CN101986385B - Compressing and decompressing method of image of light emitting diode (LED) display screen - Google Patents
Compressing and decompressing method of image of light emitting diode (LED) display screen Download PDFInfo
- Publication number
- CN101986385B CN101986385B CN 201010544041 CN201010544041A CN101986385B CN 101986385 B CN101986385 B CN 101986385B CN 201010544041 CN201010544041 CN 201010544041 CN 201010544041 A CN201010544041 A CN 201010544041A CN 101986385 B CN101986385 B CN 101986385B
- Authority
- CN
- China
- Prior art keywords
- pixel
- pixel point
- pixel value
- value
- central
- 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 35
- 238000007906 compression Methods 0.000 claims abstract description 112
- 230000006835 compression Effects 0.000 claims abstract description 111
- 230000000052 comparative effect Effects 0.000 claims description 81
- 230000006837 decompression Effects 0.000 abstract description 6
- 230000000694 effects Effects 0.000 abstract description 2
- 125000004122 cyclic group Chemical group 0.000 description 9
- 238000006243 chemical reaction Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000009466 transformation Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000002950 deficient Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
Images
Abstract
The invention discloses a compressing and decompressing method of an image of a light emitting diode (LED) display screen. The compressing method comprises the following steps: 1) determining a coordinate; 2), setting an error permission upper limit value; 3) operating a first compression mode; 4) operating a second compression mode; 5) operating a third compression mode; 6) operating a fourth compression mode; 7) operating a fifth compression mode; 8) operating a sixth compression mode; 9) operating a seventh compression mode; 10) operating an eighth compression mode; 11) operating a ninth compression mode; and 12) selecting compression modes for compression. In the invention, certain error coefficients are directly set in a space domain to compress the image, one compression mode with the best compression effect is selected in the nine compression modes through the trial operation of the nine compression modes, and finally, the compressed image is decompressed. The decompression is simple and dim edges do not occur.
Description
Technical field
The present invention relates to the LED display field, relate in particular to a kind of LED display image compression, decompression method.
Background technology
In the evolution of LED display, the application of Long-distance Control LED display more and more widely needs the transmission data unavoidably in the process of Long-distance Control, be necessary for the efficient that improves the transmission data contracts and decompresses the data entrance pressure.
The picture compression coding is one of important content of Digital Image Processing; The basic principle of compression is exactly the redundant information of removing in the picture; Because exist many relevances between the pixel of a secondary picture; Can delete the identical pixel of amount of information through the certain procedure computing, reach the purpose that reduces redundant compressed image.
In image compression process, can be divided into two kinds of lossless compress and lossy compression method according to the loss whether information arranged.Wherein lossless compress is a kind of compression of not losing picture quality, because lossless compress will be protected the quality of image fully, so its compression ratio is lower for lossy compression method.The selection of various compress techniques and to consider be exactly a compromise to picture quality and compression ratio in itself improves picture quality and will reduce compression ratio, and improving compression ratio will be cost with loss picture quality also.
With the demonstration of LED display as far as image; Control LED brightness through Control current; LED comes the pixel value in the image according to electric current, unavoidably error can occur in this process, and these errors are as long as just can exist in the scope that the LED display display image allows.If there is trickle error in original image in fact, and this error observes not come out on LED display, and these fine error can receive, and ignoring to picture compression of fine error brought huge space.
It is more common at present coming compressed image through fourier cosine transform or wavelet transformation; They change to frequency domain with image by transform of spatial domain; Concentrate on low-frequency range in the energy major part of frequency domain image and remove under the method for high frequency can preserve the most information of image, and then the frequency domain image is transformed into time-domain through inverse Fourier transform through keeping low frequency.It is unclear to thicken through edge of image after this conversion, can only just can let edge of image clear gradually through choosing more low frequency coefficient.
Summary of the invention
The technical problem that the present invention mainly solves provides a kind of LED display image compression, decompression method, and this method need not the conversion of elapsed time territory and frequency domain, and directly certain error coefficient is set in spatial domain carries out compression and decompression to image.
For solving the problems of the technologies described above, the technical scheme that the present invention adopts is: a kind of LED display method for compressing image is provided, may further comprise the steps:
3) operation first compact model: (2+3i is a central pixel point 2+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result, whenever empties a pixel value less than k then empty the pixel value of this pixel and just makes the compressometer of winning count device to add 1;
4) operation second compact model: (2+3i is a central pixel point 3+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the second compression counter add 1;
5) operation the 3rd compact model: (2+3i is a central pixel point 4+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 3rd compression counter add 1;
6) operation the 4th compact model: (3+3i is a central pixel point 2+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 4th compression counter add 1;
7) operation the 5th compact model: (3+3i is a central pixel point 3+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 5th compression counter add 1;
8) operation the 6th compact model: (3+3i is a central pixel point 4+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 6th compression counter add 1;
9) operation the 7th compact model: (4+3i is a central pixel point 2+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 7th compression counter add 1;
10) operation the 8th compact model: (4+3i is a central pixel point 3+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 8th compression counter add 1;
11) operation the 9th compact model: (4+3i is a central pixel point 4+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 9th compression counter add 1;
12) select the compact model compression: the numerical value of the first compression counter, the second compression counter, the 3rd compression counter, the 4th compression counter, the 5th compression counter, the 6th compression counter, the 7th compression counter, the 8th compression counter and the 9th compression counter relatively; Choose the corresponding compact model of the maximum compression counter of numerical value the said image of compression that needs is compressed, obtain the picture compression result;
Wherein, step 3) ~ 11) in no particular order.
Wherein, the quantity of choosing of said surrounding pixel point is eight, and its coordinate is respectively:
The top left pixel point coordinates be I (1+3i, 1+3j), last pixel coordinate be I (1+3i, 2+3j); Upper right pixel coordinate be I (1+3i, 3+3j), left pixel coordinate be I (2+3i, 1+3j); Right pixel coordinate be I (2+3i, 3+3j), a left side down the pixel coordinate be I (3+3i, 1+3j); Following pixel coordinate be I (3+3i, 2+3j), the bottom right pixel point coordinates be I (3+3i, 3+3j);
Wherein, the comparison formula of said central pixel point and its surrounding pixel is respectively:
For solving the problems of the technologies described above, another technical scheme that the present invention adopts is: a kind of method of LED display image decompressor is provided, is used to the above-mentioned compressed image that decompresses, may further comprise the steps:
1) confirm to empty pixel: scanning is through the image of overcompression, and finds out the pixel that is cleared, the coordinate of the pixel of confirming to be cleared be I (m, n), wherein m and n are the positive integer more than or equal to 2;
2) confirm central pixel point: confirm the surrounding pixel point of pixel that is cleared, and find out the centre coordinate of confirming when compressing in the pixel around;
3) empty the pixel assignment: the pixel value of central pixel point is imparted on the pixel value of the pixel that has been cleared, obtains the result that decompresses.
Wherein, in step 2) described in the quantity of choosing of surrounding pixel point be eight, its coordinate is respectively: I (m-1, n), I (m+1; N), I (m, n-1), I (m, n+1), I (m-1, n-1), I (m-1; N+1), I (m+1, n-1) and I (m+1, n+1).
The invention has the beneficial effects as follows: Fourier's varies with cosine person of the changing wavelet transformation that is different from prior art needs the conversion of elapsed time territory and frequency domain; Complicated and the image border after compression of the computing unclear defective that thickens; The present invention directly is provided with certain error coefficient image is compressed in spatial domain; And the trial run through nine kinds of compact models, and in these nine kinds of compact models, select the best compact model of a kind of compression effectiveness and finally compress, only need simple contrast computing can realize compression; And the image decompressor after the compression is simple, the unclear situation of edge blurry can not occur.
Description of drawings
Fig. 1 is the program flow diagram of LED display method for compressing image embodiment of the present invention;
Fig. 2 is the pixel compression sketch map of first kind of compact model of the present invention;
Fig. 3 is the pixel compression sketch map of second kind of compact model of the present invention;
Fig. 4 is the pixel compression sketch map of the third compact model of the present invention;
Fig. 5 is the pixel compression sketch map of the 4th kind of compact model of the present invention;
Fig. 6 is the pixel compression sketch map of the 5th kind of compact model of the present invention;
Fig. 7 is the pixel compression sketch map of the 6th kind of compact model of the present invention;
Fig. 8 is the pixel compression sketch map of the 7th kind of compact model of the present invention;
Fig. 9 is the pixel compression sketch map of the 8th kind of compact model of the present invention;
Figure 10 is the pixel compression sketch map of the 9th kind of compact model of the present invention;
Figure 11 is the program flow diagram of LED display image decompression compression method embodiment of the present invention.
Embodiment
By specifying technology contents of the present invention, structural feature, realized purpose and effect, give explanation below in conjunction with execution mode and conjunction with figs. are detailed.
See also Fig. 1 ~ Figure 10, LED display method for compressing image of the present invention may further comprise the steps:
3) operation first compact model: (2+3i is a central pixel point 2+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result, whenever empties a pixel value less than k then empty the pixel value of this pixel and just makes the compressometer of winning count device to add 1;
4) operation second compact model: (2+3i is a central pixel point 3+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the second compression counter add 1;
5) operation the 3rd compact model: (2+3i is a central pixel point 4+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 3rd compression counter add 1;
6) operation the 4th compact model: (3+3i is a central pixel point 2+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 4th compression counter add 1;
7) operation the 5th compact model: (3+3i is a central pixel point 3+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 5th compression counter add 1;
8) operation the 6th compact model: (3+3i is a central pixel point 4+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 6th compression counter add 1;
9) operation the 7th compact model: (4+3i is a central pixel point 2+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 7th compression counter add 1;
10) operation the 8th compact model: (4+3i is a central pixel point 3+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 8th compression counter add 1;
11) operation the 9th compact model: (4+3i is a central pixel point 4+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 9th compression counter add 1;
12) select the compact model compression: the numerical value of the first compression counter, the second compression counter, the 3rd compression counter, the 4th compression counter, the 5th compression counter, the 6th compression counter, the 7th compression counter, the 8th compression counter and the 9th compression counter relatively; Choose the corresponding compact model of the maximum compression counter of numerical value the said image of compression that needs is compressed, obtain the picture compression result;
Wherein, step 3) ~ 11) in no particular order.
Fourier's varies with cosine person of the changing wavelet transformation that is different from prior art needs the conversion of elapsed time territory and frequency domain; Complicated and the image border after compression of the computing unclear defective that thickens; The present invention directly is provided with certain error coefficient image is compressed in spatial domain; And the trial run through nine kinds of compact models, and in these nine kinds of compact models, select the best compact model of a kind of compression effectiveness and finally compress, only need simple contrast computing can realize compression; And the image decompressor after the compression is simple, the unclear situation of edge blurry can not occur.
In one embodiment, the quantity of choosing of said surrounding pixel point is eight, and its coordinate is respectively: the top left pixel point coordinates be I (1+3i, 1+3j), last pixel coordinate is I (1+3i; 2+3j), upper right pixel coordinate be I (1+3i, 3+3j), left pixel coordinate be I (2+3i, 1+3j); Right pixel coordinate be I (2+3i, 3+3j), a left side down the pixel coordinate be I (3+3i, 1+3j); Following pixel coordinate be I (3+3i, 2+3j), the bottom right pixel point coordinates be I (3+3i, 3+3j);
In one embodiment, the comparison formula of said central pixel point and its surrounding pixel is respectively:
See also Figure 11, the method for LED display image decompressor of the present invention is used to the above-mentioned compressed image that decompresses, and may further comprise the steps:
1) confirm to empty pixel: scanning is through the image of overcompression, and finds out the pixel that is cleared, the coordinate of the pixel of confirming to be cleared be I (m, n), wherein m and n are the positive integer more than or equal to 2;
2) confirm central pixel point: confirm the surrounding pixel point of pixel that is cleared, and find out the centre coordinate of confirming when compressing in the pixel around;
3) empty the pixel assignment: the pixel value of central pixel point is imparted on the pixel value of the pixel that has been cleared, obtains the result that decompresses.
In one embodiment, in the step 2 of the method for above-mentioned LED display image decompressor) in, the quantity of choosing of described surrounding pixel point is eight; Its coordinate is respectively: I (m-1, n), I (m+1, n), I (m; N-1), I (m, n+1), I (m-1, n-1), I (m-1; N+1), I (m+1, n-1) and I (m+1, n+1).
See also Fig. 2, among this figure with pixel I (2+3i, 2+3j) realize circulating through following statement for central pixel point: " for i=1 to (mod (width-2))/3); For j=1 to (mod (width-2))/3) ... End; End " wherein i, j are that step-length increases progressively with 1.In cyclic process earlier relatively I (2+3i, 2+3j) the corresponding surrounding pixel value of pixel value I with it (1+3i, 1+3j), I (1+3i; 2+3j), I (1+3i, 3+3j), I (2+3i, 1+3j), I (2+3i; 3+3j), I (3+3i, 1+3j), I (3+3i, 2+3j), I (3+3i; 3+3j) relatively, will (2+3i, 2+3j) pixel value equates or differs very little pixel value to empty to vacate memory space with I.
See also Fig. 3, among this figure with pixel I (2+3i, 3+3j) realize circulating through following statement for central pixel point: " for i=1 to (mod (width-2))/3); For j=1 to (mod (width-3))/3) ... End; End " wherein i, j are that step-length increases progressively with 1.In cyclic process earlier relatively I (2+3i, 3+3j) the corresponding surrounding pixel value of pixel value I with it (1+3i, 2+3j), I (1+3i; 3+3j), I (1+3i, 4+3j), I (2+3i, 2+3j), I (2+3i; 4+3j), I (3+3i, 2+3j), I (3+3i, 3+3j), I (3+3i; 4+3j) relatively, will (2+3i, 3+3j) pixel value equates or differs very little pixel value to empty to vacate memory space with I.
See also Fig. 4, among this figure with pixel I (2+3i, 4+3j) realize circulating through following statement for central pixel point: " for i=1 to (mod (width-2))/3); For j=1 to (mod (width-4))/3) ... End; End " wherein i, j are that step-length increases progressively with 1.In cyclic process earlier relatively I (2+3i, 4+3j) the corresponding surrounding pixel value of pixel value I with it (1+3i, 3+3j), I (1+3i; 4+3j), I (1+3i, 5+3j), I (2+3i, 3+3j), I (2+3i; 5+3j), I (3+3i, 3+3j), I (3+3i, 4+3j), I (3+3i; 5+3j) relatively, will (2+3i, 4+3j) pixel value equates or differs very little pixel value to empty to vacate memory space with I.
See also Fig. 5, among this figure with pixel I (3+3i, 2+3j) realize circulating through following statement for central pixel point: " for i=1 to (mod (width-3))/3); For j=1 to (mod (width-2))/3) ... End; End " wherein i, j are that step-length increases progressively with 1.In cyclic process earlier relatively I (3+3i, 2+3j) the corresponding surrounding pixel value of pixel value I with it (2+3i, 1+3j), I (2+3i; 2+3j), I (2+3i, 3+3j), I (3+3i, 1+3j), I (3+3i; 3+3j), I (4+3i, 1+3j), I (4+3i, 2+3j), I (4+3i; 3+3j) relatively, will (3+3i, 2+3j) pixel value equates or differs very little pixel value to empty to vacate memory space with I.
See also Fig. 6, among this figure with pixel I (3+3i, 3+3j) realize circulating through following statement for central pixel point: " for i=1 to (mod (width-3))/3); For j=1 to (mod (width-3))/3) ... End; End " wherein i, j are that step-length increases progressively with 1.In cyclic process earlier relatively I (3+3i, 3+3j) the corresponding surrounding pixel value of pixel value I with it (2+3i, 2+3j), I (2+3i; 3+3j), I (2+3i, 4+3j), I (3+3i, 2+3j), I (3+3i; 4+3j), I (4+3i, 2+3j), I (4+3i, 3+3j), I (4+3i; 4+3j) relatively, will (3+3i, 3+3j) pixel value equates or differs very little pixel value to empty to vacate memory space with I.
See also Fig. 7, among this figure with pixel I (3+3i, 4+3j) realize circulating through following statement for central pixel point: " for i=1 to (mod (width-3))/3); For j=1 to (mod (width-4))/3) ... End; End " wherein i, j are that step-length increases progressively with 1.In cyclic process earlier relatively I (3+3i, 4+3j) the corresponding surrounding pixel value of pixel value I with it (2+3i, 3+3j), I (2+3i; 4+3j), I (2+3i, 5+3j), I (3+3i, 3+3j), I (3+3i; 5+3j), I (4+3i, 3+3j), I (4+3i, 4+3j), I (4+3i; 5+3j) relatively, will (3+3i, 4+3j) pixel value equates or differs very little pixel value to empty to vacate memory space with I.
See also Fig. 8, among this figure with pixel I (4+3i, 2+3j) realize circulating through following statement for central pixel point: " for i=1 to (mod (width-4))/3); For j=1 to (mod (width-2))/3) ... End; End " wherein i, j are that step-length increases progressively with 1.In cyclic process earlier relatively I (4+3i, 2+3j) the corresponding surrounding pixel value of pixel value I with it (3+3i, 1+3j), I (3+3i; 2+3j), I (3+3i, 3+3j), I (4+3i, 1+3j), I (4+3i; 3+3j), I (5+3i, 1+3j), I (5+3i, 2+3j), I (5+3i; 3+3j) relatively, will (4+3i, 2+3j) pixel value equates or differs very little pixel value to empty to vacate memory space with I.
See also Fig. 9, among this figure with pixel I (4+3i, 3+3j) realize circulating through following statement for central pixel point: " for i=1 to (mod (width-4))/3); For j=1 to (mod (width-3))/3) ... End; End " wherein i, j are that step-length increases progressively with 1.In cyclic process earlier relatively I (4+3i, 3+3j) the corresponding surrounding pixel value of pixel value I with it (3+3i, 2+3j), I (3+3i; 3+3j), I (3+3i, 4+3j), I (4+3i, 2+3j), I (4+3i; 4+3j), I (5+3i, 2+3j), I (5+3i, 3+3j), I (5+3i; 4+3j) relatively, will (4+3i, 3+3j) pixel value equates or differs very little pixel value to empty to vacate memory space with I.
See also Figure 10, among this figure with pixel I (4+3i, 4+3j) realize circulating through following statement for central pixel point: " for i=1 to (mod (width-4))/3); For j=1 to (mod (width-4))/3) ... End; End " wherein i, j are that step-length increases progressively with 1.In cyclic process earlier relatively I (4+3i, 4+3j) the corresponding surrounding pixel value of pixel value I with it (3+3i, 3+3j), I (3+3i; 4+3j), I (3+3i, 5+3j), I (4+3i, 3+3j), I (4+3i; 5+3j), I (5+3i, 3+3j), I (5+3i, 4+3j), I (5+3i; 5+3j) relatively, will (4+3i, 4+3j) pixel value equates or differs very little pixel value to empty to vacate memory space with I.
The above is merely embodiments of the invention; Be not so limit claim of the present invention; Every equivalent structure or equivalent flow process conversion that utilizes specification of the present invention and accompanying drawing content to be done; Or directly or indirectly be used in other relevant technical fields, all in like manner be included in the scope of patent protection of the present invention.
Claims (4)
1. a LED display method for compressing image is characterized in that, may further comprise the steps:
1) confirm coordinate: scanning needs the image of compression, confirms each the pixel coordinate in the image, make the pixel coordinate be I (i, j), wherein i and j are positive integer;
2) specification error allowable upper limit value: the specification error allowable upper limit value is k;
3) operation first compact model: (2+3i is a central pixel point 2+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result, whenever empties a pixel value less than k then empty the pixel value of this pixel and just makes the compressometer of winning count device to add 1;
4) operation second compact model: (2+3i is a central pixel point 3+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the second compression counter add 1;
5) operation the 3rd compact model: (2+3i is a central pixel point 4+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 3rd compression counter add 1;
6) operation the 4th compact model: (3+3i is a central pixel point 2+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 4th compression counter add 1;
7) operation the 5th compact model: (3+3i is a central pixel point 3+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 5th compression counter add 1;
8) operation the 6th compact model: (3+3i is a central pixel point 4+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 6th compression counter add 1;
9) operation the 7th compact model: (4+3i is a central pixel point 2+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 7th compression counter add 1;
10) operation the 8th compact model: (4+3i is a central pixel point 3+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 8th compression counter add 1;
11) operation the 9th compact model: (4+3i is a central pixel point 4+3j), confirms the surrounding pixel point coordinates of central pixel point, and the pixel value of central pixel point and the pixel value of its surrounding pixel point are compared to choose I; The comparative result that the pixel value of central pixel point and the pixel value of its surrounding pixel point relatively draw compares with error allowable upper limit value k respectively; If comparative result is more than or equal to k then keep the pixel value of this pixel; If comparative result less than k then empty the pixel value of this pixel, whenever empties a pixel value and just makes the 9th compression counter add 1;
12) select the compact model compression: the numerical value of the first compression counter, the second compression counter, the 3rd compression counter, the 4th compression counter, the 5th compression counter, the 6th compression counter, the 7th compression counter, the 8th compression counter and the 9th compression counter relatively; Choose the corresponding compact model of the maximum compression counter of numerical value the said image of compression that needs is compressed, obtain the picture compression result;
Wherein, step 3) ~ 11) in no particular order.
2. LED display method for compressing image according to claim 1 is characterized in that: the quantity of choosing of said surrounding pixel point is eight, and its coordinate is respectively:
The top left pixel point coordinates be I (1+3i, 1+3j), last pixel coordinate be I (1+3i, 2+3j); Upper right pixel coordinate be I (1+3i, 3+3j), left pixel coordinate be I (2+3i, 1+3j); Right pixel coordinate be I (2+3i, 3+3j), a left side down the pixel coordinate be I (3+3i, 1+3j); Following pixel coordinate be I (3+3i, 2+3j), the bottom right pixel point coordinates be I (3+3i, 3+3j).
3. the method for a LED display image decompressor is characterized in that: be used for decompressing like each described compressed image of claim 1 ~ 2, may further comprise the steps:
1) confirm to empty pixel: scanning is through the image of overcompression, and finds out the pixel that is cleared, the coordinate of the pixel of confirming to be cleared be I (m, n), wherein m and n are the positive integer more than or equal to 2;
2) confirm central pixel point: confirm the surrounding pixel point of pixel that is cleared, and find out the centre coordinate of confirming when compressing in the pixel around;
3) empty the pixel assignment: the pixel value of central pixel point is imparted on the pixel value of the pixel that has been cleared, obtains the result that decompresses.
4. the method for LED display image decompressor according to claim 3 is characterized in that: in step 2) described in the quantity of choosing of surrounding pixel point be eight, its coordinate is respectively: I (m-1; N), I (m+1, n), I (m, n-1), I (m; N+1), I (m-1, n-1), I (m-1, n+1), I (m+1; N-1) and I (m+1, n+1).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010544041 CN101986385B (en) | 2010-11-15 | 2010-11-15 | Compressing and decompressing method of image of light emitting diode (LED) display screen |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010544041 CN101986385B (en) | 2010-11-15 | 2010-11-15 | Compressing and decompressing method of image of light emitting diode (LED) display screen |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101986385A CN101986385A (en) | 2011-03-16 |
| CN101986385B true CN101986385B (en) | 2012-11-14 |
Family
ID=43710730
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010544041 Expired - Fee Related CN101986385B (en) | 2010-11-15 | 2010-11-15 | Compressing and decompressing method of image of light emitting diode (LED) display screen |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101986385B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116170599B (en) * | 2023-04-26 | 2023-07-25 | 长城信息股份有限公司 | Synchronous real-time image compression method, system, medium and terminal |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494788A (en) * | 2009-01-23 | 2009-07-29 | 炬才微电子（深圳）有限公司 | Method and apparatus for compressing and decompressing video image |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3040967B2 (en) * | 1997-09-10 | 2000-05-15 | 近畿日本鉄道株式会社 | Full color LED display |
| EP1279290A1 (en) * | 2000-04-04 | 2003-01-29 | Koninklijke Philips Electronics N.V. | Video encoding method using a wavelet transform |
| TW595229B (en) * | 2002-12-04 | 2004-06-21 | Etoms Electronics Corp | Video image compressing/decompressing method |
| TW200642477A (en) * | 2005-05-26 | 2006-12-01 | Chunghwa Telecom Co Ltd | Method of compressing/decompressing color image data |
-
2010
- 2010-11-15 CN CN 201010544041 patent/CN101986385B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494788A (en) * | 2009-01-23 | 2009-07-29 | 炬才微电子（深圳）有限公司 | Method and apparatus for compressing and decompressing video image |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101986385A (en) | 2011-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111800641B (en) | Image coding and decoding method and device adopting different kinds of reconstructed pixels in same mode | |
| WO2015120823A1 (en) | Image compression method and device using reference pixel storage space in multiple forms | |
| EP3211900A1 (en) | Image coding method, decoding method, coding device and decoding device | |
| CN1773553B (en) | Image encoding with dynamic buffer capacity level based compression adjustment | |
| CN1943243B (en) | 2-dimensional signal encoding/decoding method and device | |
| CN108605141A (en) | Efficient parameter storage for the transformation of compact multipass | |
| CN104378644A (en) | Fixed-width variable-length pixel sample value string matching strengthened image compression method and device | |
| EP3107289A1 (en) | Picture coding and decoding methods and devices | |
| CN106412579B (en) | A kind of coding of image, coding/decoding method and device | |
| CN1419787A (en) | Quality based image compression | |
| CN101924562B (en) | Compression-type coding scheme of curve vector data based on integer wavelet transformation | |
| CN104683801A (en) | Image compression method and device | |
| CN107743235B (en) | Image processing method, device and electronic equipment | |
| CN1547708A (en) | A system and method for decoding digital image and audio data in a lossless manner | |
| CN104205845A (en) | LM mode with uniform bit-width multipliers | |
| US11863799B2 (en) | Image encoding method and apparatus, image decoding method and apparatus, and chip | |
| CN104427349A (en) | Bayer image compression method | |
| CN109889846A (en) | A kind of compression of De-Mura table data and decompressing method, device and coding/decoding system | |
| CN101986385B (en) | Compressing and decompressing method of image of light emitting diode (LED) display screen | |
| CN106612438A (en) | Image compression method based on overlapping district advanced wavelet transformation technique | |
| CN102883165A (en) | Picture zooming processing method and device | |
| CN102238376B (en) | Image processing system and method | |
| CN110324668A (en) | The inverse transform method and device in transform method, decoding in image block coding | |
| CN102724456B (en) | The OSD compression method that display terminal is applied based on Android and device | |
| CN105376578A (en) | Image compression method and device |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20121114 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |