CN107592541A - A kind of image decompression method and system - Google Patents

Abstract

The invention discloses a fast image decompression method for a specific image compressed data stream, and describes in detail the corresponding compression algorithm, decompression implementation process, image reconstruction process, internal structure and interconnection between modules. An image decompression system is also proposed, which can be used to implement the image decompression method. The image decompression method and system provided by the present invention have the advantages of simple algorithm implementation and clear meaning, and can perform multi-stage pipeline operations according to "image rows", thereby realizing data decompression and image lossless reconstruction.

Description

Image decompression method and system

technical field

The invention relates to the technical field of image information processing, in particular to a decompression method and system for a specific image compressed data stream.

Background technique

Image sensors have been widely used in various fields such as scientific research, industrial production, medical and health care, national defense and military affairs. With the continuous improvement of image resolution and image frame rate, human beings can observe more subtle object features or more short-term physical phenomena, which greatly enriches human observation methods and improves human cognition.

However, with the rapid improvement of image performance, it also brings a huge challenge that the amount of image data and data transmission bandwidth increase exponentially. Massive image data and ultra-high data transmission bandwidth have brought a series of technical difficulties for subsequent image transmission, storage and processing. In order to solve the above problems, an image lossless compression method for real-time processing of high data bandwidth is developed, which greatly reduces the difficulty of transmission and storage. At the same time, corresponding decompression methods are also proposed for lossless reconstruction of images for subsequent research and practical use.

Contents of the invention

(1) Technical problems to be solved

The purpose of the present invention is to aim at a high-speed, real-time image lossless compression algorithm, realize the inverse process of the image compression algorithm, that is, restore the original image data before compression, and reconstruct the image losslessly for subsequent use, and propose an image decompression method and system.

(2) Technical solutions

An image decompression method, comprising: S1: reading the first frame of original image data in the image compression data stream, and using the first frame of original image data as the basic image data; S2: reading and judging the i-th frame in each row Whether the compressed data of each image line is within the preset threshold range, if the compressed data of the image line is within the threshold range, add the compressed data of the image line to the basic image data of the same coordinates, if the compressed data of the image line exceeds the threshold range, then read the uncompressed data of the image row corresponding to the out-of-range data, add it to the basic image data of the same coordinates, calculate the complete data image of the i-th frame, and use it as a new basic image Data; S3: judge whether the i-th frame is the last frame, if so, complete the image decompression, if not, set i=i+1, and return to S2; wherein, i is a positive integer, and its initial value is 2.

Preferably, step S2 includes: S21: read the image data of the jth row from the basic image data; S22: read the compressed data of the kth image row of the jth row in the ith frame; S23: determine whether the image row is compressed Whether the data is within the preset threshold range, if so, add the compressed data of the image line to the basic image data of the same coordinates, if not, store the coordinates corresponding to the uncompressed data of the image line; S24: determine k Whether the value is the number of pixels included in the j row, if not, then set k=k+1, return to S22 to process the next image line compressed data of the j row, if so, then enter step S25; S25: read and The non-compressed data of the image line corresponding to the stored coordinates is added to the basic image data of the same coordinates to obtain the image data of the i-th frame and the j-th row, and use it to update the j-th row of the basic image data; S26: Determine whether the value of j is the number of rows that the i-th frame image contains, if not, then set j=i+1, return to S21 to process the image row compressed data of another row, if so, then obtain the complete data image of the i-th frame, Take it as the new basic image data; where, k and j are both positive integers, and the starting value is 1.

Preferably, S1A is also included between S1 and S2: scan the preset alignment code in the compressed image data stream, continue searching if no preset alignment code is found, and enter step S2 if a preset alignment code is found.

An image decompression system, including a row decompression processing module, for performing the above-mentioned image decompression method;

Preferably, it also includes a data packet frame header detection module and an image frame data cache module; the data packet frame header detection module is used to scan the preset alignment code in the image compression data stream to trigger the line decompression processing module to perform step S2 ; The image frame data cache module is used to cache basic image data, the basic image data is the original image data or the image data of the i-th frame.

Preferably, a row decompression processing module is included, and the row decompression processing module includes a data stream reading controller, a comparator, an adder, an OV address register, an image row data cache, and a decompression state control machine; the data stream reading The acquisition controller is used to read the first frame of original image data, image line compressed data and image line uncompressed data in the image compressed data stream, and transmit the original image frame data to the image line data cache, and send the image line compressed data to The comparator and the adder send the uncompressed data of the image line to the adder; the image line data buffer is used to receive the original image data, and write it into the image frame data buffer module, and read it from the image frame data buffer module Get the image data of the jth row in the basic image data; the comparator is connected to the data flow reading controller, the adder and the OV address register, and is used to judge whether the compressed data of each image row is within a preset threshold range, If in, then send trigger signal to adder, if not in, then store the corresponding coordinate of the data of described ultra-threshold value range to OV address register; Described decompression state control machine is used for scanning the address in OV address register, control The data stream reading controller reads the uncompressed data of the corresponding image row, and sends a trigger signal to the adder. The adder is used to add the compressed data of the image line to the basic image data of the same coordinates, and to add the uncompressed data of the image line to the basic image data of the same coordinates; the image line data cache is also connected to the adder for Transmit the basic image data of the same coordinates in the jth row of image data to the adder for calculation, and obtain the updated image data of the jth row from the adder, and send it back to the image frame data buffer module to update the basic Row j of image data.

Preferably, the line decompression processing module further includes a data stream writing controller, and the data stream writing controller is located between the image line data buffer and the image frame data buffer module, and is used to store the image data in the image line data Cache and image frame data are transferred between cache modules.

Preferably, the row decompression processing module further includes a data counter and a row counter; the data counter is connected to the data stream reading controller, and is used to record the number of image data read by the data stream reading controller, thereby judging Whether the value of k is the number of pixels included in the jth row; the row counter is connected to the data stream writing controller, and is used to record the number of rows of data transmitted by the data stream writing controller, thereby judging whether the value of j is the first The number of lines contained in the i-frame image.

Preferably, the decompression state control machine is also used to collect signals from the data packet frame header detection module, data counter, OV address register, line counter and external user input, and generate image decompression process control signals according to the logic, according to the predetermined The process starts/stops the data stream reading controller, comparator, adder, data stream writing controller in an orderly manner, and generates a synchronous valid signal for decompressing the data stream.

Preferably, it also includes an input data cache module and an output data cache module; the input data cache module is used to cache the image data in the image compression data stream, and transmits the data to the row decompression processing module; the output data cache module The row decompression processing module is connected, and is used for buffering and outputting the first frame of original image data and each subsequent frame of image data.

(3) Beneficial effects

As can be seen from the foregoing technical solutions, the present invention has the following beneficial effects:

(1) The method of the present invention is simple in hierarchy, clear in meaning, easy to implement, and can quickly realize image lossless recovery and reconstruction for specific compressed data streams;

(2) In the actual processing of the present invention, processing is carried out according to "image line", which is beneficial to duplicating multiple similar realization structures, unfolding and performing multi-stage pipeline operation, thereby increasing the decompression speed.

Description of drawings

Figure 1 is a schematic diagram of the input image compression data flow.

FIG. 2 is a schematic structural diagram of an image decompression system according to an embodiment of the present invention.

FIG. 3 is a state machine transition diagram of an image decompression process according to an embodiment of the present invention.

Fig. 4 is a flowchart of an image decompression method according to an embodiment of the present invention.

detailed description

In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with specific embodiments and with reference to the accompanying drawings.

In the image decompression method proposed by the present invention, the image compressed data stream processed is divided into 4 data segments from the data structure, as shown in Figure 1 is a schematic diagram of the image compressed data stream, including:

(1) original image frame data segment;

(2) Align the encoded data segment;

(3) image row compression data segment;

(4) The uncompressed data segment of the image row.

The data segment (1) only appears once in the entire compressed data stream; the data segment (2) only appears once in the compressed data of a frame of image; the data segments (3), (4) appear alternately and cyclically. And data segments (3), (4) are generated by formulas (EQ1, EQ2, EQ3), wherein data segment (3) is actually the calculation result of B(p, l, f), and data segment (4) is actually O(p , l, f) calculation result:

δ(p,l,f)=gray(p,l,f)-gray(p,l,f-1) (EQ1)

(The above formula should satisfy 1≤p≤M, L _dark +1<l≤N, f≥1, and TH=2 ^K -1 (0<K<R))

Where gray(p, l, f) is the grayscale function of the input pixel, p is the pixel number, l is the image row number, f is the image frame number, M is the image width, N is the image height, and R is the quantization bit of the pixel Width, L _dark is the row height of dark pixels. δ(p, l, f) represents the residual, B(p, l, f) and O(p, l, f) respectively represent the residual coding mark value and overflow value, TH is the preset threshold, binK _{(δ( p, l, f))} and binK _(TH) and binK _(-(TH+1)) are respectively the K-bit signed natural binary code of the residual; the K-bit signed natural binary code of TH; -(TH+1 ) is the K-bit signed natural binary code; binR _{(δ(p, l, f))} is the R-bit signed natural binary code of the residual.

An embodiment of the present invention provides an image decompression method, comprising the following steps:

S1: read the original image data of the first frame in the image compression data stream, and use the original image data as the basic image data;

S2: Read and judge whether the compressed data of each image line in each line of the i-th frame is within the preset threshold range, and if the compressed image data is within the threshold range, compare the compressed data of the image line with the basic image with the same coordinates Data addition, if the image line compressed data exceeds the threshold range, read the image line uncompressed data corresponding to the over-range data, and add it to the basic image data of the same coordinates, and calculate the complete i-th frame data image, and use it as the new base image data;

S3: Determine whether the i-th frame is the last frame, if yes, complete image decompression, if not, set i=i+1, and return to S2; wherein, the initial value of i is 2.

Wherein, step S2 further includes:

S21: Read the image data of row j from the basic image data;

S22: Read the compressed data of the k-th image row in the j-th row in the i-th frame;

S23: judge whether the image line compressed data is within the preset threshold range, if so, add the image line compressed data to the basic image data of the same coordinates (i.e. the kth basic image data of the jth row), if If not, store the coordinates corresponding to the uncompressed data of the image row;

S24: judge whether the value of k is the number of pixels contained in the j row, if not, then set k=k+1, return to S22 to process the compressed data of the next image line in the j row, if so, then enter step S25;

S25: Read the uncompressed data of the image row corresponding to the storage coordinates one by one, and add it to the basic image data of the same coordinates to obtain the image data of the jth row of the i-th frame, and use it to update the image data of the basic image data row j;

S26: Determine whether the value of j is the number of lines contained in the image of the i-th frame, if not, set j=j+1, return to S21 to process the compressed data of the image line of another line, if so, obtain the complete data of the i-th frame image, which is used as the new basic image data; where k and j are both positive integers, and the initial value is 1.

In some embodiments of the present invention, S1A is also included between S1 and S2: scan the preset alignment code in the image compressed data stream, continue to search if no preset alignment code is found, and enter step when a preset alignment code is found S2.

Another embodiment of the present invention provides an image decompression system. The system block diagram of the present invention is shown in FIG. 2 , and for the above data structure, the present invention works in an orderly manner according to the state machine transition diagram shown in FIG. 3 . The image decompression system includes: SOF detection module (data packet frame header detection module), input data cache module, row decompression processing module, image frame data cache module, output data cache module, and the modules are interconnected in an orderly manner. Wherein, the row decompression processing module is used to execute steps S1 to S3.

The SOF detection module (SOF is the abbreviation of Start of Frame, indicating the packet frame header) is used to scan the preset alignment code in the image compression data stream, so as to quickly locate the new frame of image in the continuous image compression data stream The starting position triggers the row decompression processing module to execute step S2.

The input data buffering module is used for buffering the image data in the image compressed data stream, and transmitting the data to the row decompression processing module.

The image frame data cache module is used for caching basic image data, and the basic image data is original image data or image data of the i-th frame. The image frame data buffering module receives the image data output by the cache line decompression processing module on the one hand, and outputs the image data to the line decompression processing module on the other hand. Its storage capacity should be sufficient to completely store at least one frame of image data.

The output data cache module is connected to the row decompression processing module, and is used for buffering and outputting the first frame of original image data and each subsequent frame of image data output by the row decompression processing module, that is, the image decompression data stream.

The line decompression processing module includes a data stream reading controller, a decompression control state machine, a data counter, a comparator, an OV address register, an image line data cache, an adder, a line counter and a data stream writing controller, and each unit interconnected in an orderly manner.

The decompression control state machine is connected to other units in the row decompression processing module, collects signals from the SOF detection module, data counter, OV address register, row counter and external user input signals (such as threshold information), and generates an image decompression process according to the logic The control signal starts/stops the data stream reading controller, comparator, adder, data stream writing controller in an orderly manner according to a predetermined process, and generates a synchronous valid signal for decompressing the data stream.

The data flow reading controller is connected to the decompression state control machine, image line data cache, data counter, comparator and adder, and the data flow reading controller is controlled by the output pulse of the decompression state control machine to read the first frame in order The original image frame data, the image row compressed data and the image row uncompressed data of the i-th frame, and the original image frame data is transferred to the image row data cache, the image row compressed data is sent to the comparator and the adder, and the image row Uncompressed data is sent to the adder.

The data counter is connected to the decompression state control machine, and is used to record the number of data read by the data stream reading controller, so as to judge whether the value of k is the number of pixels contained in the jth row, that is, judge the compressed data of the kth image row Whether it is the last data of line j; the data counter is a loop counter, and the maximum range of counting is the number of pixels (or number of pixels) contained in a single line of the decompressed image. When the data counter is full of the number of pixels required for one line of the image, a pulse signal is generated and sent to the decompression state control machine to control each unit to perform the next operation. The data counter is then cleared to zero and starts counting again.

The image line data cache is connected to the decompression state control machine, the data stream read controller and the data stream write controller, and is used for buffering a certain line of image data from the data stream read controller or the data stream write controller. Receive the original image data from the data stream reading controller, write it into the image frame data buffer module, and read the image data of the jth row in the basic image data from the image frame data buffer module. The image row data cache is also connected to the adder, which is used to transmit the basic image data of the same coordinates in the jth row of image data to the adder for calculation, and obtain the updated image data of the jth row from the adder, and convert it to Send back to the image frame data cache module, and update the jth line of the basic image data.

The data flow writing controller is connected with the decompression state control machine, the image row data buffer, the row counter, and the image frame data buffer module and the output data buffer module outside the row decompression processing module. The data flow writing controller is controlled by the output pulse of the decompression state control machine, and the image data flow is moved in an orderly manner in the image line data cache, image frame data cache module and output data cache module, and it is output every time a line operation is completed 1 pulse, which starts the row counter incremented by one.

The comparator is connected to the decompression state control machine, the data flow reading controller, the adder and the OV address register, and is used to judge whether the compressed data of each image row is within the preset threshold range, and receives the decompression state control machine to send The threshold information of the data flow reading controller is compared with the threshold value of the compressed image data read in by the data flow reading controller. If it is within the range indicated by the threshold value, the comparator sends a trigger signal to the adder, which triggers the adder to read the data and perform calculations. Output; if it is outside the threshold range, the comparator stores the coordinates corresponding to the data beyond the threshold range in the OV address register.

The adder is connected to the decompression state control machine, the data flow reading controller, the image line data cache and the comparator, and is controlled by the decompression state control machine to read the data of the corresponding coordinates from the image line data cache, and compare the data with the data The stream reads the sum of the image row compressed data or the image row uncompressed data sent by the same coordinates from the controller.

The OV address register (OV is the abbreviation of Overflow, which means overflow or over-threshold), connects the decompression state control machine and the comparator, and is used to receive and store the position information of pixels outside the threshold range transmitted by the comparator. The decompression state control machine scans the address in the OV address register, controls the data flow reading controller to read the corresponding uncompressed data of the image line, and sends a trigger signal to the adder.

The line counter is connected to the decompression state control machine and the data stream writing controller, and is used to record the number of lines of data processed by the data stream writing controller, so as to judge whether the value of j is the number of lines contained in the i-th frame image, that is, judge Whether the jth line is the last line of the i-th frame image, the line counter is a loop counter, the maximum range of counting is to the height of the decompressed image frame (or the maximum number of image lines), a pulse signal is generated after the count is full, and the pulse signal is sent To uncompress the state control machine, make it control each unit to carry out the next operation. The row counter is then cleared and restarted.

Another embodiment of the present invention provides an image decompression method, which is used in an image decompression system. The implementation steps of image decompression are sequentially and conditionally converted in five states, as shown in Figure 3 for the image of the embodiment of the present invention Decompression method flow chart, Fig. 4 is the state machine transfer diagram of the image decompression process of the embodiment of the present invention, comprises the following steps:

Step S1: Read the first frame of original image data in the image compression data stream, and use the first frame of original image data as the basic image data.

In this embodiment, the image decompression system is the above-mentioned image decompression system. The line decompression processing module reads the original image frame data in the compressed data stream, and writes the complete original image frame data into the image frame data cache module, and uses the first frame of original image data stored in the image frame data cache module as the basis image data.

Image decompression process is in state 1 in this step, and this state is carried out for (1) data segment, comprises the following substeps:

Sub-step S11: the decompression state control machine activates the data flow reading controller and the data counter, and sequentially writes the read data into the image line data cache. When the data counter is full of the number of pixels required for one line of the image, the decompression state machine stops the data flow reading controller, and starts the data flow writing controller;

Sub-step S12: The data flow writing controller moves the data in the image line data buffer into the image frame buffer module and the output data buffer module at the same time, when the write controller operation is completed, a pulse is generated, and the start line counter is incremented by 1, marking 1 Row data processing is complete.

Sub-step S13: Repeat sub-steps S11 and S12 until the line counter counts all the lines of a frame of image.

When this state operation is completed, a complete frame of original image has been saved in the image frame data buffer module, and a complete frame of image data is also output from the output terminal. Thereafter, the decompression state control machine goes to the next state.

Step S1A: Scan the preset alignment code in the compressed image data stream, continue searching if no preset alignment code is found, and proceed to step S2 if a preset alignment code is found.

In this step, the image decompression process is in state 2. In state 2, for the data segment (2), use the SOF retrieval module to scan the input data stream, and continue searching if no preset alignment code is found; if a preset alignment is found The code generates a trigger pulse, starts the decompression state control machine, and starts to enter the image line decompression mode; (here, the alignment code is a preset value or an agreed value, for example: the pixel values of one line are all 0xFFFF, and the pixel values of the next line are all 0x0000 , such as data with a huge mutation in the gray value between two consecutive adjacent rows.)

Step S2: Read and judge whether the compressed data of each image row in each row of the i-th frame is within the preset threshold range, and if the compressed image data is within the threshold range, then compare the compressed data of the image row with the basis of the same coordinates Add the image data, if the image line compressed data exceeds the threshold range, read the image line uncompressed data corresponding to the over-range data, and add it to the basic image data with the same coordinates, and calculate the i-th frame Complete the data image and use it as the new base image data.

Among them, i is a positive integer, and its initial value is 2. Step S2 includes the following sub-steps:

Sub-step S21: read the jth line of image data from the basic image data.

Wherein, j is a positive integer, and its initial value is 1. The decompression state control machine starts the data stream writing controller, and reads out one row (the jth row) basic image data to the image row data cache from the image frame data cache module;

Sub-step S22: Read the compressed data of the k-th image line in the j-th line in the i-th frame.

Wherein, k is a positive integer, and its initial value is 1.

In this step, the image decompression process is in state 3, and state 3 is for (3) data segment, and the decompression state control machine starts the data stream reading controller, counter and comparator, and the data stream reading controller reads the compressed data stream successively The image row compressed data in the image row, and the currently read-in data (such as the k-th image row compressed data of the j-th row) is transmitted to the comparator and the adder.

Sub-step S23: judge whether the image line compressed data is within the preset threshold range, if yes, add the image line compressed data to the basic image data of the same coordinates, if not, store the image line uncompressed data corresponding coordinates.

In the comparator, compare and judge the currently read-in data with the preset threshold value. If the currently read-in data is within the range indicated by the threshold value, the comparator will trigger the adder, and the adder will fetch the data from the image line data cache and the current Read the data of the same coordinate address of the image line compressed data and sum it with the currently read image line compressed data, then write the calculation result into the image line data cache, and update the image line data in the image line data cache. If it is outside the range indicated by the threshold, the comparator triggers the OV address register, and writes the coordinate address of the currently read pixel data into the OV address register.

This step realizes the inverse process of a case in δ(p, l, f)=gray(p, l, f)-gray(p, l, f-1) (that is, the pixel value of the current row and the adjacent upper The difference of pixel values corresponding to the same position line in a frame of image is within the set threshold range), that is, according to the read-in data B(p, l, f) and gray (p, l, f) in the image line data cache f-1), solve to get gray(p, l, f). If it is outside the range indicated by the threshold, trigger the OV address register, write the current pixel address into this register, and wait for the next operation.

Sub-step S24: judge whether the value of k is the number of pixels contained in the jth row, if not, then set k=k+1, return to S22 to process the compressed data of the next image row in the jth row, if so, then enter step S25 .

In the above process, the data counter records the number of image line compressed data read by the data stream reading controller, that is, it is judged whether the value of k reaches the number of pixels contained in the jth line, when the data counter is full of the image line After the required number of pixels, the compressed data of the k-th image line is the compressed data of the last image line of the j-th line, and the state is transferred to the next state.

Sub-step S25: Read the uncompressed data of the image row corresponding to the storage coordinates one by one, and add it to the basic image data of the same coordinates to obtain the image data of the jth row of the i-th frame, and use it to update the basic image The jth row of the data.

In this step, the image decompression process is in state 4, and state 4 is for (4) data segment, and the decompression state control machine scans the address data recorded in the OV address register one by one, and the decompression state control machine triggers the adder from the image row data cache Take out the data at the same coordinate address, and read the data obtained by the data flow controller at this time, and send the data read from the same address as the image line data cache to the adder for calculation, and then write the calculation result back to the corresponding image line data cache within the coordinate address of . Start the data flow writing controller, and move the data in the image row data buffer to the image frame data buffer module and the output data buffer module. At this point, the refreshing of the new image line in the image frame data buffer module and the output of the new image line are actually completed. When the data flow is written into the controller and the output is completed, a pulse is generated at the same time, and the start line counter is increased by 1, indicating that the data processing of one line is completed.

This step realizes the inverse process of another case in δ(p, l, f)=gray(p, l, f)-gray(p, l, f-1) (that is, the pixel value of the current row is the same as that of the adjacent The difference of the corresponding pixel value of the same position row in the previous frame of image, in the case outside the set threshold range), that is, according to the read data O(p, l, f) and the gray (p, l , f-1) to obtain gray (p, l, f). When the OV address register is scanned, the decompression state machine

Sub-step S26: judge whether the value of j is the number of lines contained in the i-th frame image, if not, then set j=j+1, return to S21 to process another line of image line compressed data, if so, then obtain the i-th frame The complete data image as the new base image data;

In the above process, the line counter records the number of lines of the image data refreshed in the image frame data buffer module, that is, it is judged whether the value of j is the number of lines contained in the i-th frame image, whether the j-th line is the last line of the frame image, If the refreshing of all rows has not been completed, then set j=j+1, return to S21 to process the image row compressed data of another row, and the data flow writing controller reads the next row of image data from the image frame data cache module and caches it to the image row Data cache, decompression state controller controls data flow read controller, comparator, adder, OV address register, data counter and line counter process the next line of image data, and move the processed next line of image into the image frame data The cache module and the output data cache module complete the refresh and output of the next row of images until the decompression state machine scan line counter reaches the image height (or image row number), then the complete i-th frame is preserved in the image frame buffer module at this time image data, and the output end also outputs the complete i-th frame image data, which is used as the new basic image data.

Step S3: Determine whether the i-th frame is the last frame, if yes, complete image decompression, if not, set i=i+1, and return to S2.

Judging whether the i-th frame is the last frame (this judging process can be completed by the decompression state control machine or the data stream reading controller) if so, then complete the decompression of all image frames, if not, then set i=i+ 1. Return to step S1A to re-retrieve the next frame of image. In this step, image decompression is in state 5, and steps S1A to S3 are repeated until the decompression of all F frames of images is completed.

It should also be noted that the directional terms mentioned in the embodiments, such as "up", "down", "front", "back", "left", "right", etc., are only referring to the directions of the drawings, not Used to limit the protection scope of the present invention. Throughout the drawings, the same elements are indicated by the same or similar reference numerals. Conventional structures or constructions will be omitted when they may obscure the understanding of the present invention.

And the shape and size of each component in the figure do not reflect the actual size and proportion, but only illustrate the content of the embodiment of the present invention. Furthermore, in the claims, any reference signs placed between parentheses shall not be construed as limiting the claim.

Unless known to the contrary, the numerical parameters set forth in the specification and appended claims are approximations that can vary depending upon the desired properties obtained through the teachings of the invention. Specifically, all numbers used in the specification and claims to represent the content of components, reaction conditions, etc. should be understood to be modified by the term "about" in all cases. In general, the expressed meaning is meant to include a variation of ±10% in some embodiments, a variation of ±5% in some embodiments, a variation of ±1% in some embodiments, a variation of ±1% in some embodiments, and a variation of ±1% in some embodiments ±0.5% variation in the example.

Furthermore, the word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements.

In addition, unless specifically described or steps that must occur sequentially, the order of the above steps is not limited to that listed above and may be changed or rearranged according to the desired design. Moreover, the above-mentioned embodiments can be mixed and matched with each other or used with other embodiments based on design and reliability considerations, that is, technical features in different embodiments can be freely combined to form more embodiments.

Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, in order to streamline the present disclosure and to facilitate an understanding of one or more of the various inventive aspects, various features of the invention are sometimes grouped together in a single embodiment, figure, or its description. This method of invention, however, is not to be interpreted as reflecting an intention that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing invention. Thus, the claims following the Detailed Description are hereby expressly incorporated into this Detailed Description, with each claim standing on its own as a separate embodiment of this invention.

The specific embodiments described above have further described the purpose, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above descriptions are only specific embodiments of the present invention, and are not intended to limit the present invention. Within the spirit and principles of the present invention, any modifications, equivalent replacements, improvements, etc., shall be included in the protection scope of the present invention.

Claims (10)

1. An image decompression method, comprising: S1: read the original image data of the first frame in the image compression data stream, and use the original image data as the basic image data; S2: Read and judge whether the compressed data of each image line in each line of the i-th frame is within the preset threshold range, and if the compressed image data is within the threshold range, compare the compressed data of the image line with the basic image with the same coordinates Data addition, if the image line compressed data exceeds the threshold range, read the image line uncompressed data corresponding to the over-range data, and add it to the basic image data of the same coordinates, and calculate the complete i-th frame data image, and use it as the new base image data; S3: judge whether the i-th frame is the last frame, if so, complete the image decompression, if not, set i=i+1, and return to S2; Among them, the initial value of i is 2. 2. The image decompression method according to claim 1, wherein, step S2 further comprises: S21: Read the image data of row j from the basic image data; S22: Read the compressed data of the k-th image row in the j-th row in the i-th frame; S23: Determine whether the image row compressed data is within the preset threshold range, if so, add the image row compressed data to the basic image data at the same coordinates, if not, store the image row corresponding to the uncompressed data coordinate; S24: judge whether the value of k is the number of pixels contained in the j row, if not, then set k=k+1, return to S22 to process the compressed data of the next image line in the j row, if so, then enter step S25; S25: Read the uncompressed data of the image row corresponding to the storage coordinates one by one, and add it to the basic image data of the same coordinates to obtain the image data of the jth row of the i-th frame, and use it to update the image data of the basic image data row j; S26: Determine whether the value of j is the number of lines contained in the image of the i-th frame, if not, set j=j+1, return to S21 to process the compressed data of the image line of another line, if so, obtain the complete data of the i-th frame image as the new base image data; Wherein, both k and j are positive integers, and the initial value is 1. 3. The image decompression method according to claim 1 or 2, wherein, between S1 and S2, S1A is also included: scanning the preset alignment coding in the image compression data stream, and continuing to search when no preset alignment coding is found , enter step S2 when a preset alignment code is found. 4. An image decompression system, comprising a line decompression processing module for executing the image decompression method according to any one of claims 1 to 3. 5. The image decompression system according to claim 4, wherein, also comprising a data packet frame header detection module and an image frame data cache module; The data packet frame header detection module is used to scan the preset alignment coding in the image compressed data stream, so as to trigger the line decompression processing module to perform step S2; The image frame data caching module is used for caching basic image data, and the basic image data is original image data or image data of the i-th frame. 6. The image decompression system according to claim 5, wherein the row decompression processing module comprises a data flow read controller, a comparator, an adder, an OV address register, an image row data cache and a decompression state control machine ; The data stream reading controller is used to read the first frame of original image data, image line compressed data and image line uncompressed data in the image compression data stream, and transmit the original image frame data to the image line data cache, and image The row compressed data is sent to the comparator and the adder, and the image row uncompressed data is sent to the adder; The image row data buffer is used to receive the original image data, and write it into the image frame data buffer module, and read the image data of the jth row in the basic image data from the image frame data buffer module; The comparator is connected to the data flow reading controller, the adder and the OV address register, and is used to judge whether the compressed data of each image line is within the preset threshold range, if so, then send a trigger signal to the adder, if If not, the coordinates corresponding to the data in the super-threshold range are stored in the OV address register; The decompression state control machine is used to scan the address in the OV address register, control the data flow reading controller to read the corresponding uncompressed data of the image row, and send a trigger signal to the adder. The adder is used to add the compressed data of the image row to the basic image data of the same coordinates, and to add the uncompressed data of the image row to the basic image data of the same coordinates; The image row data buffer is also connected to an adder, which is used to transmit the basic image data of the same coordinates in the jth row of image data to the adder for calculation, and obtain the updated image data of the jth row from the adder, Pass it back to the image frame data cache module, and update the jth line of the basic image data. 7. The image decompression system according to claim 6, wherein the row decompression processing module further comprises a data stream writing controller, and the data stream writing controller is located at the image line data cache and the image frame data cache Between modules, it is used to transfer image data between image line data cache and image frame data cache modules. 8. The image decompression system according to claim 7, wherein the row decompression processing module further comprises a data counter and a row counter; The data counter is connected to the data flow reading controller, and is used to record the number of image data read by the data flow reading controller, thereby judging whether the value of k is the number of pixels included in the j row; The line counter is connected to the data stream writing controller, and is used to record the number of lines of data transmitted by the data stream writing controller, so as to determine whether the value of j is the number of lines contained in the i-th frame image. 9. The image decompression system according to claim 8, wherein the decompression state control machine is also used for collecting signals input from the data packet frame header detection module, data counter, OV address register, row counter and external users , generating image decompression process control signals according to the logic, sequentially starting/stopping the data stream reading controller, comparator, adder, and data stream writing controller according to a predetermined process, and generating a synchronous valid signal for decompressing the data stream. 10. The image decompression system according to any one of claims 4 to 9, wherein, also comprising an input data cache module and an output data cache module; The input data cache module is used to cache the image data in the image compression data stream, and transmit the data to the row decompression processing module; The output data buffering module is connected to the row decompression processing module, and is used for buffering and outputting the first frame of original image data and each subsequent frame of image data.