THE SPARSE REPRESENTATION RELATED WITH FRACTIONAL HEAT EQUATIONS

This study introduces a pre-orthogonal adaptive Fourier decomposition(POAFD)to obtain approximations and numerical solutions to the fractional Laplacian initial value problem and the extension problem of Caffarelli and Silvestre(generalized Poisson equation).As a first step,the method expands the initial data function into a sparse series of the fundamental solutions with fast convergence,and,as a second step,makes use of the semigroup or the reproducing kernel property of each of the expanding entries.Experiments show the effectiveness and efficiency of the proposed series solutions.

A Disturbance Localization Method for Power System Based on Group Sparse Representation and Entropy Weight Method

This paper addresses the problem of complex and challenging disturbance localization in the current power system operation environment by proposing a disturbance localization method for power systems based on group sparse representation and entropy weight method.Three different electrical quantities are selected as observations in the compressed sensing algorithm.The entropy weighting method is employed to calculate the weights of different observations based on their relative disturbance levels.Subsequently,by leveraging the topological information of the power system and pre-designing an overcomplete dictionary of disturbances based on the corresponding system parameter variations caused by disturbances,an improved Joint Generalized Orthogonal Matching Pursuit(J-GOMP)algorithm is utilized for reconstruction.The reconstructed sparse vectors are divided into three parts.If at least two parts have consistent node identifiers,the node is identified as the disturbance node.If the node identifiers in all three parts are inconsistent,further analysis is conducted considering the weights to determine the disturbance node.Simulation results based on the IEEE 39-bus system model demonstrate that the proposed method,utilizing electrical quantity information from only 8 measurement points,effectively locates disturbance positions and is applicable to various disturbance types with strong noise resistance.

Multi-Layer Deep Sparse Representation for Biological Slice Image Inpainting

Biological slices are an effective tool for studying the physiological structure and evolutionmechanism of biological systems.However,due to the complexity of preparation technology and the presence of many uncontrollable factors during the preparation processing,leads to problems such as difficulty in preparing slice images and breakage of slice images.Therefore,we proposed a biological slice image small-scale corruption inpainting algorithm with interpretability based on multi-layer deep sparse representation,achieving the high-fidelity reconstruction of slice images.We further discussed the relationship between deep convolutional neural networks and sparse representation,ensuring the high-fidelity characteristic of the algorithm first.A novel deep wavelet dictionary is proposed that can better obtain image prior and possess learnable feature.And multi-layer deep sparse representation is used to implement dictionary learning,acquiring better signal expression.Compared with methods such as NLABH,Shearlet,Partial Differential Equation(PDE),K-Singular Value Decomposition(K-SVD),Convolutional Sparse Coding,and Deep Image Prior,the proposed algorithm has better subjective reconstruction and objective evaluation with small-scale image data,which realized high-fidelity inpainting,under the condition of small-scale image data.And theOn2-level time complexitymakes the proposed algorithm practical.The proposed algorithm can be effectively extended to other cross-sectional image inpainting problems,such as magnetic resonance images,and computed tomography images.

A weighted block cooperative sparse representation algorithm based on visual saliency dictionary

Unconstrained face images are interfered by many factors such as illumination,posture,expression,occlusion,age,accessories and so on,resulting in the randomness of the noise pollution implied in the original samples.In order to improve the sample quality,a weighted block cooperative sparse representation algorithm is proposed based on visual saliency dictionary.First,the algorithm uses the biological visual attention mechanism to quickly and accurately obtain the face salient target and constructs the visual salient dictionary.Then,a block cooperation framework is presented to perform sparse coding for different local structures of human face,and the weighted regular term is introduced in the sparse representation process to enhance the identification of information hidden in the coding coefficients.Finally,by synthesising the sparse representation results of all visual salient block dictionaries,the global coding residual is obtained and the class label is given.The experimental results on four databases,that is,AR,extended Yale B,LFW and PubFig,indicate that the combination of visual saliency dictionary,block cooperative sparse representation and weighted constraint coding can effectively enhance the accuracy of sparse representation of the samples to be tested and improve the performance of unconstrained face recognition.

Super-Resolution Based on Curvelet Transform and Sparse Representation

Super-resolution techniques are used to reconstruct an image with a high resolution from one or more low-resolution image(s).In this paper,we proposed a single image super-resolution algorithm.It uses the nonlocal mean filter as a prior step to produce a denoised image.The proposed algorithm is based on curvelet transform.It converts the denoised image into low and high frequencies(sub-bands).Then we applied a multi-dimensional interpolation called Lancozos interpolation over both sub-bands.In parallel,we applied sparse representation with over complete dictionary for the denoised image.The proposed algorithm then combines the dictionary learning in the sparse representation and the interpolated sub-bands using inverse curvelet transform to have an image with a higher resolution.The experimental results of the proposed super-resolution algorithm show superior performance and obviously better-recovering images with enhanced edges.The comparison study shows that the proposed super-resolution algorithm outperforms the state-of-the-art.The mean absolute error is 0.021±0.008 and the structural similarity index measure is 0.89±0.08.

Image Fusion Based on NSCT and Sparse Representation for Remote Sensing Data

The practice of integrating images from two or more sensors collected from the same area or object is known as image fusion.The goal is to extract more spatial and spectral information from the resulting fused image than from the component images.The images must be fused to improve the spatial and spectral quality of both panchromatic and multispectral images.This study provides a novel picture fusion technique that employs L0 smoothening Filter,Non-subsampled Contour let Transform(NSCT)and Sparse Representation(SR)followed by the Max absolute rule(MAR).The fusion approach is as follows:first,the multispectral and panchromatic images are divided into lower and higher frequency components using the L0 smoothing filter.Then comes the fusion process,which uses an approach that combines NSCT and SR to fuse low frequency components.Similarly,the Max-absolute fusion rule is used to merge high frequency components.Finally,the final image is obtained through the disintegration of fused low and high frequency data.In terms of correlation coefficient,Entropy,spatial frequency,and fusion mutual information,our method outperforms other methods in terms of image quality enhancement and visual evaluation.

Non Sub-Sampled Contourlet with Joint Sparse Representation Based Medical Image Fusion

Medical Image Fusion is the synthesizing technology for fusing multi-modal medical information using mathematical procedures to generate better visual on the image content and high-quality image output.Medical image fusion represents an indispensible role infixing major solutions for the complicated medical predicaments,while the recent research results have an enhanced affinity towards the preservation of medical image details,leaving color distortion and halo artifacts to remain unaddressed.This paper proposes a novel method of fusing Computer Tomography(CT)and Magnetic Resonance Imaging(MRI)using a hybrid model of Non Sub-sampled Contourlet Transform(NSCT)and Joint Sparse Representation(JSR).This model gratifies the need for precise integration of medical images of different modalities,which is an essential requirement in the diagnosing process towards clinical activities and treating the patients accordingly.In the proposed model,the medical image is decomposed using NSCT which is an efficient shift variant decomposition transformation method.JSR is exercised to extricate the common features of the medical image for the fusion process.The performance analysis of the proposed system proves that the proposed image fusion technique for medical image fusion is more efficient,provides better results,and a high level of distinctness by integrating the advantages of complementary images.The comparative analysis proves that the proposed technique exhibits better-quality than the existing medical image fusion practices.

Hyperspectral image classification based on spatial and spectral features and sparse representation

To minimize the low classification accuracy and low utilization of spatial information in traditional hyperspectral image classification methods, we propose a new hyperspectral image classification method, which is based on the Gabor spatial texture features and nonparametric weighted spectral features, and the sparse representation classification method（Gabor–NWSF and SRC）, abbreviated GNWSF–SRC. The proposed（GNWSF–SRC） method first combines the Gabor spatial features and nonparametric weighted spectral features to describe the hyperspectral image, and then applies the sparse representation method. Finally, the classification is obtained by analyzing the reconstruction error. We use the proposed method to process two typical hyperspectral data sets with different percentages of training samples. Theoretical analysis and simulation demonstrate that the proposed method improves the classification accuracy and Kappa coefficient compared with traditional classification methods and achieves better classification performance.

A Novel Clutter Suppression Algorithm for Low-Slow-Small Targets Detecting Based on Sparse Adaptive Filtering

Passive detection of low-slow-small(LSS)targets is easily interfered by direct signal and multipath clutter,and the traditional clutter suppression method has the contradiction between step size and convergence rate.In this paper,a frequency domain clutter suppression algorithm based on sparse adaptive filtering is proposed.The pulse compression operation between the error signal and the input reference signal is added to the cost function as a sparsity constraint,and the criterion for filter weight updating is improved to obtain a purer echo signal.At the same time,the step size and penalty factor are brought into the adaptive iteration process,and the input data is used to drive the adaptive changes of parameters such as step size.The proposed algorithm has a small amount of calculation,which improves the robustness to parameters such as step size,reduces the weight error of the filter and has a good clutter suppression performance.

Estimating High-Order Functional Connectivity Networks for Mild Cognitive Impairment Identification Based on Topological Structure

Functional connectivity networks (FCNs) are important in the diagnosis of neurological diseases and the understanding of brain tissue patterns. Recently, many methods, such as Pearson’s correlation (PC), Sparse representation (SR), and Sparse low-rank representation have been proposed to estimate FCNs. Despite their popularity, they only capture the low-order connections of the brain regions, failing to encode more complex relationships (i.e. , high-order relationships). Although researchers have proposed high-order methods, like PC + PC and SR + SR, aiming to build FCNs that can reflect more real state of the brain. However, such methods only consider the relationships between brain regions during the FCN construction process, neglecting the potential shared topological structure information between FCNs of different subjects. In addition, the low-order relationships are always neglected during the construction of high-order FCNs. To address these issues, in this paper we proposed a novel method, namely Ho-FCNTops, towards estimating high-order FCNs based on brain topological structure. Specifically, inspired by the Group-constrained sparse representation (GSR), we first introduced a prior assumption that all subjects share the same topological structure in the construction of the low-order FCNs. Subsequently, we employed the Correlation-reserved embedding (COPE) to eliminate noise and redundancy from the low-order FCNs. Meanwhile, we retained the original low-order relationships during the embedding process to obtain new node representations. Finally, we utilized the SR method on the obtained new node representations to construct the Ho-FCNTops required for disease identification. To validate the effectiveness of the proposed method, experiments were conducted on 137 subjects from the Alzheimer’s Disease Neuroimaging Initiative (ADNI) database to identify Mild Cognitive Impairment (MCI) patients from the normal controls. The experimental results demonstrate superior performance compared to baseline methods.

Sparse representation-based color visualization method for hyperspectral imaging

In this paper, we designed a color visualization model for sparse representation of the whole hyperspectral image, in which, not only the spectral information in the sparse representation but also the spatial information of the whole image is retained. After the sparse representation, the color labels of the effective elements of the sparse coding dictionary are selected according to the sparse coefficient and then the mixed images are displayed. The generated images maintain spectral distance preservation and have good separability. For local ground objects, the proposed single-pixel mixed array and improved oriented sliver textures methods are integrated to display the specific composition of each pixel. This avoids the confusion of the color presentation in the mixed-pixel color display and can also be used to reconstruct the original hyperspectral data. Finally, the model effectiveness was proved using real data. This method is promising and can find use in many fields, such as energy exploration, environmental monitoring, disaster warning, and so on.

Infrared small target detection using sparse representation

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.

Single frame super-resolution reconstruction based on sparse representation

In order to effectively improve the quality of recovered images, a single frame super-resolution reconstruction method based on sparse representation is proposed. The combination method of local orientation estimation-based image patch clustering and principal component analysis is used to obtain a series of geometric dictionaries of different orientations in the dictionary learning process. Subsequently, the dictionary of the nearest orientation is adaptively assigned to each of the input patches that need to be represented in the sparse coding process. Moreover, the consistency of gradients is further incorporated into the basic framework to make more substantial progress in preserving more fine edges and producing sharper results. Two groups of experiments on different types of natural images indicate that the proposed method outperforms some state-of- the-art counterparts in terms of both numerical indicators and visual quality.

DOA Estimation Based on Sparse Representation of the Fractional Lower Order Statistics in Impulsive Noise

This paper is mainly to deal with the problem of direction of arrival(DOA) estimations of multiple narrow-band sources impinging on a uniform linear array under impulsive noise environments. By modeling the impulsive noise as α-stable distribution, new methods which combine the sparse signal representation technique and fractional lower order statistics theory are proposed. In the new algorithms, the fractional lower order statistics vectors of the array output signal are sparsely represented on an overcomplete basis and the DOAs can be effectively estimated by searching the sparsest coefficients. To enhance the robustness performance of the proposed algorithms,the improved algorithms are advanced by eliminating the fractional lower order statistics of the noise from the fractional lower order statistics vector of the array output through a linear transformation. Simulation results have shown the effectiveness of the proposed methods for a wide range of highly impulsive environments.

Multi-task Joint Sparse Representation Classification Based on Fisher Discrimination Dictionary Learning

Recently,sparse representation classification(SRC)and fisher discrimination dictionary learning(FDDL)methods have emerged as important methods for vehicle classification.In this paper,inspired by recent breakthroughs of discrimination dictionary learning approach and multi-task joint covariate selection,we focus on the problem of vehicle classification in real-world applications by formulating it as a multi-task joint sparse representation model based on fisher discrimination dictionary learning to merge the strength of multiple features among multiple sensors.To improve the classification accuracy in complex scenes,we develop a new method,called multi-task joint sparse representation classification based on fisher discrimination dictionary learning,for vehicle classification.In our proposed method,the acoustic and seismic sensor data sets are captured to measure the same physical event simultaneously by multiple heterogeneous sensors and the multi-dimensional frequency spectrum features of sensors data are extracted using Mel frequency cepstral coefficients(MFCC).Moreover,we extend our model to handle sparse environmental noise.We experimentally demonstrate the benefits of joint information fusion based on fisher discrimination dictionary learning from different sensors in vehicle classification tasks.

Underdetermined DOA estimation and blind separation of non-disjoint sources in time-frequency domain based on sparse representation method

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.

Weighted Sparse Image Classification Based on Low Rank Representation

The conventional sparse representation-based image classification usually codes the samples independently,which will ignore the correlation information existed in the data.Hence,if we can explore the correlation information hidden in the data,the classification result will be improved significantly.To this end,in this paper,a novel weighted supervised spare coding method is proposed to address the image classification problem.The proposed method firstly explores the structural information sufficiently hidden in the data based on the low rank representation.And then,it introduced the extracted structural information to a novel weighted sparse representation model to code the samples in a supervised way.Experimental results show that the proposed method is superiority to many conventional image classification methods.

Unsupervised seismic facies analysis using sparse representation spectral clustering

Traditional unsupervised seismic facies analysis techniques need to assume that seismic data obey mixed Gaussian distribution.However,fi eld seismic data may not meet this condition,thereby leading to wrong classifi cation in the application of this technology.This paper introduces a spectral clustering technique for unsupervised seismic facies analysis.This algorithm is based on on the idea of a graph to cluster the data.Its kem is that seismic data are regarded as points in space,points can be connected with the edge and construct to graphs.When the graphs are divided,the weights of the edges between the different subgraphs are as low as possible,whereas the weights of the inner edges of the subgraph should be as high as possible.That has high computational complexity and entails large memory consumption for spectral clustering algorithm.To solve the problem this paper introduces the idea of sparse representation into spectral clustering.Through the selection of a small number of local sparse representation points,the spectral clustering matrix of all sample points is approximately represented to reduce the cost of spectral clustering operation.Verifi cation of physical model and fi eld data shows that the proposed approach can obtain more accurate seismic facies classification results without considering the data meet any hypothesis.The computing efficiency of this new method is better than that of the conventional spectral clustering method,thereby meeting the application needs of fi eld seismic data.

Research on image sentiment analysis technology based on sparse representation

Many methods based on deep learning have achieved amazing results in image sentiment analysis.However,these existing methods usually pursue high accuracy,ignoring the effect on model training efficiency.Considering that when faced with large-scale sentiment analysis tasks,the high accuracy rate often requires long experimental time.In view of the weakness,a method that can greatly improve experimental efficiency with only small fluctuations in model accuracy is proposed,and singular value decomposition(SVD)is used to find the sparse feature of the image,which are sparse vectors with strong discriminativeness and effectively reduce redundant information;The authors propose the Fast Dictionary Learning algorithm(FDL),which can combine neural network with sparse representation.This method is based on K-Singular Value Decomposition,and through iteration,it can effectively reduce the calculation time and greatly improve the training efficiency in the case of small fluctuation of accuracy.Moreover,the effectiveness of the proposed method is evaluated on the FER2013 dataset.By adding singular value decomposition,the accuracy of the test suite increased by 0.53%,and the total experiment time was shortened by 8.2%;Fast Dictionary Learning shortened the total experiment time by 36.3%.

Intelligent Fusion of Infrared and Visible Image Data Based on Convolutional Sparse Representation and Improved Pulse-Coupled Neural Network

Multi-source information can be obtained through the fusion of infrared images and visible light images,which have the characteristics of complementary information.However,the existing acquisition methods of fusion images have disadvantages such as blurred edges,low contrast,and loss of details.Based on convolution sparse representation and improved pulse-coupled neural network this paper proposes an image fusion algorithm that decompose the source images into high-frequency and low-frequency subbands by non-subsampled Shearlet Transform(NSST).Furthermore,the low-frequency subbands were fused by convolutional sparse representation(CSR),and the high-frequency subbands were fused by an improved pulse coupled neural network(IPCNN)algorithm,which can effectively solve the problem of difficulty in setting parameters of the traditional PCNN algorithm,improving the performance of sparse representation with details injection.The result reveals that the proposed method in this paper has more advantages than the existing mainstream fusion algorithms in terms of visual effects and objective indicators.