Tensor decomposition cutoff remote sensing hyperspectral image compression method based on fast optimal core configuration search
A technology of tensor decomposition and image compression, applied in the field of remote sensing hyperspectral image processing
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0068] Specific implementation mode one: the following combination figure 1 Illustrate the present embodiment, the tensor decomposition and truncation remote sensing hyperspectral image compression method based on the fast search optimal kernel configuration described in the present embodiment, its realization steps are as follows:
[0069] Step 1. Set the compression ratio C Rate and evaluation criteria;
[0070] Step 2. Take the hyperspectral image as a tensor I×J×K dimensions, I, J, and K represent space dimension 1, space dimension 2, and spectral dimension respectively;
[0071] Under the conditions of P=I, Q=J and R=K, the hyperspectral image is completely decomposed by tensor Tucker decomposition, so as to obtain the result of Tucker complete decomposition A f , B f , C f ;
[0072] Among them: P represents the space transformation dimension one of tensor decomposition, Q represents the space transformation dimension two of tensor decomposition, and R represent...
specific Embodiment approach 2
[0118] Specific implementation mode two: the following combination figure 1 Describe this embodiment, this embodiment is the set compression ratio C of Embodiment 1 Rate and further description of the evaluation criteria, the set compression ratio C described in this embodiment Rate and evaluation criteria are as follows:
[0119] Set the compression ratio C Rate The method is: normalize the elements of the nuclear tensor and the pattern matrix to 16bit; the normalization methods of the nuclear tensor and the pattern matrix are as follows:
[0120] The normalization process of the kernel tensor element G is:
[0121]
[0122] The normalization process of the mode matrix is:
[0123] u n =[u n ×10 4 ] (4)
[0124] Take the first 4 significant digits after the decimal point of each element to participate in the calculation, u n Represent pattern matrix A, B, C respectively, n=1,2,3; [] in both formulas means rounding;
[0125] After the data is normalized, it can be...
specific Embodiment approach 3
[0142] Specific implementation mode three: the following combination figure 1 Describe this embodiment. This embodiment is a further description of the method for complete decomposition using the tensor Tucker decomposition method in Embodiment 1. The method for complete decomposition using the tensor Tucker decomposition method described in this embodiment is:
[0143] Dimensionally decompose tensors into kernel tensors and orthogonal pattern matrices:
[0144]
[0145] in, is the original tensor, I×J×K dimension; is the decomposed nuclear tensor, P×Q×R dimension;
[0146] A, B, and C are orthogonal pattern matrices formed by eigenvectors arranged in columns, respectively, in I×P dimension, J×Q dimension, and K×R dimension.
[0147] The conditions for Tucker decomposition to be complete and uncompressed are: P=I, Q=J, R=K,
[0148] get
[0149] Among them: a p οb q οc r is the outer product of eigenvectors; × n Represents the modular multiplication of matrices...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com