CN110781974A - Dimension reduction method and system for hyperspectral image - Google Patents
Dimension reduction method and system for hyperspectral image Download PDFInfo
- Publication number
- CN110781974A CN110781974A CN201911050720.8A CN201911050720A CN110781974A CN 110781974 A CN110781974 A CN 110781974A CN 201911050720 A CN201911050720 A CN 201911050720A CN 110781974 A CN110781974 A CN 110781974A
- Authority
- CN
- China
- Prior art keywords
- matrix
- weight coefficient
- calculation module
- hyperspectral image
- nearest
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 239000011159 matrix material Substances 0.000 claims abstract description 93
- 238000004364 calculation method Methods 0.000 claims abstract description 58
- 239000013598 vector Substances 0.000 claims abstract description 53
- 238000012545 processing Methods 0.000 abstract description 8
- 230000000694 effects Effects 0.000 abstract description 5
- 238000000605 extraction Methods 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009022 nonlinear effect Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000003595 spectral effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/22—Matching criteria, e.g. proximity measures
Landscapes
- Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Theoretical Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Artificial Intelligence (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a dimension reduction method and a dimension reduction system for a hyperspectral image, wherein the method comprises the following steps: according to an input hyperspectral image sample set D ═ { x ═ x
1,x
2,...x
mH, k nearest neighbor number and d dimensionality reduced to, the sum x is calculated
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik) (ii) a Computing a local covariance matrix Z of a hyperspectral image sample set D
i(ii) a According to the local covariance matrix Z
iCalculating its weight coefficient vector W
i(ii) a According to the weight coefficient vector W
iForming a weight coefficient matrix W, and obtaining a matrix according to W calculation: m ═ I (I-W)
T(ii) a D +1 eigenvalues in front of the matrix M and eigenvectors { y corresponding to the d +1 eigenvalues are calculated according to the matrix M
1,y
2,...y
d+1And forming a matrix which is the matrix D' ═ y of the output low-dimensional hyperspectral image sample set according to the second eigenvector to the (D + 1) th eigenvector
2,y
3,...y
d+1}. The system comprises: nearest neighbor calculation module and local covariance matrixThe device comprises a calculation module, a weight coefficient vector calculation module, a matrix M calculation module and a low-order hyperspectral image sample set matrix calculation module. The method can reduce the dimension of the hyperspectral image through smaller operation complexity, and has ideal processing effect.
Description
Technical Field
The invention relates to the technical field of hyperspectral image processing, in particular to a dimension reduction method and system for a hyperspectral image.
Background
The dimension reduction processing of the hyperspectral image is an important research subject in the field of hyperspectral image processing. As is known, a hyperspectral image is a three-dimensional image data cube which has abundant spectral information and spatial information and can better analyze subtle differences among different ground objects. However, the original hyperspectral image contains hundreds of wave bands, the data volume is large, and a large amount of redundant information is contained, which brings great difficulty and influence to subsequent target anomaly detection and other work.
At present, the conventional processing method is wave band selection and feature extraction aiming at the problem of dimension reduction processing of hyperspectral images. The correlation among the wave bands selected by the wave band selection method is weak, the information content in the image can be well reserved, but compared with the characteristic extraction method, the energy carried by the processed image with the original signal is less.
The existing algorithm also realizes the dimension reduction of the hyperspectral image by finding the idea of the global optimal solution of all samples, and when the data volume is large or the sample dimension is high, the calculated amount is very large and the operation time is long; many pieces of information with certain correlation in the original hyperspectral image are recombined into a group of new mutually-independent information to replace the original information, but the obtained dimensionality reduction result cannot reflect the hidden nonlinear property between sample points, and the estimation of the number of the reserved principal components is still difficult.
Disclosure of Invention
The invention provides a dimension reduction method and system for a hyperspectral image, aiming at the problems in the prior art, the dimension reduction can be performed on the hyperspectral image through smaller operation complexity, and the processing effect is ideal.
In order to solve the technical problems, the invention is realized by the following technical scheme:
the invention provides a dimension reduction method of a hyperspectral image, which comprises the following steps:
s11: according to an input hyperspectral image sample set D ═ { x ═ x
1,x
2,...x
mH, k nearest neighbor number and d dimensionality reduced to, the sum x is calculated
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik);
S12: computing a local covariance matrix Z of a hyperspectral image sample set D
i;
S13: according to the local covariance matrix Z calculated in the S12
iCalculating its weight coefficient vector W
i;
S14: the weight coefficient vector W calculated according to the S13
iForming a weight coefficient matrix W, and obtaining a matrix according to W calculation: m ═ I (I-W)
T;
S15: d +1 eigenvalues in front of the matrix M and eigenvectors { y corresponding to the d +1 eigenvalues are calculated according to the matrix M
1,y
2,...y
d+1And forming a matrix which is the matrix D' ═ y of the output low-dimensional hyperspectral image sample set according to the second eigenvector to the (D + 1) th eigenvector
2,y
3,...y
d+1}。
Preferably, the sum x in S11 is calculated
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik) The method specifically comprises the following steps: distance in Europe as a measure, calculating the sum x
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik)。
Preferably, the local covariance matrix Z in S12
iThe formula of (1) is: z
i=(x
i-x
j)(x
i-x
j)
T。
Preferably, the method for calculating the weight coefficient vector in S13 is: solving a weight coefficient W of an m multiplied by k dimension corresponding to the minimized loss function, taking the positions of the W which are not in the neighborhood positions as 0, and expanding the W to the m multiplied by m dimension; the formula of the minimization loss function is:
preferably, the weight coefficient vector W in S13
iThe formula of (1) is:
wherein 1 is
kRepresenting a k-dimensional all-1 vector.
The invention also provides a dimension reduction system of the hyperspectral image, which comprises the following components: the system comprises a nearest neighbor calculation module, a local covariance matrix calculation module, a weight coefficient vector calculation module, a matrix M calculation module and a low-order hyperspectral image sample set matrix calculation module; wherein,
the nearest neighbor calculation module is used for calculating a nearest neighbor according to an input hyperspectral image sample set D ═ x
1,x
2,...x
mH, k nearest neighbor number and d dimensionality reduced to, the sum x is calculated
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik);
The local covariance matrix calculation module is used for calculating a local covariance matrix Z of a hyperspectral image sample set D
i;
The weight coefficient vector calculation module is used for calculating a local covariance matrix Z according to the local covariance matrix calculated by the local covariance matrix calculation module
iCalculating its weight coefficient vector W
i;
The matrix M calculation module is used for calculating a weight coefficient vector W according to the weight coefficient vector calculated by the weight coefficient vector calculation module
iForming a weight coefficient matrix W, and obtaining a matrix according to W calculation: m ═ I (I-W)
T;
The low-level hyperspectral image sample set matrix calculation module is used for calculating d +1 characteristic values in front of the matrix M and characteristic vectors { y) corresponding to the d +1 characteristic values according to the matrix M
1,y
2,...y
d+1And forming a matrix which is the matrix D' ═ y of the output low-dimensional hyperspectral image sample set according to the second eigenvector to the (D + 1) th eigenvector
2,y
3,...y
d+1}。
Preferably, the sum of computations in the nearest neighbor computation module x
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik) The method specifically comprises the following steps: distance in Europe as a measure, calculating the sum x
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik)。
Preferably, the local covariance matrix Z in the local covariance matrix calculation module
iThe formula of (1) is: z
i=(x
i-x
j)(x
i-x
j)
T。
Preferably, the method for calculating the weight coefficient vector in the weight coefficient vector calculation module is: solving a weight coefficient W of an m multiplied by k dimension corresponding to the minimized loss function, taking the positions of the W which are not in the neighborhood positions as 0, and expanding the W to the m multiplied by m dimension; the formula of the minimization loss function is:
preferably, the weight coefficient vector W in the weight coefficient vector calculation module
iThe formula of (1) is:
wherein 1 is
kRepresenting a k-dimensional all-1 vector.
Compared with the prior art, the invention has the following advantages:
(1) the dimension reduction method and system of the hyperspectral image provided by the invention calculate the first d +1 eigenvalues of the matrix M and eigenvectors { y corresponding to the d +1 eigenvalues
1,y
2,...y
d+1Forming a matrix from the second eigenvector to the (d + 1) th eigenvector, reducing the dimension of the hyperspectral image through smaller operation complexity, and achieving ideal processing effect;
(2) the dimension reduction method and system of the hyperspectral image provided by the invention calculate the local covariance matrix Z
iAnd its weight coefficient vector W
iThe mean square error loss function is minimized, so that a good linear relation can be kept after dimension reduction.
Of course, it is not necessary for any product in which the invention is practiced to achieve all of the above-described advantages at the same time.
Drawings
Embodiments of the invention are further described below with reference to the accompanying drawings:
FIG. 1 is a flow chart of a dimension reduction method for hyperspectral images according to an embodiment of the invention;
FIG. 2 is a band 1 image after the dimension reduction of the airport area in the AVIRIS hyperspectral image according to the embodiment of the invention;
FIG. 3 is a band 5 image after the dimension reduction of the airport area in the AVIRIS hyperspectral image according to the embodiment of the invention;
FIG. 4 is a band 10 image after the dimension reduction of the airport area in the AVIRIS hyperspectral image according to the embodiment of the invention;
FIG. 5 is a band 1 image after dimensionality reduction of an Urban region in a HYDICE hyperspectral image according to an embodiment of the invention;
FIG. 6 is a band 5 image after dimensionality reduction of an Urban region in a HYDICE hyperspectral image according to an embodiment of the invention;
fig. 7 is a band 10 image after dimensionality reduction of an Urban region in a hyper-spectral image according to an embodiment of the present invention.
Detailed Description
The following examples are given for the detailed implementation and specific operation of the present invention, but the scope of the present invention is not limited to the following examples.
Fig. 1 is a schematic flow chart of a dimension reduction method for a hyperspectral image according to an embodiment of the invention.
Referring to fig. 1, the dimension reduction method for the hyperspectral image of the embodiment includes the following steps:
s11: according to an input hyperspectral image sample set D ═ { x ═ x
1,x
2,...x
mH, k nearest neighbor number and d dimensionality reduced to, the sum x is calculated
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik);
S12: computing a local covariance matrix Z of a hyperspectral image sample set D
i;
S13: according to the local covariance matrix Z calculated in S12
iComputingObtain its weight coefficient vector W
i;
S14: the weight coefficient vector W calculated from S13
iForming a weight coefficient matrix W, and obtaining a matrix according to W calculation: m ═ I (I-W)
T;
S15: d +1 eigenvalues in front of the matrix M and eigenvectors { y corresponding to the d +1 eigenvalues are calculated according to the matrix M
1,y
2,...y
d+1And forming a matrix which is the matrix D' ═ y of the output low-dimensional hyperspectral image sample set according to the second eigenvector to the (D + 1) th eigenvector
2,y
3,...y
d+1}。
In one embodiment, S11 specifically includes: inputting a hyperspectral image sample set D ═ x
1,x
2,...x
mCalculating the sum x by using Euclidean distance as a measure, wherein the nearest neighbor number k and the dimensionality d obtained by dimensionality reduction are from i to 1 to i to m
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik)。
In one embodiment, S12 specifically includes: computing a local covariance matrix Z of a hyperspectral image sample set D
i=(x
i-x
j)(x
i-x
j)
T。
In one embodiment, S13 specifically includes: after dimensionality reduction, it is desirable that the linear relationship be maintained in the lower dimension. Let n-dimensional sample set { x
1,x
2,...x
mThe low-dimensional corresponding projection in dimension d is y
1,y
2,...y
mAre expected to maintain a linear relationship, i.e., the corresponding mean square error loss function is expected to be minimal, minimizing the loss function J (y) as
The formula is almost the same as the high-dimensional loss function, but in the high-dimensional formula, the high-dimensional data is known, and the aim is to solve the weight coefficient W of the m × k dimension corresponding to the minimized loss function, take the positions of W which are not in the neighborhood positions to be 0, and expand W to the m × m dimension.
In one embodiment, the weight coefficient vector W in S13
iThe expression of (a) is:
wherein 1 is
kRepresenting a k-dimensional all-1 vector.
The invention also provides a dimension reduction system of a hyperspectral image, which is used for realizing the dimension reduction method in the embodiment and comprises the following steps: the device comprises a nearest neighbor calculation module, a local covariance matrix calculation module, a weight coefficient vector calculation module, a matrix M calculation module and a low-order hyperspectral image sample set matrix calculation module. The nearest neighbor calculation module is used for calculating a nearest neighbor according to an input hyperspectral image sample set D ═ x
1,x
2,...x
mH, k nearest neighbor number and d dimensionality reduced to, the sum x is calculated
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik). The local covariance matrix calculation module is used for calculating a local covariance matrix Z of the hyperspectral image sample set D
i. The weight coefficient vector calculation module is used for calculating a local covariance matrix Z according to the local covariance matrix
iCalculating its weight coefficient vector W
i. The matrix M calculation module is used for calculating a weight coefficient vector W according to the weight coefficient vector calculated by the weight coefficient vector calculation module
iForming a weight coefficient matrix W, and obtaining a matrix according to W calculation: m ═ I (I-W)
T. The low-order hyperspectral image sample set matrix calculation module is used for calculating d +1 characteristic values in front of the matrix M and characteristic vectors { y corresponding to the d +1 characteristic values according to the matrix M
1,y
2,...y
d+1And forming a matrix which is the matrix D' ═ y of the output low-dimensional hyperspectral image sample set according to the second eigenvector to the (D + 1) th eigenvector
2,y
3,...y
d+1}。
In one embodiment, the sum of computations in the nearest neighbor computation module x
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik) The method specifically comprises the following steps: distance in Europe as a measure, calculating the sum x
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik)。
In one embodiment, the local covariance matrix Z in the local covariance matrix calculation module
iThe formula of (1) is: z
i=(x
i-x
j)(x
i-x
j)
T。
In one embodiment, the method for calculating the weight coefficient vector in the weight coefficient vector calculation module includes: solving a weight coefficient W of an m multiplied by k dimension corresponding to the minimized loss function, taking the positions of the W which are not in the neighborhood positions as 0, and expanding the W to the m multiplied by m dimension; the formula of the minimization loss function is:
in one embodiment, the weight coefficient vector W in the weight coefficient vector calculation module
iThe formula of (1) is:
wherein 1 is
kRepresenting a k-dimensional all-1 vector.
A simulation experiment is performed on the dimension reduction method of the above embodiment, and 6 images shown in fig. 2 to 7 are taken as an example, the input nearest neighbor number k set in the experiment is 20, the dimension d obtained by dimension reduction is 10, fig. 2 to 4 are respectively images of a band 1, a band 5 and a band 10 after the dimension reduction of an airport area in an AVRIS hyperspectral image, and fig. 5 to 7 are respectively images of a band 1, a band 5 and a band 10 after the dimension reduction of an Urban area in a HYDICE hyperspectral image.
As can be seen from the effect graph, the abnormal objects in the image processed by the method are obvious and can be well distinguished from the background, and the main objects such as the road and the like in the background are still clear and visible, so that the method has a good processing effect.
The embodiments were chosen and described in order to best explain the principles of the invention and the practical application, and not to limit the invention. Any modifications and variations within the scope of the description, which may occur to those skilled in the art, are intended to be within the scope of the invention.
Claims (10)
1. A dimension reduction method for a hyperspectral image is characterized by comprising the following steps:
s11: according to an input hyperspectral image sample set D ═ { x ═ x
1,x
2,…x
mH, k nearest neighbor number and d dimensionality reduced to, the sum x is calculated
iNearest k nearest neighbors (x)
i1,x
i2,…x
ik);
S12: computing a local covariance matrix Z of a hyperspectral image sample set D
i;
S13: according to the local covariance matrix Z calculated in the S12
iCalculating its weight coefficient vector W
i;
S14: the weight coefficient vector W calculated according to the S13
iForming a weight coefficient matrix W, and obtaining a matrix according to W calculation: m ═ I (I-W)
T;
S15: d +1 eigenvalues in front of the matrix M and eigenvectors { y corresponding to the d +1 eigenvalues are calculated according to the matrix M
1,y
2,…y
d+1And forming a matrix which is the matrix D' ═ y of the output low-dimensional hyperspectral image sample set according to the second eigenvector to the (D + 1) th eigenvector
2,y
3,…y
d+1}。
2. The dimension reduction method for hyperspectral images according to claim 1, wherein the sum x of the calculations in S11
iNearest k nearest neighbors (x)
i1,x
i2,…x
ik) The method specifically comprises the following steps: distance in Europe as a measure, calculating the sum x
iNearest k nearest neighbors (x)
i1,x
i2,…x
ik)。
3. The dimension reduction method for hyperspectral images according to claim 1, wherein the local covariance matrix Z in S12
iThe formula of (1) is: z
i=(x
i-x
j)(x
i-x
j)
T。
4. The dimension reduction method for the hyperspectral image according to claim 1, wherein the weight coefficient vector in S13 is calculated by: solving a weight coefficient W of an m multiplied by k dimension corresponding to the minimized loss function, taking the positions of the W which are not in the neighborhood positions as 0, and expanding the W to the m multiplied by m dimension; the formula of the minimization loss function is:
6. A dimension reduction system for hyperspectral images, comprising: the system comprises a nearest neighbor calculation module, a local covariance matrix calculation module, a weight coefficient vector calculation module, a matrix M calculation module and a low-order hyperspectral image sample set matrix calculation module; wherein,
the nearest neighbor calculation module is used for calculating a nearest neighbor according to an input hyperspectral image sample set D ═ x
1,x
2,…x
mH, k nearest neighbor number and d dimensionality reduced to, the sum x is calculated
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik);
The local covariance matrix calculation module is used for calculating a local covariance matrix Z of a hyperspectral image sample set D
i;
The weight coefficient vector calculation module is used for calculating a local covariance matrix Z according to the local covariance matrix calculated by the local covariance matrix calculation module
iCalculating its weight coefficient vector W
i;
The matrix M calculation module is used for calculating a vector according to the weight coefficientThe weight coefficient vector W calculated by the calculation module
iForming a weight coefficient matrix W, and obtaining a matrix according to W calculation: m ═ I (I-W)
T;
The low-level hyperspectral image sample set matrix calculation module is used for calculating d +1 characteristic values in front of the matrix M and characteristic vectors { y) corresponding to the d +1 characteristic values according to the matrix M
1,y
2,...y
d+1And forming a matrix which is the matrix D' ═ y of the output low-dimensional hyperspectral image sample set according to the second eigenvector to the (D + 1) th eigenvector
2,y
3,...y
d+1}。
7. The dimension reduction system for hyperspectral images according to claim 6, wherein the sum of computations in the nearest neighbor computation module x
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik) The method specifically comprises the following steps: distance in Europe as a measure, calculating the sum x
iNearest k nearest neighbors (x)
i1,x
i2,...x
ik)。
8. The dimension reduction system for hyperspectral images according to claim 6, wherein the local covariance matrix Z in the local covariance matrix calculation module
iThe formula of (1) is: z
i=(x
i-x
j)(x
i-x
j)
T。
9. The dimension reduction system for hyperspectral images according to claim 6 is characterized in that the calculation method of the weight coefficient vector in the weight coefficient vector calculation module is as follows: solving a weight coefficient W of an m multiplied by k dimension corresponding to the minimized loss function, taking the positions of the W which are not in the neighborhood positions as 0, and expanding the W to the m multiplied by m dimension; the formula of the minimization loss function is:
10. the dimensionality reduction system of the hyperspectral image of claim 9,wherein the weight coefficient vector W in the weight coefficient vector calculation module
iThe formula of (1) is:
wherein 1 is
kRepresenting a k-dimensional all-1 vector.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201911050720.8A CN110781974A (en) | 2019-10-31 | 2019-10-31 | Dimension reduction method and system for hyperspectral image |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201911050720.8A CN110781974A (en) | 2019-10-31 | 2019-10-31 | Dimension reduction method and system for hyperspectral image |
Publications (1)
Publication Number | Publication Date |
---|---|
CN110781974A true CN110781974A (en) | 2020-02-11 |
Family
ID=69388141
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201911050720.8A Pending CN110781974A (en) | 2019-10-31 | 2019-10-31 | Dimension reduction method and system for hyperspectral image |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110781974A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115457286A (en) * | 2022-10-10 | 2022-12-09 | 无锡学院 | Hyperspectral image sequence dimension reduction method based on global and local spectrum weighting |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104008383A (en) * | 2014-06-24 | 2014-08-27 | 哈尔滨工业大学 | Hyperspectral image characteristic extraction algorithm based on manifold learning linearization |
US9269162B1 (en) * | 2014-08-25 | 2016-02-23 | Raytheon Company | Rapid anomaly detection (RAND) |
CN107527326A (en) * | 2017-08-17 | 2017-12-29 | 安徽农业大学 | A kind of wheat scab diagnostic method based on high light spectrum image-forming |
CN109492593A (en) * | 2018-11-16 | 2019-03-19 | 西安电子科技大学 | Hyperspectral image classification method based on principal component analysis network and space coordinate |
-
2019
- 2019-10-31 CN CN201911050720.8A patent/CN110781974A/en active Pending
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104008383A (en) * | 2014-06-24 | 2014-08-27 | 哈尔滨工业大学 | Hyperspectral image characteristic extraction algorithm based on manifold learning linearization |
US9269162B1 (en) * | 2014-08-25 | 2016-02-23 | Raytheon Company | Rapid anomaly detection (RAND) |
CN107527326A (en) * | 2017-08-17 | 2017-12-29 | 安徽农业大学 | A kind of wheat scab diagnostic method based on high light spectrum image-forming |
CN109492593A (en) * | 2018-11-16 | 2019-03-19 | 西安电子科技大学 | Hyperspectral image classification method based on principal component analysis network and space coordinate |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115457286A (en) * | 2022-10-10 | 2022-12-09 | 无锡学院 | Hyperspectral image sequence dimension reduction method based on global and local spectrum weighting |
CN115457286B (en) * | 2022-10-10 | 2024-09-24 | 无锡学院 | Hyperspectral image sequence dimension reduction method based on global and local spectrum weighting |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Yuan et al. | Tensor ring decomposition with rank minimization on latent space: An efficient approach for tensor completion | |
Alhayani et al. | Hyper spectral image classification using dimensionality reduction techniques | |
Agarwal et al. | Efficient hierarchical-PCA dimension reduction for hyperspectral imagery | |
Lixin et al. | Segmented minimum noise fraction transformation for efficient feature extraction of hyperspectral images | |
CN105160623B (en) | Unsupervised high-spectral data dimension reduction method based on chunking low-rank tensor model | |
CN105046276A (en) | Hyperspectral image band selection method based on low-rank expression | |
CN111368691B (en) | Unsupervised hyperspectral remote sensing image space spectrum feature extraction method | |
Shi et al. | Sensor-independent hyperspectral target detection with semisupervised domain adaptive few-shot learning | |
CN108182449A (en) | A kind of hyperspectral image classification method | |
CN111783865B (en) | Hyperspectral classification method based on space spectrum neighborhood embedding and optimal similarity graph | |
CN109190511A (en) | Hyperspectral classification method based on part Yu structural constraint low-rank representation | |
Tang et al. | Hyperspectral Band Selection via Spatial-Spectral Weighted Region-wise Multiple Graph Fusion-Based Spectral Clustering. | |
Harikiran | Hyperspectral image classification using support vector machines | |
Zarachoff et al. | 2D multi-band PCA and its application for ear recognition | |
Deng et al. | t-Linear tensor subspace learning for robust feature extraction of hyperspectral images | |
He et al. | Anomaly detection for hyperspectral imagery via tensor low-rank approximation with multiple subspace learning | |
CN113446998B (en) | Hyperspectral target detection data-based dynamic unmixing method | |
Wu et al. | Approximate computing for onboard anomaly detection from hyperspectral images | |
CN110781974A (en) | Dimension reduction method and system for hyperspectral image | |
Li et al. | Multivariate image texture by multivariate variogram for multispectral image classification | |
Singh et al. | A Pre-processing framework for spectral classification of hyperspectral images | |
CN117456263A (en) | Hyperspectral image classification method based on double-branch multi-scale converter network | |
Yang et al. | An improved EM algorithm for remote sensing classification | |
Kumar et al. | Band selection for hyperspectral images based on self-tuning spectral clustering | |
CN104408476A (en) | Deep sparse main component analysis-based polarimetric SAR image classification method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200211 |
|
RJ01 | Rejection of invention patent application after publication |