Hyperspectral data dimensionality reduction method based on tensor distance patch alignment

A data dimensionality reduction and hyperspectral technology, applied in the field of hyperspectral remote sensing image processing, can solve the problems of data internal structure damage, high dimensionality, dimensionality disaster, etc.

Active Publication Date: 2013-10-02
CHINA UNIV OF MINING & TECH
View PDF4 Cites 32 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Purpose of the present invention: To solve the problems and deficiencies in the above-mentioned prior art, a hyperspectral data dimensionality reduction method based on tensor distance patch calibration is proposed to solve the problem that the transformation of three-d

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Hyperspectral data dimensionality reduction method based on tensor distance patch alignment
  • Hyperspectral data dimensionality reduction method based on tensor distance patch alignment
  • Hyperspectral data dimensionality reduction method based on tensor distance patch alignment

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0077] Example 1: The dimensionality reduction method is aimed at the tensor characteristics of hyperspectral data. First, the “window area” is used to convert the hyperspectral data into a tensor form through the central pixel and other pixels around it. , Maintain the spatial information of each pixel; second, introduce the tensor distance to construct a high-quality tensor neighbor graph containing discriminative information; third, obtain the global optimal spectrum according to the patch calibration framework extended to the tensor space- Spatial information; fourth, the solution of the quantum space is obtained by using the alternating least squares algorithm; finally, the category of each sample is determined according to the tensor nearest neighbor method;

[0078] Specific steps are as follows:

[0079] Step 1. Select the hyperspectral data to be analyzed, and convert the hyperspectral data into tensor form according to the window area;

[0080] Step 2. Calculate the tenso...

Example Embodiment

[0126] Example 2: Through the AVIRIS92AV3C hyperspectral data experiment, the TDPA proposed by the present invention is compared with the existing MDA and MPCA tensor dimensionality reduction algorithms. For the fairness of comparison, it is coordinated when seeking the nearest neighbor distance of the high-quality tensor neighbor graph The parameter β=1. And according to the tensor nearest neighbor method to distinguish the type of each test sample, each experiment is done 20 times, and the average value is taken. Prove the superiority of TDPA.

[0127] Combine figure 1 . The figure shows the key steps of using the tensor distance patch calibration method to reduce the dimensionality of hyperspectral data. It mainly includes seven steps: First: Calculate the tensor distance d between training samples TD ; Second: construct a high-quality tensor neighbor graph G according to the tensor distance; third: select χ according to the high-quality tensor neighbor graph i Patch sample ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A hyperspectral data dimensionality reduction method based on tensor distance patch alignment belongs to a hyperspectral remote sensing image processing method. The hyperspectral data dimensionality reduction method aims at the tensor characteristic of the hyperspectral data. Firstly, the hyperspectral data is converted into a tensor form through a window area and maintains space information of every pixel; secondly, the tensor distance is introduced to construct a high-quality tensor distance neighbor graph containing determination information; thirdly, a globally optimal spectrum-space information is acquired according to a patch alignment framework expanded to tensor space; fourthly, solutions of tensor sub-space are obtained by using a iteration optimization method of the alternating least square algorithm; and lastly, categories of samples are discriminated on the basis of the tensor nearest neighbor method. The hyperspectral data dimensionality reduction method has the advantages that relatively high overall classification accuracy and the Kappa coefficient through effective utilization of the space area characteristic and the spectrum characteristic of the hyperspectral data, and the acquired classification effect picture is very clear and smooth with rich details; the dimensionality reduction framework can process 2-order data, 3-order data and data in higher orders.

Description

technical field [0001] The invention relates to a hyperspectral remote sensing image processing method, in particular to a hyperspectral data dimensionality reduction method based on tensor distance patch calibration. Background technique [0002] Hyperspectral image sensors are capable of collecting images containing hundreds of spectral bands per pixel. The data obtained by the hyperspectral image sensor is three-dimensional data, including two-dimensional spatial features (width and height) and one-dimensional spectral band information. For the analysis and processing of hyperspectral data, previous researchers have proved that the redundancy of inter-spectral correlation is very high, so the spectral bands in the data structure can be reduced without loss of important information for subsequent processing. Many bands. In order to reduce the redundancy between features, keep important discriminative information for subsequent classification processing and reduce computi...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06K9/62
Inventor 王雪松高阳程玉虎
Owner CHINA UNIV OF MINING & TECH
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