Iterative hyperspectral image lossless compression method based on low-rank representation

A technology of hyperspectral image, low rank representation, applied in the field of image processing, can solve the problems of affecting compression results, inaccuracy, unstable k-means clustering results, etc., to achieve the effect of high compression ratio and enhanced stability

Active Publication Date: 2022-01-11
XIDIAN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In summary, in the current lossless compression methods for hyperspectral images, there are problems: the spatial-spectral correlation of hyperspectral images is not fully utilized, the clustering results based on k-means are unstable and inaccurate, and the clustering results are not fully utilized. The relationship between the three modules of , prediction and entropy coding, these problems directly affect the compression results

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
  • Iterative hyperspectral image lossless compression method based on low-rank representation
  • Iterative hyperspectral image lossless compression method based on low-rank representation
  • Iterative hyperspectral image lossless compression method based on low-rank representation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0026] After decades of development, the amount of data acquired by imaging spectrometers has expanded rapidly with the continuous improvement of spatial resolution and spectral resolution, and its huge amount of data has caused a huge burden on the storage and transmission of hyperspectral images. Seriously restricting the application prospects of hyperspectral images. Therefore, in order to improve storage and transmission efficiency and reduce costs, the present invention proposes an iterative hyperspectral image lossless compression method based on low-rank representation.

[0027] The present invention is an iterative hyperspectral image lossless compression method based on low-rank representation, see figure 1 , including the following steps:

[0028] (1) Define a spectral angle similarity measurement method: the spectral angle similarity measurement method of the present invention combines spectral angle and Euclidean distance to measure the similarity of hyperspectral...

Embodiment 2

[0039] The iterative hyperspectral image lossless compression method based on low-rank representation is the same as embodiment 1, the spectral angle similarity measurement method described in step (1), and the spectral angle similarity measurement method combines spectral angle and Euclidean distance to similar hyperspectral images The similarity measure formula of the similarity measure is expressed as follows:

[0040]

[0041] in, Indicates the spectral line x and the spectral line The similarity of , the spectral line x is any spectral line participating in the similarity measurement, and the spectral line is another spectral line that needs to be compared with the spectral line x, Indicates the spectral line x and the spectral line The spectral angular distance between Indicates the spectral line x and the spectral line Euclidean distance between, N A Indicates the spectral line x and the spectral line The maximum spectral angular distance between, N L...

Embodiment 3

[0044] The iterative hyperspectral image lossless compression method based on low-rank representation is the same as embodiment 1-2, the rough clustering initialization of the original image described in step (2), including the following steps:

[0045] (2a) Select seed points: randomly select K seed points in the input hyperspectral image, and K is selected as 400 in this example.

[0046] (2b) Calculate the search range of rough clustering initialization seed points: input the expected number of superpixels K, assuming that the number of spectral lines of a hyperspectral image is N, then the search range calculation formula of a seed point is:

[0047]

[0048] L is the search step size, and the unit is the number of spectral lines. Since the calculation result of L is not necessarily an integer, the calculation result is an approximate value. In this example, N is 79099776 spectral lines, and the obtained L is 197749 spectral lines.

[0049] (2c) Assign a rough clusteri...

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 discloses an iterative hyperspectral image lossless compression method based on low-rank representation, which solves the problems that the traditional compression method ignores the correlation of image space, the clustering result is unstable, and there is no connection between modules. The implementation steps include: defining the spectral angle similarity measurement method; roughly clustering the original image; solving the rough clustering block coefficient matrix by low-rank representation; re-clustering the coefficient matrix to obtain the initial clustering result; iteratively optimizing the initial clustering result to obtain The prediction coefficient and prediction residual of the final clustering block; entropy coding is then performed to obtain the code stream file to be transmitted; after entropy decoding, the code stream file is decompressed at the decoding end to obtain a lossless compressed hyperspectral image. The invention defines a spectral angle correlation measurement method to increase the utilization of spatial correlation; the combination of low-rank representation and subspace clustering increases the stability of clustering results; and iteratively optimizes and correlates each module to increase the result compression ratio. Used in the field of image compression.

Description

technical field [0001] The invention belongs to the technical field of image processing, and relates to image lossless compression, in particular to an iterative hyperspectral image lossless compression method based on low-rank representation, which is used for hyperspectral image compression. Background technique [0002] Hyperspectral images are obtained by reflecting electromagnetic waves of different bands on the same ground object, and the number of bands in the visible to near-infrared spectrum range can reach hundreds. The nanoscale spectral resolution of hyperspectral images makes hyperspectral images rich in spectral information, which can provide precise details of ground features, and has a wide range of applications in environmental monitoring, military investigation, resource management, mineral exploration, and vegetation research. After decades of development, the amount of data acquired by imaging spectrometers has expanded rapidly with the continuous improve...

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 Patents(China)
IPC IPC(8): H04N19/42G06K9/62H04N19/103H04N19/91
CPCH04N19/42H04N19/91H04N19/103G06F18/23213
Inventor 冯志玺赵世慧杨淑媛刘志徐光颖孟会晓
Owner XIDIAN UNIV
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