CN109982091B - Image processing method and device - Google Patents
Image processing method and device Download PDFInfo
- Publication number
- CN109982091B CN109982091B CN201910344056.1A CN201910344056A CN109982091B CN 109982091 B CN109982091 B CN 109982091B CN 201910344056 A CN201910344056 A CN 201910344056A CN 109982091 B CN109982091 B CN 109982091B
- Authority
- CN
- China
- Prior art keywords
- sequence
- image
- data
- frame
- pixel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- 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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/182—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a pixel
-
- 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/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
-
- 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/44—Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
Abstract
The application discloses a method and a device for processing an image, wherein the method comprises the following steps: compressing each frame of image in the collected image sequence to obtain first data corresponding to each frame of image, wherein the first data is a binary sequence; verifying whether a preset first sequence exists in the first data, wherein the first sequence is the same as a binary sequence of a starting mark or an ending mark of a preset frame; if the first sequence exists, adjusting a sequence which is the same as the first sequence in the first data based on a preset first adjusting mechanism to obtain second data corresponding to each frame of image, so that the sequence which is the same as the first sequence does not exist in the second data. The technical problem of poor quality of decompressed images in the prior art is solved.
Description
Technical Field
The present application relates to the field of image processing technologies, and in particular, to a method and an apparatus for processing an image.
Background
With the continuous pursuit of users for high definition image quality, digital technology is rapidly developed. The resolution of the display is also higher and higher, for example, the resolution is 4K or 8K, but as the resolution of the display is increased, the pixel data of the corresponding high-definition picture is huge, and the data amount of the transmitted video data is also huge. Due to the large amount of video data, the bandwidth occupied by transmitting the video data may be wide, but the bandwidth for transmitting the video data is generally limited. In order to transmit video data, the video data is usually compressed, and methods for compressing the video data include two broad categories, namely lossy compression and lossless compression, for example, lossy compression algorithms include: h264 video compression algorithm, Moving Picture Experts Group (MPEG) video compression algorithm, etc., and the lossless compression algorithm includes: JPEG format (JPEG) or Portable Network Graphics (PNG) format compression.
At present, when video data is compressed in a lossless compression manner, a data sequence corresponding to each frame of image is obtained, generally, the data sequence is a binary data sequence, and the data sequence includes a start flag of a frame, an end flag of the frame, and a data sequence corresponding to a pixel value of a pixel in the image.
Disclosure of Invention
The application provides an image processing method and device, which are used for solving the technical problem that the quality of an image obtained by decompression is poor in the prior art.
In a first aspect, an embodiment of the present application provides an image processing method, where the method includes:
compressing each frame of image in the collected image sequence to obtain first data corresponding to each frame of image, wherein the first data is a binary sequence;
verifying whether a preset first sequence exists in the first data, wherein the first sequence is the same as a binary sequence of a starting mark or an ending mark of a preset frame;
if the first sequence exists, adjusting a sequence which is the same as the first sequence in the first data based on a preset first adjusting mechanism to obtain second data corresponding to each frame of image, so that the sequence which is the same as the first sequence does not exist in the second data.
In the scheme provided by the embodiment of the application, after each frame of image is compressed to obtain first data corresponding to each frame of image, whether a first sequence identical to a binary sequence of a preset frame start mark or end mark exists in the first data is verified, and if the first sequence identical to the binary sequence of the preset frame start mark or end mark exists in the first data, a sequence identical to the first sequence in the first data is adjusted based on a preset first adjusting mechanism to obtain second data. Therefore, in the scheme provided by the embodiment of the application, the sequence in the first data, which is the same as the first sequence, is adjusted through the first adjustment mechanism, so that a sequence which is the same as a binary sequence of a preset start mark or an end mark of a frame is prevented from existing in compressed data corresponding to each frame of image, and the problem of poor quality of an image obtained through decompression is solved.
Optionally, compressing each frame of image in the acquired image sequence to obtain first data corresponding to each frame of image, including:
comparing the pixel values of the pixel points at the same position of any frame of image in the image sequence with the pixel points at the same position of the adjacent previous frame of image one by one to obtain an identification code, wherein the identification code represents the comparison result of the pixel values of the pixel points at the same position;
storing the pixel value of each pixel point in any frame of image according to the identification code to obtain third data corresponding to each pixel point;
and sequentially storing the third data corresponding to each pixel point based on the row and column positions of the pixel points in any frame of image to obtain the first data corresponding to any frame of image.
Optionally, comparing pixel values of pixels at the same position of any frame of image in the image sequence with a pixel point at the same position of an adjacent previous frame of image one by one to obtain an identification code, including:
acquiring pixel values of all pixel points of each frame of image in the image sequence, and comparing whether the pixel values of two adjacent pixel points are the same or not line by line;
if the pixel values are the same, dividing the continuous adjacent pixel points with the same pixel value into a sub-region, and determining the corresponding pixel value of the sub-region;
comparing the pixel values of the sub-regions at the same position in any frame of image with the pixel values of the sub-regions at the same position in the previous frame of image, and outputting the identification code.
In the scheme provided by the embodiment of the application, the continuous adjacent pixel points with the same pixel value in each frame of image are divided into a sub-region, the pixel values corresponding to the sub-region are determined, and the pixel values of the sub-region at the same position in any frame of image and the adjacent previous frame of image are compared. The pixel value of each pixel point of any frame of image is prevented from being compared with the pixel values of the pixel points at the same position in the adjacent previous frame of image one by one, the workload of comparing the pixel values of the pixel points at the same position of two frames of images is reduced, and the image processing efficiency is improved.
Optionally, storing the pixel value of each pixel point in any frame of image according to the identification code to obtain third data corresponding to each pixel point in any frame of image, including:
judging whether the pixel value of any pixel point in any frame of image is the same as the pixel value of a pixel point at the same position in the previous frame of image or not based on the identification code;
if the pixel values are the same, storing the identification code to obtain the third data corresponding to any pixel point;
and if not, storing the identification code and the pixel value of any pixel point to obtain the third data corresponding to any pixel point.
In the scheme provided by the embodiment of the application, if the pixel value of any pixel point in any frame of image is the same as that of the pixel point at the same position in the previous frame of image, only the identification code is stored, the pixel value of the pixel point is prevented from being repeatedly stored when the pixel values of two adjacent frames of pixel points at the same position are the same, the data volume stored in each frame of image is reduced, and further the data volume corresponding to the image sequence and the bandwidth of transmission data are reduced.
Optionally, the preset first adjusting mechanism includes:
adding preset binary data to preset positions of a sequence identical to the first sequence in the first data; or
In the first data, an identifier is added to a start position or an end position of a sequence identical to the first sequence, and data of odd or even bits in the sequence identical to the first sequence is adjusted to a binary code opposite thereto.
Optionally, after adjusting a sequence in the first data that is the same as the first sequence based on a preset first adjustment mechanism, the method further includes:
adding a preset frame starting mark at the starting position of the second data, adding a preset frame ending mark at the tail position of the second data, and adding a preset error correction bit between the second data and the ending mark to obtain fourth data corresponding to any frame of image, wherein the error correction bit is used for representing the error correction of the second data.
In a second aspect, an embodiment of the present application provides a method for processing an image, where the method includes:
acquiring second data corresponding to each frame of image in the image sequence based on a starting zone bit of a preset frame and an ending zone bit of the preset frame;
verifying whether a preset second sequence or an identifier exists in the second data, wherein the second sequence is the same as a binary sequence obtained by adjusting a sequence, which is the same as the preset first sequence, in the first data corresponding to each frame of image based on a preset first adjusting mechanism;
if the first data exists, adjusting a sequence in the second data, which is the same as the second sequence, based on a preset second adjusting mechanism to obtain first data corresponding to each frame of image;
and decompressing the first data to obtain each frame of image.
Optionally, the second adjustment mechanism includes:
deleting binary codes at preset positions of a sequence which is the same as the second sequence in the second data to obtain the first data corresponding to each frame of image; or
In the second data, the odd-numbered or even-numbered data in the sequence which is the same as the second sequence after or before the identifier is adjusted to a binary code opposite to the odd-numbered or even-numbered data, and the first data corresponding to each frame of image is obtained.
In a third aspect, an embodiment of the present application provides an image processing apparatus, including:
the device comprises a compression module, a data acquisition module and a data processing module, wherein the compression module is used for compressing each frame of image in an acquired image sequence to obtain first data corresponding to each frame of image, and the first data is a binary sequence;
a verification module, configured to verify whether a preset first sequence exists in the first data, where the preset first sequence is the same as a binary sequence of a start flag or an end flag of a preset frame;
and if the preset first sequence exists, adjusting a sequence in the first data, which is the same as the preset first sequence, based on a preset first adjustment mechanism to obtain second data corresponding to each frame of image, so that the sequence, which is the same as the first sequence, does not exist in the second data.
Optionally, the compression module is specifically configured to:
comparing the pixel values of the pixel points at the same position of any frame of image in the image sequence with the pixel points at the same position of the adjacent previous frame of image one by one to obtain an identification code, wherein the identification code represents the comparison result of the pixel values of the pixel points at the same position;
storing the pixel value of each pixel point in any frame of image according to the identification code to obtain third data corresponding to each pixel point;
and sequentially storing the third data corresponding to each pixel point based on the row and column positions of the pixel points in any frame of image to obtain the first data corresponding to any frame of image.
Optionally, the compression module is specifically configured to;
acquiring pixel values of all pixel points of each frame of image in the image sequence, and comparing whether the pixel values of two adjacent pixel points are the same or not line by line;
if the pixel values of two adjacent pixel points are the same, dividing the continuous adjacent pixel points with the same pixel value into a sub-region, and determining the corresponding pixel value of the sub-region;
comparing the pixel values of the sub-regions at the same position in any frame of image with the pixel values of the sub-regions at the same position in the previous frame of image, and outputting the identification code.
Optionally, the compression module is specifically configured to:
judging whether the pixel value of any pixel point in any frame of image is the same as the pixel value of a pixel point at the same position in the previous frame of image or not based on the identification code;
if the pixel value of any pixel point in any frame of image is the same as the pixel value of a pixel point at the same position in the previous frame of image, storing the identification code to obtain the third data corresponding to any pixel point;
and if the pixel value of any pixel point in any frame of image is not the same as the pixel value of the pixel point at the same position in the previous frame of image, storing the identification code and the pixel value of any pixel point to obtain the third data corresponding to any pixel point.
Optionally, the preset first adjusting mechanism includes:
adding preset binary data to preset positions of a sequence identical to the first sequence in the first data; or
In the first data, an identifier is added to a start position or an end position of a sequence identical to the first sequence, and data of odd or even bits in the sequence identical to the first sequence is adjusted to a binary code opposite thereto.
Optionally, the processing apparatus further comprises: adding a module;
the adding module is configured to add a preset frame start flag at a start position of the second data, add a preset frame end flag at an end position of the second data, and add a preset error correction bit between the second data and the end flag to obtain fourth data corresponding to any frame of the image, where the error correction bit is used for representing to correct the error of the second data.
In a fourth aspect, an embodiment of the present application provides an image processing apparatus, including:
the acquisition module is used for acquiring third data corresponding to each frame of image in the image sequence based on a starting zone bit or an ending zone bit of a preset frame;
a verification module, configured to verify whether a preset second sequence or an identifier exists in the third data, where the second sequence is the same as a binary sequence obtained by adjusting a sequence, which is the same as the preset first sequence, in first data corresponding to each frame of image based on a preset first adjustment mechanism;
the adjusting module is configured to adjust, based on a preset second adjusting mechanism, a sequence in the second data that is the same as the second sequence if the preset second sequence exists, so as to obtain first data corresponding to each frame of image;
and the decompression module is used for decompressing the first data to obtain each frame of image.
Optionally, the second adjustment mechanism includes:
deleting binary codes at preset positions of a sequence which is the same as the second sequence in the second data to obtain the first data corresponding to each frame of image; or in the second data, adjusting the odd-numbered or even-numbered data in the sequence which is the same as the second sequence after or before the identifier into a binary code opposite to the odd-numbered or even-numbered data to obtain the first data corresponding to each frame of image.
In a fifth aspect, an embodiment of the present application provides an image processing apparatus, including:
a memory for storing instructions for execution by at least one processor;
a processor for executing instructions stored in a memory to perform the method of the first aspect.
In a sixth aspect, embodiments of the present application provide a computer-readable storage medium storing computer instructions that, when executed on a computer, cause the computer to perform the method of the first aspect.
Drawings
Fig. 1 is a schematic structural diagram of an image processing system according to an embodiment of the present disclosure;
fig. 2 is a flowchart of an image processing method according to an embodiment of the present disclosure;
fig. 3 is a schematic diagram of pixel point distribution of a frame of image according to an embodiment of the present disclosure;
fig. 4 is a schematic diagram of distribution of sub-regions in a frame of image according to an embodiment of the present disclosure;
FIG. 5 is a diagram illustrating a data structure provided in an embodiment of the present application;
fig. 6 is a flowchart of an image processing method according to an embodiment of the present disclosure;
fig. 7 is a schematic structural diagram of an image processing apparatus according to an embodiment of the present disclosure;
fig. 8 is a schematic structural diagram of an image processing apparatus according to an embodiment of the present disclosure;
fig. 9 is a schematic structural diagram of an image processing apparatus according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of an image processing apparatus according to an embodiment of the present application.
Detailed Description
In the solutions provided in the embodiments of the present application, the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In order to better understand the technical solutions, the technical solutions of the present application are described in detail below with reference to the drawings and specific embodiments, and it should be understood that the specific features in the embodiments and examples of the present application are detailed descriptions of the technical solutions of the present application, and are not limitations of the technical solutions of the present application, and the technical features in the embodiments and examples of the present application may be combined with each other without conflict.
Referring to fig. 1, the present application provides an image processing system, comprising: the image processing system comprises a sending-end electronic device 1 and a receiving-end electronic device 2, wherein the sending-end electronic device 1 is used for sending image data, and the receiving-end electronic device 2 is used for receiving the image data. It should be understood that the sending-end electronic device 1 and the receiving-end electronic device 2 both have communication modules, and can send or receive image data through the communication modules, the sending-end electronic device 1 may be a mobile terminal, a computer, a camera, or the like, without limitation, and the receiving-end electronic device 2 may also be a mobile terminal, a computer, or the like, without limitation.
Example one
The following describes an image processing method provided in an embodiment of the present application in further detail with reference to the drawings in the specification, and a specific implementation manner of the method may include the following steps (a method flow is shown in fig. 2):
step 201, a sending end electronic device compresses each frame of image in an acquired image sequence to obtain first data corresponding to each frame of image, wherein the first data is a binary sequence.
Specifically, the electronic device at the sending end shoots video data or reads the video data from an electronic device which has a connection relationship with the electronic device, for example, the electronic device which has a connection relationship includes a camera, a mobile phone, a usb disk, or the like, and the video data includes an image sequence composed of multiple frames of images. After the sending end electronic equipment collects the image sequence, compressing each frame of image in the collected image sequence to obtain first data corresponding to each frame of image. There are various specific methods for compressing each frame of image, and a preferred image compression method is described as an example below.
The method for compressing each frame of image in the collected image sequence by the electronic equipment at the sending end to obtain first data corresponding to each frame of image comprises the following steps:
comparing the pixel values of the pixel points at the same position of any frame of image in the image sequence with the pixel points at the same position of the adjacent previous frame of image one by one to obtain an identification code, wherein the identification code represents the comparison result of the pixel values of the pixel points at the same position; storing the pixel value of each pixel point in any frame of image according to the identification code to obtain third data corresponding to each pixel point; and sequentially storing the third data corresponding to each pixel point based on the row and column positions of the pixel points in any frame of image to obtain the first data corresponding to any frame of image.
It should be understood that the identification code may be composed of multi-bit binary data for representing the pixel value comparison result of each pixel point at the same position, for example, the identification code is composed of 1-bit binary data, where 0: the pixel values of all the pixel points at the same position are the same; 1: and the pixel values of the pixel points at the same positions are different.
Specifically, there are various ways for the sending-end electronic device to compare pixel values of pixels at the same position of any frame of image in the image sequence with those of pixels at the same position of an adjacent previous frame of image one by one to obtain the identification code, and the following two preferred ways are exemplified.
In the mode 1, the sending terminal electronic device obtains the pixel value of each pixel point of each frame of image in the image sequence, and compares the pixel value of each pixel point in any frame of image in the image sequence with the pixel value of the pixel point at the same position in the adjacent previous frame of image to obtain the identification code corresponding to the pixel value of each pixel point in any frame of image.
In order to facilitate understanding of the process of comparing the pixel value of each pixel point in any frame of image in the image sequence with the pixel value of the pixel point at the same position in the previous frame of image adjacent to the pixel point, the following description is made by way of example. It should be understood that the data referred to in the examples does not represent actual data for each frame of image.
For example, the image sequence acquired by the electronic device at the sending end includes 5 frames of images, which are a first frame of image, a second frame of image, a third frame of image, a fourth frame of image, and a fifth frame of image, respectively, where the second frame of image is used as an example for description, and the pixel values of pixels at the same position in the second frame of image are compared with the pixel values of pixels at the same position in the first frame of image to obtain the process of obtaining the identification code corresponding to the pixel value of each pixel in the second frame of image. As shown in fig. 3, the pixels in the first frame image and the second frame image are arranged in rows and columns, and the first frame image and the second frame image both have M rows and N columns of pixels, where M, N is a positive integer greater than 1, and if M is equal to N is equal to 4, 16 pixels are respectively located in the first frame image and the second frame image, and are respectively numbered as pixels 1 to 16. Specifically, the pixel values of each pixel point with the same number in the second frame image are compared with the pixel values of each pixel point with the same number in the first frame image (for example, the pixel values of two pixel points with the same number in the two frame images are compared), if the pixel values of any two pixel points with the same number are the same, the identification code for the pixel value of any pixel point in the second frame image is 0, and if the pixel values are different, the identification code for the pixel value of any pixel point in the second frame image is 1.
In the mode 2, after the sending terminal electronic equipment obtains the pixel values of all the pixel points of each frame of image in the image sequence, the pixel values of two adjacent pixel points are compared line by line to judge whether the pixel values are the same; if the pixel values are the same, dividing the continuous adjacent pixel points with the same pixel value into a sub-region, and determining the corresponding pixel value of the sub-region; comparing the pixel values of the sub-regions at the same position in any frame of image with the pixel values of the sub-regions at the same position in the previous frame of image, and outputting the identification code.
For example, taking the second frame image as an example, the process of comparing the pixel values of the pixels at the same position in the second frame image with the pixel values of the pixels at the same position in the first frame image to obtain the identification code corresponding to the pixel value of each pixel in the second frame image is performed. Specifically, pixel values of any two adjacent pixel points of the first frame image and the second frame image are compared line by line, and the pixel points which are continuously adjacent and have the same pixel value are divided into the same sub-area.
As shown in fig. 4, the first frame image is divided into 6 sub-regions, wherein the pixel 1, the pixel 2 and the pixel 3 are divided into sub-regions 1, the pixel 4 is divided into sub-regions 2, the pixel 5 is divided into sub-regions 3, the pixels 6, 7 and 8 are divided into sub-regions 4, the pixels 9, 10, 11 and 12 are divided into sub-regions 5, and the pixels 13, 14, 15 and 16 are divided into sub-regions 6; and dividing the second frame image into 5 sub-regions, wherein the pixel points 1 and 2 are divided into sub-regions 7, the pixel points 3 and 4 are divided into sub-regions 8, the pixel points 5, 6, 7 and 8 are divided into sub-regions 9, the pixel points 9, 10, 11 and 12 are divided into sub-regions 10, the pixel points 13, 14, 15 and 16 are divided into sub-regions 11, and the pixel value corresponding to each sub-region is obtained.
Then, comparing the pixel value of the sub-region 7 with the pixel value of the sub-region 1 to obtain an identification code corresponding to the sub-region 7, then comparing the pixel value of the sub-region 8 with the pixel values of the sub-region 1 and the sub-region 2 respectively to obtain an identification code corresponding to the sub-region 8, comparing the pixel value of the sub-region 9 with the pixel values of the sub-region 3 and the sub-region 4 respectively to obtain an identification code corresponding to the sub-region 9, comparing the pixel value of the sub-region 10 with the pixel value of the sub-region 5 to obtain an identification code corresponding to the sub-region 10, and comparing the pixel value of the sub-region 11 with the pixel value of the sub-region 6 to obtain an identification code corresponding to the sub-region 11.
In the method 2 provided in the embodiment of the present application, the continuous adjacent pixel points with the same pixel value in each frame of image are divided into a sub-region, the pixel values corresponding to the sub-region are determined, and the pixel values of the sub-region at the same position in any frame of image and the adjacent previous frame of image are compared. The pixel value of each pixel point of any frame of image is prevented from being compared with the pixel values of the pixel points at the same position in the adjacent previous frame of image one by one, the workload of comparing the pixel values of the pixel points at the same position of two frames of images is reduced, and the image processing efficiency is improved.
Furthermore, the data amount corresponding to the image sequence and the bandwidth of the transmission data are reduced. After the identification code corresponding to the pixel value of each pixel point of any frame of image is obtained, the electronic equipment at the sending end stores the pixel value of each pixel point in any frame of image according to the identification code, and third data corresponding to each pixel point in any frame of image is obtained.
Specifically, the sending-end electronic device stores the pixel value of each pixel point in any frame of image according to the identification code, and there are various ways of obtaining the third data corresponding to each pixel point in any frame of image, and a preferred storage way is described as an example below.
The sending end electronic equipment judges whether the pixel value of any pixel point in any frame of image is the same as the pixel value of the pixel point at the same position in the previous frame of image or not based on the identification code; if the pixel values are the same, storing the identification code to obtain the third data corresponding to any pixel point; and if not, storing the identification code and the pixel value of any pixel point to obtain the third data corresponding to any pixel point.
For example, as shown in fig. 5, the data structure of the third data includes two data areas, which are: the pixel identification method comprises a p area and a q area, wherein the p area stores an identification code corresponding to any pixel point, the q area stores a pixel value of any pixel point, the identification code is represented by a one-digit binary number, and the pixel value is represented by a 30-digit binary number. If the identification code corresponding to the pixel value of any pixel point in any frame of image is 0, determining that the pixel value of any pixel point is the same as the pixel value of the pixel point at the same position in the previous frame of image, storing the identification code in a p area, not storing data in a q area, and only containing one-digit binary number in the third data; if the identification code corresponding to the pixel value of any pixel point in any frame of image is 1, determining that the pixel value of any pixel point is different from the pixel value of the pixel point at the same position in the previous frame of image, storing the identification code in a p area, and storing the pixel value corresponding to the pixel point in a q area, wherein the third data comprises a 31-bit binary number.
Further, any frame image in the image sequence may be a first frame image of the image sequence, or may be any other frame image except the first frame image. If any frame of image is the first frame of image in the image sequence, there are a plurality of methods for the sending-end electronic device to compress the first frame of image, and the following two preferable examples are given as examples.
In the mode 1, the sending-end electronic device converts the pixel value of each pixel point of the first frame image into a binary sequence, and sequentially stores the binary sequence corresponding to the pixel value of each pixel point based on the row and column positions of each pixel point in the first frame image to obtain first data corresponding to the first frame image.
Step 202, the sending-end electronic device verifies whether a preset first sequence exists in the first data, wherein the first sequence is the same as a binary sequence of a start mark or an end mark of a preset frame.
Specifically, the sending-end electronic device stores a binary sequence of a start flag or an end flag of a preset frame, after obtaining first data, the sending-end electronic device verifies whether a sequence identical to the binary sequence of the start flag or the end flag of the preset frame exists in the binary sequence corresponding to the first data, for example, the binary sequence of the end flag of the preset frame is 1111, and the sending-end electronic device verifies whether 1111 exists in the first data.
Step 203, if the first sequence exists in the first data, the sending-end electronic device adjusts a sequence, which is the same as the first sequence, in the first data based on a preset first adjustment mechanism to obtain second data corresponding to each frame of image, so that the sequence, which is the same as the first sequence, does not exist in the second data.
Specifically, after the sending-end electronic device verifies that the first sequence exists in the first data, the sequence in the first data that is the same as the first sequence is adjusted based on the first adjustment mechanism, so as to obtain second data corresponding to each frame of image. Specifically, there are various ways for the sending-end electronic device to adjust the sequence in the first data that is the same as the first sequence to obtain the second data corresponding to each frame of image, and the following two preferred ways are taken as examples for illustration.
In the method 1, the sending-end electronic device adds preset binary data to a preset position of a sequence identical to the first sequence in the first data, for example, the preset position may be between any two binary codes in the sequence identical to the first sequence, and the preset binary data may be 1 binary data or multi-bit binary data.
For example, also taking 1111 as an example of the binary sequence of the end flag of the preset frame, after the sending-end electronic device verifies that the first data exists in the binary sequence of 1111, a bit of binary 0 is added before and adjacent to the last bit of binary number in the sequence 1111, and the sequence 1111 is adjusted to 11101.
For example, also taking 1111 as an example of the binary sequence of the end flag of the preset frame, after the transmitting-end electronic device verifies that the first data exists in the binary sequence of 1111, the transmitting-end electronic device adds an identifier before the last bit or the first bit binary number in the sequence 1111, and adjusts 0101 which is the odd-numbered bit in the binary sequence of 1111 and is opposite to the odd-numbered bit.
In the scheme provided by the embodiment of the application, after each frame of image is compressed to obtain first data corresponding to each frame of image, whether a first sequence identical to a binary sequence of a preset frame start mark or end mark exists in the first data is verified, and if the first sequence identical to the binary sequence of the preset frame start mark or end mark exists in the first data, a sequence identical to the first sequence in the first data is adjusted based on a preset first adjusting mechanism to obtain second data. Therefore, in the scheme provided by the embodiment of the application, the sequence in the first data, which is the same as the first sequence, is adjusted through the first adjustment mechanism, so that a sequence which is the same as a binary sequence of a preset start mark or an end mark of a frame is prevented from existing in compressed data corresponding to each frame of image, and the problem of poor quality of an image obtained through decompression is solved.
Further, if the sending-end electronic device detects that there is no sequence identical to the first sequence in the first data corresponding to each frame of image, after step 202, the processing method further includes:
and step 204, the sending-end electronic device does not adjust the first data.
Furthermore, in order to enable the receiving-end electronic device to identify the data corresponding to each frame of image from the data corresponding to the received image sequence. After the sending-end electronic device adjusts the sequence in the first data, which is the same as the first sequence, based on a preset first adjustment mechanism, the sending-end electronic device further includes:
adding a preset frame starting mark at the starting position of the second data, adding a preset frame ending mark at the tail position of the second data, and adding a preset error correction bit between the second data and the ending mark to obtain fourth data corresponding to any frame of image, wherein the error correction bit is used for representing the error correction of the second data.
Example two
An embodiment of the present application provides a method for processing an image, and referring to fig. 6, the method includes:
step 601, the receiving end electronic device obtains second data corresponding to each frame of image in the image sequence based on a preset starting flag bit of the frame and a preset ending flag bit of the frame.
Specifically, after receiving a binary sequence corresponding to an image sequence sent by a sending-end electronic device, a receiving-end electronic device sequentially reads data based on the sequence of the data in the binary sequence, starts to read second data corresponding to any frame of image if a set of read continuous sequences is the same as the binary sequence of the start flag bit of the preset frame, and ends to read the second data corresponding to any frame of image if the set of read continuous sequences is the same as the binary sequence of the end flag bit of the preset frame, so as to obtain the second data corresponding to each frame of image in the image sequence.
Step 602, the receiving-end electronic device verifies whether a preset second sequence or an identifier exists in the second data, where the second sequence is the same as a binary sequence obtained by adjusting a sequence, which is the same as the preset first sequence, in the first data corresponding to each frame of image based on a preset first adjustment mechanism.
Step 603, if a preset second sequence or identifier exists in the second data, the receiving-end electronic device adjusts a sequence in the second data, which is the same as the second sequence, based on a preset second adjustment mechanism, to obtain first data corresponding to each frame of image.
After the receiving-end electronic device obtains second data corresponding to each frame of image, if it is verified that a preset second sequence or identifier exists in the second data, a sequence identical to the second sequence in the second data is adjusted based on a preset second adjustment mechanism, and a plurality of ways of obtaining first data corresponding to each frame of image are available. The following examples illustrate two preferred embodiments.
In the mode 1, if it is verified that a preset second sequence exists in the second data, the receiving-end electronic device deletes the binary code at the preset position of the sequence in the second data, which is the same as the second sequence, to obtain the first data corresponding to each frame of image.
For example, if the preset second sequence is 1110, when the receiving-end electronic device verifies that the second data includes the data, the last binary code 0 of the sequence 1110 in the second data is deleted, and the sequence 1110 is adjusted to 111.
And 2, if the identifier exists in the second data, the receiving end electronic device adjusts the odd-numbered or even-numbered data in the sequence which is the same as the second sequence after or before the identifier into a binary code opposite to the odd-numbered or even-numbered data, so as to obtain the first data corresponding to each frame of image.
For example, if the identifier exists before the 0101 sequence in the second data, the receiving-end electronic device extracts the sequence 0101 and adjusts the odd digits in the sequence 0101 to the opposite binary number, i.e. 0101 is adjusted to 1111.
Step 604, the receiving end electronic device decompresses the first data to obtain each frame of image.
For example, the identification code in the first data is identified by one-bit binary data, and the pixel value is represented by 30 as a binary code. After receiving first data corresponding to each frame of image, the receiving end electronic device starts from the first binary data of the first data, if the first binary data is 0, the pixel value of a pixel point at the same position as that of the previous frame of image is represented to be the same, the pixel value of the pixel point of the frame of image is obtained based on the pixel value of the pixel point at the same position as that of the previous frame of image, if the first binary data is 1, the pixel value of the pixel point at the same position as that of the previous frame of image is represented to be different, the next 30 binary data is continuously read, the pixel value corresponding to the 30 binary data is determined to be the pixel value of the pixel point, each binary data of the first data is sequentially read in the same mode, and the first data is obtained and converted into an image.
Further, the receiving-end electronic device verifies that there is no preset second sequence or identifier in the second data, and after step 602, the processing method further includes:
Specifically, the process of decompressing the second data by the receiving-end electronic device refers to the process of decompressing the first data by the receiving-end electronic device, which is not described herein again.
EXAMPLE III
An embodiment of the present application provides an image processing apparatus, and referring to fig. 7, the image processing apparatus includes:
a compression module 701, configured to compress each frame of image in an acquired image sequence to obtain first data corresponding to each frame of image, where the first data is a binary sequence;
a verifying module 702, configured to verify whether a preset first sequence exists in the first data, where the preset first sequence is the same as a binary sequence of a start flag or an end flag of a preset frame;
an adjusting module 703 is configured to, if the preset first sequence exists, adjust a sequence in the first data that is the same as the preset first sequence based on a preset first adjusting mechanism to obtain second data corresponding to each frame of image, so that the sequence that is the same as the first sequence does not exist in the second data.
Optionally, the compressing module 701 is specifically configured to:
comparing the pixel values of the pixel points at the same position of any frame of image in the image sequence with the pixel points at the same position of the adjacent previous frame of image one by one to obtain an identification code, wherein the identification code represents the comparison result of the pixel values of the pixel points at the same position;
storing the pixel value of each pixel point in any frame of image according to the identification code to obtain third data corresponding to each pixel point;
and sequentially storing the third data corresponding to each pixel point based on the row and column positions of the pixel points in any frame of image to obtain the first data corresponding to any frame of image.
Optionally, the compression module 701 is specifically configured to;
acquiring pixel values of all pixel points of each frame of image in the image sequence, and comparing whether the pixel values of two adjacent pixel points are the same or not line by line;
if the pixel values of two adjacent pixel points are the same, dividing the continuous adjacent pixel points with the same pixel value into a sub-region, and determining the corresponding pixel value of the sub-region;
comparing the pixel values of the sub-regions at the same position in any frame of image with the pixel values of the sub-regions at the same position in the previous frame of image, and outputting the identification code.
Optionally, the compressing module 701 is specifically configured to:
judging whether the pixel value of any pixel point in any frame of image is the same as the pixel value of a pixel point at the same position in the previous frame of image or not based on the identification code;
if the pixel value of any pixel point in any frame of image is the same as the pixel value of a pixel point at the same position in the previous frame of image, storing the identification code to obtain the third data corresponding to any pixel point;
and if the pixel value of any pixel point in any frame of image is not the same as the pixel value of the pixel point at the same position in the previous frame of image, storing the identification code and the pixel value of any pixel point to obtain the third data corresponding to any pixel point.
Optionally, the preset first adjusting mechanism includes:
adding preset binary data to preset positions of a sequence identical to the first sequence in the first data; or
In the first data, an identifier is added to a start position or an end position of a sequence identical to the first sequence, and data of odd or even bits in the sequence identical to the first sequence is adjusted to a binary code opposite thereto.
Optionally, referring to fig. 8, the processing apparatus further includes: an add module 704;
the adding module 704 is configured to add a preset start flag of a frame at a start position of the second data, add a preset end flag of the frame at an end position of the second data, and add a preset error correction bit between the second data and the end flag to obtain fourth data corresponding to any frame of the image, where the error correction bit is used for representing to correct the error of the second data.
Example four
An embodiment of the present application provides an image processing apparatus, and referring to fig. 9, the image processing apparatus includes:
an obtaining module 901, configured to obtain third data corresponding to each frame of an image in an image sequence based on a start flag or an end flag of a preset frame;
a verifying module 902, configured to verify whether a preset second sequence or an identifier exists in the third data, where the second sequence is the same as a binary sequence obtained by adjusting, based on a preset first adjustment mechanism, a sequence that is the same as the preset first sequence in the first data corresponding to each frame of image;
an adjusting module 903, configured to adjust, if the preset second sequence exists, a sequence in the second data that is the same as the second sequence based on a preset second adjusting mechanism, to obtain first data corresponding to each frame of image;
and a decompression module 904, configured to decompress the first data to obtain each frame of image.
Optionally, the second adjustment mechanism includes:
deleting binary codes at preset positions of a sequence which is the same as the second sequence in the second data to obtain the first data corresponding to each frame of image; or
In the second data, the odd-numbered or even-numbered data in the sequence which is the same as the second sequence after or before the identifier is adjusted to a binary code opposite to the odd-numbered or even-numbered data, and the first data corresponding to each frame of image is obtained.
EXAMPLE five
An embodiment of the present application provides an image processing apparatus, and referring to fig. 10, the image processing apparatus includes:
a memory 1001 for storing instructions executed by at least one processor;
the processor 1002 is configured to execute instructions stored in the memory to perform the method of the first embodiment.
EXAMPLE six
Embodiments of the present application provide a computer-readable storage medium, which stores computer instructions that, when executed on a computer, cause the computer to perform the method of embodiment one.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (7)
1. A method of processing an image, comprising:
acquiring pixel values of pixel points of each frame of image in the image sequence, and comparing whether the pixel values of two adjacent pixel points are the same or not line by line;
if the pixel values are the same, dividing the continuous adjacent pixel points with the same pixel value into a sub-region, and determining the corresponding pixel value of the sub-region;
comparing the pixel values of the sub-regions at the same position in any frame of image in the image sequence with the pixel values of the sub-regions at the same position in the adjacent previous frame of image, and outputting an identification code, wherein the identification code represents the comparison result of the pixel values of the pixel points at each same position;
storing the pixel value of each pixel point in any frame of image according to the identification code to obtain third data corresponding to each pixel point;
sequentially storing third data corresponding to each pixel point based on the row and column positions of the pixel points in any frame of image to obtain first data corresponding to any frame of image, wherein the first data is a binary sequence;
verifying whether a preset first sequence exists in the first data, wherein the first sequence is the same as a binary sequence of a starting mark or an ending mark of a preset frame;
if the first sequence exists, adjusting a sequence which is the same as the first sequence in the first data based on a preset first adjusting mechanism to obtain second data corresponding to each frame of image, so that the sequence which is the same as the first sequence does not exist in the second data;
wherein the preset first adjustment mechanism comprises:
in the first data, an identifier is added to a start position or an end position of a sequence identical to the first sequence, and data of odd or even bits in the sequence identical to the first sequence is adjusted to a binary code opposite thereto.
2. The method of claim 1, wherein storing pixel values of each pixel point in any one of the frame images according to the identification code to obtain third data corresponding to each pixel point in any one of the frame images comprises:
judging whether the pixel value of any pixel point in any frame of image is the same as the pixel value of a pixel point at the same position in the previous frame of image or not based on the identification code;
if the pixel values are the same, storing the identification code to obtain the third data corresponding to any pixel point;
and if not, storing the identification code and the pixel value of any pixel point to obtain the third data corresponding to any pixel point.
3. The method of claim 1, wherein after adjusting the same sequence as the first sequence in the first data based on a preset first adjustment mechanism, further comprising:
adding a preset frame starting mark at the starting position of the second data, adding a preset frame ending mark at the tail position of the second data, and adding a preset error correction bit between the second data and the ending mark to obtain fourth data corresponding to any frame of image, wherein the error correction bit is used for representing the error correction of the second data.
4. A method of processing an image, comprising:
acquiring second data corresponding to each frame of image in the image sequence based on a starting zone bit of a preset frame and an ending zone bit of the preset frame;
verifying whether a preset second sequence or an identifier exists in the second data, wherein the second sequence is the same as a binary sequence obtained by adjusting a sequence, which is the same as the preset first sequence, in the first data corresponding to each frame of image based on a preset first adjustment mechanism, and the first adjustment mechanism comprises: in the first data, adding an identifier at the start position or the end position of a sequence identical to the first sequence, and adjusting data with odd or even bits in the sequence identical to the first sequence into a binary code opposite to the identifier, wherein the preset first sequence is identical to a binary sequence of a start mark or an end mark of a preset frame;
if the first frame image exists, adjusting a sequence in the second data, which is the same as the second sequence, based on a preset second adjustment mechanism to obtain first data corresponding to each frame image, where the second adjustment mechanism includes: in the second data, adjusting the data with odd number or even number in the sequence which is the same as the second sequence after or before the identifier into a binary code opposite to the data with odd number or even number in the sequence, and obtaining the first data corresponding to each frame of image;
reading any binary data in the first data from first binary data of the first data, and if the identification code of any binary data represents that the pixel value of a pixel point at the same position of a previous frame image is the same as the pixel value of a pixel point at the same position of the previous frame image, obtaining the pixel value of the pixel point at the same position of each frame image based on the pixel value of the pixel point at the same position of the previous frame image; or if the identification code of any bit of binary data indicates that the pixel value of the pixel point at the same position as that of the previous frame of image is different, continuing to read the binary data behind any bit of binary data, and determining the pixel value corresponding to the binary data behind any bit of binary data to obtain each frame of image.
5. An apparatus for processing an image, comprising:
the compression module is used for acquiring the pixel values of all the pixel points of each frame of image in the acquired image sequence and comparing whether the pixel values of two adjacent pixel points are the same or not line by line; if the pixel values are the same, dividing the continuous adjacent pixel points with the same pixel value into a sub-region, and determining the corresponding pixel value of the sub-region; comparing the pixel values of the sub-regions at the same position in any frame of image in the image sequence with the pixel values of the sub-regions at the same position in the adjacent previous frame of image, and outputting an identification code, wherein the identification code represents the comparison result of the pixel values of the pixel points at each same position; storing the pixel value of each pixel point in any frame of image according to the identification code to obtain third data corresponding to each pixel point; sequentially storing third data corresponding to each pixel point based on the row and column positions of the pixel points in any frame of image to obtain first data corresponding to any frame of image, wherein the first data is a binary sequence;
a verification module, configured to verify whether a preset first sequence exists in the first data, where the preset first sequence is the same as a binary sequence of a start flag or an end flag of a preset frame;
an adjusting module, configured to adjust, based on a preset first adjusting mechanism, a sequence in the first data that is the same as the preset first sequence to obtain second data corresponding to each frame of image if the preset first sequence exists, so that the second data does not have the sequence that is the same as the first sequence;
wherein the preset first adjustment mechanism comprises:
in the first data, an identifier is added to a start position or an end position of a sequence identical to the first sequence, and data of odd or even bits in the sequence identical to the first sequence is adjusted to a binary code opposite thereto.
6. An apparatus for processing an image, comprising:
the acquisition module is used for acquiring second data corresponding to each frame of image in the image sequence based on a starting zone bit or an ending zone bit of a preset frame;
a verification module, configured to verify whether a preset second sequence or an identifier exists in the second data, where the second sequence is the same as a binary sequence obtained by adjusting, based on a preset first adjustment mechanism, a sequence that is the same as a preset first sequence in first data corresponding to each frame of image, and the first adjustment mechanism includes: in the first data, adding an identifier at the start position or the end position of a sequence identical to the first sequence, and adjusting data with odd or even bits in the sequence identical to the first sequence into a binary code opposite to the identifier, wherein the preset first sequence is identical to a binary sequence of a start mark or an end mark of a preset frame;
an adjusting module, configured to adjust, if the preset second sequence exists, a sequence, which is the same as the second sequence, in the second data based on a preset second adjusting mechanism, to obtain first data corresponding to each frame of image, where the second adjusting mechanism includes: in the second data, adjusting the data with odd number or even number in the sequence which is the same as the second sequence after or before the identifier into a binary code opposite to the data with odd number or even number in the sequence, and obtaining the first data corresponding to each frame of image;
the decompression module is used for reading any binary data in the first data from the first binary data of the first data, and if the identification code of any binary data indicates that the pixel value of the pixel point at the same position of the previous frame image is the same as the pixel value of the pixel point at the same position of the previous frame image, the pixel value of the pixel point at the same position of each frame image is obtained based on the pixel value of the pixel point at the same position of the previous frame image; or if the identification code of any bit of binary data indicates that the pixel value of the pixel point at the same position as that of the previous frame of image is different, continuing to read the binary data behind any bit of binary data, and determining the pixel value corresponding to the binary data behind any bit of binary data to obtain each frame of image.
7. An apparatus for processing an image, comprising:
a memory for storing instructions for execution by the processor;
a processor for executing instructions stored in the memory to perform the method of any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910344056.1A CN109982091B (en) | 2019-04-26 | 2019-04-26 | Image processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910344056.1A CN109982091B (en) | 2019-04-26 | 2019-04-26 | Image processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109982091A CN109982091A (en) | 2019-07-05 |
| CN109982091B true CN109982091B (en) | 2022-04-22 |
Family
ID=67086514
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910344056.1A Active CN109982091B (en) | 2019-04-26 | 2019-04-26 | Image processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109982091B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111565191A (en) * | 2020-05-07 | 2020-08-21 | 南通保利佳服务外包有限公司 | Data compression and transmission system and method |
| CN115691369A (en) * | 2021-07-21 | 2023-02-03 | 北京京东方光电科技有限公司 | Display method of display panel, display control device of display panel and display device |
| CN114245010B (en) * | 2021-12-08 | 2023-07-14 | 浙江大华技术股份有限公司 | Image adjustment method and device, storage medium and electronic device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH11289338A (en) * | 1997-07-04 | 1999-10-19 | Fujitsu Ltd | Frame collision control system and terminal |
| CN1618235A (en) * | 2002-01-22 | 2005-05-18 | 微软公司 | Methods and systems for start code emulation prevention and data stuffing |
| CN101321279A (en) * | 2007-06-05 | 2008-12-10 | 美国博通公司 | Method and system for processing data |
| CN101656878A (en) * | 2008-08-19 | 2010-02-24 | 新奥特（北京）视频技术有限公司 | Improved method for interframe compression |
| CN103260000A (en) * | 2013-03-07 | 2013-08-21 | 北京君正集成电路股份有限公司 | Method and device for removing competition prevention code |
| CN103369311A (en) * | 2012-04-04 | 2013-10-23 | 朱洪波 | Method for preventing conflict of initial code |
| CN104486628A (en) * | 2014-12-30 | 2015-04-01 | 华中科技大学 | Inter-frame lossless coding and intelligent decoding method with error code resistance mechanism |
| CN108540799A (en) * | 2018-05-16 | 2018-09-14 | 重庆堂堂网络科技有限公司 | It is a kind of can be with the compression method of difference between one video file two field pictures of Precise Representation |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109600616B (en) * | 2018-11-27 | 2022-11-04 | 西安汇明科技发展有限责任公司 | Code stream packaging method based on H.264 video compression standard |
-
2019
- 2019-04-26 CN CN201910344056.1A patent/CN109982091B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH11289338A (en) * | 1997-07-04 | 1999-10-19 | Fujitsu Ltd | Frame collision control system and terminal |
| CN1618235A (en) * | 2002-01-22 | 2005-05-18 | 微软公司 | Methods and systems for start code emulation prevention and data stuffing |
| CN101321279A (en) * | 2007-06-05 | 2008-12-10 | 美国博通公司 | Method and system for processing data |
| CN101656878A (en) * | 2008-08-19 | 2010-02-24 | 新奥特（北京）视频技术有限公司 | Improved method for interframe compression |
| CN103369311A (en) * | 2012-04-04 | 2013-10-23 | 朱洪波 | Method for preventing conflict of initial code |
| CN103260000A (en) * | 2013-03-07 | 2013-08-21 | 北京君正集成电路股份有限公司 | Method and device for removing competition prevention code |
| CN104486628A (en) * | 2014-12-30 | 2015-04-01 | 华中科技大学 | Inter-frame lossless coding and intelligent decoding method with error code resistance mechanism |
| CN108540799A (en) * | 2018-05-16 | 2018-09-14 | 重庆堂堂网络科技有限公司 | It is a kind of can be with the compression method of difference between one video file two field pictures of Precise Representation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109982091A (en) | 2019-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109982091B (en) | Image processing method and device | |
| RU2479937C2 (en) | Information processing apparatus and method | |
| CN104754361A (en) | Image encoding and decoding method and device | |
| CN106937121A (en) | Image decoding and coding method, decoding and code device, decoder and encoder | |
| CN105025347A (en) | Sending and receiving methods of GOP image groups | |
| CN108347602B (en) | Method and apparatus for lossless compression of video data | |
| CN112565749B (en) | Video coding method, device and system and computer readable storage medium | |
| CN113949865A (en) | Image encoding method, image encoding device, computer apparatus, storage medium, and image decoding method | |
| CN106656195A (en) | Data compression decompression method and data compression decompression system | |
| US8306346B2 (en) | Static image compression method and non-transitory computer readable medium having a file with a data structure | |
| US8681860B2 (en) | Moving picture compression apparatus and method of controlling operation of same | |
| CN116250238A (en) | Method and apparatus for encoding and decoding one or more views of a scene | |
| CN109379591B (en) | Image transcoding method, electronic device and computer readable storage medium | |
| CN110636334B (en) | Data transmission method and system | |
| US20180270507A1 (en) | Method for encoding streams of video data based on groups of pictures (gop) | |
| US8446299B2 (en) | Method and device for encoding and decoding of data in unique number values | |
| US20050036046A1 (en) | Method of or device for processing image data, a processed image data format, and a method of or device for displaying at least one image from the processed image data | |
| CN113573059B (en) | Image display method, image display apparatus, storage medium, and electronic apparatus | |
| US11599570B2 (en) | Device and method to render multimedia data stream tamper-proof based on block chain recording | |
| US8131091B2 (en) | Method and apparatus for compressing text and image | |
| CN113014905A (en) | Image frame generation method and device, storage medium and electronic equipment | |
| US20120106861A1 (en) | Image compression method | |
| US9986202B2 (en) | Spectrum pre-shaping in video | |
| CN113852823B (en) | Image data uploading method, system and device based on Internet of things | |
| US9560364B2 (en) | Encoding image data with quantizing and inverse-quantizing pixel values |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |