JPEG_LS rule coding hardware achieving method based on scanning sequence changing

Abstract

The invention relates to a JPEG_LS rule coding hardware achieving method based on scanning sequence changing. The method comprises the step of source image scanning, the step of quantization error generating and reconstruction value generating, the step of Columbus coding and the step of code stream outputting. According to the source image scanning, a source image is cached with six lines as a basic unit, a page turning RAM is used for achieving, every six lines serve as one page, writing and coding are alternately carried out on the current page and the next page, and data in the six lines in the cache are alternately coded from top to bottom and from left to right during coding; the quantization error generating and reconstruction value generating step is finished through a six-level assembly line. According to the JPEG_LS rule coding hardware achieving method based on scanning sequence changing, the processing speed is increased to six times of the processing speed of a standard JPEG_LS rule coding hardware achieving method, and a high-definition video can be easily compressed and processed frame by frame on a low-end and cheap FPGA.

Description

technical field [0001] The invention relates to a hardware implementation method of the JPEG_LS standard in the field of image compression technology, in particular to a hardware implementation method of JPEG_LS rule encoding based on scanning order change. Background technique [0002] JPEG_LS is a near-lossless image compression standard formulated by ISO / ITU, which is widely used in the field of image compression with low compression ratio. figure 1 As shown, it is a schematic diagram of the existing JPEG_LS standard scanning sequence, wherein 11 represents the data of the first row and the first column, and 6100 represents the data of the sixth row and the 100th column. figure 1 The gray grid line part indicates that when encoding the data 35 in the 3rd row and the 5th column, it is necessary to use the 2nd row and 4th column data 24, the 2nd row and 5th column data 25, and the 2nd row and 6th column data 26. The reconstructed value and the reconstructed value of the da...

AI Technical Summary

Problems solved by technology

However, there are two problems with this method. One is that the difference between the reconstructed value and the real value is less than or equal to twice the NEAR value, that is, under the same NEAR value, the error is expanded to twice the standard algorithm; The key path of reconstruction value is avoided, but the problem of optimization of the key path of reconstruction value cannot be solved at the decoding end

Therefore, this patent is applicable to the occasion of hardware encoding and software decoding, but not to the occasion where both encoding and decoding are realized by hardware

Images