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

67 results about "Tucker decomposition" patented technology

In mathematics, Tucker decomposition decomposes a tensor into a set of matrices and one small core tensor. It is named after Ledyard R. Tucker although it goes back to Hitchcock in 1927. Initially described as a three-mode extension of factor analysis and principal component analysis it may actually be generalized to higher mode analysis, which is also called Higher Order Singular Value Decomposition (HOSVD).

Face feature extraction method based on heterogeneous tensor decomposition

The invention discloses a face feature extraction method based on heterogeneous tensor decomposition. The method includes: using an arbitrary camera array to collect color views of different faces at different visual angles, and obtaining an initial view set of the faces after image processing such as gray-scale transformation and normalization; extracting images of the initial view set, and carrying out sequential stacking to form a third-order tensor, wherein a third-order dimension of the formed third-order tensor corresponds to the total number of the face images; carrying out TUCKER decomposition on the formed third-order tensor to obtain a kernel tensor, a first pattern factor matrix, a second pattern factor matrix and a third pattern factor matrix, and updating the same; judging whether the kernel tensor converges; and decomposing the obtained third pattern factor matrix Z, wherein high-dimensional face data are mapped to the pattern factor matrix of low-dimensional feature subspace, and thus the third pattern factor matrix Z is finally extracted face features. According to the method, automatic extraction of the face image features is realized, tedious steps of traditional feature extraction are avoided, and feature extraction speed is increased.
Owner:TIANJIN UNIV

Remote-sensing image digital watermark embedding and extracting method based on quaternary wavelet

InactiveCN107292806AOvercoming translation sensitivityOvercoming Poor DirectionalityImage data processing detailsWavelet decompositionTucker decomposition
The invention discloses a remote-sensing image digital watermark embedding and extracting method based on the quaternary wavelet. The embedding process comprises carrying out quaternary wavelet decomposition on R, G and B wave bands of an original color remote-sensing image, making amplitude low frequency coefficients in the three wave bands form a third-order tensor, and then carrying out Tucker decomposition to obtain a core tensor; carrying out Arnold scrambling transformation on an original watermark image; embedding the scrambled watermark information into the core tensor, reconstructing the tensor and carrying out quaternary wavelet inverse transformation, and obtaining a color remote-sensing image including a watermark. The extracting process comprises carrying out quaternary wavelet decomposition on R, G and B wave bands of the color remote-sensing image including the watermark, making amplitude low frequency coefficients in the three wave bands form a third-order tensor, and then carrying out Tucker decomposition to obtain a core tensor; calculating the singular value of the core tensor to extract embedding information; and obtaining watermark information by means of inverse transformation of the Arnold scrambling transformation. According to the invention, invisibility and anti-attack capability of the watermark can be improved.
Owner:NANJING NORMAL UNIVERSITY

Tensor decomposition cutoff remote sensing hyperspectral image compression method based on fast optimal core configuration search

The invention provides a tensor decomposition cutoff remote sensing hyperspectral image compression method based on fast optimal core configuration search and relates to a hyperspectral image processing method. Aiming at the problem that a compression method based on the tensor decomposition cannot easily and fast obtain the optimal tensor core configuration under the requirement of setting the compression quality and the compression ratio, the tensor decomposition cutoff remote sensing hyperspectral image compression method based on the fast optimal core configuration search is provided. The method has the following steps that hyperspectral images are subjected to complete Tucker decomposition; spectrum dimension search starting points are calculated, iterative search is started, and the spectrum dimension optimal configuration is obtained; then, the trimming iteration is carried out, and the space dimension optimal configuration is obtained; and finally, complete decomposition results are intercepted, and final compression results are obtained. The method can be applied to satellite-bone or ground hyperspectral image compression, the compression recovery quality is ensured, and meanwhile, the calculation quantity of the compression method can be effectively reduced.
Owner:HARBIN INST OF TECH

User behavior data mining-based electric energy experience analysis method and system

The invention provides a user behavior data mining-based electric energy experience analysis method which comprises the following steps: historic electricity consumption data of all users on a user side; a three dimensional tensor model is built while date information, time information and user information are used as coordinate axes; a Tucker decomposition method is adopted for decomposing the three dimensional tensor model; two dimensional characteristic matrixes that respectively correspond to the data information, the time information and the user information; a distribution law of electricity consumption loads of users is determined; cluster analysis is conducted, and user electricity consumption mode types are built according to all kinds of cluster results; all levels of user sensitivity are determined and combined with electricity consumption modes, an electricity consumption mode prediction model is established, current actual electricity consumption data of object users is obtained and imported into the electricity consumption mode prediction model, and current electricity consumption mode types of the object users and corresponding current sensitivity levels are obtained. Via use of the analysis method, user electric energy experience analysis results can be obtained from a user angle based on user side load sensitivity.
Owner:SHENZHEN POWER SUPPLY BUREAU +1

Video sequence classifying method based on tensor time domain association model

A video sequence classifying method based on a tensor time domain association model comprises the steps of representing an original video sequence in a three-grade video tensor manner; performing tensor Tucker decomposition on the three-grade video tensor for obtaining a latent kernel tensor; applying an autoregression model on the time domain of the obtained latent kernel tensor for establishing relevance between adjacent time slices; dynamically studying the front process, updating the result until an algorithm is convergent, and obtaining an optimal result. The video sequence classifying method ensures time domain relevance and dependence of the video sequence after dimension reduction through limiting the time domain of the video sequence. The video sequence classifying method has advantages of sufficiently utilizing latent useful information in the video, eliminating redundant information in the video, ensuring high continuity of the video sequence in time domain, reducing classification difficulty of the video sequence, and improving classification accuracy of the video sequence. The video sequence classifying method is better than a traditional video sequence classification method and greatly improves classification precision.
Owner:TIANJIN UNIV

Motion recognition method based on sparse coding tensor decomposition

The invention provides a motion recognition method based on sparse coding tensor decomposition. An original video sequence is expressed as a three-order video sequence tensor A belongs to R<I<1>xI<2>xT>, wherein T refers to the length of the video sequence, and I<1>xI<2> refers to the size of the video frame; Tucker decomposition is performed on the three-order video sequence tensor A belongs to R<I<1>xI<2>xT> so that a nuclear tensor of which the spatial domain dimension is reduced is acquired; the video sequence tensor is zoomed to the same scale; and the result is updated by dynamically learning the process until the algorithm convergence result achieves the optimum. According to the motion recognition method based on sparse coding tensor decomposition, the video sequence can be processed into the unified length-the sparse coding tensor decomposition technology. The frames of the most information are adaptively selected from a tensor decomposition framework in the process to construct a new video sequence having the unified video sequence length. According to the method, the difficulty of gesture recognition can be reduced and the accuracy of gesture recognition can be enhanced so that the great conditions can be provided for subsequent video sequence classification, and the accuracy of video sequence classification can be enhanced.
Owner:TIANJIN UNIV

Tucker decomposition-based spectral tensor dimension reduction and classification method

ActiveCN106845517ASolve the problem of factor modelingEasy to classifyCharacter and pattern recognitionQR decompositionAlgorithm
The invention discloses a Tucker decomposition-based spectral tensor dimension reduction and classification method. The method comprises the steps of constructing a three-order tensor by taking factors influencing a spectral feature of a ground object as intra-class factors and taking the intra-class factors, classes and pixel spectrums as modes respectively, and performing low-rank tensor decomposition-based dimension reduction on the three-order tensor; performing low-rank tensor decomposition on the three-order tensor to obtain a nuclear tensor Z, a class space matrix Uclass, an intra-class factor space matrix Uwithin-class and a pixel spectral matrix Upixels; and performing classification on unclassified test hyperspectral images d by adopting a supervised classifier. According to the method, the hyperspectral images can be classified after model building, and adjustment does not need to be carried out; for other tensor modeling methods, the best classification effect can be achieved by repeated setting and adjustment of parameters; and all pixel spectrums in a class are mapped to a same coefficient vector, so that the influence of various factors is reduced to minimum, the classification precision is improved, and a result is stable.
Owner:NORTHWEST UNIV(CN) +2

Underdetermined blind identification method based on general covariance and tensor decomposition

The invention relates to the field of signal identification, in particular relates to the field of blind source/signal separation and specifically relates to an underdetermined blind identification method based on general covariance and tensor decomposition. The underdetermined blind identification method based on general covariance and tensor decomposition comprises establishing kernel functional equation sets according to the general covariance matrix of observation hybrid sampled data, stacking the kernel functional equation sets into a three-dimensional tensor model, and finally gaining a factor matrix by virtue of tensor Tucker decomposition, thereby identifying underdetermined hybrid system characteristics or hybrid matrixes. The underdetermined blind identification method based on general covariance and tensor decomposition has the technical advantages of effective performance improvement and relatively low computation complexity in contrast with a mixed matrix identification method in traditional underdetermined blind source separation; the underdetermined blind identification method provides a technical foundation for the blind anti-jamming technique of array signal processing and satellite communication.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

Magnetoencephalogram source positioning method and device based on Tucker decomposition and ripple time window

The invention provides a magnetoencephalogram source positioning method and device based on Tucker decomposition and a ripple time window. The device comprises a magnetoencephalogram sensor which is used for obtaining a first magnetoencephalogram signal of a user; a ripple detection unit which is used for detecting the ripple time window in the first magnetoencephalogram signal through a root-mean-square method to serve as a time window for source positioning and obtaining the first magnetoencephalogram signal in the ripple time window to serve as a second magnetoencephalogram signal; a high-order orthogonal iteration based Tucker decomposition unit which is used for carrying out Tucker decomposition on the original tensor of the second magnetoencephalogram signal to calculate an estimated value of the original tensor; and a source positioning unit which is used for calculating a covariance matrix for the estimated value and calculating a source position corresponding to the second magnetoencephalogram signal through an LCMV inverse problem solving method in a beamforming method. According to the method, the influence of noise signals is eliminated, the calculation complexity is reduced, the consistency of each calculation result is ensured, and the positioning accuracy of the epileptogenic region is improved.
Owner:BEIHANG UNIV

Nuclear magnetic resonance FID signal noise suppression method based on multilinear singular value tensor decomposition

The invention provides a nuclear magnetic resonance FID signal noise suppression method based on multilinear singular value tensor decomposition, and the method comprises the steps: obtaining a multi-channel signal: enabling one channel to start sampling at an interval of delta t through delay sampling, and obtaining the multi-channel signal; converting each channel signal into a Hankel matrix, forming a third-order tensor, performing Tucker decomposition and processing on the third-order tensor to obtain a third-order tensor, recovering the third-order tensor into a multi-channel signal, performing CP tensor decomposition processing on a second-order tensor X formed by the multi-channel signal, and finally obtaining a high signal-to-noise ratio signal xnew after fusion of multiple communication signals. The method has the advantages that the limitation of a current algorithm under strong noise interference is effectively overcome, meanwhile, the instantaneity and universality of the algorithm are guaranteed, the method can be suitable for instruments such as a proton magnetometer and a nuclear magnetic resonance water exploration instrument, the frequency domain measurement precision and the hydrological parameter accuracy of the instruments are improved, and the precision and accuracy of related geosciences are effectively improved.
Owner:CHINA UNIV OF GEOSCIENCES (WUHAN)
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