Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

202 results about "Kernel sparse representation" patented technology

Based on sparse representation and related approaches, a novel weighted kernel sparse representation based classification (WKSRC) is proposed in this paper. Firstly, the kernel trick is used to map the original space into a high dimensional feature space, and the nonlinear data can be classified better.

An image super-resolution reconstruction method based on sparse representation and deep learning

The invention discloses an image super-resolution reconstruction method based on sparse representation and deep learning, and solves the problems that the image super-resolution process is complex incalculation and the quality of a reconstructed image is poor. The method comprises the following implementation steps: collecting and extracting training data blocks and a chromaticity and brightnessdictionary for combined optimization training; independently reconstructing a high-resolution image block; Carrying out high-resolution image reconstruction of sparse representation; Training a residual error network based on deep learning to optimize high-frequency details; Image super-resolution reconstruction. In order to prevent an edge effect and a fuzzy effect, chroma and brightness data aredistinguished and independently reconstructed; in order to optimize high-frequency detail information of a sparse representation output high-resolution image, the high-resolution image based on sparse representation reconstruction is input into a residual network, and a high-frequency residual image is output through four times of convolution feature extraction and feature fusion and input bitwise addition to reconstruct a super-resolution image. The method is low in calculation complexity, high in image reconstruction quality and widely applied to the fields of remote sensing monitoring, criminal investigation, traffic management and the like.
Owner:XIDIAN UNIV

SAR image target recognition method based on sparse representation

The invention discloses an SAR image target recognition method based on sparse representation. The SAR image target recognition method based on sparse representation mainly resolves the problem that an existing method is complex in preprocessing and difficult in estimation of an azimuth angle. The SAR image target recognition method based on sparse representation comprises the steps of (1) extracting partial features of an image and studying a recognizable dictionary through a diversity density function; (2) carrying out sparse encoding on each partial feature through the dictionary, and then carrying out space pooling on each divided sub-area through a space domain pyramid structure to obtain feature vectors of the sub-areas samples of a training set and a test set; (3) weighing the corresponding sub-areas of a test sample according to the sparsity of each sub-area of the test sample; and (4) combining the weighed sub-areas together and recognizing the image through a sparse representation method. Compared with the prior art, the SAR image target recognition method based on sparse representation has high robustness for shielded and partial noise, improves the recognition accuracy of an SAR target without estimating the azimuth angle, and can be used for image processing.
Owner:XIDIAN UNIV

Face identification method based on multiscale weber local descriptor and kernel group sparse representation

The invention discloses a face identification method based on multiscale weber local descriptor and kernel group sparse representation. The face identification method comprises the following steps: firstly normalizing the size of face images and smoothing the images by utilizing a gaussian filter; extracting differential excitation ingredients of the multiscale weber local descriptor of the images and extracting direction information by utilizing an Sobel operator; extracting the multiscale weber local descriptor of the face images according to the multiscale differential excitation and the direction information and mapping the multiscale weber local descriptor to a kernel space by utilizing a histogram intersection kernel; then with a kernel matrix obtained by a training sample as a sparse dictionary, calculating group sparse representation coefficients of a kernel vector obtained by a test sample; and finally reconstructing a multiscale weber local descriptor vector of the test sample according to the group sparse representation coefficients and distinguishing the test sample by utilizing the minimum reconstruction error. According to the face identification method, the multiscale weber local descriptor and the kernel group sparse representation algorithm are fused for face identification, and the identification accuracy rate is greatly improved.
Owner:HUNAN UNIV

Hyperspectral abnormal object detection method based on structure sparse representation and internal cluster filtering

The invention discloses a hyperspectral abnormal object detection method based on structure sparse representation and internal cluster filtering, aiming at addressing the technical problem of low object detection effciency of current hyperspectral abnormal object detection methods. The technical solution involves: after selecting an initial background pixel, using the dictionary learning method which is based on principal component analysis to study a background dictionary which obtains rebustness, in the course of sparse vector resolution and image reconstruction, introducing re-weighted laplacian prior to increase the solution precision of sparse vector, computing the errors betwen an original image and a reconstructed image to obtain a sparse representation error, using the internal cluster filtering to represent space spectrum characteristics of hyperspectral data, obtaining the internal cluster error by computing the error between a to-be-tested pixel and other pixel linear representation result, and finally combining the sparse representation error and the linear weighting of the internal cluster error and implementing precise extraction of an abnormal object. According to the invention, the method increases 10-15% of detection rate with the proviso of a constant false alarm rate compared with prior art.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

Super-pixel polarimetric SAR land feature classification method based on sparse representation

The invention discloses a super-pixel polarimetric SAR land feature classification method based on sparse representation. The method comprises: inputting polarimetric SAR image data to be classified, processing the image, and thereby obtaining a pseudocolor image corresponding to Pauli decomposition; performing super-pixel image over-segmentation on the pseudocolor image to obtain a plurality of super-pixels; extracting features, which are seven-dimensional, of radiation mechanism of the original polarimetric SAR image as features of every pixel; performing super-pixel united sparse representation to obtain sparse representation of each super-pixel feature; classifying by using a sparse representation classifier; working out the mean value of each super-pixel covariance matrix, then performing super-pixel complex Wishart iteration by using the classifying result in the last step, and at last obtaining a final classifying result. According to the super-pixel polarimetric SAR land feature classification method based on sparse representation, the problem that traditional classifying areas based on the single pixel are poor in consistency is solved, and operating speed of the algorithm is greatly increased on basis of improving accelerate.
Owner:XIDIAN UNIV

Small weak moving target tracking method based on sparse representation

InactiveCN104899567ABoost to represent sparsity differencesImprove motion detection and tracking capabilitiesImage analysisScene recognitionPattern recognitionSingular value decomposition method
A small weak moving target tracking method based on sparse representation comprises the following steps: acquiring the location of an infrared image target based on a detection algorithm, and constructing an initial training sample and an initial particle set; adopting a K-means singular value decomposition method K_SVD to learn the training sample and construct an adaptive morphological ingredient over-complete dictionary of the image, then, constructing an adaptive online classification over-complete dictionary, and carrying out real-time online updating; and finally, establishing a small weak target sparse representation observation model in a particle filter tracking framework, estimating the location of the target based on the size of sparse representation residual of a particle target image block and a particle background image block in the adaptive online classification dictionary, and keeping stable target tracking in subsequent frames through repeated iteration. The method of the invention not only overcomes the defect that it is difficult for an offline structure dictionary to sparsely represent a dynamically changing image signal and improves the difference between a signal and a background in representation sparseness, but also effectively improves the capability of infrared weak small target motion detection tracking.
Owner:CHONGQING UNIV +1

Image super resolution rebuilding method based on sparse representation and various residual

The invention relates to an image super resolution rebuilding method based on sparse representation and various residual. The image super resolution rebuilding method based on sparse representation and various residual includes the steps: first, calculating residual between images formed after the existing high resolution image and a low resolution image are amplified through an interpolation and calculating a high frequency portion and a low frequency portion of the residual; second, building a sample pair through low resolution image sample characteristic and corresponding the high frequency portion and low frequency portion of the image residual, utilizing a texture meta structure to classify the samples by regarding the low resolution sample as a standard and utilizing a singular value decomposition (KSVD) method to train each type of a sample to obtain a dictionary pair of the low resolution sample, the high frequency portion and low frequency portion of the image residual; finally, choosing the dictionary pair and combing the final image residual with the interpolation result of the low resolution image to obtain a high resolution image according to the texture meta structure type of the test samples. The image super resolution rebuilding method based on sparse representation and various residual just needs to rebuild the image residual, combines the interpolation image to rebuild the high resolution image and improves a rebuilding result of the high resolution image.
Owner:HANGZHOU DIANZI UNIV

Infrared small-target detection method based on mixing Gauss and sparse representation

The invention provides an infrared small-target detection method based on mixing Gauss and sparse representation. The method comprises the following steps: constructing an overcomplete morphological dictionary of an image in a self-adaptive mode by adopting a K cluster singular value decomposition K_SVD method; according to the characteristic that object signals are usually distributed in a Gauss mode, dividing the atoms of the self-adaptive overcomplete morphological dictionary into target atoms representing target forms and background atoms representing background noise components by using a Gauss overcomplete dictionary, and forming a self-adaptive mixing Gauss overcomplete dictionary having a target morphological dictionary and a background morphological dictionary; performing sparse representation on an original image block in the mixing Gauss overcomplete dictionary and extracting the sparse representation coefficient of an image signal; and when the rarefication degree represented by the sparse representation coefficient is greater than a threshold, determining that the image block contains a target, otherwise determining that the image block is a background. By using the method provided by the invention, defects can be overcome that it is difficult for a conventional Gauss sparse dictionary to be adaptive to non-Gaussian distributed target forms and judging whether a target is contained by Gauss atom sparse representation coefficients, and thus the detection performance of small and weak targets can be improved.
Owner:CHONGQING UNIV

Wavelet transform and joint sparse representation-based infrared and visible light image fusion method

The invention provides a wavelet transform and joint sparse representation-based infrared and invisible light image fusion method, and relates to the field of image fusion. The method comprises the following steps of: firstly, carrying out DWT transform on a source image, decomposing the source image into a low-frequency sub-band matrix coefficient and a high-frequency sub-band coefficient, decomposing the low-frequency sub-band coefficient into a matrix by using a sliding window strategy and learning a dictionary in allusion to the decomposed low-frequency sub-band matrix; secondly, respectively fusing the low-frequency sub-band coefficient and the high-frequency sub-band coefficient; and finally reconstructing a fused image through DWT inverse transform. According to the method, effective sparse representation can be carried out on outstanding detail features of source images, and multi-scale fusion can be carried out on detail information of the images, so that target information of infrared images and background information such as details, profiles and the like of invisible light images are well retained, the target identification ability is improved, and benefit is brought to subsequent processing systems to extract and use the information; and compared with the traditional wavelet transform-based fusion method and the existing joint sparse representation-based fusion method, method provided by the invention has advantages.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

A face synthesis method based on a generative adversarial network

On a synthesis task of a human face, a multilevel sparse expression three-time conversion virtual generation neural network TTGAN is constructed based on an adversarial generation network CycleGAN architecture. The TTGAN proposes and joins a multi-level sparse representation model and a three-time conversion consistency constraint, and the TTGAN is a result under the synergistic effect of a plurality of generative adversarial networks for the target face synthesis of a face image pair. Wherein the multi-level sparse representation model is used for constraining features extracted by differentfeature extraction layers of a generated network in an input picture, including identity information related to a target image; The three times of conversion consistency constraint utilizes three different samples which contain network state information and are generated by one time of circulation of the model, so that the two generative adversarial networks of the whole model are guided to cooperate with each other. The multi-level sparse representation and the three-time conversion consistency constraint provided by the TTGAN further increase the image generation capability of the CycleGAN,so that the synthesized face image can obtain a better result in the aspects of keeping face identity information and showing more reality.
Owner:SUN YAT SEN UNIV

Structure sparse representation-based remote sensing image fusion method

The invention discloses a structure sparse representation-based remote sensing image fusion method. An adaptive weight coefficient calculation model is used for solving a luminance component of a multi-spectral image, similar image blocks are combined into a structure group, a structure group sparse model is used for solving structure group dictionaries and group sparse coefficients for the luminance component and a panchromatic image, an absolute value maximum rule is applied to partial replacement of the sparse coefficients of the panchromatic image, new sparse coefficients are generated, the group dictionary and the new sparse coefficients of the panchromatic image are used for reconstructing a high-spatial resolution luminance image, and finally, a universal component replacement model is used for fusion to acquire a high-resolution multi-spectral image. The method of the invention introduces the structure group sparse representation in the remote sensing image fusion method, overcomes the limitation that the typical sparse representation fusion method only considers a single image block, and compared with the typical sparse representation method, the method of the invention has excellent spectral preservation and spatial resolution improvement performance, and greatly shortens the dictionary training time during the remote sensing image fusion process.
Owner:SOUTH CHINA AGRI UNIV

Non-reference image quality evaluation method based on discrete cosine transform and sparse representation

The invention discloses a non-reference image quality evaluation method based on discrete cosine transform and sparse representation to mainly solve the problem that in the prior art, non-reference image quality evaluation is not accurate. The method comprises the following steps that a gray level image is input, discrete cosine transform is carried out on the gray level image, and natural scene statistical characteristics are extracted; natural scene statistical characteristics of a series of images of different distortion types and different content are extracted, and an original characteristic dictionary is established according to the average subjective difference score; clustering is carried out on the original characteristics dictionary, and atoms are selected in a self-adaptation mode according to the tested image characteristics and the approximation degrees in the original characteristic dictionary to form a sparse representation dictionary; the tested image characteristics are solved and the sparse representation coefficients are calculated through sparse representation in characteristics space, linear weighting summation is carried out according to the subjective evaluation values in the sparse representation dictionary, and the image quality measure is obtained. The method has good consistency with the subjective evaluation result and is suitable for quality evaluation on images with various distortion types.
Owner:XIDIAN UNIV

Sparse representation-based image super-resolution reconstruction method

The invention relates to a sparse representation-based image super-resolution reconstruction method. The steps include: 1) selecting a part of an input image sequence as a salient region, the remainder being a non-salient region; 2) training a pair of salient dictionaries D'1 and D'h according to the salient area, and performing context sparse decomposition on the salient area to obtain a salient sparse coefficient on the low-resolution salient dictionary; 3) training a pair of general dictionaries D1 and Dh according to the non-salient area, and performing sparse decomposition through the low-resolution general dictionary D1 to obtain a non-salient sparse coefficient; and 4) multiplying the sparse coefficient by the high-resolution salient dictionary D'h or the high-resolution general dictionary Dh to perform ratio reconstruction, thereby obtaining a high-resolution image sequence. On the basis of a traditional sparse representation super-resolution frame, the sparse representation-based image super-resolution reconstruction method emphasizes internal structure information of an image, and uses the internal structure information of the image as a prior model constraint L0-norm problem to solve, and the performance is superior to other methods in subjective and objective effects while complexity equivalent to that of a traditional sparse representation method is maintained.
Owner:PEKING UNIV

Infrared small target detection method based on overcomplete sparse representation

The invention relates to an infrared small target detection method based overcomplete sparse representation, belonging to the technical field of image processing. The method comprises the following steps of: generating a plurality of infrared target sample images by adopting a two-dimensional Gaussian model, and further constructing an infrared target overcomplete dictionary; dividing a test image into a plurality of sub-images, and respectively carrying out extraction representation coefficient treatment on each sub-image to obtain a representation coefficient of each sub-image under the overcomplete dictionary of the infrared target sample images; carrying out indexing treatment on each representation coefficient to obtain a sparse coefficient of each sub-image; and when the sparse coefficient of the sub-image is more than a threshold Tau, confirming a target exists in the sub-image and further acquiring the target position. The invention is easier to realize without training and can grasp internal geometrical characteristics of the target more effectively, that is to say, the representation coefficients of the sub-images have more remarkable difference under the dictionary, thereby being capable of suppressing the background better, protruding the target and acquiring the higher detection ratio.
Owner:SHANGHAI JIAO TONG UNIV

Image sparse representation method based on Curvelet redundant dictionary

The invention discloses an image sparse representation method based on a Curvelet redundant dictionary, mainly aiming to solve the problems that in the existing method, the redundant dictionary has large scale, the calculation complexity is high, and sparse representation can not be effectively carried out on the rich border outline details in the image. The invention is realized through the following steps: (1) selecting the tight frame of Curvelet as an atomic model; (2) determining the numeric areas of the scale parameter j, direction parameter theta and displacement parameter k in the frame, carrying out discretization on each parameter to form the Curvelet redundant dictionary; and (3) blocking each input image, carrying out sparse decomposition on each sub-image by utilizing an orthogonal matching pursuit (OMP) algorithm sparse decomposition to solve sparse coefficient vectors, combining all the sparse coefficient vectors to obtain the sparse matrix, and multiplying the sparse matrix by the Curvelet redundant dictionary to obtain the sparse representation results of the input image. Compared with the prior art, the invention has the advantages of low calculation complexity, high quality of sparse representation image, especially can better capture the singularity of curves in the image, and can be applied to the fields of image processing and computer vision.
Owner:XIDIAN UNIV

Sparse representation and empty spectrum Laplace figure based hyperspectral data dimension reduction method

ActiveCN104318243AAccurate descriptionImprove the effect of dimensionality reductionCharacter and pattern recognitionDecompositionHigh dimensional
The invention discloses a sparse representation and empty spectrum Laplace figure based hyperspectral data dimension reduction method which mainly aims at solving the problems that the traditional manifold learning information is single and large-scale data are difficult to be processed. The sparse representation and empty spectrum Laplace figure based hyperspectral data dimension reduction method comprises the steps of step 1, selecting a certain amount of data from large-scale hyperspectral data to serve as a training sample; step 2, performing construction of an empty spectrum Laplace figure on the training sample; step 3, performing characteristic decomposition on a Laplacian matrix to obtain the low-dimension representation of the training sample; step 4, constructing a high-dimensional dictionary and a low-dimensional dictionary through the training sample and the low-dimension representation of the training sample; step 5, calculating sparse representation coefficients of remaining hyperspectral data on the high-dimensional dictionary; step 6, performing multiplication on the sparse representation coefficients and the low-dimensional dictionary to obtain the low-dimension representation of the remaining data; step 7, integrating the low-dimension representation of the training sample and the remaining data to obtain complete dimension reduction data. According to the sparse representation and empty spectrum Laplace figure based hyperspectral data dimension reduction method, the effect of the manifold dimension reduction is improved and the large-scale hyperspectral data can be processed.
Owner:XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products