Supercharge Your Innovation With Domain-Expert AI Agents!

Hyperspectral image classification method based on node pyramid

A technology of hyperspectral image and classification method, applied in the field of hyperspectral image classification, can solve the problem of easy misclassification of scattered points, etc., and achieve the effect of improving accuracy

Pending Publication Date: 2022-05-13
CHINA ACAD OF AEROSPACE AERODYNAMICS
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The technical problem solved by the present invention is: to overcome the deficiencies of the prior art, to propose a hyperspectral image classification method based on node pyramid, to classify based on layered graph nodes, to obtain hierarchical classification results, combined with multi-level classification results, To maximize the accuracy of image classification, solve the problem of easy misclassification of scattered points in hyperspectral images distributed in strips, and the problem of time-consuming training caused by too many nodes in graph network-based classification

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 image classification method based on node pyramid
  • Hyperspectral image classification method based on node pyramid

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] The following steps specify how to optimize the classification accuracy based on node pyramids for semi-supervised classification of graph nodes, such as Figure 1 As shown:

[0024] Hyperparameter: N: The number of layers of the graph node pyramid

[0025] K: The number of neighbors per node

[0026] Step 1: Obtain the graph node layer with the largest number of nodes, each node in the layer is the pixel point to be classified and the marked pixel, the connection relationship of the node is determined by the K neighbor in the feature space, the node feature is a spectral curve; for a given hyperspectral image, the background pixel is excluded, and each of the remaining foreground pixels, including labeled and unlabeled, is a node in the graph, and the node feature is the spectral curve of the corresponding pixel of the node. The node connection relationship is determined by the K neighbor of all its nodes in the feature space, that is, if the K neighbor of node i contains ...

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

The invention relates to a hyperspectral image classification method based on a node pyramid, and the method comprises the steps: taking each foreground pixel in a hyperspectral image as a node in a graph structure, taking a spectral feature as a node feature, and constructing a connection relation between nodes according to the similarity of the nodes, thereby obtaining a bottommost layer graph structure; clustering the nodes by using a classic hierarchical clustering method to obtain N graph structures with different fine granularities; performing node classification on the graph structures of the N hierarchies by adopting a classic graph convolutional neural network; and performing voting correction on a high-fine-granularity result based on a low-fine-granularity classification result. According to the method, the problem that scattered points in a hyperspectral image distributed in a strip mode are prone to being wrongly classified is solved, and the problem of training time consumption caused by too many nodes in classification based on a graph network is solved.

Description

Technical field [0001] The present invention relates to a hyperspectral image classification method based on a node pyramid, belonging to the field of hyperspectral image classification technology. Background [0002] Diagrams are an intuitive, abstract mathematical representation of objects and their interrelationships. Data with interrelationships—Graph structure data is ubiquitous in many fields and is widely used. With the emergence of large amounts of data, traditional graph algorithms have great limitations in solving some deep-seated important problems, such as node classification and link prediction. The graph neural network model considers the scale, heterogeneity and deep topological information of the input data, etc., and shows convincing reliable performance in mining deep and effective topological information, extracting key complex characteristics of data and realizing rapid processing of massive data, such as predicting the characteristics of chemical molecules, ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06V10/762G06V10/764G06V10/80G06V10/82G06K9/62G06N3/04
CPCG06N3/045G06F18/2321G06F18/23G06F18/24143G06F18/24G06F18/254
Inventor 马弢张赢冯峰
Owner CHINA ACAD OF AEROSPACE AERODYNAMICS
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More