CN100421465C - Method of compression and recompression image data for image acquiring apparatus - Google Patents
Method of compression and recompression image data for image acquiring apparatus Download PDFInfo
- Publication number
- CN100421465C CN100421465C CNB2005100701905A CN200510070190A CN100421465C CN 100421465 C CN100421465 C CN 100421465C CN B2005100701905 A CNB2005100701905 A CN B2005100701905A CN 200510070190 A CN200510070190 A CN 200510070190A CN 100421465 C CN100421465 C CN 100421465C
- Authority
- CN
- China
- Prior art keywords
- pixel
- parameter
- group
- frequency
- differential coding
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000006835 compression Effects 0.000 title claims description 24
- 238000007906 compression Methods 0.000 title claims description 24
- 238000006243 chemical reaction Methods 0.000 claims description 38
- 230000009467 reduction Effects 0.000 claims description 30
- 238000013139 quantization Methods 0.000 abstract 2
- 230000001105 regulatory effect Effects 0.000 abstract 2
- 238000006073 displacement reaction Methods 0.000 description 33
- 230000006872 improvement Effects 0.000 description 25
- 238000007792 addition Methods 0.000 description 20
- 238000003860 storage Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 7
- 239000003086 colorant Substances 0.000 description 3
- 230000000295 complement effect Effects 0.000 description 3
- 239000012141 concentrate Substances 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000008676 import Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000011002 quantification Methods 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000001143 conditioned effect Effects 0.000 description 1
- 230000006837 decompression Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000005012 migration Effects 0.000 description 1
- 238000013508 migration Methods 0.000 description 1
- 238000011017 operating method Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
Images
Landscapes
- Compression Of Band Width Or Redundancy In Fax (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The present invention provides a method for compressing and decompressing image data for an image shooting device, which comprises following steps: generating a differential code group; making MHT (Modified HadamardTransform) on the differential code group to generate low-frequency parameters and a plurality of high-frequency parameters; regulating the low-frequency parameters and regulating the high-frequency parameters according to a quantization index; restoring the low-frequency parameters and restoring the high-frequency parameters according to the quantization index; making IMHT (Inverse Modified Hadamard Transform) on the low-frequency and the high-frequency parameters to restore the differential code group.
Description
Technical field
The invention provides a kind of data transfer device, refer to a kind of data transfer device of compression and recompression image data for image acquiring apparatus especially.
Background technology
At the back segment chip of video camera, required data in the time of can comprising a very big buffer usually and be used for temporary computing are to finish the required computing of 2-D data.But in general chip, the shared area ratio of this buffer is often excessive, so that the burden on having increased many production costs and having used; If under the image quality acceptable prerequisite of finding of naked eye, utilize the size of the compress technique reduction buffer of image, then area of chip being reduced significantly too makes chip more convenient in the use, production cost is more minimizing also.In order to the skill of the compress technique that realizes image adaptive differential pulse coding method (Adaptive difference Pulse Coding) and differential pulse coding method (Difference Pulse Coding Method) are arranged usually in existing technology, the employed principle of this type of skill is to utilize the pixel of adjacent image to have the to a certain degree characteristic of relevance, the reduction of the data volume that will compress.The embodiment of this kind method can't be difficult to realize, but under some special environment, for example when edge of image, neighbor herein changes comparatively violent, make the relevance of neighbor significantly weaken, and the also therefore rapid drawdown of the quality of this type of embodiment compressed image.
Existing technology be utilize discrete cosine transform (Discrete Cosine Transform DCT) is transformed into pixel above the frequency field from the time field, and with the conversion pixel be divided into high frequency and low frequency part in view of the above.Be generally two-dimensional transformations when carrying out discrete cosine transform, its number of once carrying out the point of being taken a sample is eight to take advantage of eight totally six ten four.In these 64 parameters, except first parameter is low frequency part, all the other 63 pixels of all representing HFS.Utilize most energy in all pixels all to concentrate on the characteristic of low frequency part, existing technology can be taked the part of low frequency the compress mode of low distortion in view of the above, and the part of high frequency is taked the compress mode of high distortion, last utilize again reverse discrete cosine transform (Inverse Discrete Cosine Transform, IDCT) again with pixel above frequency field is transformed into the time field.But because it is too much to carry out the employed figure place of discrete cosine transform, cause the bottleneck on the usefulness and on the storage area, it is necessary therefore using figure place to use the less time field and the conversion method of frequency field.
Summary of the invention
Therefore main purpose of the present invention is to provide a kind of data transfer device, to overcome the problem in the above-mentioned prior art.
The present invention is the method that discloses a kind of compression and recompression image data for image acquiring apparatus, it comprises according to the pixel parameter of the green pixel in one group of image pixel and the pixel parameter generating one differential coding group of another colored pixels in this group image pixel, hadamard conversion (MHT after this differential coding group improved, Modified Hadamard Transform) to produce parameter and a plurality of parameter corresponding to high frequency corresponding to low frequency, adjust this parameter corresponding to low frequency, adjust this a plurality of parameters according to a quantizating index corresponding to high frequency, reduction is corresponding to the parameter of low frequency, reduces these a plurality of parameters corresponding to high frequency according to this quantizating index; With as-reduced corresponding to low frequency parameter and the hadamard conversion (IMHT, Inverse Modified HadamardTransform) of as-reduced a plurality of parameter after oppositely improveing corresponding to high frequency to reduce this differential coding group.
Embodiments of the invention are to compress and decompressed image data with the conversion of the hadamard after the improvement and the combination of channel differential coding (channeldifference coding), make embodiments of the invention can not be subjected in the prior art because the factor of neighbor relevance makes the relatively poor situation of image quality influence, and its image quality that is improved.
Description of drawings
The 1st figure is the schematic diagram that the present invention carries out the channel differential coding system of channel differential coding.
The 2nd figure is the schematic diagram of the hadamard conversion equipment after the improvement.
The 3rd figure is the form of being inquired about when determining the computing of quantizating index numerical value.
The 4th figure is that a size is the schematic diagram of 48 compression storage element.
The 5th figure is the schematic diagram of the hadamard conversion equipment after the reverse improvement.
The 6th figure is the schematic diagram of a channel differential decoding system.
The 7th figure is the flow chart of the encoding and decoding method of green pixel of the present invention group.
The 8th figure is the flow chart of the encoding and decoding method of differential coding of the present invention group.
[main element label declaration]
Channel differential coding system 100
The input node 101,103,105,107 of non-green pixel
The input node 109,111,113,115,609,611,613,615 of green pixel
The output node 117,119,121,123,617,619,621,623 of pixel
Subtracter 125
Multiplexer 127,627
Hadamard conversion equipment 200 after the improvement
The output node 209,509 of low frequency pixel
The output node 211,213,215,511,513,515 of high-frequency pixels
Adder 217,219,221,223,225,227,229,231,521,523,525,527,533,535,537,539,625
Displacement logical block to the right 233,235,237,239,541,543,545,547
The low frequency coefficient 401 of second group of green pixel group
The low frequency coefficient 403 of second group of differential coding group
The high frequency coefficient set 407 of second group of green pixel group
The high frequency coefficient set 409 of second group of differential coding group
Hadamard conversion equipment 500 after oppositely improveing
To left dislocation logical block 517,519
Channel differential decoding system 600
The input node 601,603,605,607 of differential coding pixel
Step 701,705,707,709,711,713,715,717,719,721,723,725,727,801,803,807,809,811,813,815,817,819,821,823,825,827,829,831
Embodiment
See also the 1st figure, the 1st figure is the schematic diagram that the present invention carries out the channel differential coding system 100 of channel differential coding.Channel differential coding system 100 can produce a differential coding group in the mode of subtracting each other with a green pixel group and a non-green pixel group, also a green pixel group directly can be exported.Channel differential coding system 100 includes four subtracters 125, four multiplexers 127, the input node 101,103,105,107 of four non-green pixel parameters, the input node 109,111,113,115 of four green pixel parameters, and four output nodes 117,119,121,123.Each subtracter 125 is to be connected in the input node of non-green pixel parameter and the input node of green pixel parameter, is used for this non-green pixel parameter and this green pixel parameter are subtracted each other, therefore four subtracter 125 exportable differential coding groups.Channel differential coding system 100 can produce the group of two kinds of patterns under the control of multiplexer 127, a kind of is green pixel group, and another is a differential coding group.In the 1st figure, each multiplexer 127 all has two inputs, produces any group with the decision of the enabled state of these two inputs, and the enabled state that four multiplexers 127 are imported is consistent.According to the 1st figure diagram, when an end that is connected with four subtracters 125 when four multiplexers 127 was enabled state, output node 117,119,121,123 was understood and is exported a differential coding group.When four multiplexers, 127 direct ends that are connected with four input nodes 109,111,113,115 were enabled state, output node 117,119,121,123 can output one green pixel group.
See also the 2nd figure, the 2nd figure is the schematic diagram of the hadamard conversion equipment 200 after the improvement.Hadamard conversion equipment 200 after the improvement is the hadamard conversions that are used for carrying out after the improvement, converts to frequency domain with the green pixel group or the differential coding group that will belong to time domain.Hadamard conversion equipment 200 after the improvement comprises eight adders 217,219,221,223,225,227,229,231, four displacement logical blocks to the right (SR) 233,235,237,239, an output node 209 that is used for output low frequency pixel parameter, and three output nodes 211,213,215 that are used for exporting the high-frequency pixels parameter.Four input nodes of the hadamard conversion equipment 200 after the improvement are connected in the output node 117,119,121,123 of channel differential coding system 100.When carrying out the hadamard conversion after improveing, in green pixel group or four inputs of the differential coding group input nodes 117,119,121,123.After the computing through the hadamard arithmetic unit 200 after the improvement, the hadamard arithmetic unit 200 after the improvement can be in pixel parameter and a plurality of pixel parameter corresponding to high frequency corresponding to low frequency of four output nodes, 209,211,213,215 output green pixel groups or differential coding group; Output node 209 is output as a low frequency pixel parameter, and output node 211,213,215 is output as three high-frequency pixels parameters.Adder 217 is coupled in input node 117 and 119, is used for input node 117 and the 119 pixel parameter additions of importing; Adder 219 is coupled in input node 117 and 119, is used for importing the negative value addition of pixel parameter with the pixel parameter of input node 119 inputs of node 117 inputs; Adder 221 is coupled in input node 121 and 123, is used for input node 121 and the 123 pixel parameter additions of importing; Adder 223 is coupled in input node 121 and 123, is used for importing the negative value addition of pixel parameter with the pixel parameter of input node 123 inputs of node 121 inputs.Displacement logical block to the right 233 is connected in the output of adder 217, is used for output pixel parameter displacement to the right one particular number of bits with adder 217 input; Displacement logical block to the right 235 is connected in the output of adder 221, is used for output pixel parameter displacement to the right one particular number of bits with adder 221 input.Adder 225 is connected in the output of displacement logical block to the right 233 and 235, is used for displacement logical block to the right 233 and the 235 output pixel parameter additions of importing; Adder 227 is coupled in the output of adder 219 and 223, is used for the negative value addition of pixel parameter that the pixel parameter of adder 219 input and adder 223 are imported; Adder 229 is coupled in the output of displacement logical block to the right 233 and 235, is used for negative value addition with output pixel parameter with the output pixel parameter of 235 inputs of displacement logical block to the right of displacement logical block to the right 233 input; Adder 231 is connected in the output of adder 219 and 223, is used for adder 219 and the 223 output pixel parameter additions of importing.Displacement logical block to the right 237 is connected in the output of adder 225, is used for output pixel parameter displacement to the right one particular number of bits with adder 225 input; Displacement logical block to the right 239 is connected in the output of adder 229, is used for output pixel parameter displacement to the right one particular number of bits with adder 229 input.
See also the 3rd figure, the 3rd figure is the form of being inquired about when determining the computing of quantizating index numerical value.Its function mode is as follows:
(a) will belong to three of green pixel group corresponding to the pixel parameter of high frequency and three pixel parameters that belong to differential coding group corresponding to high frequency be converted on the occasion of after, with three in the green pixel group pixel parameters corresponding to high frequency be considered as first (Ac0 (green)), second (Ac1 (green)), with the 3rd (Ac2 (green)) high-frequency parameter, and with three high-frequency parameters of differential coding group be considered as the 4th (Ac0 (non-green)), the 5th (Ac0 (non-green)), with the 6th (Ac0 (non-green)) high-frequency parameter; The conversion high-frequency parameter be on the occasion of operating procedure will be in the 7th figure step 707 detailed description;
(b) from the value of quantizating index Qindex be zero row, with first, second, third, fourth, the 5th, do the operation of displacement to the right in regular turn according to the indicated figure place in six hurdles behind the quantizating index hurdle of the 3rd figure with the 6th high-frequency parameter;
(c) confirm whether first high-frequency parameter does not surpass six positions, and confirm whether all the other high-frequency parameters do not surpass five positions, if six high frequency coefficients all satisfy the figure place of above appointment, then write down the numerical value of the quantizating index of this row representative, and the numerical value that will quantize pointer is with binary representation, with three bit positions of quantizating index representative in this binary numeral of 48 in the step 813 of the step 711 of inserting the 7th figure and the 8th figure;
(d) in step (c), if have more than one high-frequency parameter not satisfy the condition of the figure place that desire is confirmed in the step (c) in six high-frequency parameters, meaning promptly surpasses the specified figure place of step (c), then the present quantizating index numerical value of process migration representative with inquiry adds one row, and repeat in regular turn execution in step (b), step (c), with step (d), till the value that a quantizating index satisfies the conditioned disjunction quantizating index of step (c) is six.Wherein because the value of quantizating index was added to 6 o'clock, do not need to repeat again in regular turn execution in step (b), step (c), with step (d), be six row so in the 3rd figure, do not list the value of representing quantizating index.
According to the quantizating index numerical value that obtains at the 3rd figure, with the move to right figure place of this quantizating index numerical value representative of the first, second, third, fourth, the 5th, the 6th high frequency coefficient.
For all low-frequency parameters in the green pixel group that will belong to frequency domain are adjusted into seven unitss that are fit to specified format, adjust all low-frequency parameter dc_coef in the green pixel group with following formula:
dc_coef＝(dc_coef+1)＞＞1； (3)
This formula than prior art easily the place be do not need through two complement codes conversion (2`s complement) be convertible negative value on the occasion of, do not need extra adder support.Formula (3) is to be used for supporting adjusting in the step 709 each step corresponding to the parameter of low frequency.
For all low-frequency parameters in the differential coding group that will belong to frequency domain are adjusted into seven unitss that are fit to specified format, adjust all low-frequency parameter dc_coef in the differential coding group with following formula:
dc_coef＝(dc_coef+2)＞＞2； (4)
Formula (4) is to be used for supporting adjusting in the step 811 each step corresponding to the parameter of low frequency.
See also the 4th figure, the 4th figure is that a size is the schematic diagram of 48 compression storage element 400.Compression storage element 400 be used for this binary numeral of 48 in the step 813 of step 711 and the 8th figure of icon the 7th figure form and each parameter and quantize the collocation method of pointer.Compression storage element 400 includes the low-frequency parameter 401 that belongs to green pixel group, the low-frequency parameter 403 that belongs to differential coding group, quantizating index 405, belong to the high-frequency parameter set 407 of green pixel group and belong to the high-frequency parameter set 409 of differential coding group.Low- frequency parameter 401 and 403 respectively occupies seven positions in compression storage element 400, and respectively according to supporting the formula (4) of step 811 to adjust the numerical value of low-frequency parameter 401 and low-frequency parameter 403 among the formula (3) of supporting step 709 among the 7th figure and the 8th figure; In compression storage element 400, low-frequency parameter 403 is connected on after the low-frequency parameter 401.Quantizing pointer 405 is according to the value of high-frequency parameter set 407 with high-frequency parameter set 409, decides the numerical value of quantizating index 405 with the inquiry mode of the 3rd figure, and it occupies three positions altogether in compression storage element 400, is attempted by after the low-frequency parameter 403.High-frequency parameter set 407 includes first, second, third high-frequency parameter of the 3rd figure, wherein first high-frequency parameter occupies six positions, the second and the 3rd high-frequency parameter respectively occupies five positions, therefore high-frequency parameter set 407 occupies 16 positions altogether in compression storage element 400, is attempted by after the quantizating index 405.High-frequency parameter set 409 includes the 4th, the 5th, the 6th mentioned high-frequency parameter of the 3rd figure, wherein the 4th, the 5th, the 6th high-frequency parameter respectively occupies five positions, therefore high-frequency parameter set 409 occupies 15 positions altogether in compression storage element 400, is attempted by after the high-frequency parameter set 407.
To compress after storage element 400 assigns, wherein stored position group is temporary to buffer.The process of compression is so far finished.
In decompression process begins, with previous stored position group by taking out in the buffer.
In order to belong to the low-frequency parameter reduction of green pixel group, the previous stored low-frequency parameter that belongs to green pixel group that is contained in a group in buffer is taken out, and come all low-frequency parameters in the vat green color pixel group with the inverse function of formula (3).
In order to belong to the low-frequency parameter reduction of differential coding group, the previous stored low-frequency parameter that belongs to differential coding group that is contained in a group in buffer is taken out, and reduce all low-frequency parameters in the differential coding group with the inverse function of formula (4).
In order to belong to the high-frequency parameter reduction of green pixel group, the previous stored high-frequency parameter that belongs to green pixel group that is contained in a group in buffer is taken out, 48 the position group that is read from buffer again takes out the position that representative quantizes pointer value, and the green pixel group that will before have been moved to right according to the numerical value of this quantizating index first, second, the 3rd, the 4th, the 5th, the move to left figure place of this quantizating index representative numerical value of the 6th high-frequency parameter, the HFS reduction that meaning is about to be moved to right is to obtain the parameter corresponding to high frequency of all reduction in the green pixel group.
In order to belong to the high-frequency parameter reduction of differential coding group, the previous stored high-frequency parameter that belongs to differential coding group that is contained in a group in buffer is taken out, 48 the position group that is read from buffer takes out the position that representative quantizes pointer value, and the differential coding group that will before have been moved to right according to the numerical value of this quantizating index first, second, the 3rd, the 4th, the 5th, the move to left figure place of this quantizating index representative numerical value of the 6th high-frequency parameter, the HFS reduction that meaning is about to be moved to right is to obtain the parameter corresponding to high frequency of all reduction in the differential coding group.
See also the 5th figure, the 5th figure is the schematic diagram of the hadamard conversion equipment 500 after the reverse improvement.Oppositely the hadamard conversion equipment 500 after the improvement is the hadamard conversions that are used for carrying out after the reverse improvement, the green pixel group that belongs to time domain or the differential coding group that are exported with the output node 117,119,121,123 of going back original channel differential coding system 100.Reverse hadamard device 500 after the improvement comprises two to left dislocation logical block (SL) 517,519, six displacement logical blocks to the right (SR) 529,531,541,545,547,549, with eight adders 521,523,525,527,533,535,537,539, one is used for importing the input node 501 of low frequency pixel parameter, three 503,505,507, four output nodes 509,511,513,515 of input node that are used for importing the high-frequency pixels parameter.Oppositely hadamard conversion equipment 500 and the hadamard conversion equipment 200 after the improvement shown in the 2nd figure after the improvement is similar, be used in input node 501,503,505,507 inputs one green pixel group that is reduced or differential coding group, to obtain the differential coding group that a green pixel group or that belongs to the reduction of time domain belongs to the reduction of time domain at output node 509,511,513,515.Be connected in input node 501 to left dislocation logical block 517, be used for and import the pixel parameter of node 501 to left dislocation one particular number of bits; Be connected in input node 505 to left dislocation logical block 519, be used for and import the pixel parameter of node 505 to left dislocation one particular number of bits.Adder 521 is connected in the output and input node 503 to left dislocation logical block 517, is used for output pixel parameter and the pixel parameter addition of importing node 503 inputs to 517 inputs of left dislocation logical block; Adder 523 is connected in the output and input node 507 to left dislocation logical block 519, is used for output pixel parameter and the pixel parameter addition of importing node 507 inputs to 519 inputs of left dislocation logical block; Adder 525 is coupled in the output and input node 503 to left dislocation logical block 517, and being used for will be to the negative value addition of left dislocation logical block 517 output pixel parameter of importing and the pixel parameter of importing node 503 inputs; Adder 527 is coupled in to the output of left dislocation logical block 519 and input node 507, and being used for will be to the negative value of the output pixel parameter of left dislocation logical block 519 inputs and the pixel parameter addition of input node 507 inputs.Displacement logical block to the right 529 is connected in the output of adder 523, is used for output pixel parameter displacement to the right one particular number of bits with adder 523 input; Displacement logical block to the right 531 is connected in the output of adder 527, is used for output pixel parameter displacement to the right one particular number of bits with adder 527 input.Adder 533 is connected in the output of adder 521 and the output of displacement logical block to the right 529, is used for the output pixel parameter of adder 521 inputs and the output pixel parameter addition of 529 inputs of displacement logical block to the right; Adder 535 is coupled in the output of adder 521 and the output of displacement logical block to the right 529, is used for negative value addition with output pixel parameter with the output pixel parameter of 529 inputs of displacement logical block to the right of adder 521 inputs; Adder 537 is connected in the output of adder 525 and the output of displacement logical block to the right 531, is used for the output pixel parameter of adder 525 inputs and the output pixel parameter addition of 531 inputs of displacement logical block to the right; Adder 539 is coupled in the output of adder 525 and the output of displacement logical block to the right 531, is used for negative value addition with output pixel parameter with the output pixel parameter of 531 inputs of displacement logical block to the right of adder 525 inputs.Displacement logical block to the right 541,543,545,547 is connected in the output of corresponding adder 533,535,537,539 separately, is used for separately output pixel parameter displacement to the right one particular number of bits with adder 533,535,537,539 inputs.
See also the 6th figure, the 6th figure is the schematic diagram of a channel differential decoding system 600.The differential coding group that channel differential decoding system 600 can belong to a green pixel group and that belongs to the reduction of time domain the reduction of time domain produces the non-green pixel group of a reduction in the mode of addition, also a green pixel group that belongs to the reduction of time domain directly can be exported.Channel differential decoding system 600 include input node 609,611,613,615 that four adders 625, four multiplexers 627, four 601,603,605,607, four of input nodes that are used for importing the pixel parameter that belongs to differential coding group be used for importing the pixel parameter that belongs to green pixel group, with four output nodes 617,619,621,623.The input pixel parameter of input node 601,603,605,607 is following output of pattern of handling differential coding group by the output node 509,511,513,515 of the 5th figure.The input pixel parameter of input node 609,611,613,615 is following output of pattern of handling green pixel group by the output node 509,511,513,515 of the 5th figure.Each adder 625 all is connected with the input node of a differential coding group and the input node of a green pixel group, is used for the pixel parameter of a differential coding group and the pixel parameter addition of a green pixel group.Each multiplexer 627 all is connected with the output of an adder and the input node of a green pixel group, with deciding the green pixel group that produces a non-green pixel group of reducing or directly export the reduction of an input; Each multiplexer 627 all produces the wherein a kind of of two kinds of outputs with the decision of its enabled state, and the enabled state that four multiplexers 627 are imported is consistent.When an end that is connected in four adders 625 when four multiplexers 627 is enabled state, output node 617,619,621, and 623 can one group of reduction of output non-green pixel group.When ends that directly are connected with four input nodes 609,611,613,615 when four multiplexers 627 are enabled state, output node 617,619,621, and 623 can directly export a green pixel group of reducing.
See also the 7th figure, the 7th figure is the flow chart of the encoding and decoding method of green pixel of the present invention group.Wherein there is the encoding and decoding method of part steps and differential coding group to overlap or support mutually.
Step 701: the pixel of all raw image datas is divided into two kinds of groups of green pixel and non-green pixel, and the number of each group pixel is all four.
Step 705: green pixel group is transformed on the frequency domain to produce a green pixel group that belongs to frequency domain from time domain with the hadamard conversion after the improvement, and the conversion of the hadamard among the present invention after the improvement is once imported four pixel parameters and is done conversion, and meaning is promptly once imported one group of pixel parameter and done conversion.The method that in existing technology the pixel parameter is transformed into frequency domain by time domain is often to be discrete cosine transform (DCT, Discrete Cosine Transform), but the hadamard after the improvement that the required figure place of its low frequency part is used than the present invention is converted to many.Arbitrary group of green pixel group comprises four pixel parameters, and one of them is the pixel parameter that belongs to low frequency, and other three for belonging to the pixel parameter of high frequency.
Step 707: the numerical value of quantizating index is to be decided by all contained high-frequency parameters of green pixel group that belongs to frequency domain and the differential coding group that belongs to frequency domain, and the quantification pointer comprises three positions.Before all high-frequency parameters contained to green pixel group and differential coding group are adjusted with the quantizating index of gained, must all high-frequency parameter ac that green pixel group and differential coding group is contained be converted on the occasion of; The formula of conversion is as follows:
if(positive)ac＝{ac＜＜1，1’b0}； (1)
else ac＝{～ac＜＜1，1’b1}； (2)
This formula unlike the prior art be do not need through two complement codes conversions be convertible negative value on the occasion of, do not need extra adder.Next determine quantizating index in the mode of tabling look-up, will belong to three high-frequency parameters and the figure place that belongs to three these quantizating index representative numerical value of high-frequency parameter displacement to the right of differential coding group of green pixel group again, then all high-frequency parameter adjustment finish; Wherein this mode of tabling look-up will illustrate in the 3rd figure of the present invention.
Step 711: because the view data before the compression is with 64 binary number value representation, and the view data after the compression is with 48 binary number value representation, therefore in the view data after compression, low-frequency parameter that this binary numeral of 48 must comprise the green pixel group that belongs to frequency domain and three high-frequency parameters, belong to frequency domain differential coding group second group low-frequency parameter and three high-frequency parameters, reach a quantizating index.In the form of this binary numeral of 48, each parameter will describe in detail in the 4th figure of the present invention with the collocation method that quantizes pointer, represent the shared figure place of each group in this form of explanation earlier herein.Represent in this form green pixel group and differential coding group low-frequency parameter each therefore represent that with seven positions still 14 need of excess-three are distributed to quantizating index, three high-frequency parameters belonging to green pixel group distribute with three high-frequency parameters that belong to differential coding group; Wherein the numerical value of quantizating index is to be decided by totally six high-frequency parameters of representing green pixel group and differential coding group, and the quantification pointer comprises three positions; In step 707, determine the numerical value of quantizating index in the mode of tabling look-up, therefore in step 707 in view of the above quantizating index will belong to three high-frequency parameters and the figure place that belongs to three these quantizating index representative numerical value of high-frequency parameter displacement to the right of differential coding group of green pixel group, and this purpose that moves to right action is to fill up left all positions in this form, so represents the figure place of the parameter of all groups to be determined in these 48.
Step 723: the position of the low-frequency parameter of all green pixel groups that belong to frequency domain is represented in taking-up in 48 the position group that is read from buffer, and with the inverse function of formula (3) all low-frequency parameters in the green pixel group is reduced to obtain the parameter corresponding to low frequency of all reduction in the green pixel group.
Step 725: in belonging to the green pixel group of frequency domain, step 721 gained changed back time domain to obtain the green pixel group that belong to time domain corresponding to the hadamard conversion (IMHT, Inverse Modified Hadamard Transform) after with reverse improvement of all parameters of low frequency from frequency domain corresponding to all parameters of high frequency and step 723 gained.This green pixel group is identical with the green pixel group of step 701 in fact, is the group that is reduced.
See also the 8th figure, the 8th figure is the flow chart of the encoding and decoding method of differential coding of the present invention group.Wherein there is the encoding and decoding method of part steps and green pixel group to overlap or support mutually, and separated to be right in the step of the 7th figure and mentioned, so the part that repeats is not given unnecessary details at this.
Step 801 repeats to some extent with step 701 and supports mutually, so will not give unnecessary details.
Step 803: in order to reduce the figure place of processing, the mode of therefore having taked to subtract each other comes the channel differential coding is done by green pixel group and non-green pixel group,
Step 807: the differential coding group that will belong to time domain with the hadamard conversion after the improvement is transformed on the frequency domain to produce a differential coding group that belongs to frequency domain from time domain.Arbitrary group of differential coding group comprises four pixel parameters, and one of them is the pixel parameter that belongs to low frequency, and other three for belonging to the pixel parameter of high frequency.Step 807 repeats with step 705 to some extent except the part of this explanation, so will not give unnecessary details.
Step 809 repeats to some extent with step 707 and supports mutually, so will not give unnecessary details.
Step 813 repeats to some extent with step 711 and supports mutually, so will not give unnecessary details.
Step 825: the position of the low-frequency parameter of all differential coding groups that belong to frequency domain is represented in taking-up in 48 the position group that is read from buffer, and with the inverse function of formula (4) all low-frequency parameters in the differential coding group is reduced to obtain the parameter corresponding to low frequency of all reduction in the differential coding group.
Step 827: all parameters corresponding to low frequency corresponding to all parameters of high frequency and step 825 gained of step 823 gained are considered as a differential coding group that belongs to the reduction of frequency domain.In differential coding group, step 823 gained changed back time domain to obtain the differential coding group that belong to time domain corresponding to the hadamard conversion (IMHT, Inverse ModifiedHadamard Transform) after with reverse improvement of all parameters of low frequency from frequency domain corresponding to all parameters of high frequency and step 825 gained.This differential coding group is identical with the differential coding group of step 803 in fact, is the group that is reduced.
Step 829: do the channel differential decoding in the mode of addition with the differential coding group that green pixel group that step 725 is obtained and step 827 obtain, obtain the non-green pixel group of a reduction, and this group is identical with the resulting non-green pixel of step 801 group in fact, is the group that is reduced.
Method of the present invention can be with originally with the pixel group boil down to of the 64 bit representations pixel group with 48 bit representations, and the pixel group of this 48 bit representation is decompressed is the original pixel group with 64 bit representations again.Shown in the 7th figure, the process of green pixel group compression is to represent with step 701,705,707,709,711,713,715, and the process that green pixel group decompresses is to represent with step 717,719,721,723,725,727.Shown in the 8th figure, the process of differential coding group compression is to represent with step 801,803,807,809,811,813,815,817, and the process that differential coding group decompresses is to represent with step 819,821,823,825,827,829,831.
The way of coming compressing image data with the differential pulse coding method of utilizing the neighbor relevance compared to prior art, the present invention has used the characteristic that energy major part in the view data concentrates on low frequency part, take the lower compress mode of distortion for low frequency part, then take the higher compress mode of distortion for HFS.In addition, viewpoint with three colors (RGB) of initial data, most energy is concentrated in the part of green pixel, and the energy that only has smaller portions is present in part blue and red pixel, meaning is higher that the frequency of green pixel appearance in the initial data is red and blue pixel is obviously next, therefore can the less mode of suppressed range compress the blue relatively green pixel comparatively many of quantity, then cooperate the pixel parameter of green pixel to represent with red pixel with the bigger channel Differential video coding method of suppressed range for blue with red pixel.The step 701 of the 7th figure of the present invention and the step 801 of the 8th figure are in order to be beneficial to the different compress modes of this kind for the pixel of different colours, and in advance green pixel with non-green are divided into two groups.
Compared to existing technology, embodiments of the invention are for changing violent part at image pixel, because utilize the relevance of neighbor to come compressed image, changing the phenomenon that the image quality of violent part die-offs with addressed pixel has tangible improvement; This kind effect is comparatively to concentrate on green pixel because of embodiments of the invention utilize the energy of three kinds of colors of initial data, and make the characteristic that the green pixel frequency of occurrences is bigger, adopting the position few method of change to compress green pixel makes its distortion minimum, and adopt the mode of channel differential coding to come compression energy to be evident as few non-green pixel than green pixel, though making its compression degree is big far beyond green pixel, but because of the frequency of occurrences is lower, thus to the compression after image quality only have minimum influence.Embodiments of the invention and utilize with the Energy distribution of shades of colour pixel in the initial data compress the method for versicolor pixel can Billy with the method for the relevance compress of neighbor come more can loyal performance initial data in the characteristic of each pixel, be used for significantly reducing the distortion of relevance because of expecting that its power causes of neighbor.Moreover, the more existing technology of the present invention has been used less figure place in the part of low frequency, this kind effect is only need utilize addition and subtraction just can realize because of the conversion of the hadamard after the improvement of the present invention, and the figure place of its low-frequency component is constant, and the employed discrete cosine transform of existing technology then needs more figure place.
The above only is preferred embodiment of the present invention, and all equalizations of being done according to claim scope of the present invention change and modify, and all should belong to covering scope of the present invention.
Claims (9)
1. the method for a compression and recompression image data for image acquiring apparatus, it includes the following step:
(a) the pixel parameter generating one differential coding group of another colored pixels in the pixel parameter of the green pixel in one group of image pixel of foundation and this group image pixel;
(b) conversion of the hadamard after this differential coding group is improved to be producing the parameter corresponding to low frequency, and a plurality of parameter corresponding to high frequency;
(c) adjust this parameter corresponding to low frequency;
(d) adjust this a plurality of parameters according to a quantizating index corresponding to high frequency;
(e) parameter of set-up procedure (c) generation is with the parameter corresponding to low frequency of reduction step (b);
(f) parameter that produces according to this quantizating index set-up procedure (d) is with a plurality of parameters corresponding to high frequency of reduction step (b);
(g) the hadamard conversion after a plurality of parameters corresponding to high frequency that parameter and the step (f) corresponding to low frequency that step (e) is produced produces oppositely improve is to reduce this differential coding group.
2. method according to claim 1, it includes the following step in addition:
(h) the hadamard conversion after the pixel parameter that will organize the green pixel in the image pixel improves is producing the parameter corresponding to low frequency, and a plurality of parameter corresponding to high frequency;
What (i) produce in the set-up procedure (h) should be corresponding to the parameter of low frequency;
(j) according to these a plurality of parameters that produce in this quantizating index set-up procedure (h) corresponding to high frequency;
(k) parameter of set-up procedure (i) generation is with the parameter corresponding to low frequency of reduction step (h);
(l) parameter that produces according to this quantizating index set-up procedure (j) is with a plurality of parameters corresponding to high frequency of reduction step (h);
(m) the hadamard conversion after a plurality of parameters corresponding to high frequency that parameter and the step (l) corresponding to low frequency that step (k) is produced produces oppositely improve is to reduce the pixel parameter of the green pixel in this group image pixel.
3. method according to claim 2, it comprises step (n) in addition: the pixel parameter of another colored pixels in this group image pixel is reduced by the differential coding group of reducing according to the pixel parameter and the step (g) of the green pixel in this group image pixel of step (m) reduction.
4. method according to claim 3, wherein step (a) is according to the pixel parameter of the green pixel in one group of image pixel and the pixel parameter generating one differential coding group of the red pixel in this group image pixel; Step (n) is reduced the pixel parameter of the red pixel in this group image pixel for the differential coding group of reducing according to the pixel parameter and the step (g) of the green pixel in this group image pixel of step (m) reduction.
5. method according to claim 3, wherein step (a) is according to the pixel parameter of the green pixel in one group of image pixel and the pixel parameter generating one differential coding group of the blue pixel in this group image pixel; Step (n) is reduced the pixel parameter of the blue pixel in this group image pixel for the differential coding group of reducing according to the pixel parameter and the step (g) of the green pixel in this group image pixel of step (m) reduction.
6. image-pickup device method of compressing image data, it includes the following step:
(a) the pixel parameter generating one differential coding group of another colored pixels in the pixel parameter of the green pixel in one group of image pixel of foundation and this group image pixel;
(b) conversion of the hadamard after this differential coding group is improved to be producing the parameter corresponding to low frequency, and a plurality of parameter corresponding to high frequency;
(c) adjust this parameter corresponding to low frequency; And
(d) adjust this a plurality of parameters according to a quantizating index corresponding to high frequency.
7. method according to claim 6, it includes the following step in addition:
(e) the hadamard conversion after the pixel parameter that will organize the green pixel in the image pixel improves is producing the parameter corresponding to low frequency, and a plurality of parameter corresponding to high frequency;
What (f) produce in the set-up procedure (e) should be corresponding to the parameter of low frequency; And
(g) according to these a plurality of parameters that produce in this quantizating index set-up procedure (e) corresponding to high frequency.
8. method according to claim 6, wherein step (a) is according to the pixel parameter of the green pixel in one group of image pixel and the pixel parameter generating one differential coding group of the red pixel in this group image pixel.
9. method according to claim 6, wherein step (a) is according to the pixel parameter of the green pixel in one group of image pixel and the pixel parameter generating one differential coding group of the blue pixel in this group image pixel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100701905A CN100421465C (en) | 2005-05-10 | 2005-05-10 | Method of compression and recompression image data for image acquiring apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100701905A CN100421465C (en) | 2005-05-10 | 2005-05-10 | Method of compression and recompression image data for image acquiring apparatus |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1863296A CN1863296A (en) | 2006-11-15 |
| CN100421465C true CN100421465C (en) | 2008-09-24 |
Family
ID=37390607
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100701905A Expired - Fee Related CN100421465C (en) | 2005-05-10 | 2005-05-10 | Method of compression and recompression image data for image acquiring apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100421465C (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1239380A (en) * | 1998-04-30 | 1999-12-22 | 现代电子产业株式会社 | Apparatus and method for compressing image data received from image sensor having bayer pattern |
| JP2000101848A (en) * | 1998-09-25 | 2000-04-07 | Asahi Optical Co Ltd | Image conpressing device and image compander |
| CN1405735A (en) * | 2002-11-08 | 2003-03-26 | 北京工业大学 | Colour-picture damage-free compression method based on perceptron |
| US6560373B1 (en) * | 1996-12-04 | 2003-05-06 | Samsung Electronics Co., Ltd. | Apparatus and method of compressing still image at regular compression rate |
-
2005
- 2005-05-10 CN CNB2005100701905A patent/CN100421465C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6560373B1 (en) * | 1996-12-04 | 2003-05-06 | Samsung Electronics Co., Ltd. | Apparatus and method of compressing still image at regular compression rate |
| CN1239380A (en) * | 1998-04-30 | 1999-12-22 | 现代电子产业株式会社 | Apparatus and method for compressing image data received from image sensor having bayer pattern |
| JP2000101848A (en) * | 1998-09-25 | 2000-04-07 | Asahi Optical Co Ltd | Image conpressing device and image compander |
| CN1405735A (en) * | 2002-11-08 | 2003-03-26 | 北京工业大学 | Colour-picture damage-free compression method based on perceptron |
Non-Patent Citations (2)
| Title |
|---|
| 一种基于色差分析的彩色图像压缩编码新方法. 陈宇拓，余英林.华南理工大学学报（自然科学版），第28卷第4期. 2000 |
| 一种基于色差分析的彩色图像压缩编码新方法. 陈宇拓，余英林.华南理工大学学报（自然科学版），第28卷第4期. 2000 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1863296A (en) | 2006-11-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100355287C (en) | Adaptive variable-length coding methods for image data | |
| CN104205845B (en) | LM patterns with unified bit wide multiplier | |
| CN103460699B (en) | Loop circuit filtering method and its equipment | |
| CN100362510C (en) | Round-off control for multi-stage interpolation | |
| JP5507077B2 (en) | Apparatus and method for encoding and calculating a discrete cosine transform using a butterfly processor | |
| JP2017055267A (en) | Image encoding device, image processing apparatus, and image encoding method | |
| US9019399B2 (en) | Two-dimensional signal encoding device | |
| CN107645662A (en) | A kind of colour image compression method | |
| CN102271251B (en) | Lossless image compression method | |
| EP1324618A2 (en) | Encoding method and arrangement | |
| CN101951524A (en) | JPEG (Joint Photographic Experts Group) compression method and device of color digital image | |
| CN100421465C (en) | Method of compression and recompression image data for image acquiring apparatus | |
| CN107343199B (en) | Rapid adaptive compensation method for sampling points in HEVC (high efficiency video coding) | |
| CN1295652C (en) | Image information coding method | |
| CN108989820B (en) | Data compression method and device adopting respective corresponding chroma sampling formats at all stages | |
| KR20070111111A (en) | Method of compressing and decompressing image and equipment thereof | |
| CN117459737B (en) | Training method of image preprocessing network and image preprocessing method | |
| TWI795480B (en) | Image processing device for performing data decompression and image processing device for performing data compression | |
| CN1640144A (en) | Method and device for coding and decoding a digital color video sequence | |
| CN106878740A (en) | Suitable for the method for compressing image and image compression system of liquid crystal driving | |
| KR101704674B1 (en) | An apparatus for generating digital cinema images in high speed and the method thereof | |
| CN112104876A (en) | Data compression method and device for performing multi-set coefficient component conversion on prediction residual error | |
| CN116095333A (en) | Image compression method, device, equipment and storage medium | |
| CN1622611A (en) | Method for controlling quantization degree of video signal coding bit-stream and related device | |
| TW201340716A (en) | Differential layer stratification image compression method |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: ALCOR MICRO CORP Free format text: FORMER OWNER: ALI CORPORATION Effective date: 20100701 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: TAIPEI CITY, TAIWAN PROVINCE, CHINA TO: TAIPEI CITY, TAIWAN PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20100701 Address after: Taipei city of Taiwan Province Patentee after: Anguo International Sci-Tech Co., Ltd. Address before: Taipei City, Taiwan, China Patentee before: Yangzhi Science & Technology Co., Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20161219 Address after: Taipei City, Taiwan China Nangang District three road 66, 9 floor 1 Patentee after: Exhibition Polytron Technologies Inc Address before: Taipei City, Taiwan, China Patentee before: Anguo International Sci-Tech Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080924 Termination date: 20170510 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |