WO2011072620A1 - 存储处理图像序列的方法及图像序列的压缩存储处理方法 - Google Patents

存储处理图像序列的方法及图像序列的压缩存储处理方法 Download PDF

Info

Publication number
WO2011072620A1
WO2011072620A1 PCT/CN2010/079968 CN2010079968W WO2011072620A1 WO 2011072620 A1 WO2011072620 A1 WO 2011072620A1 CN 2010079968 W CN2010079968 W CN 2010079968W WO 2011072620 A1 WO2011072620 A1 WO 2011072620A1
Authority
WO
WIPO (PCT)
Prior art keywords
pixel
image
pixel value
sequence
bit
Prior art date
Application number
PCT/CN2010/079968
Other languages
English (en)
French (fr)
Inventor
于培宁
Original Assignee
珂溢鸿科技发展（北京）有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 珂溢鸿科技发展（北京）有限公司 filed Critical 珂溢鸿科技发展（北京）有限公司
Priority to US13/516,403 priority Critical patent/US8644626B2/en
Priority to EP10837057.8A priority patent/EP2515530A4/en
Publication of WO2011072620A1 publication Critical patent/WO2011072620A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N9/00—Details of colour television systems
    • H04N9/79—Processing of colour television signals in connection with recording
    • H04N9/80—Transformation of the television signal for recording, e.g. modulation, frequency changing; Inverse transformation for playback
    • H04N9/804—Transformation of the television signal for recording, e.g. modulation, frequency changing; Inverse transformation for playback involving pulse code modulation of the colour picture signal components
    • H04N9/8042—Transformation of the television signal for recording, e.g. modulation, frequency changing; Inverse transformation for playback involving pulse code modulation of the colour picture signal components involving data reduction
    • H04N9/8045—Transformation of the television signal for recording, e.g. modulation, frequency changing; Inverse transformation for playback involving pulse code modulation of the colour picture signal components involving data reduction using predictive coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/507—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction using conditional replenishment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/93—Run-length coding

Definitions

  • the invention is mainly applied to, but not limited to, the field of digital image sequence processing such as visible light image sequence, infrared image sequence, ultraviolet image sequence, laser image sequence, radar image sequence and sonar image sequence, and particularly relates to a digital image storage.
  • digital image sequence processing such as visible light image sequence, infrared image sequence, ultraviolet image sequence, laser image sequence, radar image sequence and sonar image sequence, and particularly relates to a digital image storage.
  • the existing digital image lossless storage processing method is to store the pixels of all the frames constituting the digital image without fail.
  • the main disadvantage of the digital image storage method is that the digital image has a large amount of stored information and a long storage time.
  • the size of the digital image stored is too large, that is, the number of bytes of the stored digital image file is very large, so that the transmission and interpretation of the digital image is also long, resulting in inefficiency.
  • the information processed by digital image is mostly two-dimensional information, and the amount of processing information is large.
  • a 256 X 256 low resolution black and white digital image requires approximately 64 kbit of data.
  • 768kbit data is required. If the video digital image sequence of 30 frames/second is to be processed, the data amount is required to be 500 kbit to 22. 5 Mbits per second. Therefore, the calculation speed, storage capacity, and the like of the computer are relatively high.
  • Digital image processing occupies a wide frequency band, and the occupied frequency band is several orders of magnitude larger than the language information.
  • the video digital image has a bandwidth of about 6.5 MHz, and the voice bandwidth is only about 4 kHz. Therefore, digital images are difficult to implement in terms of image processing, transmission, storage, processing, display, etc., and the cost is also high, which puts higher requirements on the band compression technology.
  • the correlation coefficient of the adjacent two pixels or the adjacent two rows in the same row in the picture may be greater than 0.9, and the correlation ratio of the image content between adjacent frames is Intra-frame correlation is generally higher.
  • This phenomenon creates conditions for digital image processing technology to compress image information.
  • the existing digital image lossless compression method utilizes statistical redundancy of data for compression. This method has the advantage of completely recovering the original data without causing any distortion. However, the compression ratio is often limited by the statistical redundancy of the data.
  • the commonly used lossless compression methods are Shannon-Fano coding, Huffman coding, run-length coding, LZW (Lempel-Ziv-Welch) coding and arithmetic coding. Wait. At the same time, there is temporal redundancy (or "time domain redundancy") between pixels of each frame image in the image sequence. When performing such lossless compression on time redundancy, a large amount is generated due to the moving vector of the recorded image pixels. Data and storage overhead.
  • the technical problem to be solved by the present invention is to provide a method for storing a sequence of processed images to solve the problem of storing a large amount of information stored in a digital image in the prior art, having a long storage time, a large occupied space, and low efficiency.
  • a method of storing a sequence of processed images comprising:
  • each pixel constituting each frame image is arranged in a known position and order in the frame image to form a pixel bit sequence
  • Step S1 After comparison, if the difference between the "pre-pixel value” and the "post-pixel value” If the absolute value is equal to zero or less than the set threshold, then the conclusion that the "pre-pixel value” is equal to the "post-pixel value” is made, and the following processing is performed:
  • the recording program updates the number of times that the "pre-pixel value" has been repeatedly repeated in the image sequence in the image sequence, and performs recording and/or storage processing;
  • the "previous pixel value” is still regarded as the "previous pixel value” and the pixel value of the same pixel order of the adjacent continuous image is updated.
  • post-pixel value performing a loop comparison, wherein the continuous frame image is adjacent to the rear-bit frame image;
  • Step S2 After comparison, if the absolute value of the difference between the "pre-pixel value” and the “post-pixel value” is greater than the set threshold, the "pre-pixel value” and the “post-pixel value” are not equal.
  • the recording program records and/or stores the number of times the "pre-pixel value" has been continuously repeated in the image sequence in the image sequence;
  • the recording program updates the number of times that the "post-pixel value" has been repeatedly repeated in the image sequence in the image sequence, and performs recording and/or storage processing;
  • the "post-pixel value” is taken as the pixel value of the new "pre-pixel value” and the same pixel order of the adjacent post-frame image.
  • a new "post-bit pixel value” is used for loop comparison, wherein the adjacent rear-bit frame image is the continuous frame image, and the continuous frame image is adjacent to the rear-bit frame image.
  • a processing step is selected from the step S1 and the step S2, and the pixel is selected. The value is processed.
  • the first pixel position of the previous bit frame image is any pixel position in the previous bit frame image.
  • the known pixel position adjacent to the "first pixel position” is the second pixel position, and the previous bit frame image in the image sequence
  • the pixel value of the second pixel position is set to "previous pixel value", which will be in the rear sequence of the image sequence adjacent to the previous bit image
  • the pixel values of the same pixel bit sequence of the frame image are set to "post-bit pixel values", and the "pre-pixel value” and "post-pixel value” are compared in any order.
  • the known pixel position adjacent to the "second pixel position” is the third pixel position, and the third pixel position of the previous bit frame image in the image sequence
  • the pixel value is set to "previous pixel value”
  • the pixel value of the same pixel bit sequence of the subsequent bit frame image adjacent to the image sequence of the previous bit frame is set to "post pixel value”, in any order.
  • the "previous pixel value” is compared with the "post pixel value”.
  • the pixel values of all pixel positions of the previous bit frame image in the image sequence are set one by one as "previous pixel values”, and the same is the same as the posterior bit frame image adjacent to the previous bit frame image in the image sequence.
  • the pixel values of the pixel bit sequence are set one by one as "post pixel values”, and each pair of "previous pixel values” and "post pixel values” in all the same pixel bit sequences are respectively compared until the images constituting the image sequence are formed.
  • the pixel values of all pixel bit orders are processed accordingly.
  • the "previous pixel value" of each pixel position of each frame of the image sequence is compared with the "post pixel value" of the same pixel order of the adjacent frame image.
  • each frame image that is set to be subjected to storage processing in all other subsequent image feature frame sequences of the image sequence and/or a pixel value that is set to a pixel bit sequence existing in each frame image that needs to be stored is preferably set. Compare processing separately.
  • the known position and order arrangement information in the image is: a first pixel position, a second pixel position, a third pixel position, ... to an nth pixel position, and all of each frame image in the image sequence
  • the order in which the effective pixels are located is sequentially positioned and expressed by coordinates.
  • the intra-image pixel bit sequence information the arrangement path of the first pixel position, the second pixel position, the third pixel position, and the nth pixel position is set according to a certain recyclable feature or The encoded bit sequence information is set.
  • the pre-frame image is any frame image in the image sequence.
  • the method for storing a sequence of processed images processes the image sequence after obtaining two frames of images before and after, until the image of the subsequent bit frame can be processed in real time, and all frame images of the image sequence are processed one by one Processing is complete.
  • the method for storing a sequence of processed images begins to process after collecting the images of the frames of the image sequence, until all frame images of the image sequence are processed one by one, or when the pair is completed.
  • the partial processing of each frame image of the image sequence begins after processing until all frame images of the image sequence are processed one by one.
  • the set threshold is related to pixel precision.
  • the set threshold can take 3, 12-bit pixels, and the set threshold can take 6, 16-bit pixels, the set threshold can be 20 .
  • the method for storing a sequence of processed images has the following advantages: First, temporal redundancy (or "time domain redundancy") of pixel values existing in an image pixel sequence in an image sequence is performed.
  • the present invention achieves the purpose of reducing the amount of data storage when storing the image sequence by statistically recording the data content repetition and applying the method of encoding the known bit sequence information of the image pixels in each relevant frame.
  • the storage space of the image is greatly reduced correspondingly, and the lossless compression encoding of the recording motion vector during storage processing saves a large amount of storage space because in the initial state.
  • the technical problem to be solved by the present invention is to provide a compression storage processing method for an image sequence to solve the temporal redundancy of pixel values existing in an image sequence of images in an image sequence in the prior art.
  • “Time Domain Redundancy” The problem of recording data generated by the motion vector during storage processing, large storage overhead, long storage time, large space occupation, and low efficiency.
  • the present invention discloses the following technical solutions:
  • a compression storage processing method for an image sequence in which a pixel constituting each frame image is arranged in a known position and order in a frame image to form a pixel bit sequence;
  • the pixel values of all pixel positions of the previous bit frame image are set one by one as the "previous pixel value" of the pixel bit sequence, and will be adjacent to the image sequence and the previous bit frame image.
  • the pixel values of the same pixel bit sequence of the bit frame image are set one by one as the "post-bit pixel value" of the pixel bit sequence.
  • each pair of "pre-pixels" in all the same pixel bit order The value is compared with the "post-pixel value";
  • each pair of "previous pixel values" and “post pixel values” in the same pixel bit sequence of the pre-frame image and the post-frame image in the image sequence Comparing, and setting a recording program for recording the number of times the "previous pixel value" is continuously repeated in the pixel bit sequence;
  • Step S1 After comparison, if the absolute value of the difference between the "pre-pixel value” and the “post-pixel value” is equal to zero or less than the second set threshold, the following processing is performed:
  • the recording program updates the number of times that the "pre-pixel value" has been repeatedly repeated in the image sequence in the image sequence, and performs recording and/or storage processing;
  • the "previous pixel value” is still used as the "previous pixel value” to continue the pixel with the same pixel order of the adjacent continuous image.
  • Value is the new "post pixel” a value of ", performing a loop comparison, wherein the continuous frame image is adjacent to the rear bit frame image;
  • Step S2 After comparing, if the absolute value of the difference between the "previous pixel value” and the “post pixel value” is greater than the second set threshold, the following processing is performed:
  • the recording program records and/or stores the number of times that the "pre-pixel value" has been repeatedly repeated in the pixel sequence in the image sequence;
  • the recording program updates the number of times that the "post-pixel value" has been repeatedly repeated in the image sequence in the image sequence, and performs recording and/or storage processing;
  • the "post-pixel value” is taken as the new "pre-pixel value” and the same pixel order of the adjacent post-frame image
  • the pixel value is a new "post-bit pixel value”
  • the cyclic comparison is performed, wherein the adjacent rear-bit frame image is the continuous frame image, and the continuous frame image is adjacent to the rear-bit frame image.
  • the first pixel position of the previous bit frame image is any pixel position in the previous bit frame image.
  • the pre-frame image is any frame image in the image sequence.
  • the pre-frame image is compared with a previous adjacent frame, and the pre-frame image is compared with a subsequent bit frame image;
  • the statistical value of the sum of the corresponding "pre-pixel value” and “post-bit pixel value” unequal number of each pixel position of the current bit frame image and its previous adjacent one image is smaller than the first set threshold
  • the statistical value of the sum of the corresponding "previous pixel value” and “post pixel pixel value” of each pixel position included in the previous bit frame image and the subsequent bit frame image is equal to or greater than the first setting
  • the corresponding "post-pixel value” and "pre-pixel value” of each pixel position included in the first and second frames are not If the statistical value of the sum of equal numbers is greater than or equal to the first set threshold, then all pixels of the image of the nth frame are completely stored according to their original bit order information, and the time and/or occurrence of the processing method is The frame sequence is subjected to corresponding recording and/or storage processing.
  • the corresponding "post-pixel value” and “pre-pixel value” of each pixel position included in the first and second frames are not The statistical value of the sum of equal numbers is smaller than the first set threshold, and all "post pixel values" of the nth frame image are recorded and stored, and the recording program generates the "post pixel value” in the image.
  • the number of times the pixel sequence of the sequence has been continuously repeated is updated and recorded and/or stored.
  • the step S2 A processing step is selected to process the "pre-pixel value” and the "post-pixel value".
  • the entire frame of the previous frame is stored in the back end of the image sequence.
  • the same storage space is preferably, when the pre-frame image needs to be stored in an entire frame.
  • the entire frame of the previous frame is stored in another storage space different in the sequence of images.
  • the first set threshold is related to image resolution, for example, the first set threshold may be 30%, 70% or 50% of the image resolution.
  • the second set threshold is related to pixel precision.
  • the set threshold can be 3, 12-bit pixels
  • the set threshold can be 6, 16-bit pixels
  • the set threshold can be Take 20 etc.
  • the technical problem to be solved by the present invention is to provide a compression storage processing method for an image sequence to solve the temporal redundancy of pixel values existing in an image sequence of images in an image sequence in the prior art.
  • Time Domain Redundancy The problem of recording data generated by the motion vector during storage processing, large storage overhead, long storage time, large space occupation, and low efficiency.
  • the present invention discloses the following technical solutions:
  • a compression storage processing method for an image sequence comprising the following steps:
  • each pixel constituting each frame image is arranged in a known position and order in the frame image to form a pixel bit sequence
  • Step S1 comparing, if the "pre-pixel value” and the "post-pixel” If the value “the absolute value of the difference between the two is equal to zero, or is less than the first set threshold, then the conclusion that the "previous pixel value” is equal to the "post pixel value” is made, and the following processing is performed:
  • the recording program updates the number of times that the "previous pixel value" has been repeatedly repeated in the pixel sequence in the image sequence, and performs recording and/or storage processing;
  • the another recording program counts and/or updates the number of times or the ratio information of the "previous pixel value” and the "post pixel pixel value” that have occurred since the processing of the previous bit frame and the subsequent bit frame is not equal. And if the number or ratio is greater than or equal to the second set threshold, performing complete storage processing on all pixel values of the previous bit frame image according to the original bit sequence information, and time and frame of the processing method occurring Perform corresponding recording and storage processing;
  • the "pre-pixel value” is still Performing a loop comparison for the "pre-position pixel value” to continue the pixel value of the same pixel bit sequence of the adjacent continuous-frame image, that is, the new "post-bit pixel value", wherein the continuous frame image and the rear-bit frame image Adjacent
  • Step S2 After comparing, if the absolute value of the difference between the "pre-pixel value” and the "post-pixel value” is greater than the first set threshold, the following processing is performed:
  • the recording program records and/or stores the number of times that the "previous pixel value" has been repeatedly repeated in the pixel sequence in the image sequence;
  • the recording program updates the number information of the "post-bit pixel value" in which the pixel bit sequence in the image sequence has been continuously repeated, and performs recording and/or storage processing;
  • the another recording program updates the number of times or the ratio information that the "previous pixel value” and the "post pixel pixel value” that have occurred are not equal, if the number or ratio is greater than or equal to the second set threshold, Then performing complete storage processing on all pixel values of the previous bit frame image according to its original bit sequence information, and performing corresponding recording and storage processing on the time and frame sequence of the processing method;
  • the "post-pixel value” is taken as the new "pre-pixel value” and the same pixel order of the adjacent post-frame image
  • the pixel value is a new "post-bit pixel value”
  • the cyclic comparison is performed, wherein the adjacent rear-bit frame image is the continuous frame image, and the continuous frame image is adjacent to the rear-bit frame image.
  • step S1, step S2 is selected.
  • the first set threshold is related to pixel precision.
  • the set threshold can be 3, 12-bit pixels, and the set threshold can be 6, 16-bit pixels.
  • the threshold can be taken as 20.
  • the second set threshold is related to the image resolution, for example, the first set threshold may be 30% of the image resolution,
  • the compressed storage processing method of the image sequence has the following advantages: When using the image sequence for storage compression, when there are two consecutive frames or consecutive multiple frames, a certain proportion of the pixel bit sequence occurs. When the pixel value in the image is different from the pixel value of the same pixel sequence in the image of the latter frame, the normal image sequence compression storage method does not achieve the desired compression effect, and the above-described compression storage processing method is adopted. When the pixel value in the pixel sequence of more than a certain ratio of two frames of images is different from the pixel value of the same pixel bit sequence in the image of the latter frame, the latter frame is stored as a whole, and is not stored on each pixel bit sequence. The pixels are marked as repeated times, saving more than 50% of the compression space and being lossless compression.
  • Figure 2 is a diagram showing the arrangement of pixel positions in the image sequence "in accordance with the known order of image pixels”. a schematic diagram for encoding the sequence of images;
  • FIG. 3 is a schematic diagram of the present invention encoding a sequence of pixels in a sequence of pixel positions in a sequence of images that are "arranged and/or encoded according to a certain characterization";
  • FIG. 4 is a schematic structural diagram of an image sequence coding principle of the present invention.
  • FIG. 5 is a schematic diagram of coding an image sequence in a sequence of pixel positions in a sequence of image pixels according to an image sequence
  • FIG. 6 is a schematic structural diagram of the principle that the recording device stores the same pixel value of the same pixel bit sequence in the image sequence as a repetition number;
  • Figure 7 is a schematic diagram showing the principle structure of image sequence coding
  • FIG. 8 is a schematic structural diagram of an embodiment of a compression storage processing method for an image sequence according to the present invention
  • FIG. 9 is a schematic structural diagram of another embodiment of a compression storage processing method for an image sequence according to the present invention.
  • the present invention provides a method for storing a sequence of processed images by statistically recording a method of repeating the content of the data to achieve the purpose of reducing the amount of data stored when the image is stored. At the same time, since the amount of information stored in the image is effectively reduced, the storage space of the image is greatly reduced, the data and storage overhead are reduced, and the lossless storage is achieved.
  • the present invention provides a method for storing a sequence of processed images in which pixels constituting each frame image are arranged in accordance with their known positions and orders in the frame image to form a pixel bit sequence. (Step 101);
  • Step S1 After comparison, if the absolute value of the difference between the "pre-pixel value” and the "post-pixel value” is equal to zero or less than or equal to the set threshold (step 103), the following processing is performed:
  • the recording program updates the number of times that the "pre-pixel value" has been repeatedly repeated in the pixel sequence in the image sequence, and performs recording and/or storage processing (step 105);
  • Step S2 After comparison, if the absolute value of the difference between the "pre-pixel value” and the "post-pixel value” is greater than or equal to the set threshold (step 104), the following processing is performed:
  • the recording program records and/or stores the number of times that the "pre-pixel value" has been repeatedly repeated in the image sequence in the image sequence (step 106);
  • the recording program updates the number of times that the "post-bit pixel value" has been repeatedly repeated in the image sequence in the image sequence, and performs recording and/or storage processing;
  • the "post-bit pixel value” is taken as the pixel value of the new "pre-pixel value” and the same pixel bit sequence of the adjacent post-frame image.
  • the new "post-bit pixel value” is subjected to loop comparison, wherein the adjacent rear-bit frame image is the continuous frame image, and the continuous frame image is adjacent to the subsequent-bit frame image (step 107).
  • the known position and order arrangement information in the image are: a first pixel position, a second pixel position, a third pixel position, ... to an nth pixel position.
  • the position of the effective pixels in each frame of the image is sequentially positioned and expressed by coordinates
  • the intra-image pixel bit-order information is bit-order information formed by the known position and order information existing in the image sequence.
  • the known position and order arrangement information in the image are: a first pixel position, a second pixel position, a third pixel position, ... to an nth pixel position.
  • the position of the effective pixels in each frame of the image is sequentially positioned and expressed by coordinates
  • the bit sequence information formed by the in-frame image pixel bit sequence information is the known position and order information existing in the image sequence.
  • vector Z be the time vector of the exemplary image sequence and be the frame sequence vector that expresses the sequence of images.
  • the pixel value set to pixel bit sequence 1 in the exemplary image sequence is always the number "120" within the sequence.
  • the pixel value of the pixel bit sequence 2 in the exemplary image sequence be the number "000" or "0" in the Z-0 frame and the Z-1 frame of the image sequence; and learn from: Z-2
  • the frame starts until the Zn frame is stopped, and the pixel value of the pixel position is the number "255".
  • the starting frame image of the processed image sequence and the adjacent/subsequent frame image can start processing: In the Z-0 frame:
  • the encoding of the pixel bit sequence 1 is: The recording pixel value is "120", and the number of repetitions is set to "0" (starting value).
  • the encoding of the pixel bit sequence 2 is: The recording pixel value is "0", and the number of repetitions is set to "0" (starting value) in the Z-1 frame:
  • the encoding of pixel bit sequence 1 is: Since the pixel value continues to be "120”, only the number of repetitions is increased by “1”, that is, the number of repetitions is now 1.
  • the encoding of pixel bit sequence 2 is: Since the pixel value continues to be "0”, only the number of repetitions is increased by "1”, that is, the number of repetitions is now 1.
  • the encoding of the pixel bit sequence 2 is: Since the pixel value is changed from “0” to "255", the recording pixel value is "255" and the number of repetitions is set to "0" (starting value).
  • the encoding of pixel bit sequence 1 is: Since the pixel value continues to be "120”, only the number of repetitions is increased by "1", that is, the number of repetitions is n.
  • the encoding of pixel bit sequence 2 is: Since the pixel value continues to be "255”, only the number of repetitions is increased by "1", that is, the number of repetitions is n-2.
  • the present invention provides a method for storing a sequence of processed images, which is repeated by statistically recording data content when storing pixel value temporal redundancy (or "time domain redundancy") of an image pixel sequence in an image sequence.
  • the method of the number of times achieves the purpose of reducing the amount of data storage when the image is stored.
  • the invention greatly reduces the amount of image data that needs to be stored, effectively reduces the amount of data required to express the same image information, improves the speed and efficiency of image data processing, and has outstanding substantive features compared with the prior art.
  • the invention solves the technical problem that the image lossless storage compression which people have been eager to solve but has not succeeded in the past, overcomes the technical prejudice that the video lossless compression compression ratio is hard to be higher than 1:51, and obtains an unexpected video.
  • the technical effect of performing lossless storage compression is described in detail below with reference to the accompanying drawings: As shown in FIG.
  • the pixel value temporal redundancy of the image pixel sequence in the image feature sequence is present (or
  • the motion vector information of the image pixels included in the sequence is recorded by using the known bit sequence information of the image pixels in the relevant frame to reduce the data when the image feature sequence is stored and processed.
  • the purpose of the quantity specifically, setting the pixel value of the previous pixel position naturally generated by the image of the image feature sequence or set to the "pre-pixel value” according to the traversable feature, will be in the sequence Rear
  • the pixel value of the same pixel bit sequence of one frame image is set to "post pixel value”
  • the "previous pixel value” is compared with the "post pixel value”
  • a recording program is set for recording "previous”
  • the bit pixel value "the number of times the pixel bit sequence is repeatedly repeated;
  • Step S1 After comparison, if the absolute value of the difference between the "pre-pixel value” and the “post-pixel value” is equal to zero or less than the set threshold, the following processing is performed:
  • the recording program updates the number of times that the "pre-pixel value" has been repeatedly repeated in the image sequence in the image sequence, and performs recording and/or storage processing;
  • Step S2 After comparison, if the absolute value of the difference between the "pre-pixel value” and the “post-pixel value” is greater than the set threshold, the following processing is performed:
  • the recording program records and/or stores the number of times that the "pre-pixel value" has been repeatedly repeated in the pixel sequence in the image sequence;
  • the recording program updates the number of times that the "post-bit pixel value" has been repeatedly repeated in the image sequence in the image sequence, and performs recording and/or storage processing;
  • the first frame or a certain image image pixel sequence in the image feature sequence is encoded, and the same image pixel sequence is encoded after several or all of the frame images.
  • the adjacent two frames of images are set to the "pre-pixel value” of the pixel value of the previous pixel position which is naturally generated or set according to the traversable feature of the previous frame image of the image feature sequence.
  • comparing the "previous pixel value” with the "post pixel value” and setting a record a program for recording the number of times the "previous pixel value” is continuously repeated in the pixel bit sequence
  • the logger begins recording the number of times the "previous pixel value” is repeated continuously in the pixel order.
  • the above-mentioned storage processing method using the image feature sequence is in a technical problem, that is, when the pixel values of the same pixel position in the continuous image pixel sequence are different than a certain ratio, such as the storage method in which the pixel value and the number of repetitions are matched, Will not get a good compression effect, it is possible to increase the amount of compressed storage.
  • an embodiment of the present invention provides a compression storage processing method for an image sequence.
  • a frame sequence in an image sequence only one pixel per frame image is taken as an example, and the first frame is set.
  • the statistical value of the sum of the corresponding "post-pixel value” and "pre-pixel value” of each pixel position included in the two frames in the second frame and the third frame is less than the set threshold, in the third Frame, frame 4, frame 5, frame 6 and frame 7
  • the statistical value of the sum of the corresponding "rear pixel value” and "previous pixel value” unequal number of each pixel position included in the frame is greater than or equal to the set threshold, in the 7th frame, the 8th frame, the ninth frame
  • the statistical value of the sum of the corresponding "post-bit pixel value” and "pre-pixel value” unequal numbers of the pixel positions included in the two frames before and after the nth frame is less than the set threshold.
  • the compressed image storage process of the above image sequence is:
  • the statistical value of the sum of the corresponding "post-bit pixel value” and “pre-pixel value” of each pixel position included in the two frames before and after the comparison between the first frame and the second frame is less than a set threshold, that is, 1 frame is subjected to compression storage processing, and the processing is repeated for the pixel value of the first frame once;
  • the statistical value of the sum of the corresponding "post-bit pixel value” and “pre-pixel value” of each pixel position included in the two frames before and after the comparison between the second frame and the third frame is less than a set threshold, that is, 2 frames are subjected to compression storage processing, and the statistics of the sum of the corresponding "post-bit pixel value” and "pre-pixel value” of each pixel position included in the two frames before and after the comparison between the first frame and the second frame are unequal.
  • the value is less than the set threshold, and the first frame and the second frame are processed as the pixel values of the first frame to be repeatedly recorded twice;
  • the statistical value of the sum of the corresponding "post-bit pixel value” and the "pre-pixel value” unequal number of each pixel position included in the two frames before and after the comparison between the third frame and the fourth frame is greater than or equal to the set threshold,
  • the statistical value of the sum of the corresponding "post-bit pixel value” and “pre-pixel value” of each pixel position included in the two frames before and after the comparison between the third frame and the second frame is less than the set threshold, still All the pixels in 3 frames are stored in accordance with their known bit sequence information and/or bit sequence information set and encoded by the human intervention method, and the pixel values in the pixel bit sequence in the third frame image are preceded by
  • the second frame of the adjacent frame is compared and stored as a continuous repetition number, and the third frame is subjected to compression storage processing, and the processing is repeated for the pixel value of the second frame; since the second frame is compared with the first frame,
  • the statistical value of the sum of the corresponding "post-bit pixel value" and “pre-pixel value” unequal number of each pixel position included in the two frames before and after the comparison between the fourth frame and the fifth frame is greater than or equal to a set threshold, that is,
  • the fourth frame is subjected to compression storage processing, and the processing is to perform complete storage processing on all the pixels of the fourth frame according to the known bit sequence information and/or the bit sequence information set and/or encoded by the human intervention method. And performing corresponding recording and/or storage processing on the time at which the processing method occurs and/or the frame sequence in the sequence of images;
  • the statistical value of the sum of the corresponding "rear pixel value” and “previous pixel value” unequal number of each pixel position included in the two frames before and after the comparison between the fifth frame and the sixth frame is greater than or equal to a set threshold, that is,
  • the fifth frame is subjected to compression storage processing, and the processing is to perform complete storage processing on all the pixels of the fifth frame according to the known bit sequence information and/or the bit sequence information set and/or encoded by the human intervention method.
  • the statistical value of the sum of the corresponding "post-bit pixel value” and "pre-pixel value” of each pixel position included in the two frames before and after the n-th frame and the n-th frame is less than a set threshold, that is, The 7th frame to the nth frame are subjected to compression storage processing, and the processing is repeated for n-6 times for the pixel value of the 7th frame.
  • another embodiment of the present invention provides a compression storage processing method for an image sequence.
  • a frame sequence in an image sequence only one pixel per frame image is taken as an example, and is set to be 1
  • the statistical value of the sum of the corresponding "post-bit pixel value" and "pre-pixel value” unequal number of each pixel position included in the frame, the second frame, and the third frame is greater than or equal to the set threshold.
  • the corresponding "post-bit pixel value" and "pre-pixel value” of each pixel position included in the two frames before and after the third frame, the fourth frame, the fifth frame, the sixth frame, and the seventh frame are not equal.
  • the statistical value of the sum is less than the set threshold, and the corresponding "post-pixel value” and “pre-pixel” of each pixel position included in the two frames before and after the 7th frame, the 8th frame, the ninth frame, and the nth frame
  • the value of the value "the sum of the unequal numbers is greater than or equal to the set threshold.
  • the image sequence is compressed and stored as:
  • the statistical value of the sum of the corresponding "post-bit pixel value" and "pre-pixel value” of each pixel position included in the first frame and the second frame before and after the second frame is greater than or equal to a set threshold, that is, 1 frame performs compression storage processing, and the processing is to perform complete storage processing on all the pixels of the first frame according to the known bit sequence information and/or the bit sequence information set and/or encoded by the human intervention method, and The time when the processing method occurs and/or the frame sequence in the image sequence are correspondingly recorded and/or stored.
  • the entire frame image of the first frame is stored at the back end of the image sequence. Same storage space;
  • the statistical value of the sum of the corresponding "post-bit pixel value" and "pre-pixel value” of each pixel position included in the two frames before and after the second frame and the third frame is greater than or equal to a set threshold, that is, 2 frames are subjected to compression storage processing, and the processing is to perform complete storage processing on all the pixels of the second frame according to the known bit sequence information and/or the bit sequence information set and/or encoded by the human intervention method, and The time when the processing method occurs and/or the frame sequence in the image sequence are correspondingly recorded and/or stored.
  • the second frame image needs to be stored in the entire frame, the second frame image is stored in the image sequence backend. Same storage space;
  • the statistical value of the sum of the corresponding "post-bit pixel value” and "pre-pixel value” of each pixel position included in the two frames before and after the two frames is set to a threshold value, that is, the first 3 frames are subjected to compression storage processing, that is, the processing is repeated for the pixel value of the third frame once;
  • the statistical value of the sum of the corresponding "post-bit pixel value” and “pre-pixel value” of each pixel position included in the two frames before and after the comparison between the fourth frame and the fifth frame is less than a set threshold, that is, The 3rd frame and the 4th frame are subjected to compression storage processing, that is, the processing is repeated twice for the pixel value of the third frame; and the corresponding "rear position" of each pixel position included in the two frames before and after the comparison of the sixth frame and the seventh frame Pixel value "and” before
  • the statistical value of the sum of the corresponding "rear pixel value” and “previous pixel value” unequal number of each pixel position included in the two frames before and after the comparison between the seventh frame and the eighth frame is greater than or equal to the set threshold
  • the statistical value of the sum of the corresponding "post-bit pixel value” and “pre-pixel value” of each pixel position included in the two frames before and after the comparison between the seventh frame and the sixth frame is less than the set threshold
  • still 7 frames are performed for all pixels in accordance with their known bit sequence information and/or bit sequence information set and/or encoded by a human intervention method, and the pixel values in the pixel bit sequence in the 7th frame image are performed.
  • the number of consecutive repeated occurrences is stored, and the 7th frame is subjected to compression storage processing, and the processing is repeated for the pixel value of the 6th frame; since the 6th frame and the 3rd frame are Comparing the statistics of the sum of the corresponding "post-pixel value” and "pre-pixel value” of each pixel position included in the two frames before and after is smaller than the set threshold, that is, pressing the third to third frames Shrink storage processing is the pixel value of the third frame is heavy Repeat 5 times;
  • the statistical value of the sum of the corresponding "rear pixel value” and "previous pixel value” unequal number of each pixel position included in the two frames before and after the n-1th frame is greater than or equal to a set threshold , that is, the n-1th frame is subjected to compression storage processing, and is processed as a bit sequence in which all pixels of the n-1th frame are set and/or encoded according to their known bit order information and/or by a human intervention method.
  • the information is subjected to complete storage processing, and the recording and/or storage processing is performed on the time when the processing method occurs and/or the frame sequence in the image sequence, and the n-1th frame image is stored in the entire frame, and the nth is - 1 frame image is stored in the same storage space at the back end of the image sequence;
  • the statistical value of the sum of the corresponding "rear pixel value” and "previous pixel value” unequal number of each pixel position included in the two frames before and after the nth frame and the n-1th frame is greater than or equal to a set threshold , that is, performing compression storage processing on the nth frame, and processing is performed to complete all the pixels of the nth frame according to the known bit sequence information and/or the bit sequence information set and/or encoded by the human intervention method.
  • the n-th frame image needs to be stored in the entire frame, the n-th frame image is stored in the entire frame.
  • the image storage backend has the same storage space.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Image Processing (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Television Signal Processing For Recording (AREA)

Description

存储处理图像序列的方法及图像序列的压缩存储处理方法 技术领域
本发明主要应用于但不局限于可见光光学图像序列、 红外线图像序列、 紫外线图像序 列、 激光图像序列、 雷达图像序列及声纳图像序列等的数字图像序列处理领域， 特别涉及 一种数字图像的存储方法及图像序列的压縮存储处理方法。 背景技术
目前现有的数字图像无损存储处理方法是将组成数字图像的所有帧的像素完整 不漏地进行存储处理， 这种数字图像的存储方法的主要缺点是数字图像的存储信息量 庞大， 存储时间长， 且存储出来的数字图像的体积过大， 即存储出来的数字图像文件 的字节数非常大， 这样数字图像的传输和解读显示的时间也长， 导致效率低下。
数字图像处理的信息大多是二维信息， 处理信息量很大。 如一幅 256 X 256低分辨 率黑白数字图像， 要求约 64kbit的数据量。 对高分辨率彩色 512 X 512数字图像， 则 要求 768kbit数据量。 如果要处理 30帧 /秒的视频数字图像序列， 则每秒要求 500kbit〜22. 5Mbit数据量。 因此对计算机的计算速度、 存储容量等要求较高。
数字图像处理占用的频带较宽， 与语言信息相比， 占用的频带要大几个数量级。 如视频数字图像的带宽约 5. 6MHz , 而语音带宽仅为 4kHz左右。 因此， 数字图像在成 像、 传输、 存储、 处理、 显示等各个环节的实现上， 技术难度较大， 成本亦高， 这就 对频带压縮技术提出了更高的要求。
数字图像中各个像素内容或像素值往往具有很高的相关性。 以一帧视频画面而 言， 画面内同一行中相邻两个像素或相邻两行间的像素， 其相关系数可达 0. 9以上， 而相邻两帧之间图像内容的相关性比帧内相关性一般说还要更高些。 这个现象为数字 图像处理技术对图像信息进行压縮创造了条件。 现有的数字图像无损压縮方法， 是利 用数据的统计冗余进行压縮， 这种方法的优势在于可完全回复原始数据而不引起任何 失真。 但压縮率往往受到数据统计冗余度的限制， 经常使用的无损压縮方法有 Shannon-Fano 编码， Huffman 编码，游程（Run-length)编码， LZW (Lempel-Ziv-Welch) 编码和算术编码等。 同时， 图像序列中各帧图像的像素间还存在时间冗余 （或称 "时 域冗余" ） ， 在对这类时间冗余进行无损压縮时， 因为记录图像像素的移动向量而 产生大量数据和存储开销。 发明内容
一方面， 本发明所要解决的技术问题是要提供一种存储处理图像序列的方法， 以 解决在现有技术下存储数字图像存储信息量大、 存储时间长、 占用空间大、 效率低下 的问题。
为解决上述技术问题， 根据本发明提供的的具体实施例， 本发明公布了如下技术 方案： 一种存储处理图像序列的方法， 包括：
在图像序列中，将组成各帧图像的各像素依照其在该帧图像中已知位置和顺序排 列， 形成像素位序；
将图像序列中位于前位帧图像第一像素位置的像素值设置为 "前位像素值" ，将 位于该图像序列中与前位帧图像相邻的后位帧图像的相同像素位序的像素值设置为 "后位像素值" ， 将所述 "前位像素值" 与 "后位像素值"进行比较；
设置一个记录程序， 用于记录 "前位像素值" 在该像素位序连续重复出现的次数， 在随后图像序列中， 当 "后位像素值" 与 "前位像素值"被判断为 "相等" 时， 此记 录程序记录该 "前位像素值" 在该像素位序已经连续重复出现的次数；
其中， 将 "前位像素值" 与 "后位像素值" 进行比较后， 进行如下处理： 步骤 S 1 : 经比较， 如果 "前位像素值" 与 "后位像素值" 两者之差的绝对值等 于零或小于设定阈值， 则做出 "前位像素值" 与 "后位像素值" 相等的结论， 并进行 如下处理：
对该 "前位像素值" 予以记录和 /或存储处理；
记录程序对该 "前位像素值" 在图像序列中的该像素位序已经连续重复出现的 次数信息进行更新， 并进行记录和 /或存储处理；
在图像序列中， 当还有需要处理的续帧图像时， 将此 "前位像素值" 仍作为 "前 位像素值" 继续与相邻的续帧图像的相同像素位序的像素值即新 "后位像素值" ， 进 行循环比较， 其中， 该续帧图像与所述后位帧图像相邻；
步骤 S2: 经比较， 如果 "前位像素值" 与 "后位像素值" 两者之差的绝对值大 于设定阈值， 则做出 "前位像素值" 与 "后位像素值" 不相等的结论， 并进行如下处 理：
对该 "前位像素值" 予以记录和 /或存储处理；
记录程序对该 "前位像素值" 在图像序列中的该像素位序已经连续重复的次数 信息进行记录和 /或存储处理；
对该 "后位像素值" 予以记录和 /或存储处理；
记录程序对该 "后位像素值" 在图像序列中的该像素位序已经连续重复出现的 次数信息进行更新， 并进行记录和 /或存储处理；
在图像序列中， 当还有需要处理的续帧图像时， 将此 "后位像素值" 作为新的 "前位像素值" 与相邻的后位帧图像的相同像素位序的像素值即新 "后位像素值" ， 进行循环比较， 其中， 该相邻的后位帧图像即为该续帧图像， 该续帧图像与所述后位 帧图像相邻。
优选的， 当 "前位像素值" 与 "后位像素值" 两者之差的绝对值等于设定阈值 时， 从所述的步骤 Sl、 步骤 S2中选定一个处理步骤， 对所述像素值进行处理。
优选的， 所述前位帧图像的第一像素位置为该前位帧图像中的任一像素位置。 优选的， 在同一图像序列中， 依照像素在图像中已知位置， 与 "第一像素位置" 相邻的、 已知的像素位置为第二像素位置， 将在图像序列中的前位帧图像的第二像素 位置的像素值设置为 "前位像素值" ， 将处于该图像序列中与前位帧图像相邻的后位 帧图像的相同像素位序的像素值设置为 "后位像素值" ， 以任何顺序对所述 "前位像 素值" 与 "后位像素值" 进行比较。
优选的， 在同一图像序列中， 在与所述的 "第二像素位置"相邻的、 已知的像素 位置为第三像素位置， 将在图像序列中的前位帧图像的第三像素位置的像素值设置为 "前位像素值" ， 将处于该图像序列与前位帧图像相邻的后位帧图像的相同像素位序 的像素值设置为 "后位像素值" ， 以任何顺序对所述 "前位像素值" 与 "后位像素 值"进行比较。
优选的， 将在图像序列中的前位帧图像的所有像素位置的像素值逐一设置为 "前 位像素值" ， 将处于该图像序列中与前位帧图像相邻的后位帧图像的相同像素位序的 像素值逐一设置为 "后位像素值" ， 对处于所有相同像素位序的每对 "前位像素 值" 与 "后位像素值" 分别进行比较， 直至组成该图像序列的图像的所有像素位序的 像素值均获得了相应的比较处理。
优选的，对该图像序列的每帧图像的每个像素位置的 "前位像素值" 与处于相邻 帧图像的相同像素位序的 "后位像素值"进行比较。
优选的，对在图像序列所有其他后续图像特征帧序中被设定为需要进行存储处理 的各帧图像和 /或被设定为需要存储处理的存在于各帧图像中像素位序的像素值分别 进行比较处理。
优选的， 所述的图像中已知位置和顺序排列信息为： 第一像素位置、 第二像素位 置、 第三像素位置……至第 n像素位置， 在图像序列中将每帧图像中的所有有效像素 所处的位置顺序通过坐标进行定位和表达。
优选的， 所述帧内图像像素位序信息： 第一像素位置、 第二像素位置、 第三像素 位置……至第 n像素位置的排列路径为按照某种可循特征而设定成为的或编码而成的 位序信息设定。
优选的， 所述的前位帧图像为图像序列中的任一帧图像。
优选的， 所述的存储处理图像序列的方法， 在得到前后两帧图像后即对所述的图 像序列进行处理， 直至可以实时处理随后位帧的图像， 将所述图像序列的所有帧图像 逐一处理完毕。
优选的， 所述的存储处理图像序列的方法， 当完成对所述的图像序列各帧图像的 收集后开始进行处理， 直至将所述图像序列的所有帧图像逐一处理完毕， 或者当完成 对所述图像序列各帧图像的部分收集后开始进行处理， 直至将所述图像序列的所有帧 图像逐一处理完毕。
优选的， 该设定阈值与像素精度有关， 例如， 8bi t像素时， 该设定阈值可以取 3， 12bit像素时， 该设定阈值可以取 6， 16bit像素时， 该设定阈值可以取 20。
与现有技术相比， 本发明提供的存储处理图像序列的方法具有以下优点： 首先， 在对具有图像序列中图像像素序列存在的像素值时间冗余（或称 "时域冗 余" ） 进行存储处理时， 本发明通过统计记录数据内容重复和应用其被编码各相关帧 内图像像素已知位序信息的方法达到对图像序列进行存储处理时减少数据存储量的 目的。 其次， 由于图像的存储处理信息量得到有效减少， 相应的极大的减少了图像的存 储空间， 相比存储处理时记录移动向量的序列无损压縮编码节省了大量的存储空间， 因为在初始状态， 对数字图像中的所有像素进行位序设定代替存储处理时记录移动向 量的序列无损压縮编码， 进而使每帧数字图像的各个像素对应的位被定义， 在像素还 原时就按照设定的路径进行位序还原； 在图像的存储处理、 传输或解读显示时能达到 了理想的效果。
另一方面，本发明所要解决的技术问题是要提供一种图像序列的压縮存储处理方 法， 以解决在现有技术下在对图像序列中图像像素序列存在的像素值时间冗余 （或称 "时域冗余" ）进行存储处理时记录移动向量产生的数据和存储开销大、存储时间长、 占用空间大、 效率低下的问题。
为解决上述技术问题， 根据本发明提供的具体实施例， 本发明公布了如下技术方 案：
一种图像序列的压縮存储处理方法， 在图像序列中， 将组成各帧图像的各像素依 照其在帧图像中已知位置和顺序排列， 形成像素位序；
将图像序列中位于前位帧图像第一像素位置的像素值设置为 "前位像素值" ， 将 位于该图像序列中与前位帧图像相邻的后位帧图像的相同像素位序的像素值设置为 "后位像素值" ， 将所述 "前位像素值" 与 "后位像素值"进行比较；
在当前被处理的图像序列中， 将前位帧图像的所有像素位置的像素值逐一设置为 该像素位序的 "前位像素值" ， 将处于该图像序列与前位帧图像相邻的后位帧图像的 相同像素位序的像素值逐一设置为该像素位序的 "后位像素值" ， 在该前、 后两帧图 像中， 对处于所有相同像素位序的每对 "前位像素值" 与 "后位像素值" 分别进行比 较；
定义一个统计机制， 用于统计前位帧图像和后位帧图像两帧间相同像素位置的像 素值不相同的数量作为统计值；
当所述统计值大于或等于第一设定阈值， 则对前位帧图像的所有像素依照其原始 位序信息进行完整的存储处理， 并对此处理方法发生的时间和 /或帧序进行相应的记 录和 /或存储处理；
当所述统计值小于所述第一设定阈值， 则对图像序列中前位帧图像和后位帧图像 的处于相同像素位序的每对 "前位像素值" 与 "后位像素值" 进行比较， 并设置一个 记录程序， 用于记录 "前位像素值"在该像素位序连续重复出现的次数；
进行如下处理：
步骤 S 1 : 经比较，如果 "前位像素值" 与 "后位像素值" 两者之差的绝对值等于 零或小于第二设定阈值， 进行如下处理：
对该 "前位像素值" 予以记录和 /或存储处理；
记录程序对该 "前位像素值" 在图像序列中的该像素位序已经连续重复出现的 次数信息进行更新， 并进行记录和 /或存储处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述 "前位像素值 " 仍作 为 "前位像素值" 继续与相邻的续帧图像的相同像素位序的像素值即新 "后位像素 值" ， 进行循环比较， 其中， 所述续帧图像与所述后位帧图像相邻；
步骤 S2 : 经比较， 如果 "前位像素值" 与 "后位像素值" 两者之差的绝对值大于 所述第二设定阈值， 进行如下处理：
对该 "前位像素值" 予以记录和 /或存储处理；
记录程序对该 "前位像素值" 在图像序列中的该像素位序已经连续重复出现的 次数信息进行记录和 /或存储处理；
对该 "后位像素值" 予以记录和 /或存储处理；
记录程序对该 "后位像素值" 在图像序列中的该像素位序已经连续重复出现的 次数信息进行更新， 并进行记录和 /或存储处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述 "后位像素值" 作为 新的 "前位像素值" 与相邻的后位帧图像的相同像素位序的像素值即新 "后位像素 值" ， 进行循环比较， 其中， 所述相邻的后位帧图像即为所述续帧图像， 所述续帧图 像与所述后位帧图像相邻。
进一步的， 所述前位帧图像的第一像素位置为该前位帧图像中的任一像素位置。 进一步的， 所述的前位帧图像为图像序列中的任一帧图像。
进一步的， 将所述前位帧图像与其前相邻一帧相比较， 同时将所述前位帧图像与 其后位帧图像相比较；
当前位帧图像与其前相邻一桢图像所包含的各像素位置的相应 "前位像素值" 与 "后位像素值" 不相等数量之和的所述统计值小于所述第一设定阈值， 同时前位帧 图像与其后位帧图像所包含的各像素位置的相应 "前位像素值" 与 "后位像素值" 不相等数量之和的所述统计值等于或大于所述第一设定阈值时， 将所述前位帧图像所 有 "前位像素值" 予以记录和 /或存储处理， 并且记录程序对该 "前位像素值"在图 像序列中的该像素位序已经连续重复出现的次数信息进行更新， 并进行记录和 /或存 储处理。
进一步的， 当所述前位帧图像为图像序列中为第 n-1帧时， 前、 后两帧中所包含 的各像素位置的相应 "后位像素值" 与 "前位像素值" 不相等数量之和的所述统计 值大于或等于第一设定阈值， 则对第 n帧图像的所有像素依照其原始位序信息进行完 整的存储处理， 并对此处理方法发生的时间和 /或帧序进行相应的记录和 /或存储处 理。
进一步的， 当所述前位帧图像为图像序列中为第 n-1帧时， 前、 后两帧中所包含 的各像素位置的相应 "后位像素值" 与 "前位像素值" 不相等数量之和的所述统计 值小于所述第一设定阈值， 将第 n帧图像所有 "后位像素值" 予以记录和存储处理， 并且记录程序对该 "后位像素值" 发生在图像序列的该像素位序已经连续重复出现 的次数信息进行更新， 并进行记录和 /或存储处理。
优选的， 经比较， 当所述 "前位像素值" 与所述 "后位像素值" 两者之差的绝对 值等于所述第二设定阈值时， 从所述的步骤 Sl、 步骤 S2中选定一个处理步骤， 对所 述 "前位像素值" 与所述 "后位像素值"进行处理。
优选的， 所述前位帧图像需整帧存储时， 将前一帧图像整帧存储在图像序列后端 同一存储空间。
优选的， 所述前位帧图像需整帧存储时， 将前一帧图像整帧存储在图像序列不同 的另一存储空间。
优选的， 该第一设定阈值与图像分辨率有关， 例如第一设定阈值可以是图像分辨 率的 30%、 70%或 50%。
优选的， 该第二该设定阈值与像素精度有关， 例如， 8bit像素时， 该设定阈值 可以取 3， 12bit像素时， 该设定阈值可以取 6， 16bit像素时， 该设定阈值可以取 20 等
另一方面，本发明所要解决的技术问题是要提供一种图像序列的压縮存储处理方 法， 以解决在现有技术下在对图像序列中图像像素序列存在的像素值时间冗余 （或称
"时域冗余" ）进行存储处理时记录移动向量产生的数据和存储开销大、存储时间长、 占用空间大、 效率低下的问题。
为解决上述技术问题， 根据本发明提供的具体实施例， 本发明公布了如下技术方 案：
一种图像序列的压縮存储处理方法， 包括如下步骤：
在图像序列中， 将组成各帧图像的各像素依照其在该帧图像中已知位置和顺序排 列， 形成像素位序；
将所述图像序列中位于前位帧图像所有像素位置的像素值逐一设置为 "前位像 素值" ， 将位于所述图像序列中与所述前位帧图像相邻的后位帧图像的相同像素位序 的像素值设置为 "后位像素值" ， 将所述 "前位像素值" 与所述 "后位像素值"进行 比较；
设置一个记录程序， 用于记录所述 "前位像素值" 在所述像素位序连续重复出现 的次数；
设置另一个记录程序， 用于统计前位帧图像的各像素值与相邻的后位帧图像的相 同像素位序的像素值不相等的次数或比例；
其中，将所述 "前位像素值" 与所述 "后位像素值" 进行比较后，进行如下处理： 步骤 S1 : 经比较，如果所述 "前位像素值" 与所述 "后位像素值" 两者之差的绝 对值等于零， 或小于第一设定阈值， 则做出所述 "前位像素值" 与所述 "后位像素 值"相等的结论， 并进行如下处理：
对所述 "前位像素值" 予以记录和 /或存储处理；
所述记录程序对所述 "前位像素值"在所述图像序列中的所述像素位序已经连 续重复出现的次数信息进行更新， 并进行记录和 /或存储处理；
所述另一记录程序对开始处理所述前位帧与所述后位帧以来已发生的 "前位像 素值" 与 "后位像素值" 不相等的次数或比例信息进行统计和 /或更新， 如果所述次 数或比例大于或等于第二设定阈值， 则对所述前位帧图像的所有像素值依照其原始位 序信息进行完整的存储处理， 并对此处理方法发生的时间和帧序进行相应的记录和存 储处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述 "前位像素值 " 仍作 为 "前位像素值" 继续与相邻的续帧图像的相同像素位序的像素值即新 "后位像素 值" ， 进行循环比较， 其中， 所述续帧图像与所述后位帧图像相邻；
步骤 S2 : 经比较， 如果所述 "前位像素值" 与所述 "后位像素值" 两者之差的绝 对值大于所述第一设定阈值， 进行如下处理：
对所述 "前位像素值" 予以记录和 /或存储处理；
所述记录程序对所述 "前位像素值"在所述图像序列中的所述像素位序已经连 续重复出现的次数信息进行记录和 /或存储处理；
对所述 "后位像素值" 予以记录和 /或存储处理；
记录程序对所述 "后位像素值"在图像序列中的所述像素位序已经连续重复出 现的次数信息进行更新， 并进行记录和 /或存储处理；
所述另一记录程序对已发生的 "前位像素值" 与 "后位像素值" 不相等的次数 或比例信息进行更新， 如果所述次数或比例大于或等于所述第二设定阈值， 则对所述 前位帧图像的所有像素值依照其原始位序信息进行完整的存储处理， 并对此处理方法 发生的时间和帧序进行相应的记录和存储处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述 "后位像素值" 作为 新的 "前位像素值" 与相邻的后位帧图像的相同像素位序的像素值即新 "后位像素 值" ， 进行循环比较， 其中， 所述相邻的后位帧图像即为所述续帧图像， 所述续帧图 像与所述后位帧图像相邻。
优选的， 当所述 "前位像素值" 与所述 "后位像素值" 两者之差的绝对值等于所 述第二设定阈值时， 从所述的步骤 Sl、 步骤 S2中选定一个处理步骤， 对所述 "前位 像素值" 与所述 "后位像素值"进行处理。
优选的， 优选的， 该第一该设定阈值与像素精度有关， 例如， 8bit像素时， 该 设定阈值可以取 3， 12bit像素时， 该设定阈值可以取 6， 16bit像素时， 该设定阈值 可以取 20。
该第二设定阈值与图像分辨率有关，例如第一设定阈值可以是图像分辨率的 30%、
70%或 50%， 或是 50次、 70次等。
与现有技术相比， 本发明提供的图像序列的压縮存储处理方法具有以下优点： 在利用图像序列进行存储压縮时， 当出现连续两帧或连续多帧中大于一定比例的 像素位序中的像素值与后一帧图像中相同像素位序的像素值不相同时， 再采用普通图 像序列压縮存储方法时就达不到理想的压縮效果， 而采用上述压縮存储处理方法， 对 两帧图像存在大于一定比例的像素位序中的像素值与后一帧图像中相同像素位序的 像素值不相同时， 把后一帧整体存储， 不再对其每个像素位序上的像素作重复次数标 记， 节省压縮空间 50%以上， 并且为无损压縮。 附图说明
图 1 是本发明的原理流程示意图；
图 2是本发明以图像序列中"按照图象像素已知产生的位序而成的" 像素位置排列顺 序来为该图像序列编码的示意图；
图 3是本发明以图像序列中"按照某种可循特征设定和 /或编码而成的 "像素位置排列顺 序来为该图像序列编码的示意图；
图 4 是本发明图像序列编码原理结构示意图；
图 5是以图像序列中按照图象像素位序而成的像素位置排列顺序来为该图像序列编码 的示意图；
图 6是以记录装置对当图像序列中相同像素位序的相同像素值作重复次数存储的原理 结构示意图；
图 7是以图像序列编码的原理结构示意图；
图 8是本发明图像序列的压縮存储处理方法的一个实施例的原理结构示意图； 图 9是本发明图像序列的压縮存储处理方法另一个实施例的原理结构示意图。 具体实施方式
为使本发明的内容、 特征和优点更加明显易懂， 下面结合附图和
具体实施例对本发明作进一步详细的说明， 但本发明并不局限于以下实施例。 本发明提供了一种存储处理图像序列的方法， 通过统计记录数据内容重复的方法 达到对图像进行存储处理时减少数据存储量的目的。 同时， 由于图像的存储处理信息 量得到有效减少， 相应的极大的减少了图像的存储空间， 减少了数据和存储开销， 并 达到了无损存储的目的。
如图 1所示， 本发明提供了一种存储处理图像序列的方法， 在图像序列中， 将组 成各帧图像的各像素依照其在该帧图像中已知位置和顺序排列， 形成像素位序 （步骤 101 ) ；
将图像序列中位于前位帧图像第一像素位置的像素值设置为"前位像素值"， 将位 于该图像序列中与前位帧图像相邻的后位帧图像的相同像素位序的像素值设置为"后 位像素值"， 将所述 "前位像素值 "与"后位像素值"进行比较 （步骤 102) ；
设置一个记录程序， 用于记录"前位像素值"在该像素位序连续重复出现的次数， 在随后图像序列中， 当"后位像素值"与"前位像素值"被判断为"相等"时， 此记录程序 记录该"前位像素值"在该像素位序已经连续重复出现的次数；
其中， 将"前位像素值"与"后位像素值"进行比较后， 进行如下处理：
步骤 S1: 经比较， 如果"前位像素值"与"后位像素值"两者之差的绝对值等于零或 小于等于设定阈值 （步骤 103 ) ， 进行如下处理：
对该"前位像素值"予以记录和 /或存储处理；
记录程序对该 "前位像素值 "在图像序列中的该像素位序已经连续重复出现的次数 信息进行更新， 并进行记录和 /或存储处理 （步骤 105 ) ；
在图像序列中， 当还有需要处理的续帧图像时， 将此"前位像素值"仍作为"前位像 素值"继续与相邻的续帧图像的相同像素位序的像素值即新"后位像素值"，进行循环比 较， 其中， 该续帧图像与该后位帧图像相邻； 步骤 S2: 经比较， 如果"前位像素值"与"后位像素值"两者之差的绝对值大于等于 设定阈值 （步骤 104) ， 进行如下处理：
对该"前位像素值"予以记录和 /或存储处理；
记录程序对该 "前位像素值 "在图像序列中的该像素位序已经连续重复出现的次数 信息进行记录和 /或存储处理 （步骤 106) ；
对该"后位像素值"予以记录和 /或存储处理；
记录程序对该 "后位像素值 "在图像序列中的该像素位序已经连续重复出现的次数 信息进行更新， 并进行记录和 /或存储处理；
在图像序列中， 当还有需要处理的续帧图像时， 将此"后位像素值"作为新的"前位 像素值 "与相邻的后位帧图像的相同像素位序的像素值即新"后位像素值"，进行循环比 较， 其中， 该相邻的后位帧图像为该续帧图像， 该续帧图像与该后位帧图像相邻 （步 骤 107) 。
如图 2所示， 在图像中已知位置和顺序排列信息为： 第一像素位置、 第二像素位 置、 第三像素位置 ......至第 n像素位置。 在图像序列中将每帧图像中的有效像素所处 位置顺序通过坐标进行定位和表达， 帧内图像像素位序信息为该图像序列中存在的已 知位置和顺序信息而成的位序信息， 对目标结果示例的说明： 设向量 Z为示范图像序 列的时间向量， 同时为表达该图像序列的帧序向量，以每帧图像设有六个像素位置为 例。
在 Z-1帧：
以示范图像序列中图像像素位置为 X=0,Y=0， Z=l (定为像素位序 WX1) ；
X=1,Y=0， Z=l (定为像素位序 WX2) ； Χ=0， Υ=1,Ζ=1 (定为像素位序 WX3) ;Χ=1, γ=1,Ζ=1 (定为像素位序 WX4) ;Χ=0， Υ=2,Ζ=1 (定为像素位序 WX5) ;Χ=1, Υ=2, Z=l (定为像素位序 WX6) 。
在 Ζ-2帧：
以示范图像序列中图像像素位置为 X=0,Y=0， Ζ=2 (定为像素位序 WX1) ；
X=1,Y=0， Ζ=2 (定为像素位序 WX2) ； Χ=0， Υ=1,Ζ=2 (定为像素位序 WX3) ;Χ=1, Υ=1,Ζ=2 (定为像素位序 WX4) ;Χ=0， Υ=2,Ζ=2 (定为像素位序 WX5) ;Χ=1, Υ=2, Ζ=2 (定为像素位序 WX6) 。 在 Ζ-Ν帧：
以示范图像序列中图像像素位置为 X=0,Y=0， Ζ=Ν (定为像素位序 WX1) ； X=1,Y=0， Ζ=Ν (定为像素位序 WX2) ； Χ=0， Υ=1,Ζ=Ν (定为像素位序 WX3) ； X=l, Υ=1,Ζ=Ν (定为像素位序 WX4) ； Χ=0， Υ=2, Ζ=Ν (定为像素位序 WX5) ； X=l, Υ=2, Ζ=Ν (定为像素位序 WX6) 。
如图 3所示， 在图像中已知位置和顺序排列信息为： 第一像素位置、 第二像素位 置、 第三像素位置 ......至第 η像素位置。 在图像序列中将每帧图像中的有效像素所处 位置顺序通过坐标进行定位和表达， 根据帧内图像像素位序信息为该图像序列中存在 的已知位置和顺序信息而成的位序信息， 对目标结果示例的说明： 设向量 Ζ为示范图 像序列的时间向量，同时为表达该图像序列的帧序向量，以每帧图像设有六个像素位置 为例。
在 Z-1帧：
以示范图像序列中图像像素位置为 X=0,Y=0,Z=1(定为像素位序 WX1);X=0,Y=1, Z=l (定为像素位序 WX2) ； X=0， Y=2 ,Z=1 (定为像素位序 WX3) ;Χ=1, Υ=2, Z=l (定为像素位序 WX4) ;Χ=1, Υ=1,Ζ=1 (定为像素位序 WX5) ;Χ=1, Υ=0, Z=l (定 为像素位序 WX6) 。
在 Ζ-2帧：
以示范图像序列中图像像素位置为 Χ=0,Υ=0,Ζ=2(定为像素位序 WX1);X=0,Y=1, Z=2 (定为像素位序 WX2) ； X=0， Y=2 ,Z=2 (定为像素位序 WX3) ;Χ=1, Υ=2, Ζ=2 (定为像素位序 WX4) ;Χ=1, Υ=1,Ζ=2 (定为像素位序 WX5) ;Χ=1, Υ=0, Ζ=2 (定 为像素位序 WX6) . 在 Ζ-Ν帧：
以示范图像序列中图像像素位置为 X=0,Y=0,Z=N (定为像素位序 WX1);X=0,Y=1,
Z=N (定为像素位序 WX2) ； X=0， Y=2 ,Z=N (定为像素位序 WX3) ;X=1, Y=2, Z=N (定为像素位序 WX4) ； X=l, Y=1,Z=N (定为像素位序 WX5) ;X=1, Y=0, Z=N (定 为像素位序 WX6) 。
由上图 2、 图 3可知， 由于应用图像序列中因图像像素已知排列而存在的位序信 息， 从而在每帧图像进行压縮时不需要记录移动向量而产生的数据和存储开销， 只需 在初始时设定好位序信息， 或者在图像序列中设定几种位序信息,这种数据开销很少， 在多帧图像序列中可以忽略不计；
如图 4所示， 对目标结果示例进行说明：
设向量 Z为示范图像序列的时间向量， 同时为表达该图像序列的帧序向量。
同时仅以示范图像序列中图像像素位置为 x=0,y=0 (像素位序 1) ； x=l,y=0 (像 素位序 2) 两个像素序列为例。
设位于示范图像序列中像素位序 1的像素值在该序列内始终为数字" 120"。
设位于示范图像序列中像素位序 2的像素值在该图像序列的 Z-0帧和 Z-1帧内的 图像像素值为数字 "000"或" 0"; 同时得知： 自 Z-2帧开始直到 Z-n帧止， 像素位置的 像素值为数字 "255"。 但对被处理的图像序列的起始帧图像与比邻 /随后帧图像可以开始处理时： 在 Z-0帧：
像素位序 1的编码为： 记录像素值为 "120"， 其重复次数设为 "0" (起始值） 像素位序 2的编码为： 记录像素值为 "0"， 其重复次数设为 "0" (起始值） 在 Z-1帧：
像素位序 1的编码为： 由于像素值继续为" 120"， 仅将其重复次数增加 "1"， 即重 复次数现在为 1 。 像素位序 2的编码为： 由于像素值继续为 "0"， 仅将其重复次数增加 "1"， 即重复 次数现在为 1。
在 Z-2帧：
像素位序 1的编码为： 由于像素值继续为" 120"， 仅将重复次数增加" 1"， 即重复 次数现在为 2 。
像素位序 2的编码为： 由于像素值从 "0"变为" 255"， 因此记录像素值为" 255"、 将 其重复次数设为 "0" (起始值） 。
在 Z-3帧：
像素位序 1的编码为： 由于像素值继续为" 120"， 仅将其重复次数增加 "1"， 即重 复次数现在为 3 。
像素位序 2的编码为： 由于像素值继续为" 225"， 仅将其重复次数增加 "1"， 即重 复次数现在为 1。 在 Z-n帧：
像素位序 1的编码为： 由于像素值继续为" 120"， 仅将其重复次数增加 "1"， 即重 复次数为 n。
像素位序 2的编码为： 由于像素值继续为" 255"， 仅将其重复次数增加 "1"， 即重 复次数为 n-2。
由上图 4所示， 在图像序列中就每帧的相同像素位序当连续出现相同像素值时就 不必重复存储， 即在连续数帧图像相同像素位序中相同像素值时， 可以采用简便乘法 记忆。
本发明提供了一种存储处理图像序列的方法， 在对具有图像序列中图像像素序列 存在的像素值时间冗余 （或称"时域冗余"） 进行存储处理时， 通过统计记录数据内容 重复次数的方法达到对图像进行存储处理时减少数据存储量的目的； 同时结合在图像 序列中就每帧的相同像素位序当连续出现相同像素值时就不必重复记忆法达到更进 一步避免因记录数据和存储开销。
本发明大幅减少了需要进行存储处理的图像数据量， 有效地减少了表达相同图像 信息所需的数据量， 提高了图像数据处理的速度和效率， 相对于现有技术具有突出的 实质性特点和显著的技术进步。 本发明解决了人们一直以来渴望解决但终未获成功的 图像无损存储压縮的技术难题， 克服了视频无损压縮压縮比难以高于 1 : 51的技术偏 见， 取得了意想不到的对视频进行无损存储压縮的技术效果。 下面结合附图对本发明提供的图像序列的压縮存储处理方法进行详细的描述： 如图 5所示,在图像序列中，对具有图像特征序列中图像像素序列存在的像素值时 间冗余 （或称"时域冗余"） 进行存储处理时， 应用其被编码各相关帧内图像像素已知 位序信息记录该序列包含的图像像素的移动向量信息达到减少对图像特征序列存储 处理时的数据量的目的;具体为将图像特征序列的前一帧图像的自然产生的或按照可 循特征而设定成为的前一像素位置的像素值设置为"前位像素值"， 将处于该序列的后 一帧图像的相同像素位序的像素值设置为 "后位像素值"，将所述 "前位像素值 "与"后位 像素值 "进行比较， 并设置一个记录程序， 用于记录"前位像素值"在该像素位序连续重 复出现的次数；
进行如下处理：
步骤 S1: 经比较， 如果"前位像素值"与"后位像素值"两者之差的绝对值等于零或 小于设定阈值， 进行如下处理：
对该"前位像素值"予以记录和 /或存储处理；
记录程序对该 "前位像素值 "在图像序列中的该像素位序已经连续重复出现的次数 信息进行更新， 并进行记录和 /或存储处理；
步骤 S2: 经比较， 如果"前位像素值"与"后位像素值"两者之差的绝对值大于设定 阈值， 进行如下处理：
对该"前位像素值"予以记录和 /或存储处理；
记录程序对该 "前位像素值 "在图像序列中的该像素位序已经连续重复出现的次数 信息进行记录和 /或存储处理；
对该"后位像素值"予以记录和 /或存储处理；
记录程序对该 "后位像素值 "在图像序列中的该像素位序已经连续重复出现的次数 信息进行更新， 并进行记录和 /或存储处理；
将图像特征序列中第一帧或某一帧图像像素序列进行编码， 在此帧图像以后数帧 或全部采用相同的图像像素序列进行编码。
如图 6所示， 将相邻两帧图像将图像特征序列的前一帧图像的自然产生的或按照 可循特征而设定成为的前一像素位置的像素值设置为"前位像素值"， 将处于该序列的 后一帧图像的相同像素位序的像素值设置为"后位像素值"，将所述 "前位像素值 "与"后 位像素值"进行比较， 并设置一个记录程序， 用于记录"前位像素值"在该像素位序连续 重复出现的次数， 在随后图像特征序列中， 当"后位像素值"与"前位像素值"被判断为 "相等 "时， 此记录程序开始记录该"前位像素值"在该像素位序连续重复出现的次数。
如图 7所示， 通过将图像特征序列中的图像像素序列进行编码定位， 再把前后相 邻的两图像相同像素序列的像素值进行比较， 同时设置记录装置， 用于准确记录 "'前 位像素值'在该像素位置连续重复出现的次数。这种利用图像特征序列的存储处理方法 对前后相邻的两图像相同像素序列的像素值进行比较， 就相同像素值免去了重复记 忆， 即某一像素序列中的连续出现相同像素值时， 只需记录成像素值及重复次数， 连 续相同像素序列中相同像素值重复次数越多， 相应的压縮空间就越大。
但上述利用图像特征序列的存储处理方法处在一个技术问题， 即当连续图像像素 序列中相同像素位置的像素值超过一定比例不相同时， 如采用上述像素值及重复次数 相匹配的存储方法， 将得不到很好的压縮效果， 有可能还增加压縮存储量。
如图 8所示， 本发明的一个实施例提供了一种图像序列的压縮存储处理方法， 在 图像序列中的帧序中， 以每帧图像只有一个像素值为例， 设在第 1帧、 第 2帧和第 3 帧中前后两帧中所包含的各像素位置的相应"后位像素值"与"前位像素值"不相等数量 之和的统计值小于设定阈值， 在第 3帧、 第 4帧、 第 5帧、 第 6帧和第 7帧中前后两 帧中所包含的各像素位置的相应"后位像素值"与"前位像素值"不相等数量之和的统计 值大于或等于设定阈值， 在第 7帧、 第 8帧、 第 9帧一直到第 n帧中前后两帧中所包 含的各像素位置的相应"后位像素值"与"前位像素值"不相等数量之和的统计值小于设 定阈值。
根据本发明技术方案对上述一图像序列进行压縮存储处理为：
第 1帧与第 2帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值小于设定阈值， 即对第 1帧进行压縮存储处理， 处理为第 1帧的像素值重复记录 1次；
第 2帧与第 3帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值小于设定阈值， 即对第 2帧进行压縮存储处理， 由于第 1帧与第 2帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值小于设定阈值， 将第 1帧和第 2帧处理为第 1帧 的像素值重复记录 2次；
第 3帧与第 4帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值大于或等于设定阈值， 由于第 3帧与第 2帧相比 较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像素值"不相等数量之 和的统计值小于设定阈值，依然对第 3帧进行所有像素依照其已知位序信息和 /或通过 人为干预方法而设定和编码而成的位序信息进行存储处理， 并将第 3帧图像中像素位 序中的像素值与其前相邻一帧第 2帧比较作连续重复次数存储记录， 对第 3帧进行压 縮存储处理， 处理为第 2帧的像素值重复记录 1次； 由于第 2帧与第 1帧相比较前后 两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像素值"不相等数量之和的统 计值小于设定阈值， 即对第 1帧、 第 2帧和第 3帧进行压縮存储处理为第 1帧的像素 值重复记录 3次；
第 4帧与第 5帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值大于或等于设定阈值， 即对第 4帧进行压縮存储 处理，处理为将第 4帧所有像素依照其已知位序信息和 /或通过人为干预方法而设定和 /或编码而成的位序信息进行完整的存储处理， 并对此处理方法发生的时间和 /或该图 像序列中的帧序进行相应的记录和 /或存储处理；
第 5帧与第 6帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值大于或等于设定阈值， 即对第 5帧进行压縮存储 处理，处理为将第 5帧所有像素依照其已知位序信息和 /或通过人为干预方法而设定和 /或编码而成的位序信息进行完整的存储处理， 并对此处理方法发生的时间和 /或该图 像序列中的帧序进行相应的记录和 /或存储处理； 第 7帧与第 8帧前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像素 值"不相等数量之和的统计值小于设定阈值， 即对第 7帧进行压縮存储处理， 处理为 第 7帧的像素值重复记录 1次；
第 8帧与第 9帧前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像素 值"不相等数量之和的统计值小于设定阈值， 即对第 7帧和第 8帧进行压縮存储处理， 处理为第 7帧的像素值重复记录 2次； 第 n-1帧与第 n帧前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像 素值"不相等数量之和的统计值小于设定阈值， 即对第 7帧、第 8第至第 n-1帧进行压 縮存储处理， 处理为第 7帧的像素值重复记录 n-7次；
第 n帧与第 n-1帧前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像 素值"不相等数量之和的统计值小于设定阈值， 即对第 7帧至第 n帧进行压縮存储处 理， 处理为第 7帧的像素值重复记录 n-6次。
如图 9所示， 本发明的另一个实施例提供了一种图像序列的压縮存储处理方法， 在图像序列中的帧序中， 以每帧图像只有一个像素值为例， 设在第 1帧、 第 2帧和第 3帧中前后两帧中所包含的各像素位置的相应"后位像素值"与"前位像素值"不相等数 量之和的统计值大于或等于设定阈值， 在第 3帧、 第 4帧、 第 5帧、 第 6帧和第 7帧 中前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像素值"不相等数量之 和的统计值小于设定阈值， 在第 7帧、 第 8帧、 第 9帧一直到第 n帧中前后两帧中所 包含的各像素位置的相应"后位像素值"与"前位像素值"不相等数量之和的统计值大于 或等于设定阈值。
根据本发明技术方案对上述图像序列进行压縮存储处理为：
第 1帧与第 2帧前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像素 值"不相等数量之和的统计值大于或等于设定阈值， 即对第 1帧进行压縮存储处理， 处理为将第 1帧所有像素依照其已知位序信息和 /或通过人为干预方法而设定和 /或编 码而成的位序信息进行完整的存储处理，并对此处理方法发生的时间和 /或该图像序列 中的帧序进行相应的记录和 /或存储处理， 第 1帧图像需整帧存储时， 将第 1帧图像整 帧存储在图像序列后端同一存储空间；
第 2帧与第 3帧前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像素 值"不相等数量之和的统计值大于或等于设定阈值， 即对第 2帧进行压縮存储处理， 处理为将第 2帧所有像素依照其已知位序信息和 /或通过人为干预方法而设定和 /或编 码而成的位序信息进行完整的存储处理，并对此处理方法发生的时间和 /或该图像序列 中的帧序进行相应的记录和 /或存储处理， 第 2帧图像需整帧存储时， 将第 2帧图像整 帧存储在图像序列后端同一存储空间；
第 3帧与第 4帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值小设定阈值， 即对第 3帧进行压縮存储处理， 即 处理为第 3帧的像素值重复记录 1次；
第 4帧与第 5帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值小于设定阈值， 即对第 3帧和第 4帧进行压縮存 储处理， 即处理为第 3帧的像素值重复记录 2次； 第 6帧与第 7帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值小设定阈值， 即对第 3帧至第 6帧进行压縮存储 处理， 即处理为第 3帧的像素值重复记录 4次；
第 7帧与第 8帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前 位像素值"不相等数量之和的统计值大于或等于设定阈值， 由于第 7帧与第 6帧相比 较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像素值"不相等数量之 和的统计值小于设定阈值，依然对第 7帧进行所有像素依照其已知位序信息和 /或通过 人为干预方法而设定和 /或编码而成的位序信息进行存储处理，并将第 7帧图像中像素 位序中的像素值与其前相邻一帧第 6帧比较作连续重复出现次数存储记录， 对第 7帧 进行压縮存储处理， 处理为第 6帧的像素值重复记录 1次； 由于第 6帧与第 3帧相比 较前后两帧中所包含的各像素位置的相应 "后位像素值 "与"前位像素值"不相等数量之 和的统计值小于设定阈值， 即对第 3帧至第 Ί帧进行压縮存储处理为第 3帧的像素值 重复记录 5次；
第 n-1帧与第 n帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与 "前位像素值"不相等数量之和的统计值大于或等于设定阈值， 即对第 n-1帧进行压縮 存储处理， 处理为将第 n-1帧所有像素依照其已知位序信息和 /或通过人为干预方法而 设定和 /或编码而成的位序信息进行完整的存储处理， 并对此处理方法发生的时间和 / 或该图像序列中的帧序进行相应的记录和 /或存储处理， 第 n-1帧图像需整帧存储时， 将第 n-1帧图像整帧存储在图像序列后端同一存储空间；
第 n帧与第 n-1帧相比较前后两帧中所包含的各像素位置的相应 "后位像素值 "与 "前位像素值"不相等数量之和的统计值大于或等于设定阈值， 即对第 n帧进行压縮存 储处理，处理为将第 n帧所有像素依照其已知位序信息和 /或通过人为干预方法而设定 和 /或编码而成的位序信息进行完整的存储处理， 并对此处理方法发生的时间和 /或该 图像序列中的帧序进行相应的记录和 /或存储处理， 第 n帧图像需整帧存储时， 将第 n 帧图像整帧存储在图像序列后端同一存储空间。
以上所述为本发明的优选实施例而已， 并不用于限制本发明。 显然， 本领域的技 术人员可以对本发明进行各种改动和变形而不脱离本发明所保护的范围。 因此， 如果 对于本发明的这些改动和变形属于本发明权利要求及其等同技术的范围之内， 则本发 明的意图也包含这些改动和变形之内。

Claims

权 利 要 求 书
1、 一种存储处理图像序列的方法， 其特征在于， 包括如下步骤：
在图像序列中， 将组成各帧图像的各像素依照其在该帧图像中已知位置和顺序排 列， 形成像素位序；
将所述图像序列中位于前位帧图像所有像素位置的像素值逐一设置为 "前位像素 值"， 将位于所述图像序列中与所述前位帧图像相邻的后位帧图像的相同像素位序的 像素值设置为 "后位像素值"， 将所述 "前位像素值 "与所述"后位像素值"进行比较； 设置一个记录程序， 用于记录所述 "前位像素值 "在所述像素位序连续重复出现的 次数；
其中， 将所述 "前位像素值 "与所述"后位像素值"进行比较后， 进行如下处理： 歩骤 S 1 : 经比较， 如果所述"前位像素值"与所述 "后位像素值 "两者之差的绝对值 等于零， 或小于设定阈值， 则做出所述"前位像素值"与所述"后位像素值"相等的结论， 并进行如下处理：
对所述 "前位像素值 "予以记录和 /或存储处理；
所述记录程序对所述 "前位像素值 "在所述图像序列中的所述像素位序已经连续重 复出现的次数信息进行更新， 并进行记录和 /或存储处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述"前位像素值"仍作为 "前位像素值 "继续与相邻的续帧图像的相同像素位序的像素值即新 "后位像素值"， 进 行循环比较， 其中， 所述续帧图像与所述后位帧图像相邻；
步骤 S2: 经比较， 如果所述"前位像素值"与所述 "后位像素值 "两者之差的绝对值 大于设定阈值， 进行如下处理：
对所述 "前位像素值 "予以记录和 /或存储处理；
所述记录程序对所述 "前位像素值 "在所述图像序列中的所述像素位序已经连续重 复出现的次数信息进行记录和 /或存储处理；
对所述 "后位像素值 "予以记录和 /或存储处理；
记录程序对所述"后位像素值"在图像序列中的所述像素位序已经连续重复出现的 次数信息进行更新， 并进行记录和 /或存储处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述"后位像素值"作为新 的"前位像素值"与相邻的后位帧图像的相同像素位序的像素值即新"后位像素值"， 进 行循环比较， 其中， 该相邻的后位帧图像即为所述续帧图像， 所述续帧图像与所述后 位帧图像相邻。
2 、 根据权利要求 1所述的存储处理图像序列的方法， 其特征在于， 经比较， 当 所述"前位像素值"与所述"后位像素值"两者之差的绝对值等于所述设定阈值时， 从所 述的步骤 S1、步骤 S2中选定一个处理步骤，对所述 "前位像素值 "与所述"后位像素值" 进行处理。
3、 根据权利要求 1所述的存储处理图像序列的方法， 其特征在于， 所述的图像 中已知位置和顺序排列信息为： 第一像素位置、 第二像素位置、 第三像素位置 ......至 第 n像素位置， 在所述图像序列中将每帧图像中的所有有效像素所处的位置顺序通过 坐标进行定位和表达。
4、 根据权利要求 1所述的存储处理图像序列的方法， 其特征在于， 当得到前后 两帧图像后即对所述的图像序列进行处理， 直至将所述图像序列的所有帧图像逐一处 理完毕。
5、 根据权利要求 1所述的存储处理图像序列的方法， 其特征在于， 当完成对所 述的图像序列各帧图像的收集后开始进行处理， 直至将所述图像序列的所有帧图像逐 一处理完毕， 或者当完成对所述图像序列各帧图像的部分收集后开始进行处理， 直至 将所述图像序列的所有帧图像逐一处理完毕。
6、 一种图像序列的压縮存储处理方法， 其特征在于， 在图像序列中， 将组成各 帧图像的各像素依照其所在帧图像中已知位置和顺序排列， 形成像素位序；
在当前被处理的所述图像序列中， 将位于前位帧图像的所有像素位置的像素值逐 一设置为所述像素位序的"前位像素值"， 将处于所述图像序列与所述前位帧图像相邻 的后位帧图像的相同像素位序的像素值逐一设置为所述像素位序的"后位像素值"， 在 该前、后两帧图像中， 对处于所有相同像素位序的所述"前位像素值"与所述 "后位像素 值"分别进行比较；
定义一个统计机制， 用于统计所述前位帧图像和所述后位帧图像两帧间相同像素 位置的像素值不相同的数量作为统计值；
当所述统计值大于或等于所述第一设定阈值， 则对所述前位帧图像的所有像素值 依照其原始位序信息进行完整的存储处理， 并对此处理方法发生的时间和帧序进行相 应的记录和存储处理；
当所述统计值小于所述第一设定阈值， 则对所述图像序列中所述前位帧图像和所 述后位帧图像的处于相同像素位序的所述 "前位像素值 "与所述"后位像素值"进行比 较， 并设置一个记录程序， 用于记录所述 "前位像素值 "在所述像素位序连续重复出现 的次数；
进行如下处理：
步骤 S1: 经比较， 如果所述"前位像素值"与所述 "后位像素值 "两者之差的绝对值 等于零或小于第二设定阈值， 进行如下处理：
对所述 "前位像素值 "予以记录和 /或存储处理；
所述记录程序对所述 "前位像素值 "在所述图像序列中的所述像素位序已经连续重 复出现的次数信息进行更新， 并进行记录和 /或存储处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述"前位像素值"仍作为 "前位像素值 "继续与相邻的续帧图像的相同像素位序的像素值即新 "后位像素值"， 进 行循环比较， 其中， 所述续帧图像与所述后位帧图像相邻；
步骤 S2: 经比较， 如果所述"前位像素值"与所述 "后位像素值 "两者之差的绝对值 大于所述第二设定阈值， 进行如下处理：
对所述 "前位像素值 "予以记录和 /或存储处理；
所述记录程序对所述 "前位像素值 "在所述图像序列中的所述像素位序已经连续重 复出现的次数信息进行记录和 /或存储处理；
对所述 "后位像素值 "予以记录和 /或存储处理；
所述记录程序对所述 "后位像素值 "在所述图像序列中的所述像素位序已经连续重 复出现的次数信息进行更新， 并进行记录和 /或存储处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述"后位像素值"作为新 的"前位像素值"与相邻的后位帧图像的相同像素位序的像素值即新"后位像素值"， 进 行循环比较， 其中， 该相邻的后位帧图像即为所述续帧图像， 所述续帧图像与所述后 位帧图像相邻。
7、 根据权利要求 6所述的图像序列的压縮存储处理方法， 其特征在于， 将所述 前位帧图像与其前相邻一帧相比较， 同时将所述前位帧图像与其后位帧图像相比较； 当所述前位帧图像与其前相邻帧图像所包含的各像素位置的相应所述 "前位像素 值"与所述"后位像素值"不相等数量之和的所述统计值小于所述第一设定阈值，同时所 述前位帧图像与其后位帧图像所包含的各像素位置的相应所述"前位像素值"与所述 "后位像素值 "不相等数量之和的所述统计值等于或大于所述第一设定阈值时， 将所述 前位帧图像所有所述 "前位像素值 "予以记录和 /或存储处理，并且所述记录程序对所述 "前位像素值 "在所述图像序列中的所述像素位序已经连续重复出现的次数信息进行更 新， 并进行记录和 /或存储处理。
8、 根据权利要求 6所述的图像序列的压縮存储处理方法， 其特征在于， 当所述 前位帧图像为所述图像序列中的第 n- 1帧图像时， 前、 后两帧图像所包含的各像素位 置的相应所述 "后位像素值 "与所述"前位像素值"不相等数量之和的所述统计值大于或 等于所述第一设定阈值， 则对第 n帧图像的所有像素依照其原始位序信息进行完整的 存储处理， 并对此处理方法发生的时间和 /或帧序进行相应的记录和 /或存储处理。
9、 根据权利要求 6所述的图像序列的压縮存储处理方法， 其特征在于， 当所述 前位帧图像为图像序列中为第 n- 1帧时， 前、 后两帧中所包含的各像素位置的相应所 述"后位像素值"与所述"前位像素值"不相等数量之和的所述统计值小于所述第一设定 阈值， 将第 n帧图像所有"后位像素值"予以记录和 /或存储处理， 并且记录程序对所述 "后位像素值 "发生在图像序列的该像素位序已经连续重复出现的次数信息进行更新， 并进行记录和 /或存储处理。
10、 根据权利要求 6-9任意一项所述的图像序列的压縮存储处理方法， 其特征在 于， 所述前位帧图像需整帧存储时， 将前一帧图像整帧存储在图像序列后端同一存储 空间。
11、 根据权利要求 6-9任意一项所述的图像序列的压縮存储处理方法， 其特征在 于， 所述前位帧图像需整帧存储时， 将前一帧图像整帧存储在所述图像序列不同的另 一存储空间。
12、 根据权利要求 6-9任意一项所述的图像序列的压縮存储处理方法， 经比较， 当所述 "前位像素值 "与所述"后位像素值"两者之差的绝对值等于所述第二设定阈值 时， 从所述的步骤 S l、 步骤 S2中选定一个处理步骤， 对所述 "前位像素值 "与所述"后 位像素值"进行处理。
13、 一种图像序列的压縮存储处理方法， 其特征在于， 包括如下步骤： 在图像序列中， 将组成各帧图像的各像素依照其在该帧图像中已知位置和顺序排 列， 形成像素位序；
将所述图像序列中位于前位帧图像所有像素位置的像素值逐一设置为 "前位像素 值"， 将位于所述图像序列中与所述前位帧图像相邻的后位帧图像的相同像素位序的 像素值设置为 "后位像素值"， 将所述 "前位像素值 "与所述"后位像素值"进行比较； 设置一个记录程序， 用于记录所述 "前位像素值 "在所述像素位序连续重复出现的 次数；
设置另一个记录程序， 用于统计前位帧图像的各像素值与相邻的后位帧图像的相 同像素位序的像素值不相等的次数或比例；
其中， 将所述 "前位像素值 "与所述"后位像素值"进行比较后， 进行如下处理： 歩骤 S 1 : 经比较， 如果所述"前位像素值"与所述 "后位像素值 "两者之差的绝对值 等于零， 或小于第一设定阈值， 则做出所述"前位像素值"与所述"后位像素值"相等的 结论， 并进行如下处理：
对所述 "前位像素值 "予以记录和 /或存储处理； 所述记录程序对所述 "前位像素值 "在所述图像序列中的所述像素位序已经连续重 复出现的次数信息进行更新， 并进行记录和 /或存储处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述"前位像素值"仍作为 "前位像素值 "继续与相邻的续帧图像的相同像素位序的像素值即新 "后位像素值"， 进 行循环比较， 其中， 所述续帧图像与所述后位帧图像相邻；
步骤 S2: 经比较， 如果所述"前位像素值"与所述 "后位像素值 "两者之差的绝对值 大于所述第一设定阈值， 进行如下处理：
对所述 "前位像素值 "予以记录和 /或存储处理；
所述记录程序对所述 "前位像素值 "在所述图像序列中的所述像素位序已经连续重 复出现的次数信息进行记录和 /或存储处理；
对所述 "后位像素值 "予以记录和 /或存储处理；
记录程序对所述"后位像素值"在图像序列中的所述像素位序已经连续重复出现的 次数信息进行更新， 并进行记录和 /或存储处理；
所述另一记录程序对开始处理所述前位帧与所述后位帧以来已发生的 "前位像素 值"与"后位像素值"不相等的次数或比例信息进行统计和 /或更新， 如果所述次数或比 例大于或等于所述第二设定阈值， 则对所述前位帧图像的所有像素值依照其原始位序 信息进行完整的存储处理， 并对此处理方法发生的时间和帧序进行相应的记录和存储 处理；
在所述图像序列中， 当还有需要处理的续帧图像时， 将所述"后位像素值"作为新 的"前位像素值"与相邻的后位帧图像的相同像素位序的像素值即新"后位像素值"， 进 行循环比较， 其中， 该相邻的后位帧图像即为所述续帧图像， 所述续帧图像与所述后 位帧图像相邻。
14、 根据权利要求 13所述的图像序列的压縮存储处理方法， 其特征在于， 经比 较， 当所述 "前位像素值 "与所述"后位像素值"两者之差的绝对值等于所述第二设定阈 值时，从所述的步骤 S1、步骤 S2中选定一个处理步骤，对所述 "前位像素值 "与所述"后 位像素值"进行处理。
PCT/CN2010/079968 2009-12-17 2010-12-17 存储处理图像序列的方法及图像序列的压缩存储处理方法 WO2011072620A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US13/516,403 US8644626B2 (en) 2009-12-17 2010-12-17 Method for storing and processing image sequence and method for compressing, storing and processing image sequence
EP10837057.8A EP2515530A4 (en) 2009-12-17 2010-12-17 METHOD FOR STORING AND PROCESSING A SEQUENCE OF IMAGES AND METHOD FOR COMPRESSING, STORING AND PROCESSING A SEQUENCE OF IMAGES

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN200910242521.7 2009-12-17
CN200910242521A CN101729840A (zh) 2009-12-17 2009-12-17 一种利用视频图像特征序列的存储处理方法
CN201010160818.1A CN102104764B (zh) 2009-12-17 2010-04-30 一种图像序列的压缩存储处理方法
CN201010160818.1 2010-04-30

Publications (1)

Publication Number Publication Date
WO2011072620A1 true WO2011072620A1 (zh) 2011-06-23

Family

ID=42449924

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/079968 WO2011072620A1 (zh) 2009-12-17 2010-12-17 存储处理图像序列的方法及图像序列的压缩存储处理方法

Country Status (4)

Country Link
US (1) US8644626B2 (zh)
EP (1) EP2515530A4 (zh)
CN (3) CN101729840A (zh)
WO (1) WO2011072620A1 (zh)

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729840A (zh) 2009-12-17 2010-06-09 于培宁 一种利用视频图像特征序列的存储处理方法
CN104282226B (zh) * 2010-08-12 2017-12-26 上海本星电子科技有限公司 含有数据代码的图像及可显示该图像的显示器
CN104269108B (zh) * 2010-08-12 2017-08-11 上海本星电子科技有限公司 支持采集者通过红外图像采集来获取数据的显示器
CN102761733A (zh) * 2011-04-29 2012-10-31 富泰华工业（深圳）有限公司 监控系统及视频数据存储方法
CN104079950A (zh) * 2014-07-04 2014-10-01 福建天晴数码有限公司 视频输出处理、视频接收处理的方法、装置和系统
CN104469229A (zh) * 2014-11-18 2015-03-25 北京恒华伟业科技股份有限公司 视频数据存储方法和装置
CN104954718A (zh) * 2015-06-03 2015-09-30 惠州Tcl移动通信有限公司 一种移动智能终端及其录像方法
CN105787465A (zh) * 2016-03-21 2016-07-20 苏州东吴维桢信息技术有限公司 基于位置结构的图像识别方法
CN107770445B (zh) * 2017-10-30 2020-01-07 深圳市华盛昌科技实业股份有限公司 一种红外图像共享方法及其装置
CN107801031B (zh) * 2017-11-09 2019-10-18 广州物启科技有限公司 一种对纯三原色图片数据的无损压缩编码方法
CN109271538A (zh) * 2018-08-20 2019-01-25 深圳和而泰智能控制股份有限公司 一种图片存储方法及相关设备
US11356326B2 (en) 2018-12-13 2022-06-07 Amazon Technologies, Inc. Continuously calibrated network system
US11368400B2 (en) 2018-12-13 2022-06-21 Amazon Technologies, Inc. Continuously calibrated network system
KR102185668B1 (ko) * 2019-01-30 2020-12-02 스노우 주식회사 이미지 파일의 픽셀 변환을 통한 압축율 향상 방법 및 시스템
US11461168B1 (en) * 2019-03-29 2022-10-04 Amazon Technologies, Inc. Data loss protection with continuity
IT201900006730A1 (it) * 2019-05-10 2020-11-10 Stmicroelectronics Grand Ouest Sas Sistema di visualizzazione e relativo veicolo e procedimento
CN112995745B (zh) * 2019-12-17 2023-01-03 瑞昱半导体股份有限公司 图像储存方法与电路系统
CN111400533B (zh) * 2020-03-02 2023-10-17 北京三快在线科技有限公司 图像筛选方法、装置、电子设备和存储介质
CN111683254B (zh) * 2020-06-24 2022-03-25 湖南国科微电子股份有限公司 一种图像压缩方法、装置及电子设备和存储介质
CN112199358B (zh) * 2020-09-04 2022-12-09 天津津航技术物理研究所 一种面向红外图像的数据库管理方法和系统
CN112637598B (zh) * 2020-12-18 2023-07-25 国家电网有限公司信息通信分公司 视频的压缩与解压缩方法、装置、设备及可读存储介质
CN112822495B (zh) * 2020-12-31 2023-10-13 广州科易光电技术有限公司 红外图像压缩方法及装置、电子设备、存储介质
CN112954261B (zh) * 2021-03-18 2021-09-10 深圳奇实科技有限公司 一种视频会议网络流量控制方法和系统
WO2023014815A1 (en) * 2021-08-03 2023-02-09 Vertiv It Systems, Inc. Dvcx and dvcy extensions to dvc video compression

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1949831A (zh) * 2006-11-13 2007-04-18 华为技术有限公司 一种检测电视电影模式的方法、装置以及显示器
CN101317195A (zh) * 2005-11-30 2008-12-03 日本电气株式会社 图像处理设备、显示设备、图像处理方法以及程序
CN101729840A (zh) * 2009-12-17 2010-06-09 于培宁 一种利用视频图像特征序列的存储处理方法

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3553362A (en) * 1969-04-30 1971-01-05 Bell Telephone Labor Inc Conditional replenishment video system with run length coding of position
JPH0244883A (ja) * 1988-08-05 1990-02-14 Toshiba Corp 動画像伝送方式
US5325126A (en) * 1992-04-01 1994-06-28 Intel Corporation Method and apparatus for real time compression and decompression of a digital motion video signal
JP3931595B2 (ja) * 2001-07-10 2007-06-20 株式会社日立製作所 データ修正装置及びデータ修正方法
CN1396769A (zh) * 2001-07-17 2003-02-12 时代新技术产业有限公司 运动图像信息的压缩方法及其系统
US7294446B2 (en) * 2001-10-29 2007-11-13 Eastman Kodak Company Digital analog recording using near field optical imaging
WO2004030369A1 (en) * 2002-09-27 2004-04-08 Videosoft, Inc. Real-time video coding/decoding
CN1710960A (zh) * 2005-07-21 2005-12-21 中华电信股份有限公司 具差异判断的连续影像压缩方法
JP5012315B2 (ja) * 2007-08-20 2012-08-29 セイコーエプソン株式会社 画像処理装置
CN101261740B (zh) * 2008-03-27 2012-01-04 于培宁 一种图像的存储处理方法
CN101330619B (zh) * 2008-07-29 2012-03-07 北京中星微电子有限公司 一种视频图像压缩方法及相应视频解码方法
US8463035B2 (en) * 2009-05-28 2013-06-11 Gentex Corporation Digital image processing for calculating a missing color value

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101317195A (zh) * 2005-11-30 2008-12-03 日本电气株式会社 图像处理设备、显示设备、图像处理方法以及程序
CN1949831A (zh) * 2006-11-13 2007-04-18 华为技术有限公司 一种检测电视电影模式的方法、装置以及显示器
CN101729840A (zh) * 2009-12-17 2010-06-09 于培宁 一种利用视频图像特征序列的存储处理方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2515530A4 *

Also Published As

Publication number Publication date
CN102104764A (zh) 2011-06-22
EP2515530A4 (en) 2015-10-14
CN102065203A (zh) 2011-05-18
US8644626B2 (en) 2014-02-04
CN102104764B (zh) 2015-01-21
US20120257836A1 (en) 2012-10-11
EP2515530A1 (en) 2012-10-24
EP2515530A9 (en) 2013-04-17
CN102065203B (zh) 2012-02-01
CN101729840A (zh) 2010-06-09

Similar Documents

Publication Publication Date Title
WO2011072620A1 (zh) 存储处理图像序列的方法及图像序列的压缩存储处理方法
JP4151684B2 (ja) 符号化装置、符号化方法および符号化プログラム、並びに撮像装置
CN101494788B (zh) 视频图像的压缩/解压缩方法与装置
JPH05122538A (ja) 画像再生装置および方法
US9460525B2 (en) Tile-based compression and decompression for graphic applications
JP2008501261A (ja) 高速高品質画像処理のための画像圧縮方法
JP2000244922A (ja) 画像データ圧縮方法
US8213520B2 (en) Compression method for display frames of QFHD (quad full high definition) resolution and system thereof
CN110087085B (zh) 图像处理装置
JP3952116B2 (ja) 画像圧縮装置及び方法
JP2008017472A (ja) 超音波映像の圧縮方法
TWI700921B (zh) 影像解碼裝置與方法
US8238415B2 (en) Method and system for programmable breakpoints in an integrated embedded image and video accelerator
CN109525848B (zh) 一种脉冲序列的压缩方法及装置
JPS5840989A (ja) 画像情報の符号化処理方法および伝送制御方法
JP2009124278A (ja) 撮像装置
CN109561313B (zh) 一种基于分块的脉冲序列压缩方法及装置
KR100530745B1 (ko) 고해상도 영상신호를 저해상도 디스플레이 장치에 디스플레이하는 디스플레이 방법
JP2001217722A (ja) 情報符号化装置及び情報符号化方法及びコンピュータ読み取り可能な記憶媒体
JP3368164B2 (ja) 符号化復号化システム
CN116800912A (zh) 脉冲信号的编码方法和装置、电子设备和存储介质
TWI432031B (zh) Distortion-free image compression method
JP3144480B2 (ja) 画像符号化制御回路及び画像符号化制御方法
TWI305088B (en) Digital video decoding apparatus and method thereof
JPH10271502A (ja) 動画像情報の圧縮方法およびそのシステム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10837057

Country of ref document: EP

Kind code of ref document: A1

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10837057

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 13516403

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2010837057

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2010837057

Country of ref document: EP