Kernel adaptive filters(KAFs)have sparked substantial attraction for online non-linear learning applications.It is noted that the effectiveness of KAFs is highly reliant on a rational learning criterion.Concerning thi...Kernel adaptive filters(KAFs)have sparked substantial attraction for online non-linear learning applications.It is noted that the effectiveness of KAFs is highly reliant on a rational learning criterion.Concerning this,the logarithmic hyperbolic cosine(lncosh)criterion with better robustness and convergence has drawn attention in recent studies.However,existing lncosh loss-based KAFs use the stochastic gradient descent(SGD)for optimization,which lack a trade-off between the convergence speed and accuracy.But recursion-based KAFs can provide more effective filtering performance.Therefore,a Nyström method-based robust sparse kernel recursive least lncosh loss algorithm is derived in this article.Experiments via measures and synthetic data against the non-Gaussian noise confirm the superiority with regard to the robustness,accuracy performance,and computational cost.展开更多
Hair coloring is widely used by women and men either to change their natural hair color or to delay the onset of gray hair. Oxidative dyes may damage the hair, since chemical and physical procedures are involved to al...Hair coloring is widely used by women and men either to change their natural hair color or to delay the onset of gray hair. Oxidative dyes may damage the hair, since chemical and physical procedures are involved to alter the structure hair and consequently, alterations in its mechanical and of surface properties. One benefit of hair conditioners is to prevent flyaway hair, make the hair “shine”, and protect the hair from further damage. In this research we analyzed the hair protective effect conditioner agents Argania spinosa kernel oil and/or Theobroma grandiflorum seed butter in hair care on Caucasian hair post treatment with hair dye. The hairs were submitted by quantifying protein loss. The samples were classified as: hair untreated (I);hair treated with a commercial oxidative ultra-blond hair dye (II);hair post treatment II and F1: Base hair care formulation (III), hair post treatment II and F2: Base hair care formulation containing 1.0% (w/w) Argania spinosa kernel oil (IV), hair post treatment II and F3: Base hair care formulation containing 1.0% (w/w) Theobroma grandiflorum seed butter (V) and hair post treatment II and F4: Base hair care formulation containing 0.5% (w/w) Argania spinosa kernel oil and 0.5% (w/w) Theobroma grandiflorum seed butter (VI). For the protein loss, the results were: IIA = IIIA > IB = IVB = VB = VIB. Results classified with different letters present statistically significant differents, for α = 5, p ≤ 0.05, n = 6. Based on the results, the incorporation of conditioners agents Argania spinosa kernel oil and/or Theobroma grandiflorum seed butter in base hair care formulation applied in Caucasian hair post treatment with hair dye decreased the damage caused to hair by the coloring process.展开更多
Robust watermarking requires finding invariant features under multiple attacks to ensure correct extraction.Deep learning has extremely powerful in extracting features,and watermarking algorithms based on deep learnin...Robust watermarking requires finding invariant features under multiple attacks to ensure correct extraction.Deep learning has extremely powerful in extracting features,and watermarking algorithms based on deep learning have attracted widespread attention.Most existing methods use 3×3 small kernel convolution to extract image features and embed the watermarking.However,the effective perception fields for small kernel convolution are extremely confined,so the pixels that each watermarking can affect are restricted,thus limiting the performance of the watermarking.To address these problems,we propose a watermarking network based on large kernel convolution and adaptive weight assignment for loss functions.It uses large-kernel depth-wise convolution to extract features for learning large-scale image information and subsequently projects the watermarking into a highdimensional space by 1×1 convolution to achieve adaptability in the channel dimension.Subsequently,the modification of the embedded watermarking on the cover image is extended to more pixels.Because the magnitude and convergence rates of each loss function are different,an adaptive loss weight assignment strategy is proposed to make theweights participate in the network training together and adjust theweight dynamically.Further,a high-frequency wavelet loss is proposed,by which the watermarking is restricted to only the low-frequency wavelet sub-bands,thereby enhancing the robustness of watermarking against image compression.The experimental results show that the peak signal-to-noise ratio(PSNR)of the encoded image reaches 40.12,the structural similarity(SSIM)reaches 0.9721,and the watermarking has good robustness against various types of noise.展开更多
In some sample based regression tasks,the observed samples are quite few or not informative enough.As a result,the conflict between the number of samples and the model complexity emerges,and the regression method will...In some sample based regression tasks,the observed samples are quite few or not informative enough.As a result,the conflict between the number of samples and the model complexity emerges,and the regression method will confront the dilemma whether to choose a complex model or not.Incorporating the prior knowledge is a potential solution for this dilemma.In this paper,a sort of the prior knowledge is investigated and a novel method to incorporate it into the kernel based regression scheme is proposed.The proposed prior knowledge based kernel regression(PKBKR)method includes two subproblems:representing the prior knowledge in the function space,and combining this representation and the training samples to obtain the regression function.A greedy algorithm for the representing step and a weighted loss function for the incorporation step axe proposed.Finally,experiments are performed to validate the proposed PKBKR method,wherein the results show that the proposed method can achieve relatively high regression performance with appropriate model complexity,especially when the number of samples is small or the observation noise is large.展开更多
Reliability analysis is the key to evaluate software’s quality. Since the early 1970s, the Power Law Process, among others, has been used to assess the rate of change of software reliability as time-varying function ...Reliability analysis is the key to evaluate software’s quality. Since the early 1970s, the Power Law Process, among others, has been used to assess the rate of change of software reliability as time-varying function by using its intensity function. The Bayesian analysis applicability to the Power Law Process is justified using real software failure times. The choice of a loss function is an important entity of the Bayesian settings. The analytical estimate of likelihood-based Bayesian reliability estimates of the Power Law Process under the squared error and Higgins-Tsokos loss functions were obtained for different prior knowledge of its key parameter. As a result of a simulation analysis and using real data, the Bayesian reliability estimate under the Higgins-Tsokos loss function not only is robust as the Bayesian reliability estimate under the squared error loss function but also performed better, where both are superior to the maximum likelihood reliability estimate. A sensitivity analysis resulted in the Bayesian estimate of the reliability function being sensitive to the prior, whether parametric or non-parametric, and to the loss function. An interactive user interface application was additionally developed using Wolfram language to compute and visualize the Bayesian and maximum likelihood estimates of the intensity and reliability functions of the Power Law Process for a given data.展开更多
针对最小二乘孪生支持向量机受误差值影响大,对噪声样本敏感及核函数、核参数选择困难等问题,提出一种Critic特征加权的多核最小二乘孪生支持向量机(Multi-Kernel Least-Squares Twin Support Vector Machine based on Critic weighted,...针对最小二乘孪生支持向量机受误差值影响大,对噪声样本敏感及核函数、核参数选择困难等问题,提出一种Critic特征加权的多核最小二乘孪生支持向量机(Multi-Kernel Least-Squares Twin Support Vector Machine based on Critic weighted,CMKLSTSVM)分类方法。首先,CMKLSTSVM使用Critic法赋予特征权重,反映不同特征间重要性差异,降低冗余特征及噪声样本影响。其次,根据混合多核学习策略构造了一种新的多核权重系数确定方法。该方法通过基核与理想核间的混合核对齐值判断核函数相似程度,确定权重系数,可以合理地组合多个核函数,最大程度地发挥不同核函数的映射能力。最后,采用加权求和的方式将特征权重与核权重进行统一并构造多核结构,使数据表达更全面,提高模型灵活性。在UCI数据集上的对比实验表明,CMKLSTSVM的分类准确率优于单核结构的SVM(support vector machine)算法,同时在高光谱图像上的对比实验反映了CMKLSTSVM对于包含噪声的真实分类问题的有效性。展开更多
基金supported in part by the National Natural Science Foundation of China under Grants No.62027803,No.61601096,No.61971111,and No.61801089in part by the Science and Technology Program under Grants No.8091C24,No.2021JCJQJJ0949,and No.2022JCJQJJ0784in part by the Industrial Technology Development Program under Grant No.2020110C041.
文摘Kernel adaptive filters(KAFs)have sparked substantial attraction for online non-linear learning applications.It is noted that the effectiveness of KAFs is highly reliant on a rational learning criterion.Concerning this,the logarithmic hyperbolic cosine(lncosh)criterion with better robustness and convergence has drawn attention in recent studies.However,existing lncosh loss-based KAFs use the stochastic gradient descent(SGD)for optimization,which lack a trade-off between the convergence speed and accuracy.But recursion-based KAFs can provide more effective filtering performance.Therefore,a Nyström method-based robust sparse kernel recursive least lncosh loss algorithm is derived in this article.Experiments via measures and synthetic data against the non-Gaussian noise confirm the superiority with regard to the robustness,accuracy performance,and computational cost.
文摘Hair coloring is widely used by women and men either to change their natural hair color or to delay the onset of gray hair. Oxidative dyes may damage the hair, since chemical and physical procedures are involved to alter the structure hair and consequently, alterations in its mechanical and of surface properties. One benefit of hair conditioners is to prevent flyaway hair, make the hair “shine”, and protect the hair from further damage. In this research we analyzed the hair protective effect conditioner agents Argania spinosa kernel oil and/or Theobroma grandiflorum seed butter in hair care on Caucasian hair post treatment with hair dye. The hairs were submitted by quantifying protein loss. The samples were classified as: hair untreated (I);hair treated with a commercial oxidative ultra-blond hair dye (II);hair post treatment II and F1: Base hair care formulation (III), hair post treatment II and F2: Base hair care formulation containing 1.0% (w/w) Argania spinosa kernel oil (IV), hair post treatment II and F3: Base hair care formulation containing 1.0% (w/w) Theobroma grandiflorum seed butter (V) and hair post treatment II and F4: Base hair care formulation containing 0.5% (w/w) Argania spinosa kernel oil and 0.5% (w/w) Theobroma grandiflorum seed butter (VI). For the protein loss, the results were: IIA = IIIA > IB = IVB = VB = VIB. Results classified with different letters present statistically significant differents, for α = 5, p ≤ 0.05, n = 6. Based on the results, the incorporation of conditioners agents Argania spinosa kernel oil and/or Theobroma grandiflorum seed butter in base hair care formulation applied in Caucasian hair post treatment with hair dye decreased the damage caused to hair by the coloring process.
基金supported,in part,by the National Nature Science Foundation of China under grant numbers 62272236in part,by the Natural Science Foundation of Jiangsu Province under grant numbers BK20201136,BK20191401in part,by the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD)fund.
文摘Robust watermarking requires finding invariant features under multiple attacks to ensure correct extraction.Deep learning has extremely powerful in extracting features,and watermarking algorithms based on deep learning have attracted widespread attention.Most existing methods use 3×3 small kernel convolution to extract image features and embed the watermarking.However,the effective perception fields for small kernel convolution are extremely confined,so the pixels that each watermarking can affect are restricted,thus limiting the performance of the watermarking.To address these problems,we propose a watermarking network based on large kernel convolution and adaptive weight assignment for loss functions.It uses large-kernel depth-wise convolution to extract features for learning large-scale image information and subsequently projects the watermarking into a highdimensional space by 1×1 convolution to achieve adaptability in the channel dimension.Subsequently,the modification of the embedded watermarking on the cover image is extended to more pixels.Because the magnitude and convergence rates of each loss function are different,an adaptive loss weight assignment strategy is proposed to make theweights participate in the network training together and adjust theweight dynamically.Further,a high-frequency wavelet loss is proposed,by which the watermarking is restricted to only the low-frequency wavelet sub-bands,thereby enhancing the robustness of watermarking against image compression.The experimental results show that the peak signal-to-noise ratio(PSNR)of the encoded image reaches 40.12,the structural similarity(SSIM)reaches 0.9721,and the watermarking has good robustness against various types of noise.
基金Supported_by National Key Technologies Research and De-velopment Program of China during the 11th Five-year Plan(2006AA060206)Basic Research Foundation of Tsinghua Uni-versity(JC2007024)
文摘In some sample based regression tasks,the observed samples are quite few or not informative enough.As a result,the conflict between the number of samples and the model complexity emerges,and the regression method will confront the dilemma whether to choose a complex model or not.Incorporating the prior knowledge is a potential solution for this dilemma.In this paper,a sort of the prior knowledge is investigated and a novel method to incorporate it into the kernel based regression scheme is proposed.The proposed prior knowledge based kernel regression(PKBKR)method includes two subproblems:representing the prior knowledge in the function space,and combining this representation and the training samples to obtain the regression function.A greedy algorithm for the representing step and a weighted loss function for the incorporation step axe proposed.Finally,experiments are performed to validate the proposed PKBKR method,wherein the results show that the proposed method can achieve relatively high regression performance with appropriate model complexity,especially when the number of samples is small or the observation noise is large.
文摘Reliability analysis is the key to evaluate software’s quality. Since the early 1970s, the Power Law Process, among others, has been used to assess the rate of change of software reliability as time-varying function by using its intensity function. The Bayesian analysis applicability to the Power Law Process is justified using real software failure times. The choice of a loss function is an important entity of the Bayesian settings. The analytical estimate of likelihood-based Bayesian reliability estimates of the Power Law Process under the squared error and Higgins-Tsokos loss functions were obtained for different prior knowledge of its key parameter. As a result of a simulation analysis and using real data, the Bayesian reliability estimate under the Higgins-Tsokos loss function not only is robust as the Bayesian reliability estimate under the squared error loss function but also performed better, where both are superior to the maximum likelihood reliability estimate. A sensitivity analysis resulted in the Bayesian estimate of the reliability function being sensitive to the prior, whether parametric or non-parametric, and to the loss function. An interactive user interface application was additionally developed using Wolfram language to compute and visualize the Bayesian and maximum likelihood estimates of the intensity and reliability functions of the Power Law Process for a given data.
文摘针对最小二乘孪生支持向量机受误差值影响大,对噪声样本敏感及核函数、核参数选择困难等问题,提出一种Critic特征加权的多核最小二乘孪生支持向量机(Multi-Kernel Least-Squares Twin Support Vector Machine based on Critic weighted,CMKLSTSVM)分类方法。首先,CMKLSTSVM使用Critic法赋予特征权重,反映不同特征间重要性差异,降低冗余特征及噪声样本影响。其次,根据混合多核学习策略构造了一种新的多核权重系数确定方法。该方法通过基核与理想核间的混合核对齐值判断核函数相似程度,确定权重系数,可以合理地组合多个核函数,最大程度地发挥不同核函数的映射能力。最后,采用加权求和的方式将特征权重与核权重进行统一并构造多核结构,使数据表达更全面,提高模型灵活性。在UCI数据集上的对比实验表明,CMKLSTSVM的分类准确率优于单核结构的SVM(support vector machine)算法,同时在高光谱图像上的对比实验反映了CMKLSTSVM对于包含噪声的真实分类问题的有效性。
