CN110868603A - Bayer image compression method - Google Patents

Bayer image compression method Download PDF

Info

Publication number
CN110868603A
CN110868603A CN201911065301.1A CN201911065301A CN110868603A CN 110868603 A CN110868603 A CN 110868603A CN 201911065301 A CN201911065301 A CN 201911065301A CN 110868603 A CN110868603 A CN 110868603A
Authority
CN
China
Prior art keywords
matrix
dct
column
filling
bayer image
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.)
Granted
Application number
CN201911065301.1A
Other languages
Chinese (zh)
Other versions
CN110868603B (en
Inventor
朱树元
贺康
刘光辉
曾兵
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
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 University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201911065301.1A priority Critical patent/CN110868603B/en
Publication of CN110868603A publication Critical patent/CN110868603A/en
Application granted granted Critical
Publication of CN110868603B publication Critical patent/CN110868603B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/625Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using discrete cosine transform [DCT]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/124Quantisation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods 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/182Methods 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods 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/186Methods 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 colour or a chrominance component
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/42Methods 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

Abstract

The invention belongs to the technical field of image processing, in particular to a Bayer image compression method; the method is used for overcoming the problems that the quality of a restored image is reduced by converting two green pixels into one pixel, or the number of bits required by coding is increased by designing complex structural transformation aiming at a Y matrix in the conventional Bayer image compression method. The invention firstly uses G of Bayer image1RBG2Colour permutation conversion to new colour permutation Y1UVY2The method eliminates the correlation of RGB color space, can improve the compression ratio and ensure the quality of the recovered image; then, by rearrangement-column filling-The method of column DCT-row filling-row DCT performs DCT transformation on the Y matrix without losing any existing information and simultaneously reduces the bit number required for coding the Y matrix; in conclusion, the invention has larger compression ratio under the condition of the same recovered image quality, and the method is simple and obviously reduces the operation complexity.

Description

Bayer image compression method
Technical Field
The invention belongs to the technical field of image processing, and particularly relates to a Bayer image compression method.
Background
To produce color images, most digital cameras use a single CMOS board with several different color filters and use interpolation techniques to produce full color images. Among several different Color Filter Arrays (CFAs), Bayer-CFA is the most commonly used, with only one color component in each pixel, and so the other two color components of a given pixel must be interpolated using adjacent pixel information. Although there are several possible interpolation algorithms, they all result in an increase in redundancy from an information theory point of view.
Most of the existing compression methods of the CMOS images on the civil digital cameras compress the images after the interpolation of the images, the data volume of the compression is three times of that of the original Bayer images, and the compression method is not beneficial to the image compression real-time performance of the space camera.
Disclosure of Invention
The present invention is directed to overcoming the above-mentioned drawbacks of the prior art and providing a Bayer image compression method which is simple to implement, i.e., does not increase the number of bits required for encoding or degrade the quality of a restored image.
In order to achieve the purpose, the invention adopts the technical scheme that:
a Bayer image compression method comprising the steps of:
s1, converting G of Bayer image1RBG2Colour permutation conversion to new colour permutation Y1UVY2To eliminate the correlation of the RGB color space;
s2, rearranging the Y matrix, filling numbers in empty positions twice to perform one-dimensional DCT transformation to ensure that the two-dimensional DCT domain coefficient has the minimum non-zero value, and carrying out quantization coding on DCT domain data; the method specifically comprises the following steps:
s21, separating the U componentsForming a U matrix, forming a V matrix by the V components independently, and forming non-Y in the original matrix1And Y2Filling the component positions with zeros to form a Y matrix;
s22, performing zero padding expansion on the Y matrix to enable the number of rows and the number of columns to be integer multiples of 8;
s23, dividing the expanded Y matrix into 8 × 8 pixel blocks, and performing the following processing for each block:
1) rearranging: arranging 32 effective Y pixels in an 8x8 pixel block at the upper left corner in a 'Zig-Zag scanning' manner;
2) column filling: the number of effective pixels is n, the vector formed by the effective numbers is y, then 8-n numbers which need to be inserted are recorded, and the vector formed by the inserted numbers is x:
x=Pn*y
wherein, Pn:
Figure BDA0002259131850000021
Figure BDA0002259131850000022
Figure BDA0002259131850000023
Figure BDA0002259131850000024
Figure BDA0002259131850000025
P7=[-0.1989 0.5665 -0.8478 1 0.8478 -0.5665 0.1989]
Corresponding to the inserted position:
Pos2:1 3 4 5 6 8
Pos3:2 3 5 6 8
Pos4:2 4 6 7
Pos5:2 4 6
Pos6:3 6
Pos7:5
3) column DCT: performing row-column DCT transformation on the column filling result;
4) and (3) line filling: completing row filling of the column DCT transformation result by adopting (2) the same treatment;
5) line DCT: performing DCT (discrete cosine transformation) on the line filling result;
6) quantization coding: quantizing the line DCT result according to a JPEG gray quantization table, and encoding the quantization result according to a standard JPEG encoding mode;
s3, performing two-dimensional DCT on the U and V matrixes, and performing JPEG chroma quantization and coding on DCT domain data and sending;
s4, the data is received, and inverse quantization and inverse transformation are performed to reconstruct an image.
Further, the step S1 specifically includes:
s11, conducting zero filling expansion on the Bayer image to enable the number of rows and the number of columns to be integer multiples of 2;
s12, color labeling the expanded Bayer, and labeling it as four components:
G1(m n)=S(2m-1 2n-1)
R(m n)=S(2m-1 2n)
B(m n)=S(2m 2n-1)
G2(m n)=S(2m 2n)
wherein S represents the original Bayer image matrix, G1Representing the green component of odd columns of odd rows, R representing the red component, B representing the blue component, G2Green components of even rows and even columns are represented, and m and n represent the m-th row and the n-th column of the matrix;
s13, matrix transforming the four components of each 2 × 2 block as follows:
Figure BDA0002259131850000031
four components Y obtained1、U、V、Y2Thereby G will be1RBG2Color rowColumn to Y1UVY2Color arrangement;
g of Bayer image1RBG2Colour permutation conversion to new colour permutation Y1UVY2To eliminate the correlation of the RGB color space, the compression ratio can be increased.
Further, in step S3, the two-dimensional DCT transform, quantization, and encoding all use the standard JPEG compression encoding method.
Further, the step S4 is specifically:
s41, after receiving the data sent in the steps S2 and S3, decoding the data and reconstructing a quantized matrix;
s42, inverse quantization corresponding to the quantization in S3 and S2 is performed on the quantized matrix;
s43, performing two-dimensional inverse DCT on the U, V matrix two-dimensional DCT transformation result;
s44, the following process is performed for each 8 × 8 block of the Y matrix change result:
1) performing line inverse DCT transformation;
2) line screening: selecting the corresponding effective pixels in the step 4) in the step 23 to be arranged on the left side of each line;
3) performing column inverse DCT transformation;
4) column screening: selecting the corresponding effective pixels in the step 2) in the step 23 to be arranged on the upper side of each column;
5) and (3) recovering the arrangement: restoring the original arrangement at a position corresponding to step 1) of S23;
s45, inversely transforming the color arrangement according to the following formula:
Figure BDA0002259131850000041
the invention has the beneficial effects that:
the invention provides a Bayer image compression method, firstly, G of the Bayer image is compressed1RBG2Colour permutation conversion to new colour permutation Y1UVY2The method eliminates the correlation of RGB color space, can improve the compression ratio and ensure the quality of the recovered image; then go toThe method of rearrangement-column filling-column DCT-row filling-row DCT is used for performing DCT transformation on the Y matrix, no existing information is lost, and the bit number required for coding the Y matrix is reduced; in conclusion, the invention has larger compression ratio under the condition of the same recovered image quality, and the method is simple and obviously reduces the operation complexity.
Drawings
Fig. 1 is a schematic flow chart of a Bayer image compression method according to the present invention.
Fig. 2 is a schematic diagram of colors of each pixel point of a Bayer pattern image in the embodiment of the present invention.
FIG. 3 is a G of a Bayer image in an embodiment of the invention1RBG2Colour permutation conversion to new colour permutation Y1UVY2Schematic representation.
Fig. 4 is a schematic diagram illustrating the separate processing of the Y matrix and the U, V matrix in the embodiment of the present invention.
FIG. 5 is a diagram illustrating DCT transformation according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
The invention provides a Bayer image compression method, wherein one-dimensional DCT change is involved, and the known one-dimensional DCT change can be represented by a matrix form:
Figure BDA0002259131850000051
where C denotes a transform matrix, y denotes a vector composed of significant digits, x denotes a vector composed of values to be inserted, and the coefficients of the highest few bits of frequency in the DCT domain are 0, there are:
Figure BDA0002259131850000052
changing the position of the x interpolation so that C11Minimum condition number, assume C11Minimum condition number
Figure BDA0002259131850000053
Is denoted by PnAnd then:
x=Pn*y
wherein n is the number of significant digits.
Based on this, the Bayer image compression method in this embodiment, as shown in fig. 1, includes the following steps:
step S1, converting G of Bayer image1RBG2Colour permutation conversion to new colour permutation Y1UVY2To eliminate the correlation of the RGB color space;
the method specifically comprises the following steps:
s11, conducting zero filling expansion on the Bayer image to enable the number of rows and the number of columns to be integer multiples of 2; thus, in the following steps, the image can be divided into 2x2 blocks for color arrangement conversion;
s12, color marking the expanded Bayer, as shown in FIG. 2, specifically marking the upper left corner of each 2x2 pixel block as G1The top right pixel of every 2x2 pixel block is labeled R, the bottom left pixel of every 2x2 pixel block is labeled B, the bottom right pixel of every 2x2 pixel block is labeled G2The subsequent operation is convenient;
s13, performing color arrangement conversion on the color marked Bayer image, as shown in fig. 3, where the conversion matrix is:
Figure BDA0002259131850000054
step S2, rearranging the Y matrix, filling numbers at the empty position (0 position) twice to perform one-dimensional DCT transformation to ensure that the two-dimensional DCT domain has the least non-zero value, and carrying out quantization coding on DCT domain data;
the method comprises the following specific steps:
s21, as shown in FIG. 4, the U components are formed into U matrix separately, the V components are formed into V matrix separately, and Y is1And Y2The composed matrix is called Y matrix;
s22, expanding the Y matrix to make the number of rows and the number of columns be integer multiples of 8, so that the Y matrix can be divided into 8x8 blocks for processing respectively;
s23, as shown in fig. 5, the expanded Y matrix is divided into 8 × 8 pixel blocks, and the following processing is performed for each block:
1) rearranging: the target is that after the two-dimensional DCT transformation of each block, the high 32-dimensional coefficient is 0, so that the information quantity cannot be increased, and therefore, 32 effective Y pixels in an 8x8 pixel block are arranged at the upper left corner in a 'Zig-Zag scanning' mode;
2) column filling: the number of effective pixels in one column is n, the column vector formed by the effective numbers is y, then the 8-n numbers to be inserted are needed, the column vector formed by the inserted numbers is x:
x=Pn*y
Pnand the locations where insertion is required have been listed in the summary;
3) column DCT: performing row-column DCT transformation on the column filling result;
4) and (3) line filling: and (3) filling the row DCT conversion result, wherein the number of effective pixels in a row is n, a column vector formed by effective numbers is marked as y, then 8-n numbers which need to be inserted are marked as x:
x=Pn*y
Pnand the locations where insertion is required have been listed in the summary;
5) line DCT: performing DCT (discrete cosine transformation) on the line filling result;
6) quantization coding: quantizing the line DCT result according to a JPEG gray quantization table, and encoding the quantization result according to a standard JPEG encoding mode;
s3, performing two-dimensional DCT on the U and V matrixes, performing quantization coding on DCT domain data, and sending the DCT domain data;
step S4, restoring the image in the reverse order of steps S1-S3.
The Bayer image compression method has the advantages of higher compression ratio, simple algorithm and reduced operation complexity when the restored image quality is the same.
While the invention has been described with reference to specific embodiments, any feature disclosed in this specification may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise; all of the disclosed features, or all of the method or process steps, may be combined in any combination, except mutually exclusive features and/or steps.

Claims (3)

1. A Bayer image compression method comprising the steps of:
s1, converting G of Bayer image1RBG2Colour permutation conversion to new colour permutation Y1UVY2
S2, rearranging the Y matrix, performing one-dimensional DCT (discrete cosine transform) transformation after filling numbers in empty positions twice, quantizing and encoding DCT domain data, and sending; the method specifically comprises the following steps:
s21, independently forming U matrix by the U components, independently forming V matrix by the V components, and forming non-Y matrix in the original matrix1And Y2Filling the component positions with zeros to form a Y matrix;
s22, performing zero padding expansion on the Y matrix to enable the number of rows and the number of columns to be integer multiples of 8;
s23, dividing the expanded Y matrix into 8 × 8 pixel blocks, and performing the following processing for each block:
1) rearranging: arranging 32 effective Y pixels in an 8x8 pixel block at the upper left corner in a 'Zig-Zag scanning' manner;
2) column filling: the number of effective pixels is n, the vector formed by the effective numbers is marked as y, then 8-n numbers which need to be inserted are marked as x:
x=Pn*y
wherein, Pn:
Figure FDA0002259131840000011
Figure FDA0002259131840000012
Figure FDA0002259131840000013
Figure FDA0002259131840000021
Figure FDA0002259131840000022
P7=[-0.1989 0.5665 -0.8478 1 0.8478 -0.5665 0.1989]
Corresponding to the inserted position:
Pos2:1 3 4 5 6 8
Pos3:2 3 5 6 8
Pos4:2 4 6 7
Pos5:2 4 6
Pos6:3 6
Pos7:5
3) column DCT: performing row-column DCT transformation on the column filling result;
4) and (3) line filling: completing row filling of the column DCT transformation result by adopting (2) the same treatment;
5) line DCT: performing DCT (discrete cosine transformation) on the line filling result;
6) quantization coding: quantizing the line DCT result according to a JPEG gray quantization table, and encoding the quantization result according to a standard JPEG encoding mode;
s3, performing two-dimensional DCT on the U and V matrixes, and performing JPEG chroma quantization and coding on DCT domain data and sending;
s4, the data is received, and inverse quantization and inverse transformation are performed to reconstruct an image.
2. The Bayer image compression method according to claim 1, wherein the step S1 is specifically:
s11, conducting zero filling expansion on the Bayer image to enable the number of rows and the number of columns to be integer multiples of 2;
s12, color labeling the expanded Bayer, and labeling it as four components:
G1(m n)=S(2m-1 2n-1)
R(m n)=S(2m-1 2n)
B(m n)=S(2m 2n-1)
G2(m n)=S(2m 2n)
wherein S represents the original Bayer image matrix, G1Representing the green component of odd columns of odd rows, R representing the red component, B representing the blue component, G2Green components of even rows and even columns are represented, and m and n represent the m-th row and the n-th column of the matrix;
s13, matrix transforming the four components of each 2 × 2 block as follows:
Figure FDA0002259131840000031
four components Y obtained1、U、V、Y2Thereby G will be1RBG2Color arrangement conversion to Y1UVY2Color arrangement;
g of Bayer image1RBG2Colour permutation conversion to new colour permutation Y1UVY2To eliminate the correlation of the RGB color space, the compression ratio can be increased.
3. The Bayer image compression method according to claim 1, wherein the step S4 is specifically:
s41, after receiving the data sent in the steps S2 and S3, decoding the data and reconstructing a quantized matrix;
s42, inverse quantization corresponding to the quantization in S3 and S2 is performed on the quantized matrix;
s43, performing two-dimensional inverse DCT on the U, V matrix two-dimensional DCT transformation result;
s44, the following process is performed for each 8 × 8 block of the Y matrix change result:
1) performing line inverse DCT transformation;
2) line screening: selecting the effective pixels corresponding to the step 4) in the step 23 to be arranged on the left of each line;
3) performing column inverse DCT transformation;
4) column screening: selecting the effective pixels corresponding to the step 2) in the step 23 to be arranged on the upper side of each column;
5) and (3) recovering the arrangement: restoring the original arrangement at a position corresponding to step 1) of S23;
s45, inversely transforming the color arrangement according to the following formula:
Figure FDA0002259131840000032
CN201911065301.1A 2019-11-04 2019-11-04 Bayer image compression method Active CN110868603B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911065301.1A CN110868603B (en) 2019-11-04 2019-11-04 Bayer image compression method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911065301.1A CN110868603B (en) 2019-11-04 2019-11-04 Bayer image compression method

Publications (2)

Publication Number Publication Date
CN110868603A true CN110868603A (en) 2020-03-06
CN110868603B CN110868603B (en) 2021-08-06

Family

ID=69653368

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911065301.1A Active CN110868603B (en) 2019-11-04 2019-11-04 Bayer image compression method

Country Status (1)

Country Link
CN (1) CN110868603B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111654705A (en) * 2020-06-05 2020-09-11 电子科技大学 Mosaic image compression method based on novel color space conversion
CN113852820A (en) * 2021-08-30 2021-12-28 电子科技大学 Novel color space conversion matrix generation method
CN114189689A (en) * 2021-11-25 2022-03-15 广州思德医疗科技有限公司 Image compression processing method and device, electronic equipment and storage medium

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007324972A (en) * 2006-06-01 2007-12-13 Fuji Xerox Co Ltd Encoder, encoding method, and program
US20090174811A1 (en) * 2007-12-11 2009-07-09 Chih-Ta Star Sung Method and apparatus of bayer pattern direct video compression
CN101977330A (en) * 2010-11-12 2011-02-16 北京空间机电研究所 Bayer image compression method based on YUV conversion
CN102034220A (en) * 2010-12-23 2011-04-27 武汉大学苏州研究院 Digital watermark-based electronic bill image anti-tamper method
CN103414903A (en) * 2013-08-28 2013-11-27 清华大学 Compressing method and device for Bayer format images
US20130329098A1 (en) * 2012-05-31 2013-12-12 Apple Inc. Systems and Methods for Defective Pixel Correction with Neighboring Pixels
CN104427349A (en) * 2013-08-20 2015-03-18 清华大学 Bayer image compression method
CN108632610A (en) * 2018-04-18 2018-10-09 电子科技大学 A kind of colour image compression method based on interpolation reconstruction

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007324972A (en) * 2006-06-01 2007-12-13 Fuji Xerox Co Ltd Encoder, encoding method, and program
US20090174811A1 (en) * 2007-12-11 2009-07-09 Chih-Ta Star Sung Method and apparatus of bayer pattern direct video compression
CN101977330A (en) * 2010-11-12 2011-02-16 北京空间机电研究所 Bayer image compression method based on YUV conversion
CN102034220A (en) * 2010-12-23 2011-04-27 武汉大学苏州研究院 Digital watermark-based electronic bill image anti-tamper method
US20130329098A1 (en) * 2012-05-31 2013-12-12 Apple Inc. Systems and Methods for Defective Pixel Correction with Neighboring Pixels
CN104427349A (en) * 2013-08-20 2015-03-18 清华大学 Bayer image compression method
CN103414903A (en) * 2013-08-28 2013-11-27 清华大学 Compressing method and device for Bayer format images
CN108632610A (en) * 2018-04-18 2018-10-09 电子科技大学 A kind of colour image compression method based on interpolation reconstruction

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111654705A (en) * 2020-06-05 2020-09-11 电子科技大学 Mosaic image compression method based on novel color space conversion
CN111654705B (en) * 2020-06-05 2022-11-11 电子科技大学 Mosaic image compression method based on color space conversion
CN113852820A (en) * 2021-08-30 2021-12-28 电子科技大学 Novel color space conversion matrix generation method
CN113852820B (en) * 2021-08-30 2023-06-30 电子科技大学 Novel color space conversion matrix generation method
CN114189689A (en) * 2021-11-25 2022-03-15 广州思德医疗科技有限公司 Image compression processing method and device, electronic equipment and storage medium
CN114189689B (en) * 2021-11-25 2024-02-02 广州思德医疗科技有限公司 Image compression processing method, device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN110868603B (en) 2021-08-06

Similar Documents

Publication Publication Date Title
CN110868603B (en) Bayer image compression method
JP4559622B2 (en) Color image compression based on two-dimensional discrete wavelet transform yielding perceptually lossless images
US9924199B2 (en) Method and apparatus for compressing image data using compression profiles
CA2676099A1 (en) Method of compressing digital images
CN110087090B (en) Data coding and decoding method adopting mixed string matching and intra-frame prediction
JP3908095B2 (en) Digital imaging system that reduces color aliasing artifacts
EP0908055A1 (en) Method, apparatus and system for compressing data
JP4083934B2 (en) Image processing apparatus and image processing method
Hao et al. Comparative study of color transforms for image coding and derivation of integer reversible color transform
JP2011015347A (en) Apparatus and method for processing image, program and recording medium
WO2019237659A1 (en) Blind compressive sampling method, apparatus and imaging system
CN111654705B (en) Mosaic image compression method based on color space conversion
CN114902276A (en) Image processor
JPH1075448A (en) Image compressor and image expander
JP4257145B2 (en) Image compression apparatus and image processing system
Trifan et al. A survey on lossless compression of Bayer color filter array images
JP4975770B2 (en) Image decoding method and apparatus
JP2008124530A (en) Raw data compressing method
CN110971913B (en) Bayer image compression method based on filling Y channel
JP2006340300A (en) Signal processing method, signal processing apparatus, signal processing program and information recording medium
US11765366B2 (en) Method for processing transform coefficients
CN113365074B (en) Encoding and decoding method and device for limiting point prediction frequent position and point vector number thereof
CN108989820B (en) Data compression method and device adopting respective corresponding chroma sampling formats at all stages
CA2372514A1 (en) Method of compressing digital images
TW202137746A (en) Image processor

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