Hyperspectral image eigen decomposition method based on digital surface model assistance
A digital surface model and hyperspectral image technology, applied in the field of hyperspectral image eigendecomposition, can solve the problem of low precision of hyperspectral image eigendecomposition, achieve the effect of eliminating spectral information degradation and improving accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0061] DETAILED DESCRIPTION a: below with figure 1 The present embodiment described embodiment, the present embodiment the hyperspectral image eigen decomposition model based on the digital auxiliary surface, comprising:
[0062] Sl, and a digital input hyperspectral image surface model data, geometrical components obtained by calculation;
[0063] S2, prior partial matrix obtained by calculation;
[0064] S3, obtained by calculation prior nonlocal matrix;
[0065] S4, the geometrical components, local and nonlocal priori matrix prior eigen decomposition matrix, and outputs a high spectral reflectance of ambient light.
specific Embodiment approach 2
[0066] DETAILED Embodiment 2: This embodiment of the first embodiment will be further described, particularly the S1 method of geometrical components obtained by calculation comprises:
[0067] Hyperspectral image input
[0068] Elevation data of the input digital surface model
[0069] Where H k = [H k (Λ 1 ), H k (Λ 2 ), ..., h k (Λ d )]] T , K = 1,2, ..., u represents the spectral characteristics of each pixel, k = 1,2, ..., u denotes an index of each pixel, λ represents the wavelength, d represents the number of bands, u represents a high the number of pixels of the spectral image, z 1 ,z 2 ,…,z u Corresponding to each pixel represents the elevation, Representation domain;
[0070] Computing for each pixel a normal, normal characteristics is obtained:
[0071] in, Represents normals x, y, z spatial coordinate axes projection;
[0072] Geometrical components obtained by calculation J: J = [J 1 , J 2 , ..., J u ] ú ;
[0073] in,
[0074]
[0075] c 1 , C 2 , C 3 , C 4 , ...
specific Embodiment approach 3
[0078] DETAILED Embodiment 3: Embodiment of the present embodiment of the second embodiment will be further described, the specific method for obtaining a partial matrix prior S2 of the computing comprises:
[0079] Traversing each pixel of the index k = 1,2, ..., u, the establishment of the dictionary D k = [H 1 , ..., h k-1 H k+1 , ..., h u I d ];
[0080] Among them, I d It represents a d-dimensional matrix;
[0081] H is calculated according to the formula k In the dictionary D k The sparse representation coefficient α:
[0082] MIN α ‖Α‖ 1 subject to h k = D k [alpha];
[0083] Local each element of matrix W priori W kj Assignment obtained by the following formula:
[0084]
[0085] W kj K represents an element row j-th column of W;
[0086] alpha j It represents the j-th column of the sparse representation coefficient, α j-1 It represents a coefficient represented by the sparse column j-1.
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