Sparse representation has recently been proved to be a powerful tool in image processing and object recognition.This paper proposes a novel small target detection algorithm based on this technique.By modelling a small...Sparse representation has recently been proved to be a powerful tool in image processing and object recognition.This paper proposes a novel small target detection algorithm based on this technique.By modelling a small target as a linear combination of certain target samples and then solving a sparse 0-minimization problem,the proposed apporach successfully improves and optimizes the small target representation with innovation.Furthermore,the sparsity concentration index（SCI） is creatively employed to evaluate the coefficients of each block representation and simpfy target identification.In the detection frame,target samples are firstly generated to constitute an over-complete dictionary matrix using Gaussian intensity model（GIM）,and then sparse model solvers are applied to finding sparse representation for each sub-image block.Finally,SCI lexicographical evalution of the entire image incorparates with a simple threshold locate target position.The effectiveness and robustness of the proposed algorithm are demonstrated by the exprimental results.展开更多
This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time...This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.展开更多
Sparse representation has attracted extensive attention and performed well on image super-resolution（SR） in the last decade. However, many current image SR methods face the contradiction of detail recovery and artif...Sparse representation has attracted extensive attention and performed well on image super-resolution（SR） in the last decade. However, many current image SR methods face the contradiction of detail recovery and artifact suppression. We propose a multi-resolution dictionary learning（MRDL） model to solve this contradiction, and give a fast single image SR method based on the MRDL model. To obtain the MRDL model, we first extract multi-scale patches by using our proposed adaptive patch partition method（APPM）. The APPM divides images into patches of different sizes according to their detail richness. Then, the multiresolution dictionary pairs, which contain structural primitives of various resolutions, can be trained from these multi-scale patches.Owing to the MRDL strategy, our SR algorithm not only recovers details well, with less jag and noise, but also significantly improves the computational efficiency. Experimental results validate that our algorithm performs better than other SR methods in evaluation metrics and visual perception.展开更多
Face recognition based on few training samples is a challenging task. In daily applications, sufficient training samples may not be obtained and most of the gained training samples are in various illuminations and pos...Face recognition based on few training samples is a challenging task. In daily applications, sufficient training samples may not be obtained and most of the gained training samples are in various illuminations and poses. Non-sufficient training samples could not effectively express various facial conditions, so the improvement of the face recognition rate under the non-sufficient training samples condition becomes a laborious mission. In our work, the facial pose pre-recognition(FPPR) model and the dualdictionary sparse representation classification(DD-SRC) are proposed for face recognition. The FPPR model is based on the facial geometric characteristic and machine learning, dividing a testing sample into full-face and profile. Different poses in a single dictionary are influenced by each other, which leads to a low face recognition rate. The DD-SRC contains two dictionaries, full-face dictionary and profile dictionary, and is able to reduce the interference. After FPPR, the sample is processed by the DD-SRC to find the most similar one in training samples. The experimental results show the performance of the proposed algorithm on olivetti research laboratory(ORL) and face recognition technology(FERET) databases, and also reflect comparisons with SRC, linear regression classification(LRC), and two-phase test sample sparse representation(TPTSSR).展开更多
Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor do...Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper,i.e.UKGE-MS.Specifically,UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information,and solves the problems of traditional unsupervised feature selection methods,which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples.Firstly,considering the influence of local information of samples in feature correlation evaluation,a feature clustering algorithm based on average neighborhood mutual information is proposed,and the feature clusters with certain event correlation are obtained;Secondly,an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation,so as to enhance the generalization ability of the selected feature items.Finally,the events knowledge graph is constructed by means of sparse representation and l1 norm.Extensive experiments are carried out on five real datasets and synthetic datasets,and the UKGE-MS are compared with five corresponding algorithms.The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection,and has some advantages over other methods in text event recognition and discovery.展开更多
A novel supervised dimensionality reduction algorithm, named discriminant embedding by sparse representation and nonparametric discriminant analysis(DESN), was proposed for face recognition. Within the framework of DE...A novel supervised dimensionality reduction algorithm, named discriminant embedding by sparse representation and nonparametric discriminant analysis(DESN), was proposed for face recognition. Within the framework of DESN, the sparse local scatter and multi-class nonparametric between-class scatter were exploited for within-class compactness and between-class separability description, respectively. These descriptions, inspired by sparse representation theory and nonparametric technique, are more discriminative in dealing with complex-distributed data. Furthermore, DESN seeks for the optimal projection matrix by simultaneously maximizing the nonparametric between-class scatter and minimizing the sparse local scatter. The use of Fisher discriminant analysis further boosts the discriminating power of DESN. The proposed DESN was applied to data visualization and face recognition tasks, and was tested extensively on the Wine, ORL, Yale and Extended Yale B databases. Experimental results show that DESN is helpful to visualize the structure of high-dimensional data sets, and the average face recognition rate of DESN is about 9.4%, higher than that of other algorithms.展开更多
Image fusion based on the sparse representation(SR)has become the primary research direction of the transform domain method.However,the SR-based image fusion algorithm has the characteristics of high computational com...Image fusion based on the sparse representation(SR)has become the primary research direction of the transform domain method.However,the SR-based image fusion algorithm has the characteristics of high computational complexity and neglecting the local features of an image,resulting in limited image detail retention and a high registration misalignment sensitivity.In order to overcome these shortcomings and the noise existing in the image of the fusion process,this paper proposes a new signal decomposition model,namely the multi-source image fusion algorithm of the gradient regularization convolution SR(CSR).The main innovation of this work is using the sparse optimization function to perform two-scale decomposition of the source image to obtain high-frequency components and low-frequency components.The sparse coefficient is obtained by the gradient regularization CSR model,and the sparse coefficient is taken as the maximum value to get the optimal high frequency component of the fused image.The best low frequency component is obtained by using the fusion strategy of the extreme or the average value.The final fused image is obtained by adding two optimal components.Experimental results demonstrate that this method greatly improves the ability to maintain image details and reduces image registration sensitivity.展开更多
Face recognition has been widely used and developed rapidly in recent years.The methods based on sparse representation have made great breakthroughs,and collaborative representation-based classification(CRC)is the typ...Face recognition has been widely used and developed rapidly in recent years.The methods based on sparse representation have made great breakthroughs,and collaborative representation-based classification(CRC)is the typical representative.However,CRC cannot distinguish similar samples well,leading to a wrong classification easily.As an improved method based on CRC,the two-phase test sample sparse representation(TPTSSR)removes the samples that make little contribution to the representation of the testing sample.Nevertheless,only one removal is not sufficient,since some useless samples may still be retained,along with some useful samples maybe being removed randomly.In this work,a novel classifier,called discriminative sparse parameter(DSP)classifier with iterative removal,is proposed for face recognition.The proposed DSP classifier utilizes sparse parameter to measure the representation ability of training samples straight-forward.Moreover,to avoid some useful samples being removed randomly with only one removal,DSP classifier removes most uncorrelated samples gradually with iterations.Extensive experiments on different typical poses,expressions and noisy face datasets are conducted to assess the performance of the proposed DSP classifier.The experimental results demonstrate that DSP classifier achieves a better recognition rate than the well-known SRC,CRC,RRC,RCR,SRMVS,RFSR and TPTSSR classifiers for face recognition in various situations.展开更多
Power-line interference is one of the most common noises in magnetotelluric(MT)data.It usually causes distortion at the fundamental frequency and its odd harmonics,and may also affect other frequency bands.Although tr...Power-line interference is one of the most common noises in magnetotelluric(MT)data.It usually causes distortion at the fundamental frequency and its odd harmonics,and may also affect other frequency bands.Although trap circuits are designed to suppress such noise in most of the modern acquisition devices,strong interferences are still found in MT data,and the power-line interference will fluctuate with the changing of load current.The fixed trap circuits often fail to deal with it.This paper proposes an alternative scheme for power-line interference removal based on frequency-domain sparse decomposition.Firstly,the fast Fourier transform of the acquired MT signal is performed.Subsequently,a redundant dictionary is designed to match with the power-line interference which is insensitive to the useful signal.Power-line interference is separated by using the dictionary and a signal reconstruction algorithm of compressive sensing called improved orthogonal matching pursuit(IOMP).Finally,the frequency domain data are switched back to the time domain by the inverse fast Fourier transform.Simulation experiments and real data examples from Lu-Zong ore district illustrate that this scheme can effectively suppress the power-line interference and significantly improve data quality.Compared with time domain sparse decomposition,this scheme takes less time consumption and acquires better results.展开更多
A direction of arrival（DOA） estimation algorithm is proposed using the concept of sparse representation. In particular, a new sparse signal representation model called the smoothed covariance vector（SCV） is establ...A direction of arrival（DOA） estimation algorithm is proposed using the concept of sparse representation. In particular, a new sparse signal representation model called the smoothed covariance vector（SCV） is established, which is constructed using the lower left diagonals of the covariance matrix. DOA estimation is then achieved from the SCV by sparse recovering, where two distinguished error limit estimation methods of the constrained optimization are proposed to make the algorithms more robust. The algorithm shows robust performance on DOA estimation in a uniform array, especially for coherent signals. Furthermore, it significantly reduces the computational load compared with those algorithms based on multiple measurement vectors（MMVs）. Simulation results validate the effectiveness and efficiency of the proposed algorithm.展开更多
The sparse recovery algorithms formulate synthetic aperture radar （SAR） imaging problem in terms of sparse representation （SR） of a small number of strong scatters＇ positions among a much large number of potentia...The sparse recovery algorithms formulate synthetic aperture radar （SAR） imaging problem in terms of sparse representation （SR） of a small number of strong scatters＇ positions among a much large number of potential scatters＇ positions, and provide an effective approach to improve the SAR image resolution. Based on the attributed scatter center model, several experiments were performed with different practical considerations to evaluate the performance of five representative SR techniques, namely, sparse Bayesian learning （SBL）, fast Bayesian matching pursuit （FBMP）, smoothed 10 norm method （SL0）, sparse reconstruction by separable approximation （SpaRSA）, fast iterative shrinkage-thresholding algorithm （FISTA）, and the parameter settings in five SR algorithms were discussed. In different situations, the performances of these algorithms were also discussed. Through the comparison of MSE and failure rate in each algorithm simulation, FBMP and SpaRSA are found suitable for dealing with problems in the SAR imaging based on attributed scattering center model. Although the SBL is time-consuming, it always get better performance when related to failure rate and high SNR.展开更多
Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not ...Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not satisfactory. The contribution of the vector x（t） with different modules is theoretically proved to be unequal, and a weighted K-means clustering method is proposed on this grounds. The proposed algorithm is not only as fast as the conventional K-means clustering method, but can also achieve considerably accurate results, which is demonstrated by numerical experiments.展开更多
The all traditional electrical resistance tomography (ERT) sensors have a static structure, which cannot satisfy the intelligent requirements for adaptive optimization to ERT sensors that is subject to flow pattern ch...The all traditional electrical resistance tomography (ERT) sensors have a static structure, which cannot satisfy the intelligent requirements for adaptive optimization to ERT sensors that is subject to flow pattern changes during the real-time detection of two-phase flow. In view of this problem, an adaptive ERT sensor with a dynamic structure is proposed. The electrodes of the ERT sensor are arranged in an array structure, the flow pattern recognition technique is introduced into the ERT sensor design and accordingly an ERT flow pattern recognition method based on signal sparsity is proposed. This method uses the sparse representation of the signal to express the sampling voltage of the ERT system as a sparse combination and find its sparse solution to achieve the classification of different flow patterns. With the introduction of flow identification information, the sensor has an intelligent function of adaptively and dynamically adapting the sensor structure according to the real-time flow pattern change. The experimental results show that the sensor can automatically identify four typical flow patterns: core flow, bubble flow, laminar flow and circulation flow with recognition rates of 91%, 93%, 90% and 88% respectively. For different flow patterns, the dynamically optimized sensor can significantly improve the quality of ERT image reconstruction.展开更多
The performances of repaired image depend on the local information in the repaired area and the consistency between the repair directions with structural content.Image repair algorithm with texture information perform...The performances of repaired image depend on the local information in the repaired area and the consistency between the repair directions with structural content.Image repair algorithm with texture information performs well in repairing seriously damaged images,but it has bad performances when the images have the abundant structure information.The dual optimization image repair algorithm based on the linear structure and the optimal texture is proposed.The algorithm uses the double-constraint sparse model to reconstruct the missed information in large area in order to improve the clarity of repaired images.After adopting the preference of Criminisi priority,the image repair algorithm of self-similarity characteristics is proposed to improve the fault and fuzzy distortion phenomena in the repaired image.The results show that the proposed algorithm has more clarity in the image texture and structure and better effectiveness,and the peak signal-to-noise ratio of the repaired images by proposed algorithm is superior to that by other algorithms.展开更多
Sparse-representation-based single-channel source separation,which aims to recover each source’s signal using its corresponding sub-dictionary,has attracted many scholars’attention.The basic premise of this model is...Sparse-representation-based single-channel source separation,which aims to recover each source’s signal using its corresponding sub-dictionary,has attracted many scholars’attention.The basic premise of this model is that each sub-dictionary possesses discriminative information about its corresponding source,and this information can be used to recover almost every sample from that source.However,in a more general sense,the samples from a source are composed not only of discriminative information but also common information shared with other sources.This paper proposes learning a discriminative high-fidelity dictionary to improve the separation performance.The innovations are threefold.Firstly,an extra sub-dictionary was combined into a conventional union dictionary to ensure that the source-specific sub-dictionaries can capture only the purely discriminative information for their corresponding sources because the common information is collected in the additional sub-dictionary.Secondly,a task-driven learning algorithm is designed to optimize the new union dictionary and a set of weights that indicate how much of the common information should be allocated to each source.Thirdly,a source separation scheme based on the learned dictionary is presented.Experimental results on a human speech dataset yield evidence that our algorithm can achieve better separation performance than either state-of-the-art or traditional algorithms.展开更多
Moderate resolution imaging spectroradiometer(MODIS)imaging has various applications in the field of ground monitoring,cloud classification and meteorological research.However,the limitations of the sensors and extern...Moderate resolution imaging spectroradiometer(MODIS)imaging has various applications in the field of ground monitoring,cloud classification and meteorological research.However,the limitations of the sensors and external disturbance make the resolution of image still limited in a certain level.The goal of this paper is to use a single image super-resolution(SISR)method to predict a high-resolution(HR)MODIS image from a single low-resolution(LR)input.Recently,although the method based on sparse representation has tackled the ill-posed problem effectively,two fatal issues have been ignored.First,many methods ignore the relationships among patches,resulting in some unfaithful output.Second,the high computational complexity of sparse coding using l_1 norm is needed in reconstruction stage.In this work,we discover the semantic relationships among LR patches and the corresponding HR patches and group the documents with similar semantic into topics by probabilistic Latent Semantic Analysis(p LSA).Then,we can learn dual dictionaries for each topic in the low-resolution(LR)patch space and high-resolution(HR)patch space and also pre-compute corresponding regression matrices for dictionary pairs.Finally,for the test image,we infer locally which topic it corresponds to and adaptive to select the regression matrix to reconstruct HR image by semantic relationships.Our method discovered the relationships among patches and pre-computed the regression matrices for topics.Therefore,our method can greatly reduce the artifacts and get some speed-up in the reconstruction phase.Experiment manifests that our method performs MODIS image super-resolution effectively,results in higher PSNR,reconstructs faster,and gets better visual quality than some current state-of-art methods.展开更多
Various types of interference signals limit the practical application of transform domain communication systems(TDCSs)in the severe electromagnetic field,an orthogonal basis learning method of transformation analysis(...Various types of interference signals limit the practical application of transform domain communication systems(TDCSs)in the severe electromagnetic field,an orthogonal basis learning method of transformation analysis(OBL-TA)is proposed to effectively address the problem of obtaining an optimal transform domain based on sparse representation.Then,the sparse availability is utilized to obtain the optimal transformation analysis by the iterative methods,which yields the sparse representation for transform domain(SRTD)in unrestricted form.In addition,the iterative version of SRTD(I-SRTD)in unrestricted form is obtained by decomposing the SRTD problem into three sub-problems and each sub-problem is iteratively solved by learning the best orthogonal basis.Furthermore,orthogonal basis learning via cost function minimization process is conducted by stochastic descent,which is assured to converge to a local minimum at least.Finally,the optimal transformation analysis is developed by the effectiveness of different transform domains according to the accuracy of the sparse representation and an optimal transformation analysis separately(OPTAS)is applied to the synthesized signal forms with conic alternatives,dualization,and smoothing.Simulation results demonstrate that the superiorities of the proposed methods achieve the optimal recovery and separation more rapidly and accurately than conventional methods.展开更多
基金supported by the Inter-governmental Science and Technology Cooperation Project (2009DFA12870)
文摘Sparse representation has recently been proved to be a powerful tool in image processing and object recognition.This paper proposes a novel small target detection algorithm based on this technique.By modelling a small target as a linear combination of certain target samples and then solving a sparse 0-minimization problem,the proposed apporach successfully improves and optimizes the small target representation with innovation.Furthermore,the sparsity concentration index（SCI） is creatively employed to evaluate the coefficients of each block representation and simpfy target identification.In the detection frame,target samples are firstly generated to constitute an over-complete dictionary matrix using Gaussian intensity model（GIM）,and then sparse model solvers are applied to finding sparse representation for each sub-image block.Finally,SCI lexicographical evalution of the entire image incorparates with a simple threshold locate target position.The effectiveness and robustness of the proposed algorithm are demonstrated by the exprimental results.
基金supported by the National Natural Science Foundation of China(61072120)
文摘This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.
文摘Sparse representation has attracted extensive attention and performed well on image super-resolution（SR） in the last decade. However, many current image SR methods face the contradiction of detail recovery and artifact suppression. We propose a multi-resolution dictionary learning（MRDL） model to solve this contradiction, and give a fast single image SR method based on the MRDL model. To obtain the MRDL model, we first extract multi-scale patches by using our proposed adaptive patch partition method（APPM）. The APPM divides images into patches of different sizes according to their detail richness. Then, the multiresolution dictionary pairs, which contain structural primitives of various resolutions, can be trained from these multi-scale patches.Owing to the MRDL strategy, our SR algorithm not only recovers details well, with less jag and noise, but also significantly improves the computational efficiency. Experimental results validate that our algorithm performs better than other SR methods in evaluation metrics and visual perception.
基金supported by the National Natural Science Foundation of China(6137901061772421)
文摘Face recognition based on few training samples is a challenging task. In daily applications, sufficient training samples may not be obtained and most of the gained training samples are in various illuminations and poses. Non-sufficient training samples could not effectively express various facial conditions, so the improvement of the face recognition rate under the non-sufficient training samples condition becomes a laborious mission. In our work, the facial pose pre-recognition(FPPR) model and the dualdictionary sparse representation classification(DD-SRC) are proposed for face recognition. The FPPR model is based on the facial geometric characteristic and machine learning, dividing a testing sample into full-face and profile. Different poses in a single dictionary are influenced by each other, which leads to a low face recognition rate. The DD-SRC contains two dictionaries, full-face dictionary and profile dictionary, and is able to reduce the interference. After FPPR, the sample is processed by the DD-SRC to find the most similar one in training samples. The experimental results show the performance of the proposed algorithm on olivetti research laboratory(ORL) and face recognition technology(FERET) databases, and also reflect comparisons with SRC, linear regression classification(LRC), and two-phase test sample sparse representation(TPTSSR).
基金This study was funded by the International Science and Technology Cooperation Program of the Science and Technology Department of Shaanxi Province,China(No.2021KW-16)the Science and Technology Project in Xi’an(No.2019218114GXRC017CG018-GXYD17.11),Thesis work was supported by the special fund construction project of Key Disciplines in Ordinary Colleges and Universities in Shaanxi Province,the authors would like to thank the anonymous reviewers for their helpful comments and suggestions.
文摘Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper,i.e.UKGE-MS.Specifically,UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information,and solves the problems of traditional unsupervised feature selection methods,which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples.Firstly,considering the influence of local information of samples in feature correlation evaluation,a feature clustering algorithm based on average neighborhood mutual information is proposed,and the feature clusters with certain event correlation are obtained;Secondly,an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation,so as to enhance the generalization ability of the selected feature items.Finally,the events knowledge graph is constructed by means of sparse representation and l1 norm.Extensive experiments are carried out on five real datasets and synthetic datasets,and the UKGE-MS are compared with five corresponding algorithms.The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection,and has some advantages over other methods in text event recognition and discovery.
基金Project(40901216)supported by the National Natural Science Foundation of China
文摘A novel supervised dimensionality reduction algorithm, named discriminant embedding by sparse representation and nonparametric discriminant analysis(DESN), was proposed for face recognition. Within the framework of DESN, the sparse local scatter and multi-class nonparametric between-class scatter were exploited for within-class compactness and between-class separability description, respectively. These descriptions, inspired by sparse representation theory and nonparametric technique, are more discriminative in dealing with complex-distributed data. Furthermore, DESN seeks for the optimal projection matrix by simultaneously maximizing the nonparametric between-class scatter and minimizing the sparse local scatter. The use of Fisher discriminant analysis further boosts the discriminating power of DESN. The proposed DESN was applied to data visualization and face recognition tasks, and was tested extensively on the Wine, ORL, Yale and Extended Yale B databases. Experimental results show that DESN is helpful to visualize the structure of high-dimensional data sets, and the average face recognition rate of DESN is about 9.4%, higher than that of other algorithms.
基金the National Natural Science Foundation of China(61671383)Shaanxi Key Industry Innovation Chain Project(2018ZDCXL-G-12-2,2019ZDLGY14-02-02,2019ZDLGY14-02-03).
文摘Image fusion based on the sparse representation(SR)has become the primary research direction of the transform domain method.However,the SR-based image fusion algorithm has the characteristics of high computational complexity and neglecting the local features of an image,resulting in limited image detail retention and a high registration misalignment sensitivity.In order to overcome these shortcomings and the noise existing in the image of the fusion process,this paper proposes a new signal decomposition model,namely the multi-source image fusion algorithm of the gradient regularization convolution SR(CSR).The main innovation of this work is using the sparse optimization function to perform two-scale decomposition of the source image to obtain high-frequency components and low-frequency components.The sparse coefficient is obtained by the gradient regularization CSR model,and the sparse coefficient is taken as the maximum value to get the optimal high frequency component of the fused image.The best low frequency component is obtained by using the fusion strategy of the extreme or the average value.The final fused image is obtained by adding two optimal components.Experimental results demonstrate that this method greatly improves the ability to maintain image details and reduces image registration sensitivity.
基金Project(2019JJ40047)supported by the Hunan Provincial Natural Science Foundation of ChinaProject(kq2014057)supported by the Changsha Municipal Natural Science Foundation,China。
文摘Face recognition has been widely used and developed rapidly in recent years.The methods based on sparse representation have made great breakthroughs,and collaborative representation-based classification(CRC)is the typical representative.However,CRC cannot distinguish similar samples well,leading to a wrong classification easily.As an improved method based on CRC,the two-phase test sample sparse representation(TPTSSR)removes the samples that make little contribution to the representation of the testing sample.Nevertheless,only one removal is not sufficient,since some useless samples may still be retained,along with some useful samples maybe being removed randomly.In this work,a novel classifier,called discriminative sparse parameter(DSP)classifier with iterative removal,is proposed for face recognition.The proposed DSP classifier utilizes sparse parameter to measure the representation ability of training samples straight-forward.Moreover,to avoid some useful samples being removed randomly with only one removal,DSP classifier removes most uncorrelated samples gradually with iterations.Extensive experiments on different typical poses,expressions and noisy face datasets are conducted to assess the performance of the proposed DSP classifier.The experimental results demonstrate that DSP classifier achieves a better recognition rate than the well-known SRC,CRC,RRC,RCR,SRMVS,RFSR and TPTSSR classifiers for face recognition in various situations.
基金Project(2014AA06A602)supported by the National High-Tech Research and Development Program of ChinaProjects(41404111,41304098)supported by the National Natural Science Foundation of ChinaProject(2015JJ3088)supported by the Natural Science Foundation of Hunan Province,China
文摘Power-line interference is one of the most common noises in magnetotelluric(MT)data.It usually causes distortion at the fundamental frequency and its odd harmonics,and may also affect other frequency bands.Although trap circuits are designed to suppress such noise in most of the modern acquisition devices,strong interferences are still found in MT data,and the power-line interference will fluctuate with the changing of load current.The fixed trap circuits often fail to deal with it.This paper proposes an alternative scheme for power-line interference removal based on frequency-domain sparse decomposition.Firstly,the fast Fourier transform of the acquired MT signal is performed.Subsequently,a redundant dictionary is designed to match with the power-line interference which is insensitive to the useful signal.Power-line interference is separated by using the dictionary and a signal reconstruction algorithm of compressive sensing called improved orthogonal matching pursuit(IOMP).Finally,the frequency domain data are switched back to the time domain by the inverse fast Fourier transform.Simulation experiments and real data examples from Lu-Zong ore district illustrate that this scheme can effectively suppress the power-line interference and significantly improve data quality.Compared with time domain sparse decomposition,this scheme takes less time consumption and acquires better results.
基金supported by the National Natural Science Foundation of China(6127130061405150)
文摘A direction of arrival（DOA） estimation algorithm is proposed using the concept of sparse representation. In particular, a new sparse signal representation model called the smoothed covariance vector（SCV） is established, which is constructed using the lower left diagonals of the covariance matrix. DOA estimation is then achieved from the SCV by sparse recovering, where two distinguished error limit estimation methods of the constrained optimization are proposed to make the algorithms more robust. The algorithm shows robust performance on DOA estimation in a uniform array, especially for coherent signals. Furthermore, it significantly reduces the computational load compared with those algorithms based on multiple measurement vectors（MMVs）. Simulation results validate the effectiveness and efficiency of the proposed algorithm.
基金Project(61171133)supported by the National Natural Science Foundation of ChinaProject(11JJ1010)supported by the Natural Science Fund for Distinguished Young Scholars of Hunan Province,ChinaProject(61101182)supported by National Natural Science Foundation for Young Scientists of China
文摘The sparse recovery algorithms formulate synthetic aperture radar （SAR） imaging problem in terms of sparse representation （SR） of a small number of strong scatters＇ positions among a much large number of potential scatters＇ positions, and provide an effective approach to improve the SAR image resolution. Based on the attributed scatter center model, several experiments were performed with different practical considerations to evaluate the performance of five representative SR techniques, namely, sparse Bayesian learning （SBL）, fast Bayesian matching pursuit （FBMP）, smoothed 10 norm method （SL0）, sparse reconstruction by separable approximation （SpaRSA）, fast iterative shrinkage-thresholding algorithm （FISTA）, and the parameter settings in five SR algorithms were discussed. In different situations, the performances of these algorithms were also discussed. Through the comparison of MSE and failure rate in each algorithm simulation, FBMP and SpaRSA are found suitable for dealing with problems in the SAR imaging based on attributed scattering center model. Although the SBL is time-consuming, it always get better performance when related to failure rate and high SNR.
基金the National Natural Science Foundation of China (60672061)
文摘Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not satisfactory. The contribution of the vector x（t） with different modules is theoretically proved to be unequal, and a weighted K-means clustering method is proposed on this grounds. The proposed algorithm is not only as fast as the conventional K-means clustering method, but can also achieve considerably accurate results, which is demonstrated by numerical experiments.
基金Projects(51405381,51674188)supported by the National Natural Science Foundation of China
文摘The all traditional electrical resistance tomography (ERT) sensors have a static structure, which cannot satisfy the intelligent requirements for adaptive optimization to ERT sensors that is subject to flow pattern changes during the real-time detection of two-phase flow. In view of this problem, an adaptive ERT sensor with a dynamic structure is proposed. The electrodes of the ERT sensor are arranged in an array structure, the flow pattern recognition technique is introduced into the ERT sensor design and accordingly an ERT flow pattern recognition method based on signal sparsity is proposed. This method uses the sparse representation of the signal to express the sampling voltage of the ERT system as a sparse combination and find its sparse solution to achieve the classification of different flow patterns. With the introduction of flow identification information, the sensor has an intelligent function of adaptively and dynamically adapting the sensor structure according to the real-time flow pattern change. The experimental results show that the sensor can automatically identify four typical flow patterns: core flow, bubble flow, laminar flow and circulation flow with recognition rates of 91%, 93%, 90% and 88% respectively. For different flow patterns, the dynamically optimized sensor can significantly improve the quality of ERT image reconstruction.
基金Project(12GJ6055)supported by the Natural Science Foundation of Hunan Province,ChinaProject(2010FJ4107)supported by Hunan Provincial Science and Technology Department,China
文摘The performances of repaired image depend on the local information in the repaired area and the consistency between the repair directions with structural content.Image repair algorithm with texture information performs well in repairing seriously damaged images,but it has bad performances when the images have the abundant structure information.The dual optimization image repair algorithm based on the linear structure and the optimal texture is proposed.The algorithm uses the double-constraint sparse model to reconstruct the missed information in large area in order to improve the clarity of repaired images.After adopting the preference of Criminisi priority,the image repair algorithm of self-similarity characteristics is proposed to improve the fault and fuzzy distortion phenomena in the repaired image.The results show that the proposed algorithm has more clarity in the image texture and structure and better effectiveness,and the peak signal-to-noise ratio of the repaired images by proposed algorithm is superior to that by other algorithms.
基金This work was supported by the National Natural Science Foundation of China(62001489)the scientific research planning project of National University of Defense Technology(JS19-04).
文摘Sparse-representation-based single-channel source separation,which aims to recover each source’s signal using its corresponding sub-dictionary,has attracted many scholars’attention.The basic premise of this model is that each sub-dictionary possesses discriminative information about its corresponding source,and this information can be used to recover almost every sample from that source.However,in a more general sense,the samples from a source are composed not only of discriminative information but also common information shared with other sources.This paper proposes learning a discriminative high-fidelity dictionary to improve the separation performance.The innovations are threefold.Firstly,an extra sub-dictionary was combined into a conventional union dictionary to ensure that the source-specific sub-dictionaries can capture only the purely discriminative information for their corresponding sources because the common information is collected in the additional sub-dictionary.Secondly,a task-driven learning algorithm is designed to optimize the new union dictionary and a set of weights that indicate how much of the common information should be allocated to each source.Thirdly,a source separation scheme based on the learned dictionary is presented.Experimental results on a human speech dataset yield evidence that our algorithm can achieve better separation performance than either state-of-the-art or traditional algorithms.
基金partially supported by the National Natural Science Foundation of China(61471212)Natural Science Foundation of Zhejiang Province(LY16F010001)Natural Science Foundation of Ningbo(2016A610091,2017A610297)
文摘Moderate resolution imaging spectroradiometer(MODIS)imaging has various applications in the field of ground monitoring,cloud classification and meteorological research.However,the limitations of the sensors and external disturbance make the resolution of image still limited in a certain level.The goal of this paper is to use a single image super-resolution(SISR)method to predict a high-resolution(HR)MODIS image from a single low-resolution(LR)input.Recently,although the method based on sparse representation has tackled the ill-posed problem effectively,two fatal issues have been ignored.First,many methods ignore the relationships among patches,resulting in some unfaithful output.Second,the high computational complexity of sparse coding using l_1 norm is needed in reconstruction stage.In this work,we discover the semantic relationships among LR patches and the corresponding HR patches and group the documents with similar semantic into topics by probabilistic Latent Semantic Analysis(p LSA).Then,we can learn dual dictionaries for each topic in the low-resolution(LR)patch space and high-resolution(HR)patch space and also pre-compute corresponding regression matrices for dictionary pairs.Finally,for the test image,we infer locally which topic it corresponds to and adaptive to select the regression matrix to reconstruct HR image by semantic relationships.Our method discovered the relationships among patches and pre-computed the regression matrices for topics.Therefore,our method can greatly reduce the artifacts and get some speed-up in the reconstruction phase.Experiment manifests that our method performs MODIS image super-resolution effectively,results in higher PSNR,reconstructs faster,and gets better visual quality than some current state-of-art methods.
基金supported by the University Cooperation Project Foundation of the Key Laboratory for Aerospace Information Technology(KX162600022).
文摘Various types of interference signals limit the practical application of transform domain communication systems(TDCSs)in the severe electromagnetic field,an orthogonal basis learning method of transformation analysis(OBL-TA)is proposed to effectively address the problem of obtaining an optimal transform domain based on sparse representation.Then,the sparse availability is utilized to obtain the optimal transformation analysis by the iterative methods,which yields the sparse representation for transform domain(SRTD)in unrestricted form.In addition,the iterative version of SRTD(I-SRTD)in unrestricted form is obtained by decomposing the SRTD problem into three sub-problems and each sub-problem is iteratively solved by learning the best orthogonal basis.Furthermore,orthogonal basis learning via cost function minimization process is conducted by stochastic descent,which is assured to converge to a local minimum at least.Finally,the optimal transformation analysis is developed by the effectiveness of different transform domains according to the accuracy of the sparse representation and an optimal transformation analysis separately(OPTAS)is applied to the synthesized signal forms with conic alternatives,dualization,and smoothing.Simulation results demonstrate that the superiorities of the proposed methods achieve the optimal recovery and separation more rapidly and accurately than conventional methods.
