Image denoising is a well-studied problem closely related to sparse coding. Noticing that the Laplacian distribution has a strong sparseness, we use Laplacian scale mixture to model sparse coefficients. With the obser...Image denoising is a well-studied problem closely related to sparse coding. Noticing that the Laplacian distribution has a strong sparseness, we use Laplacian scale mixture to model sparse coefficients. With the observation that prior information of an image is relevant to the estimation of sparse coefficients, we introduce the prior information into maximum a posteriori（MAP） estimation of sparse coefficients by an appropriate estimate of the probability density function. Extending to structured sparsity, a nonlocal image denoising model： Improved Simultaneous Sparse Coding with Laplacian Scale Mixture（ISSC-LSM） is proposed. The centering preprocessing, which admits biased-mean of sparse coefficients and saves expensive computation, is done firstly. By alternating minimization and learning an orthogonal PCA dictionary, an efficient algorithm with closed-form solutions is proposed. When applied to noise removal, our proposed ISSC-LSM can capture structured image features, and the adoption of image prior information leads to highly competitive denoising performance. Experimental results show that the proposed method often provides higher subjective and objective qualities than other competing approaches. Our method is most suitable for processing images with abundant self-repeating patterns by effectively suppressing undesirable artifacts while maintaining the textures and edges.展开更多
A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inne...A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.展开更多
Impulse components in vibration signals are important fault features of complex machines. Sparse coding （SC） algorithm has been introduced as an impulse feature extraction method, but it could not guarantee a satisf...Impulse components in vibration signals are important fault features of complex machines. Sparse coding （SC） algorithm has been introduced as an impulse feature extraction method, but it could not guarantee a satisfactory performance in processing vibration signals with heavy background noises. In this paper, a method based on fusion sparse coding （FSC） and online dictionary learning is proposed to extract impulses efficiently. Firstly, fusion scheme of different sparse coding algorithms is presented to ensure higher reconstruction accuracy. Then, an improved online dictionary learning method using FSC scheme is established to obtain redundant dictionary and it can capture specific features of training samples and reconstruct the sparse approximation of vibration signals. Simulation shows that this method has a good performance in solving sparse coefficients and training redundant dictionary compared with other methods. Lastly, the proposed method is further applied to processing aircraft engine rotor vibration signals. Compared with other feature extraction approaches, our method can extract impulse features accurately and efficiently from heavy noisy vibration signal, which has significant supports for machinery fault detection and diagnosis.展开更多
A new method for the construction of the high performance systematic irregular low-density paritycheck （LDPC） codes based on the sparse generator matrix （G-LDPC） is introduced. The code can greatly reduce the enco...A new method for the construction of the high performance systematic irregular low-density paritycheck （LDPC） codes based on the sparse generator matrix （G-LDPC） is introduced. The code can greatly reduce the encoding complexity while maintaining the same decoding complexity as traditional regular LDPC （H-LDPC） codes defined by the sparse parity check matrix. Simulation results show that the performance of the proposed irregular LDPC codes can offer significant gains over traditional LDPC codes in low SNRs with a few decoding iterations over an additive white Gaussian noise （AWGN） channel.展开更多
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ...For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.展开更多
Due to the strong background noise and the acquisition system noise,the useful characteristics are often difficult to be detected.To solve this problem,sparse coding captures a concise representation of the high-level...Due to the strong background noise and the acquisition system noise,the useful characteristics are often difficult to be detected.To solve this problem,sparse coding captures a concise representation of the high-level features in the signal using the underlying structure of the signal.Recently,an Online Convolutional Sparse Coding(OCSC)denoising algorithm has been proposed.However,it does not consider the structural characteristics of the signal,the sparsity of each iteration is not enough.Therefore,a threshold shrinkage algorithm considering neighborhood sparsity is proposed,and a training strategy from loose to tight is developed to further improve the denoising performance of the algorithm,called Variable Threshold Neighborhood Online Convolution Sparse Coding(VTNOCSC).By embedding the structural sparse threshold shrinkage operator into the process of solving the sparse coefficient and gradually approaching the optimal noise separation point in the training,the signal denoising performance of the algorithm is greatly improved.VTNOCSC is used to process the actual bearing fault signal,the noise interference is successfully reduced and the interest features are more evident.Compared with other existing methods,VTNOCSC has better denoising performance.展开更多
Key frame extraction based on sparse coding can reduce the redundancy of continuous frames and concisely express the entire video.However,how to develop a key frame extraction algorithm that can automatically extract ...Key frame extraction based on sparse coding can reduce the redundancy of continuous frames and concisely express the entire video.However,how to develop a key frame extraction algorithm that can automatically extract a few frames with a low reconstruction error remains a challenge.In this paper,we propose a novel model of structured sparse-codingbased key frame extraction,wherein a nonconvex group log-regularizer is used with strong sparsity and a low reconstruction error.To automatically extract key frames,a decomposition scheme is designed to separate the sparse coefficient matrix by rows.The rows enforced by the nonconvex group log-regularizer become zero or nonzero,leading to the learning of the structured sparse coefficient matrix.To solve the nonconvex problems due to the log-regularizer,the difference of convex algorithm(DCA)is employed to decompose the log-regularizer into the difference of two convex functions related to the l1 norm,which can be directly obtained through the proximal operator.Therefore,an efficient structured sparse coding algorithm with the group log-regularizer for key frame extraction is developed,which can automatically extract a few frames directly from the video to represent the entire video with a low reconstruction error.Experimental results demonstrate that the proposed algorithm can extract more accurate key frames from most Sum Me videos compared to the stateof-the-art methods.Furthermore,the proposed algorithm can obtain a higher compression with a nearly 18% increase compared to sparse modeling representation selection(SMRS)and an 8% increase compared to SC-det on the VSUMM dataset.展开更多
The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) ...The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) was proposed. The graph regularized sparse coding showed the potential in maintaining the geometrical information of the data. In this study, it was incorporated with two-level Bregman iterative procedure that updated the data term in outer-level and learned dictionary in innerlevel. Moreover,the graph regularized sparse coding and simple dictionary updating stages derived by the inner minimization made the proposed algorithm converge in few iterations, meanwhile achieving superior reconstruction performance. Extensive experimental results have demonstrated GSCMRI can consistently recover both real-valued MR images and complex-valued MR data efficiently,and outperform the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.展开更多
Abstract:Sparse coding(SC)based visual tracking(l1-tracker)is gaining increasing attention,and many related algorithms are developed.In these algorithms,each candidate region is sparsely represented as a set of target...Abstract:Sparse coding(SC)based visual tracking(l1-tracker)is gaining increasing attention,and many related algorithms are developed.In these algorithms,each candidate region is sparsely represented as a set of target templates.However,the structure connecting these candidate regions is usually ignored.Lu proposed an NLSSC-tracker with non-local self-similarity sparse coding to address this issue,which has a high computational cost.In this study,we propose an Euclidean local-structure constraint based sparse coding tracker with a smoothed Euclidean local structure.With this tracker,the optimization procedure is transformed to a small-scale l1-optimization problem,significantly reducing the computational cost.Extensive experimental results on visual tracking demonstrate the eectiveness and efficiency of the proposed algorithm.展开更多
For sparse coding, the weaker the correlation of dictionary atoms is, the better the representation capacity of dictionary will be. A weak correlation dictionary construction method for sparse coding has been proposed...For sparse coding, the weaker the correlation of dictionary atoms is, the better the representation capacity of dictionary will be. A weak correlation dictionary construction method for sparse coding has been proposed in this paper. Firstly, a new dictionary atom initialization is proposed in which data samples with weak correlation are selected as the initial dictionary atoms in order to effectively reduce the correlation among them.Then, in the process of dictionary learning, the correlation between atoms has been measured by correlation coefficient, and strong correlation atoms have been eliminated and replaced by weak correlation atoms in order to improve the representation capacity of the dictionary. An image classification scheme has been achieved by applying the weak correlation dictionary construction method proposed in this paper. Experimental results show that, the proposed method averagely improves image classification accuracy by more than 2%, compared to sparse coding spatial pyramid matching(Sc SPM) and other existing methods for image classification on the datasets of Caltech-101, Scene-15, etc.展开更多
Sparse coding is a prevalent method for image inpainting and feature extraction,which can repair corrupted images or improve data processing efficiency,and has numerous applications in computer vision and signal proce...Sparse coding is a prevalent method for image inpainting and feature extraction,which can repair corrupted images or improve data processing efficiency,and has numerous applications in computer vision and signal processing.Recently,sev-eral memristor-based in-memory computing systems have been proposed to enhance the efficiency of sparse coding remark-ably.However,the variations and low precision of the devices will deteriorate the dictionary,causing inevitable degradation in the accuracy and reliability of the application.In this work,a digital-analog hybrid memristive sparse coding system is pro-posed utilizing a multilevel Pt/Al_(2)O_(3)/AlO_(x)/W memristor,which employs the forward stagewise regression algorithm:The approxi-mate cosine distance calculation is conducted in the analog part to speed up the computation,followed by high-precision coeffi-cient updates performed in the digital portion.We determine that four states of the aforementioned memristor are sufficient for the processing of natural images.Furthermore,through dynamic adjustment of the mapping ratio,the precision require-ment for the digit-to-analog converters can be reduced to 4 bits.Compared to the previous system,our system achieves higher image reconstruction quality of the 38 dB peak-signal-to-noise ratio.Moreover,in the context of image inpainting,images containing 50%missing pixels can be restored with a reconstruction error of 0.0424 root-mean-squared error.展开更多
Aiming at technical difficulties in feature extraction for the inverse synthetic aperture radar(ISAR)target recognition,this paper imports the concept of visual perception and presents a novel method,which is based on...Aiming at technical difficulties in feature extraction for the inverse synthetic aperture radar(ISAR)target recognition,this paper imports the concept of visual perception and presents a novel method,which is based on the combination of non-negative sparse coding(NNSC)and linear discrimination optimization,to recognize targets in ISAR images.This method implements NNSC on the matrix constituted by the intensities of pixels in ISAR images for training,to obtain non-negative sparse bases which characterize sparse distribution of strong scattering centers.Then this paper chooses sparse bases via optimization criteria and calculates the corresponding non-negative sparse codes of both training and test images as the feature vectors,which are input into k neighbors classifier to realize recognition finally.The feasibility and robustness of the proposed method are proved by comparing with the template matching,principle component analysis(PCA)and non-negative matrix factorization(NMF)via simulations.展开更多
In this paper, a two-level Bregman method is presented with graph regularized sparse coding for highly undersampled magnetic resonance image reconstruction. The graph regularized sparse coding is incorporated with the...In this paper, a two-level Bregman method is presented with graph regularized sparse coding for highly undersampled magnetic resonance image reconstruction. The graph regularized sparse coding is incorporated with the two-level Bregman iterative procedure which enforces the sampled data constraints in the outer level and updates dictionary and sparse representation in the inner level. Graph regularized sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge with a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can consistently reconstruct both simulated MR images and real MR data efficiently, and outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.展开更多
Sparse vector coding(SVC)is emerging as a potential technology for short packet communications.To further improve the block error rate(BLER)performance,a uniquely decomposable constellation group-based SVC(UDCG-SVC)is...Sparse vector coding(SVC)is emerging as a potential technology for short packet communications.To further improve the block error rate(BLER)performance,a uniquely decomposable constellation group-based SVC(UDCG-SVC)is proposed in this article.Additionally,in order to achieve an optimal BLER performance of UDCG-SVC,a problem to optimize the coding gain of UDCG-based superimposed constellation is formulated.Given the energy of rotation constellations in UDCG,this problem is solved by converting it into finding the maximized minimum Euclidean distance of the superimposed constellation.Simulation results demonstrate the validness of our derivation.We also find that the proposed UDCGSVC has better BLER performance compared to other SVC schemes,especially under the high order modulation scenarios.展开更多
The existing depth video coding algorithms are generally based on in-loop depth filters, whose performance are unstable and easily affected by the outliers. In this paper, we design a joint weighted sparse representat...The existing depth video coding algorithms are generally based on in-loop depth filters, whose performance are unstable and easily affected by the outliers. In this paper, we design a joint weighted sparse representation-based median filter as the in-loop filter in depth video codec. It constructs depth candidate set which contains relevant neighboring depth pixel based on depth and intensity similarity weighted sparse coding, then the median operation is performed on this set to select a neighboring depth pixel as the result of the filtering. The experimental results indicate that the depth bitrate is reduced by about 9% compared with anchor method. It is confirmed that the proposed method is more effective in reducing the required depth bitrates for a given synthesis quality level.展开更多
Purpose: To improve the image resolution of magnetic resonance imaging (MRI), conventional interpolation methods are commonly used to magnify images via various image processing approaches;however, these methods tend ...Purpose: To improve the image resolution of magnetic resonance imaging (MRI), conventional interpolation methods are commonly used to magnify images via various image processing approaches;however, these methods tend to produce artifacts. While super-resolution (SR) schemes have been introduced as an alternative approach to apply medical imaging, previous studies applied SR only to medical images in 8-bit image format. This study aimed to evaluate the effectiveness of sparse-coding super-resolution (ScSR) for improving the image quality of reconstructed high-resolution MR images in 16-bit digital imaging and communications in medicine (DICOM) image format. Materials and Methods: Fifty-nine T1-weighted images (T1), 84 T2-weighted images (T2), 85 fluid attenuated inversion recovery (FLAIR) images, and 30 diffusion-weighted images (DWI) were sampled from The Repository of Molecular Brain Neoplasia Data as testing datasets, and 1307 non-medical images were sampled from the McGill Calibrated Color Image Database as a training dataset. We first trained the ScSR to prepare dictionaries, in which the relationship between low- and high-resolution images was learned. Using these dictionaries, a high-resolution image was reconstructed from a 16-bit DICOM low-resolution image downscaled from the original test image. We compared the image quality of ScSR and 4 interpolation methods (nearest neighbor, bilinear, bicubic, and Lanczos interpolations). For quantitative evaluation, we measured the peak signal-to-noise ratio (PSNR) and structural similarity (SSIM). Results: The PSNRs and SSIMs for the ScSR were significantly higher than those of the interpolation methods for all 4 MRI sequences (PSNR: p p Conclusion: ScSR provides significantly higher image quality in terms of enhancing the resolution of MR images (T1, T2, FLAIR, and DWI) in 16-bit DICOM format compared to the interpolation methods.展开更多
Purpose: To detect small diagnostic signals such as lung nodules in chest radiographs, radiologists magnify a region-of-interest using linear interpolation methods. However, such methods tend to generate over-smoothed...Purpose: To detect small diagnostic signals such as lung nodules in chest radiographs, radiologists magnify a region-of-interest using linear interpolation methods. However, such methods tend to generate over-smoothed images with artifacts that can make interpretation difficult. The purpose of this study was to investigate the effectiveness of super-resolution methods for improving the image quality of magnified chest radiographs. Materials and Methods: A total of 247 chest X-rays were sampled from the JSRT database, then divided into 93 training cases with non-nodules and 154 test cases with lung nodules. We first trained two types of super-resolution methods, sparse-coding super-resolution (ScSR) and super-resolution convolutional neural network (SRCNN). With the trained super-resolution methods, the high-resolution image was then reconstructed using the super-resolution methods from a low-resolution image that was down-sampled from the original test image. We compared the image quality of the super-resolution methods and the linear interpolations (nearest neighbor and bilinear interpolations). For quantitative evaluation, we measured two image quality metrics: peak signal-to-noise ratio (PSNR) and structural similarity (SSIM). For comparative evaluation of the super-resolution methods, we measured the computation time per image. Results: The PSNRs and SSIMs for the ScSR and the SRCNN schemes were significantly higher than those of the linear interpolation methods (p p p Conclusion: Super-resolution methods provide significantly better image quality than linear interpolation methods for magnified chest radiograph images. Of the two tested schemes, the SRCNN scheme processed the images fastest;thus, SRCNN could be clinically superior for processing radiographs in terms of both image quality and processing speed.展开更多
基金Supported by the National Natural Science Foundation of China(61573014)
文摘Image denoising is a well-studied problem closely related to sparse coding. Noticing that the Laplacian distribution has a strong sparseness, we use Laplacian scale mixture to model sparse coefficients. With the observation that prior information of an image is relevant to the estimation of sparse coefficients, we introduce the prior information into maximum a posteriori（MAP） estimation of sparse coefficients by an appropriate estimate of the probability density function. Extending to structured sparsity, a nonlocal image denoising model： Improved Simultaneous Sparse Coding with Laplacian Scale Mixture（ISSC-LSM） is proposed. The centering preprocessing, which admits biased-mean of sparse coefficients and saves expensive computation, is done firstly. By alternating minimization and learning an orthogonal PCA dictionary, an efficient algorithm with closed-form solutions is proposed. When applied to noise removal, our proposed ISSC-LSM can capture structured image features, and the adoption of image prior information leads to highly competitive denoising performance. Experimental results show that the proposed method often provides higher subjective and objective qualities than other competing approaches. Our method is most suitable for processing images with abundant self-repeating patterns by effectively suppressing undesirable artifacts while maintaining the textures and edges.
基金The National Natural Science Foundation of China (No.61362001,61102043,61262084,20132BAB211030,20122BAB211015)the Basic Research Program of Shenzhen(No.JC201104220219A)
文摘A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.
基金supported by the National Natural Science Foundation of China (No. 51201182)
文摘Impulse components in vibration signals are important fault features of complex machines. Sparse coding （SC） algorithm has been introduced as an impulse feature extraction method, but it could not guarantee a satisfactory performance in processing vibration signals with heavy background noises. In this paper, a method based on fusion sparse coding （FSC） and online dictionary learning is proposed to extract impulses efficiently. Firstly, fusion scheme of different sparse coding algorithms is presented to ensure higher reconstruction accuracy. Then, an improved online dictionary learning method using FSC scheme is established to obtain redundant dictionary and it can capture specific features of training samples and reconstruct the sparse approximation of vibration signals. Simulation shows that this method has a good performance in solving sparse coefficients and training redundant dictionary compared with other methods. Lastly, the proposed method is further applied to processing aircraft engine rotor vibration signals. Compared with other feature extraction approaches, our method can extract impulse features accurately and efficiently from heavy noisy vibration signal, which has significant supports for machinery fault detection and diagnosis.
文摘A new method for the construction of the high performance systematic irregular low-density paritycheck （LDPC） codes based on the sparse generator matrix （G-LDPC） is introduced. The code can greatly reduce the encoding complexity while maintaining the same decoding complexity as traditional regular LDPC （H-LDPC） codes defined by the sparse parity check matrix. Simulation results show that the performance of the proposed irregular LDPC codes can offer significant gains over traditional LDPC codes in low SNRs with a few decoding iterations over an additive white Gaussian noise （AWGN） channel.
基金Project supported by the National Natural Science Foundation of China(Grant No.60972046)Grant from the National Defense Pre-Research Foundation of China
文摘For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
基金supported by the National Key Research and Development Program of China(No.2018YFB2003300)National Science and Technology Major Project,China(No.2017-IV-0008-0045)National Natural Science Foundation of China(No.51675262).
文摘Due to the strong background noise and the acquisition system noise,the useful characteristics are often difficult to be detected.To solve this problem,sparse coding captures a concise representation of the high-level features in the signal using the underlying structure of the signal.Recently,an Online Convolutional Sparse Coding(OCSC)denoising algorithm has been proposed.However,it does not consider the structural characteristics of the signal,the sparsity of each iteration is not enough.Therefore,a threshold shrinkage algorithm considering neighborhood sparsity is proposed,and a training strategy from loose to tight is developed to further improve the denoising performance of the algorithm,called Variable Threshold Neighborhood Online Convolution Sparse Coding(VTNOCSC).By embedding the structural sparse threshold shrinkage operator into the process of solving the sparse coefficient and gradually approaching the optimal noise separation point in the training,the signal denoising performance of the algorithm is greatly improved.VTNOCSC is used to process the actual bearing fault signal,the noise interference is successfully reduced and the interest features are more evident.Compared with other existing methods,VTNOCSC has better denoising performance.
基金supported in part by the National Natural Science Foundation of China(61903090,61727810,62073086,62076077,61803096,U191140003)the Guangzhou Science and Technology Program Project(202002030289)Japan Society for the Promotion of Science(JSPS)KAKENHI(18K18083)。
文摘Key frame extraction based on sparse coding can reduce the redundancy of continuous frames and concisely express the entire video.However,how to develop a key frame extraction algorithm that can automatically extract a few frames with a low reconstruction error remains a challenge.In this paper,we propose a novel model of structured sparse-codingbased key frame extraction,wherein a nonconvex group log-regularizer is used with strong sparsity and a low reconstruction error.To automatically extract key frames,a decomposition scheme is designed to separate the sparse coefficient matrix by rows.The rows enforced by the nonconvex group log-regularizer become zero or nonzero,leading to the learning of the structured sparse coefficient matrix.To solve the nonconvex problems due to the log-regularizer,the difference of convex algorithm(DCA)is employed to decompose the log-regularizer into the difference of two convex functions related to the l1 norm,which can be directly obtained through the proximal operator.Therefore,an efficient structured sparse coding algorithm with the group log-regularizer for key frame extraction is developed,which can automatically extract a few frames directly from the video to represent the entire video with a low reconstruction error.Experimental results demonstrate that the proposed algorithm can extract more accurate key frames from most Sum Me videos compared to the stateof-the-art methods.Furthermore,the proposed algorithm can obtain a higher compression with a nearly 18% increase compared to sparse modeling representation selection(SMRS)and an 8% increase compared to SC-det on the VSUMM dataset.
基金National Natural Science Foundations of China(Nos.61362001,61102043,61262084)Technology Foundations of Department of Education of Jiangxi Province,China(Nos.GJJ12006,GJJ14196)Natural Science Foundations of Jiangxi Province,China(Nos.20132BAB211030,20122BAB211015)
文摘The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) was proposed. The graph regularized sparse coding showed the potential in maintaining the geometrical information of the data. In this study, it was incorporated with two-level Bregman iterative procedure that updated the data term in outer-level and learned dictionary in innerlevel. Moreover,the graph regularized sparse coding and simple dictionary updating stages derived by the inner minimization made the proposed algorithm converge in few iterations, meanwhile achieving superior reconstruction performance. Extensive experimental results have demonstrated GSCMRI can consistently recover both real-valued MR images and complex-valued MR data efficiently,and outperform the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.
基金National Natural Foundation of China under Grant(61572085,61502058)
文摘Abstract:Sparse coding(SC)based visual tracking(l1-tracker)is gaining increasing attention,and many related algorithms are developed.In these algorithms,each candidate region is sparsely represented as a set of target templates.However,the structure connecting these candidate regions is usually ignored.Lu proposed an NLSSC-tracker with non-local self-similarity sparse coding to address this issue,which has a high computational cost.In this study,we propose an Euclidean local-structure constraint based sparse coding tracker with a smoothed Euclidean local structure.With this tracker,the optimization procedure is transformed to a small-scale l1-optimization problem,significantly reducing the computational cost.Extensive experimental results on visual tracking demonstrate the eectiveness and efficiency of the proposed algorithm.
基金Manuscript received February 13, 2016 accepted December 7, 2016. This work was supported by the National Natural Science Foundation of China （61362001, 61661031）, Jiangxi Province Innovation Projects for Postgraduate Funds （YC2016-S006）, the International Postdoctoral Exchange Fellowship Program, and Jiangxi Advanced Project for Post-Doctoral Research Fund （2014KY02）.
基金the National Natural Science Foundation of China(Nos.61372149,61370189,and 61471013)the Importation and Development of High-Caliber Talents Project of Beijing Municipal Institutions(Nos.CIT&TCD20150311,CIT&TCD201304036,and CIT&TCD201404043)+3 种基金the Program for New Century Excellent Talents in University of China(No.NCET-11-0892)the Specialized Research Fund for the Doctoral Program of Higher Education of China(No.20121103110017)the Natural Science Foundation of Beijing(No.4142009)the Science and Technology Development Program of Beijing Education Committee(No.KM201410005002)
文摘For sparse coding, the weaker the correlation of dictionary atoms is, the better the representation capacity of dictionary will be. A weak correlation dictionary construction method for sparse coding has been proposed in this paper. Firstly, a new dictionary atom initialization is proposed in which data samples with weak correlation are selected as the initial dictionary atoms in order to effectively reduce the correlation among them.Then, in the process of dictionary learning, the correlation between atoms has been measured by correlation coefficient, and strong correlation atoms have been eliminated and replaced by weak correlation atoms in order to improve the representation capacity of the dictionary. An image classification scheme has been achieved by applying the weak correlation dictionary construction method proposed in this paper. Experimental results show that, the proposed method averagely improves image classification accuracy by more than 2%, compared to sparse coding spatial pyramid matching(Sc SPM) and other existing methods for image classification on the datasets of Caltech-101, Scene-15, etc.
基金This work was supported by the National Key R&D Program of China(Grant No.2019YFB2205100)in part by Hubei Key Laboratory of Advanced Memories.
文摘Sparse coding is a prevalent method for image inpainting and feature extraction,which can repair corrupted images or improve data processing efficiency,and has numerous applications in computer vision and signal processing.Recently,sev-eral memristor-based in-memory computing systems have been proposed to enhance the efficiency of sparse coding remark-ably.However,the variations and low precision of the devices will deteriorate the dictionary,causing inevitable degradation in the accuracy and reliability of the application.In this work,a digital-analog hybrid memristive sparse coding system is pro-posed utilizing a multilevel Pt/Al_(2)O_(3)/AlO_(x)/W memristor,which employs the forward stagewise regression algorithm:The approxi-mate cosine distance calculation is conducted in the analog part to speed up the computation,followed by high-precision coeffi-cient updates performed in the digital portion.We determine that four states of the aforementioned memristor are sufficient for the processing of natural images.Furthermore,through dynamic adjustment of the mapping ratio,the precision require-ment for the digit-to-analog converters can be reduced to 4 bits.Compared to the previous system,our system achieves higher image reconstruction quality of the 38 dB peak-signal-to-noise ratio.Moreover,in the context of image inpainting,images containing 50%missing pixels can be restored with a reconstruction error of 0.0424 root-mean-squared error.
基金supported by the Prominent Youth Fund of the National Natural Science Foundation of China(61025006)
文摘Aiming at technical difficulties in feature extraction for the inverse synthetic aperture radar(ISAR)target recognition,this paper imports the concept of visual perception and presents a novel method,which is based on the combination of non-negative sparse coding(NNSC)and linear discrimination optimization,to recognize targets in ISAR images.This method implements NNSC on the matrix constituted by the intensities of pixels in ISAR images for training,to obtain non-negative sparse bases which characterize sparse distribution of strong scattering centers.Then this paper chooses sparse bases via optimization criteria and calculates the corresponding non-negative sparse codes of both training and test images as the feature vectors,which are input into k neighbors classifier to realize recognition finally.The feasibility and robustness of the proposed method are proved by comparing with the template matching,principle component analysis(PCA)and non-negative matrix factorization(NMF)via simulations.
基金Supported by the National Natural Science Foundation of China(No.61261010No.61362001+7 种基金No.61365013No.61262084No.51165033)Technology Foundation of Department of Education in Jiangxi Province(GJJ13061GJJ14196)Young Scientists Training Plan of Jiangxi Province(No.20133ACB21007No.20142BCB23001)National Post-Doctoral Research Fund(No.2014M551867)and Jiangxi Advanced Project for Post-Doctoral Research Fund(No.2014KY02)
文摘In this paper, a two-level Bregman method is presented with graph regularized sparse coding for highly undersampled magnetic resonance image reconstruction. The graph regularized sparse coding is incorporated with the two-level Bregman iterative procedure which enforces the sampled data constraints in the outer level and updates dictionary and sparse representation in the inner level. Graph regularized sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge with a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can consistently reconstruct both simulated MR images and real MR data efficiently, and outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.
基金supported by the National Science Fundation of China(NSFC)under grant 62001423the Henan Provincial Key Research,Development and Promotion Project under grant 212102210175the Henan Provincial Key Scientific Research Project for College and University under grant 21A510011.
文摘Sparse vector coding(SVC)is emerging as a potential technology for short packet communications.To further improve the block error rate(BLER)performance,a uniquely decomposable constellation group-based SVC(UDCG-SVC)is proposed in this article.Additionally,in order to achieve an optimal BLER performance of UDCG-SVC,a problem to optimize the coding gain of UDCG-based superimposed constellation is formulated.Given the energy of rotation constellations in UDCG,this problem is solved by converting it into finding the maximized minimum Euclidean distance of the superimposed constellation.Simulation results demonstrate the validness of our derivation.We also find that the proposed UDCGSVC has better BLER performance compared to other SVC schemes,especially under the high order modulation scenarios.
基金Supported by the National Natural Science Foundation of China(61462048)
文摘The existing depth video coding algorithms are generally based on in-loop depth filters, whose performance are unstable and easily affected by the outliers. In this paper, we design a joint weighted sparse representation-based median filter as the in-loop filter in depth video codec. It constructs depth candidate set which contains relevant neighboring depth pixel based on depth and intensity similarity weighted sparse coding, then the median operation is performed on this set to select a neighboring depth pixel as the result of the filtering. The experimental results indicate that the depth bitrate is reduced by about 9% compared with anchor method. It is confirmed that the proposed method is more effective in reducing the required depth bitrates for a given synthesis quality level.
文摘Purpose: To improve the image resolution of magnetic resonance imaging (MRI), conventional interpolation methods are commonly used to magnify images via various image processing approaches;however, these methods tend to produce artifacts. While super-resolution (SR) schemes have been introduced as an alternative approach to apply medical imaging, previous studies applied SR only to medical images in 8-bit image format. This study aimed to evaluate the effectiveness of sparse-coding super-resolution (ScSR) for improving the image quality of reconstructed high-resolution MR images in 16-bit digital imaging and communications in medicine (DICOM) image format. Materials and Methods: Fifty-nine T1-weighted images (T1), 84 T2-weighted images (T2), 85 fluid attenuated inversion recovery (FLAIR) images, and 30 diffusion-weighted images (DWI) were sampled from The Repository of Molecular Brain Neoplasia Data as testing datasets, and 1307 non-medical images were sampled from the McGill Calibrated Color Image Database as a training dataset. We first trained the ScSR to prepare dictionaries, in which the relationship between low- and high-resolution images was learned. Using these dictionaries, a high-resolution image was reconstructed from a 16-bit DICOM low-resolution image downscaled from the original test image. We compared the image quality of ScSR and 4 interpolation methods (nearest neighbor, bilinear, bicubic, and Lanczos interpolations). For quantitative evaluation, we measured the peak signal-to-noise ratio (PSNR) and structural similarity (SSIM). Results: The PSNRs and SSIMs for the ScSR were significantly higher than those of the interpolation methods for all 4 MRI sequences (PSNR: p p Conclusion: ScSR provides significantly higher image quality in terms of enhancing the resolution of MR images (T1, T2, FLAIR, and DWI) in 16-bit DICOM format compared to the interpolation methods.
文摘Purpose: To detect small diagnostic signals such as lung nodules in chest radiographs, radiologists magnify a region-of-interest using linear interpolation methods. However, such methods tend to generate over-smoothed images with artifacts that can make interpretation difficult. The purpose of this study was to investigate the effectiveness of super-resolution methods for improving the image quality of magnified chest radiographs. Materials and Methods: A total of 247 chest X-rays were sampled from the JSRT database, then divided into 93 training cases with non-nodules and 154 test cases with lung nodules. We first trained two types of super-resolution methods, sparse-coding super-resolution (ScSR) and super-resolution convolutional neural network (SRCNN). With the trained super-resolution methods, the high-resolution image was then reconstructed using the super-resolution methods from a low-resolution image that was down-sampled from the original test image. We compared the image quality of the super-resolution methods and the linear interpolations (nearest neighbor and bilinear interpolations). For quantitative evaluation, we measured two image quality metrics: peak signal-to-noise ratio (PSNR) and structural similarity (SSIM). For comparative evaluation of the super-resolution methods, we measured the computation time per image. Results: The PSNRs and SSIMs for the ScSR and the SRCNN schemes were significantly higher than those of the linear interpolation methods (p p p Conclusion: Super-resolution methods provide significantly better image quality than linear interpolation methods for magnified chest radiograph images. Of the two tested schemes, the SRCNN scheme processed the images fastest;thus, SRCNN could be clinically superior for processing radiographs in terms of both image quality and processing speed.
