High-spectrum image segmentation method based on pixel space information
A hyperspectral image and pixel technology, applied in the field of image processing, can solve problems such as unsatisfactory effects, achieve the effect of reducing boundary points, increasing the amount of information, and achieving good results
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Publication Date
- 2010-03-10
- Estimated Expiration
- Not applicable · inactive patent
Smart Images
Figure 1 Figure 2 Figure 3
Abstract
Description
Technical field
[0001] The invention belongs to the technical field of image processing, in particular to an image segmentation method, which can analyze complex landforms, find interesting targets from similar landforms and roughly delimit the boundaries between the landforms. Background technique
[0002] Image segmentation refers to processing natural images or SAR images to separate different targets in the image. Hyperspectral image data is generated by hyperspectral remote sensing and has a high dimensionality. Each dimension of its data is a grayscale image. The traditional image segmentation method cannot be used to process it as a whole. It is too much work to process each dimension of the data and then combine it, and the effect is difficult to guarantee. Some foreign scholars have proposed the use of support vector machines to segment hyperspectral images, and the effect is also good. However, the support vector machine is a supervised learning method. It is necessar...
Examples
Embodiment Construction
[0021] Reference figure 1 The specific implementation steps of the present invention are as follows:
[0022] Step 1: Solve the Euclidean distance between the pixel feature information of the hyperspectral image data and the pixel spatial information, and normalize it.
[0023] 1.1) Select the hyperspectral image image 3 In the area shown, the data of this area contains 200 bands, and each band is a gray-scale image. Therefore, these data can be regarded as 200 gray-scale feature matrices, and each gray-scale feature matrix is divided into band order Decompose according to the columns, and then connect them in order to form a large column vector, thereby obtaining 200 column vectors;
[0024] 1.2) Combine these 200 column vectors to form a pixel feature matrix data, each row of the feature matrix data represents the pixel feature vector of a pixel, and calculate the Euclidean distance of each two rows of pixel feature vectors to obtain the pixel feature Euclidean Distance matrix ...