CN102129064A - Universal satellite borne synthetic aperture radar (SAR) original data vector quantized codebook design algorithm - Google Patents

Universal satellite borne synthetic aperture radar (SAR) original data vector quantized codebook design algorithm Download PDF

Info

Publication number
CN102129064A
CN102129064A CN 201010034407 CN201010034407A CN102129064A CN 102129064 A CN102129064 A CN 102129064A CN 201010034407 CN201010034407 CN 201010034407 CN 201010034407 A CN201010034407 A CN 201010034407A CN 102129064 A CN102129064 A CN 102129064A
Authority
CN
China
Prior art keywords
cell
solution
codebook
vector
barycenter
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.)
Granted
Application number
CN 201010034407
Other languages
Chinese (zh)
Other versions
CN102129064B (en
Inventor
祁海明
邓云凯
华斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute of Electronics of CAS
Original Assignee
Institute of Electronics of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Institute of Electronics of CAS filed Critical Institute of Electronics of CAS
Priority to CN 201010034407 priority Critical patent/CN102129064B/en
Publication of CN102129064A publication Critical patent/CN102129064A/en
Application granted granted Critical
Publication of CN102129064B publication Critical patent/CN102129064B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The invention discloses a satellite borne synthetic aperture radar (SAR) original data vector quantized codebook design method. A distortion function in a multi-dimensional space is used as a cost function, and the codebook is solved according to the joint probability density function of input data. The method comprises the following steps of: 1, determining the joint probability density function of the input data according to the vector dimension; 2, performing cell division on a definitional domain of the data according to the nearest adjacent criteria, and 3, solving mass centers of corresponding cells according to a mass center solving formula, and performing cyclic iteration on the cell division and the mass center solution to solve the quantized codebook. The method has the advantages that: the vector quantized codebook with universality is designed aiming at the statistic characteristics of the satellite borne original data, meanwhile, offline design can be proved on the vector quantized codebook, and theoretical direction is provided for satellite borne practicability of vector quantization.

Description

Universality satellite-borne SAR raw data Codebook of Vector Quantization algorithm for design
Technical field
The present invention can be applicable to satellite-borne SAR compressing original data field, relates to a kind of universality satellite-borne SAR raw data Codebook of Vector Quantization algorithm for design particularly.
Background technology
The satellite-borne SAR compressing original data is to solve the effective way that data transfer bandwidth on mass data that satellite-borne SAR obtains and the star is difficult to matching problem.At present, although compression algorithm is of a great variety on the star, but the compromise performance complicacy hard-wired of considering compression algorithm with it, can practicality have only BAQ (Block Adaptive Quantization) and BFPQ (Block Floating PointQuantization).
Vector quantization is a kind of efficient data compress technique, is a kind of interrelated process of effectively utilizing between each component of vector of removing redundance.It can obtain gratifying compression result under the data compression ratio condition with higher.
The key issue of Vector Quantization algorithm is how to design high performance code book.There is a problem that must solve in the design of tradition SAR raw data Codebook of Vector Quantization: bad adaptability.Traditional algorithm is when realizing, all by specific training set data, carry out iterative computation, obtain best code book, for guaranteeing compression performance preferably, need will regenerate code book every one piece of data, and promptly need to generate code book, cause that the data compression system computation complexity increases greatly on the star according to the input online data.As not carrying out code book in line computation, only when input data statistics characteristic and training set statistical property correlativity are bigger, quantizing performance just can be relatively good, when code book and data mismatch to be compressed (correlativity is very little), can cause the decline of Vector Quantization algorithm compression performance, and then worsen image radiation resolution, and reduce picture quality, finally influence the use in actual applications of SAR raw data.
In sum, when the statistical property mismatch of Codebook of Vector Quantization and the packed data of wanting, the performance of Vector Quantization algorithm will obviously descend, and therefore, designing the Codebook of Vector Quantization with universality is the problem that must solve in the practicality.
Summary of the invention
The object of the present invention is to provide a kind of universality satellite-borne SAR raw data Codebook of Vector Quantization method for designing, to solve the problem of Codebook of Vector Quantization adaptivity difference.
For achieving the above object, satellite-borne SAR raw data Codebook of Vector Quantization method for designing provided by the invention is a cost function with the distortion function on the hyperspace, finds the solution code book according to the joint probability density function of input data; Its key step is as follows:
Step 1: the joint probability density function of determining the input data according to the vector dimension;
Step 2:, carry out cell according to the arest neighbors criterion and divide in the field of definition of data;
Step 3: according to the barycenter solution formula, find the solution the barycenter of corresponding cell, cell is divided to find the solution with barycenter carry out loop iteration and find the solution the quantification code book.
In the described Codebook of Vector Quantization method for designing, the cell in the step 2 is divided and is comprised:
Step 11: selected desired any one separate cell, find the solution all semispaces relevant with cell;
Step 12: the semispace of step 11 gained is got common factor obtain the cell division;
Step 13: repeating step 11 and step 12 obtain all cells and divide.
In the described Codebook of Vector Quantization method for designing, described semispace can be described as by the vector parameters and the scalar parameter of correspondence:
H ij={x:y ij·x+b ij≥0,j≠i}。
In the described Codebook of Vector Quantization method for designing, when finding the solution the cell barycenter in the step 3,, find the solution each dimension of barycenter according to cell barycenter analytical expression:
y ij = ∫ R i x j p ( x ) dx ∫ R i p ( x ) dx = 1 Δ P i ∫ R i x j p ( x ) dx , i = 1,2 , . . . N ; j = 1,2 , . . . k .
The invention has the beneficial effects as follows that at the statistical property of spaceborne raw data, design has obtained having the Codebook of Vector Quantization of universality, proved that simultaneously Codebook of Vector Quantization can carry out the off-line design, for the spaceborne practicability of vector quantization provides theoretical direction.
Description of drawings
Fig. 1-1 is conventional vector quantization encoding and decoding synoptic diagram;
Fig. 1-2 is vector quantization coding of the present invention and decoding synoptic diagram.
Fig. 2 finds the solution process flow diagram for the pervasive code book theoretical derivation of the present invention.
Fig. 3 divides synoptic diagram for the pervasive code book cell of the present invention.
Embodiment
The technical solution adopted in the present invention is: when code book generates, do not re-use iterative algorithm based on training data, but,, obtain having the code book of universality by analytic method at the joint probability density function of input vector from the joint probability density function of input vector.
Concrete operations comprise: when generating code book, do not re-use training dataset, and be to use the joint probability density function of input data; When dividing cell, no longer adopt clustering method, but the nearest criterion of calculating according to the vector code book at all training datas, the field of definition of data is divided into N cell (N is in the code book, the number of code vector); When finding the solution the cell barycenter, use the barycenter solution formula among the present invention; Theoretical derivation flow process according to the present invention is then calculated, and can obtain having the code book of universality.
The present invention is further described below in conjunction with drawings and Examples.
Fig. 1-1 is conventional vector quantization encoding and decoding synoptic diagram, and Fig. 1-2 is vector quantization coding of the present invention and decoding synoptic diagram.Wherein, frame of broken lines is different from the part of conventional process mode for the present invention, and the present invention carries out the design of universality code book according to the joint probability density function of input data.
Fig. 2 has provided the process flow diagram that pervasive code book is found the solution, and the use square error is estimated the distortion that characterizes between input vector x and the quantification output Q (x), that is:
D = E [ d ( x , Q ( x ) ) ] = Σ i = 1 N E [ d ( x , y i ) ] = Σ i = 1 N ∫ R i | x - y i | 2 p ( x ) dx - - - ( 1 )
X=[x wherein 1, x 2... x k] T, y i=[y I1, y I2... y Ik] T, R iBe i division of correspondence, p (x) is the k dimension priori joint probability density function of input vector x, and N is a code book length.Code book to be generated Y = [ y 1 T , y 2 T , . . . y N T ] T .
The design criteria of quantizer is exactly to make distortion minimum in (1), and quantizer Q (x) is only definite by given code book Y (one group of quantization vector) and the optimum division (quantization areas) relevant with Y fully.Therefore the design of quantizer is exactly to determine a pair set { r (R), Y} make formula (1) obtain minimum value, wherein
r ( R ) = { R 1 , R 2 , . . . R N ; R = ∪ i = 1 N R i }
When r (R) determines,, need to satisfy for making quantizing distortion D minimum:
▿ Y D = 0 N × k - - - ( 2 )
In the formula
Figure G2010100344078D00043
Be the gradient computing, Expression distortion function D is the matrix of N * k with respect to the gradient of real matrix Y, is called for short gradient matrix, and formula (2) can be rewritten as:
Figure G2010100344078D00045
Formula (1) (3) formula of bringing into is got:
∂ D ∂ y ij = - 2 ∫ R i ( x j - y ij ) p ( x ) dx = 0 , i = 1,2 , . . . N ; j = 1,2 , . . . k - - - ( 4 )
That is:
y ij = ∫ R i x j p ( x ) dx ∫ R i p ( x ) dx = 1 Δ P i ∫ R i x j p ( x ) dx , i = 1,2 , . . . N ; j = 1,2 , . . . k - - - ( 5 )
Formula (5) is called the barycenter equation of Codebook of Vector Quantization design.
For given code book Y, for making quantizing distortion D minimum, cell is divided need satisfy the arest neighbors condition, that is:
R i={ x:||x-y i|| 2≤ || x-y j|| 2, j ≠ i} and
Figure G2010100344078D00048
Formula (6) is equivalent to:
R i={x:y ij·x+b ij≥0,j≠i}(7)
Y in the formula Ij=y i-y j, The operation of " " expression inner product.
Can get by formula (7), for by vector parameters y IjAnd scalar parameter b Ij" partly " Space H of describing Ij:
H ij={x:y ij·x+b ij≥0,j≠i}(8)
Make L Ij={ x:y IjX+b Ij=0} is constraint H IjLineoid, as can be seen, any one cell all can be described by the common factor of limited semispace, and associated constraint lineoid has constituted the surface (or border) of cell.Therefore, the cell R of vector quantizer iCan be expressed as:
R i = ∩ i = 1 M H ij - - - ( 9 )
M equals cell R in the formula iConstraint lineoid quantity, surround R iThe border be L IjThus, can obtain the processing procedure that cell is divided, accompanying drawing 3 is under the situation of two dimension for vector, the example that cell is divided.
Fig. 3 divides flow process, given initial codebook with the cell that two-dimentional cell is divided into the whole code book of example explanation:
Y 0=[0.3,0.5; 1.7,2; 0.1 ,-0.1;-1.5.1.7;-1.6 ,-2; 0.1 ,-2.4; 2.1 ,-0.9;-0.3,0.4] wherein: y 1=[0.3,0.5], y 2=[1.7,2], y 3=[0.1 ,-0.1], y 4=[1.5,1.7], y 5=[1.6,1.2], y 6=[0.1 ,-2.4], y 7=[2.1 ,-0.9], y 8=[0.3,0.4], 8 coordinates in the difference corresponding diagram 3, the joint probability density function of input data is:
f ( x 1 , x 2 ) = 1 2 π exp { - 1 2 ( x 1 2 + x 2 2 ) }
In computing,, when calculating, 1/2 π of the constant term in the joint probability density function is ignored, do not influence code book result of calculation in order to reduce operand.
At first carry out cell and divide, with y according to formula (7) 1The cell R at place 1Be example, according to formula (9) as can be known, with all " Half Space H 1j, j=2,3,4,5,6,7,8 " get it after determining and occur simultaneously and divide for final cell.
Step 1: determine H 12y 12=y 1-y 2=[1.4 ,-1.5],
Figure G2010100344078D00053
H 12={ x:y 12X+b 12〉=0};
Step 2: the disposal route of repeating step 1 is tried to achieve Half Space H 13, H 14, H 15, H 16, H 17, H 18, the gained semispace is got common factor obtains cell division R 1, all cells divisions of vector quantization are protruding, and each summit of noting convex cell at last is used for representing R 1, R in this example 1Corresponding summit is { A1 (0.2067,1.6900); B 1 (0.0753,2.1130); C1 (1.7693,0.5320); D1 (1.2412 ,-0.14711); E1 (0.0324,0.2559) }.
Step 3: repeating step 1, step 2 are tried to achieve cell and are divided R 2, R 3..., R 8
Cell R 2Corresponding summit is respectively { A2 (0.0078,3.0000); B2 (3.0000,3.0000); C2 (3.0000,0.7017); D2 (1.7693,0.5320); E2 (0.0753,2.1130) }.
Cell R 3Corresponding summit is respectively { A3 (1.1512 ,-0.6910); B3 (0.0324,0.2559); C3 (1.2412 ,-0.1471); D3 (0.8000 ,-1.2500); E3 (0.5265 ,-1.2500) }.
Cell R 4Corresponding summit is respectively { A4 (3.0000 ,-0.1108); B4 (3.0000,3.0000); C4 (0.0078,3.0000); D4 (0.0753,2.1130); E4 (0.2067,1.6900); F4 (2.1815 ,-0.1329) }.
Cell R 5Corresponding summit is respectively { A5 (3.0000 ,-3.0000); B5 (3.0000 ,-0.1108); C5 (2.1815 ,-0.1329); D5 (1.1512 ,-0.6910); E5 (0.5265 ,-1.2500); F5 (0.9382 ,-3.0000) }.
Cell R 6Corresponding summit is respectively { A6 (0.9382 ,-3.0000); B6 (0.5265 ,-1.2500); C6 (0.8000 ,-1.2500); D6 (2.1125 ,-3.0000) }.
Cell R 7Corresponding summit is respectively { A7 (0.8000 ,-1.2500); B7 (1.2412 ,-0.1471); C7 (1.7693,0.5320); D7 (3.0000,0.7017); E7 (3.0000 ,-3.0000); F7 (2.1125-3.0000) }.
Cell R 8Corresponding summit is respectively { A8 (2.1815 ,-0.1329); B8 (0.2067,1.6900); C8 (0.0324,0.2559); D8 (1.1512 ,-0.6910) }.
Find the solution the barycenter operation: the barycenter of asking for each cell that obtains in the cell division according to formula (5); Trying to achieve barycenter is C 1=[0.5938,0.7081], C 2=[1.3077,1.5542], C 3=[0.1077 ,-0.5086], C 4=[1.2883,1.3121], C 5=[1.3993 ,-1.1937], C 6=[0.1908 ,-1.7577], C 7=[1.6123 ,-0.6539], C 8=[0.7351,0.3482].
Find the solution the distortion operation: use formula (1) calculated distortion: with initial codebook Y 0Bring formula (1) into and try to achieve D 0=4.3431, will find the solution barycenter and bring formula (1) into and try to achieve D 1=2.8617.
Explained the finding the solution and the calculating of quantizing distortion of division, cell barycenter of cell by example,, found the solution process flow diagram according to pervasive code book shown in Figure 2 and carry out loop iteration, can try to achieve code book with universality with above operation.
More than used embodiment, be not that the present invention is done any pro forma restriction, the related amendments that every foundation technical spirit of the present invention is carried out all still belongs in the present invention program's the scope.

Claims (4)

1. a satellite-borne SAR raw data Codebook of Vector Quantization method for designing is a cost function with the distortion function on the hyperspace, finds the solution code book according to the joint probability density function of input data; Its key step is as follows:
Step 1: the joint probability density function of determining the input data according to the vector dimension;
Step 2:, carry out cell according to the arest neighbors criterion and divide in the field of definition of data;
Step 3: according to the barycenter solution formula, find the solution the barycenter of corresponding cell, cell is divided to find the solution with barycenter carry out loop iteration and find the solution the quantification code book.
2. Codebook of Vector Quantization method for designing according to claim 1, wherein, the cell in the step 2 is divided and is comprised:
Step 11: selected desired any one separate cell, find the solution all semispaces relevant with cell;
Step 12: the semispace of step 11 gained is got common factor obtain the cell division;
Step 13: repeating step 11 and step 12 obtain all cells and divide.
3. Codebook of Vector Quantization method for designing according to claim 2, wherein, described semispace can be described as by the vector parameters and the scalar parameter of correspondence:
H ij={x:y ij·x+b ij≥0,j≠i}。
4. Codebook of Vector Quantization method for designing according to claim 1, wherein, when finding the solution the cell barycenter in the step 3,, find the solution each dimension of barycenter according to cell barycenter analytical expression:
y ij = ∫ R i x j p ( x ) dx ∫ R i p ( x ) dx = 1 Δ P i ∫ R i x j p ( x ) dx , i = 1,2 , . . . N ; j = 1,2 , . . . k .
CN 201010034407 2010-01-15 2010-01-15 Universal satellite borne synthetic aperture radar (SAR) original data vector quantized codebook design algorithm Active CN102129064B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010034407 CN102129064B (en) 2010-01-15 2010-01-15 Universal satellite borne synthetic aperture radar (SAR) original data vector quantized codebook design algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010034407 CN102129064B (en) 2010-01-15 2010-01-15 Universal satellite borne synthetic aperture radar (SAR) original data vector quantized codebook design algorithm

Publications (2)

Publication Number Publication Date
CN102129064A true CN102129064A (en) 2011-07-20
CN102129064B CN102129064B (en) 2013-01-02

Family

ID=44267216

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010034407 Active CN102129064B (en) 2010-01-15 2010-01-15 Universal satellite borne synthetic aperture radar (SAR) original data vector quantized codebook design algorithm

Country Status (1)

Country Link
CN (1) CN102129064B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102307372A (en) * 2011-08-26 2012-01-04 电信科学技术研究院 Lloyd-Max-quantizer-based data compression method and equipment

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE4026874C1 (en) * 1990-08-25 1992-04-30 Deutsche Forschungsanstalt Fuer Luft- Und Raumfahrt Ev, 5300 Bonn, De
CN101165510A (en) * 2006-10-18 2008-04-23 中国科学院电子学研究所 Spaceborne synthetic aperture radar variable digit BAQ compression system and method
CN101587189B (en) * 2009-06-10 2011-09-14 武汉大学 Texture elementary feature extraction method for synthetizing aperture radar images

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102307372A (en) * 2011-08-26 2012-01-04 电信科学技术研究院 Lloyd-Max-quantizer-based data compression method and equipment

Also Published As

Publication number Publication date
CN102129064B (en) 2013-01-02

Similar Documents

Publication Publication Date Title
CN102460513B (en) Method for encoding/decoding a 3D mesh model that comprises one or more components
CN111818346A (en) Image encoding method and apparatus, image decoding method and apparatus
CN110663048A (en) Execution method, execution device, learning method, learning device, and program for deep neural network
CN115713109A (en) Multi-head attention model compression method for image classification
Xu et al. Singular vector sparse reconstruction for image compression
CN102129064B (en) Universal satellite borne synthetic aperture radar (SAR) original data vector quantized codebook design algorithm
CN102129074B (en) Satellite SAR original data anti-saturation vector compression coding and decoding method
CN109474824A (en) Method for compressing image
CN102684703A (en) Efficient lossless compression method for digital elevation model data
CN106331719A (en) K-L transformation error space dividing based image data compression method
CN103985096A (en) Hyperspectral image regression prediction compression method based on off-line training
TWI376960B (en) Codebook generating method for image compression
JP6684229B2 (en) Precision and quantization method applicable to wavelet transform matrix
CN115147283A (en) Image reconstruction method, device, equipment and medium
CN113038134B (en) Picture processing method, intelligent terminal and storage medium
CN107888915A (en) A kind of perception compression method of combination dictionary learning and image block
Thepade et al. New clustering algorithm for Vector Quantization using Haar sequence
i Verdú et al. Reduced-complexity multi-rate remote sensing data compression with neural networks
CN106101731A (en) Lossless Image Compression Algorithm method and device
CN105850137B (en) Use the method for the matrix coder for representing static image or video to matrix, especially according to the wavelet series of image change and the wavelet transformation of each small wave scale difference quantizing factor
CN111897995A (en) Video feature extraction method and video quantization method applying same
JP4721072B2 (en) Polygon data compression and decompression system
CN114598874B (en) Video quantization coding and decoding method, device, equipment and storage medium
TWI771250B (en) Device and method for reducing data dimension, and operating method of device for converting data dimension
CN104320659A (en) Background modeling method, device and apparatus

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant