WO2020113766A1 - Procédé de compression de table de compensation - Google Patents
Procédé de compression de table de compensation Download PDFInfo
- Publication number
- WO2020113766A1 WO2020113766A1 PCT/CN2019/071033 CN2019071033W WO2020113766A1 WO 2020113766 A1 WO2020113766 A1 WO 2020113766A1 CN 2019071033 W CN2019071033 W CN 2019071033W WO 2020113766 A1 WO2020113766 A1 WO 2020113766A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- compensation table
- sub
- block
- quantization
- compression method
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/14—Digital output to display device ; Cooperation and interconnection of the display device with other functional units
- G06F3/1407—General aspects irrespective of display type, e.g. determination of decimal point position, display with fixed or driving decimal point, suppression of non-significant zeros
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
- G06T9/007—Transform coding, e.g. discrete cosine transform
Definitions
- the invention relates to the field of image processing, in particular to a compensation table compression method.
- Data compression is a relatively mature technology for reducing data size. It is applied to the data stored in the memory subsystem of the computer system to increase the storage capacity. Data compression is also used when data is transferred between different subsystems within a computer system, or generally when the transfer is performed between two points in a data communication system that includes a communication network.
- Data compression requires two basic operations: 1. Compression (also called encoding). Compression is to take uncompressed data as input and pass the corresponding codeword (also called encoding, word code or code in the literature) Replace data values to convert uncompressed data into compressed data: 2. Decompression (also called decoding). Decompression uses compressed data as input and replaces the codeword with the corresponding data value. The compressed data is converted to uncompressed. Data compression can be lossless or lossy, depending on whether the actual data value after decompression is exactly the same as the original data value before compression (lossless), or whether the data value after decompression is different The original data value and the original value cannot be obtained (lossy type). Compression and decompression can be implemented in software, or hardware, or a combination of software and hardware to implement corresponding methods, devices, and systems.
- the compensation table is usually used to store the compensation information of each pixel.
- the driver board looks up the compensation table, adjusts the signal, and adjusts the signal in the dark area of the panel up, and the signal in the bright area down, showing a uniform display effect.
- each pixel corresponds to a set of compensation information, and each set of compensation information contains one or more compensation data.
- the physical meaning of the compensation data depends on the algorithm, which is usually the adjustment value of a specific gray scale, and some algorithms set it to the voltage value to be adjusted.
- the lossy compression algorithm of the compensation table in the prior art will visually see the loss.
- the size of the compensation table It is equal to the number of panel pixels multiplied by the size of each set of compensation information. If a 55-inch UHD (Ultra High Definition) RGB panel is compensated (each pixel includes three sub-pixels of red, green and blue), assuming that each sub-pixel compensation information is 24 bits, the compensation table data The quantity is 2160*3840*24bit*3 ⁇ 597Mb.
- the compensation table of the prior art occupies a lot of system storage resources, which has high requirements on the hardware system, and the process of transmitting and burning data on the production line takes time.
- the purpose of the present invention is to provide a compensation table compression method, which can obtain the optimal quantization step without iteration, reduce the occupation of memory space, save the hardware resources of the system, and can reduce the cost and reduce the cost of transmitting and burning data time.
- the present invention provides a compensation table compression method, including the following steps:
- Step S1 Divide the original compensation table into multiple sub-blocks of the same size in the air domain
- Step S2 Multiply the original compensation table divided into multiple sub-blocks by the sobel operator to obtain a gradient vector, and calculate the variance of each block separately;
- Step S4 Each sub-block is quantized separately according to its corresponding quantization step size to obtain a quantization compensation table, and the coding algorithm is used to compress the quantization compensation table.
- Step S5 Decompress the compressed quantization compensation table, and then dequantize each sub-block according to the information in the quantization compensation table to reconstruct the original compensation table.
- each sub-block is 8*8.
- step S2 the edge of each sub-block is detected by the sobel operator.
- step S3 the calculation formula of the quantization step size is obtained through a visual lossless subjective experiment, where a and b are parameters obtained by fitting the results of the visual lossless subjective experiment.
- the invention also provides a compensation table compression method, including the following steps:
- Step S1' DCT transform the original compensation table, convert the original compensation table from the spatial domain to the frequency domain, and divide it into multiple sub-blocks of the same size;
- Step S4' Each sub-block is quantized separately according to its corresponding quantization step size to obtain a quantization compensation table, and the encoding algorithm is used to compress the quantization compensation table.
- Step S5' Decompress the compressed quantization compensation table, and then inverse quantize and inverse DCT transform each sub-block to reconstruct the original compensation table according to the information in the quantization compensation table.
- each sub-block is 8*8.
- the size of the lower right corner area of the DCT coefficient of each sub-block is 4*4; the DC coefficient is the value of the upper left corner of each sub-block.
- step S3' the calculation formula of the quantization step size is obtained through a visual lossless subjective experiment, where a and b are parameters obtained by fitting the results of the visual lossless subjective experiment.
- the invention also provides a compensation table compression method, including the following steps:
- Step S1' DCT transform the original compensation table, convert the original compensation table from the spatial domain to the frequency domain, and divide it into multiple sub-blocks of the same size;
- Step S4' each sub-block is quantized separately according to its corresponding quantization step size to obtain a quantization compensation table, and the coding algorithm is used to compress the quantization compensation table;
- Step S5' by decompressing the compressed quantization compensation table, and then dequantizing and inverse DCT transforming each sub-block to reconstruct the original compensation table according to the information in the quantization compensation table;
- each sub-block is 8*8.
- the compensation table compression method of the present invention makes the human eye not notice the quality loss of the original compensation table through visual lossless compression of the compensation table, and greatly increases the compression efficiency, compared with the existing compensation table compression algorithm
- the invention can obtain the optimal quantization step without iteration, reduce the occupation of memory space, save the hardware resources of the system, and can reduce the cost and the time spent in transferring and burning data.
- FIG. 1 is a flowchart of a first embodiment of a compensation table compression method of the present invention
- FIG. 2 is a logic diagram of a first embodiment of a compensation table compression method of the present invention
- FIG. 3 is a flowchart of a second embodiment of the compensation table compression method of the present invention.
- FIG. 4 is a logic diagram of a second embodiment of the compensation table compression method of the present invention.
- the present invention provides a first embodiment of a compensation table compression method, including the following steps:
- Step S1 Divide the original compensation table into multiple sub-blocks of the same size in the air domain
- Step S2 Multiply the original compensation table divided into multiple sub-blocks by the sobel operator to obtain a gradient vector, and calculate the variance of each block separately;
- Step S4 Each sub-block is quantized separately according to its corresponding quantization step size to obtain a quantization compensation table, and the coding algorithm is used to compress the quantization compensation table.
- step S5 Decompressing the compressed quantization compensation table, and then dequantizing each sub-block according to the information in the quantization compensation table, the original compensation table can be reconstructed.
- each sub-block is 8*8, that is, each sub-block corresponds to 8 rows and 8 columns of pixels (a total of 64 pixels) of compensation information.
- step S2 the edge of each sub-block is detected by the sobel operator to determine the location of each sub-block.
- step S3 the calculation formula of the quantization step size can be obtained according to the visual lossless subjective experiment, so as to losslessly compress the quantization compensation table, where a and b are parameters obtained by fitting the results of the visual lossless subjective experiment.
- the present invention uses visual lossless compression compensation table to make human eyes not notice the quality loss of the original compensation table, and greatly increases the compression efficiency.
- the present invention does not require iteration It can obtain the best quantization step size, reduce the occupation of memory space, save the hardware resources of the system, and can reduce the cost and reduce the time spent in transferring and burning data.
- the present invention provides a second embodiment of a compensation table compression method, including the following steps:
- Step S1' Perform a DCT transform (discrete cosine transform) on the original compensation table, convert the original compensation table from the spatial domain to the frequency domain, and divide it into multiple sub-blocks of the same size;
- DCT transform discrete cosine transform
- Step S4' Each sub-block is quantized separately according to its corresponding quantization step size to obtain a quantization compensation table, and the encoding algorithm is used to compress the quantization compensation table.
- step S5' decompressing the compressed quantization compensation table, dequantizing each sub-block according to the information in the quantization compensation table, and inversely DCT transforming each sub-block to reconstruct the original compensation table.
- each sub-block is 8*8, that is, each sub-block corresponds to 8 rows and 8 columns of pixels (a total of 64 pixels) of compensation information.
- the size of the lower right corner area of each sub-block DCT coefficient is 4*4, that is, the compensation information of the lower right corner area of each sub-block DCT coefficient corresponds to 4 rows and 4 columns of pixels (a total of 16 pixels); the DC coefficient is in each sub-block The value in the upper left corner.
- the calculation formula of the quantization step size can be obtained according to the visual lossless subjective experiment, and thus the lossless compression quantization compensation table, where a and b are parameters obtained by fitting the results of the visual lossless subjective experiment.
- the present invention uses visual lossless compression compensation table to make human eyes not notice the quality loss of the original compensation table, and greatly increases the compression efficiency.
- the present invention does not require iteration It can obtain the best quantization step size, reduce the occupation of memory space, save the hardware resources of the system, and can reduce the cost and reduce the time spent in transferring and burning data.
- the compensation table compression method of the present invention compresses the compensation table visually, so that human eyes cannot perceive the quality loss of the original compensation table, and greatly increases the compression efficiency.
- the invention can obtain the optimal quantization step size without iteration, reduce the occupation of the memory space, save the hardware resources of the system, and can reduce the cost and the time spent in transferring and burning data.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Discrete Mathematics (AREA)
- Multimedia (AREA)
- Human Computer Interaction (AREA)
- General Engineering & Computer Science (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
La présente invention concerne un procédé de compression de table de compensation. Dans le procédé de compression de table de compensation, au moyen d'une table de compensation de compression sans perte visuelle, la perte de qualité d'une table de compensation d'origine n'est pas détectée par un oeil humain, et l'efficacité de compression est fortement augmentée. Par comparaison avec un algorithme de compression de table de compensation existant, la présente invention peut obtenir une taille de pas de quantification optimale sans itération, réduit l'occupation de l'espace mémoire, économise les ressources matérielles d'un système, peut réduire les coûts, et réduit le temps consommé pour la transmission et le rodage des données.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811475457.2 | 2018-12-04 | ||
CN201811475457.2A CN109324778B (zh) | 2018-12-04 | 2018-12-04 | 补偿表压缩方法 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2020113766A1 true WO2020113766A1 (fr) | 2020-06-11 |
Family
ID=65256221
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2019/071033 WO2020113766A1 (fr) | 2018-12-04 | 2019-01-09 | Procédé de compression de table de compensation |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN109324778B (fr) |
WO (1) | WO2020113766A1 (fr) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110166783B (zh) * | 2019-06-03 | 2021-03-23 | Tcl华星光电技术有限公司 | 补偿表压缩方法、显示器制造设备和具有存储功能的装置 |
CN110796995B (zh) * | 2019-11-28 | 2021-09-03 | Tcl华星光电技术有限公司 | 显示面板的补偿数据的处理方法及显示装置 |
CN111225216A (zh) * | 2020-01-10 | 2020-06-02 | Tcl华星光电技术有限公司 | 显示器补偿表压缩方法、装置、系统及显示器 |
CN111223438B (zh) * | 2020-03-11 | 2022-11-04 | Tcl华星光电技术有限公司 | 像素补偿表的压缩方法及装置 |
CN116229870B (zh) * | 2023-05-10 | 2023-08-15 | 苏州华兴源创科技股份有限公司 | 补偿数据的压缩、解压缩方法及显示面板补偿方法 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2005032117A2 (fr) * | 2003-09-24 | 2005-04-07 | Texas Instruments Incorporated | Transformee 8x8 et quantification |
CN108416725A (zh) * | 2018-03-13 | 2018-08-17 | 中山大学 | 一种基于消除块效应的非对称jpeg隐写方法 |
Family Cites Families (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR0129573B1 (ko) * | 1994-04-30 | 1998-04-10 | 배순훈 | 디지탈 화상 복호화를 위한 디씨(dc) 계수의 오차보상 방법 |
US6963668B2 (en) * | 1998-11-13 | 2005-11-08 | Lightsurf Technologies, Inc. | Method and system for fast image correction |
KR100539923B1 (ko) * | 2003-02-10 | 2005-12-28 | 삼성전자주식회사 | 화상통화시 화자의 영상을 구분하여 차등적 부호화할 수있는 비디오 엔코더 및 이를 이용한 비디오신호의 압축방법 |
KR20080065820A (ko) * | 2007-01-10 | 2008-07-15 | 삼성전자주식회사 | 디지털 멀티미디어 중계 신호처리장치 및 그 방법 |
CN100496127C (zh) * | 2007-06-05 | 2009-06-03 | 南京大学 | Mpeg-2到h.264码的快速转换方法 |
CN102256126A (zh) * | 2011-07-14 | 2011-11-23 | 北京工业大学 | 混合图像的编码方法 |
CN103313056B (zh) * | 2013-06-03 | 2016-08-24 | 南京邮电大学 | 一种基于图像融合和边缘Hash的子块修复方法 |
CN104202599B (zh) * | 2014-09-23 | 2017-07-28 | 浙江工商大学 | 一种应用于hevc帧间编码的全零块检测方法 |
CN105700847B (zh) * | 2016-03-25 | 2019-01-22 | 深圳市华星光电技术有限公司 | Oled显示面板补偿数据的存储方法 |
CN106341576B (zh) * | 2016-08-25 | 2020-07-03 | 深圳市华星光电技术有限公司 | 图像处理方法 |
CN106339196B (zh) * | 2016-08-31 | 2019-03-15 | 深圳市华星光电技术有限公司 | DeMura表的数据压缩、解压缩方法及Mura补偿方法 |
CN107294538B (zh) * | 2017-06-09 | 2020-09-01 | 深圳市华星光电半导体显示技术有限公司 | Oled显示装置的补偿表压缩方法及解压方法 |
CN107068050A (zh) * | 2017-06-09 | 2017-08-18 | 深圳市华星光电技术有限公司 | Oled显示面板的补偿表存储方法 |
CN107799065B (zh) * | 2017-11-02 | 2019-11-26 | 深圳市华星光电半导体显示技术有限公司 | Oled显示面板的灰阶补偿表的压缩方法 |
CN108008553A (zh) * | 2017-11-22 | 2018-05-08 | 深圳市华星光电技术有限公司 | 一种Mura检测校正方法和系统 |
CN108172168B (zh) * | 2017-12-22 | 2019-11-15 | 深圳市华星光电半导体显示技术有限公司 | 一种补偿表压缩方法 |
-
2018
- 2018-12-04 CN CN201811475457.2A patent/CN109324778B/zh active Active
-
2019
- 2019-01-09 WO PCT/CN2019/071033 patent/WO2020113766A1/fr active Application Filing
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2005032117A2 (fr) * | 2003-09-24 | 2005-04-07 | Texas Instruments Incorporated | Transformee 8x8 et quantification |
CN108416725A (zh) * | 2018-03-13 | 2018-08-17 | 中山大学 | 一种基于消除块效应的非对称jpeg隐写方法 |
Also Published As
Publication number | Publication date |
---|---|
CN109324778B (zh) | 2020-03-27 |
CN109324778A (zh) | 2019-02-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2020113766A1 (fr) | Procédé de compression de table de compensation | |
KR102118234B1 (ko) | 프레임 버퍼 압축을 위한 혼합 모드 | |
US9460527B2 (en) | Pattern mode for frame buffer compression | |
US9369732B2 (en) | Lossless intra-prediction video coding | |
US20190320173A1 (en) | Spatially adaptive quantization-aware deblocking filter | |
CN103957426A (zh) | 一种rgb565真彩色图像有损压缩及解压方法 | |
WO2020113827A1 (fr) | Procédé de compression d'image | |
JP3105335B2 (ja) | 画像の直交変換符号化による圧縮・伸張方法 | |
US10958920B2 (en) | Single-channel inverse mapping for image/video processing | |
US6614942B1 (en) | Constant bitrate algorithm for block based image compression | |
US11494946B2 (en) | Data compression device and compression method configured to gradually adjust a quantization step size to obtain an optimal target quantization step size | |
US10560703B2 (en) | FLC-based image compression method and device | |
US20240276018A1 (en) | Image compression and decompression using controlled quality loss | |
CN118646891A (zh) | 图像压缩的方法、装置及电子设备 | |
CN110740324B (zh) | 编码控制方法及相关装置 | |
US7657110B2 (en) | Image compression using a color visual model | |
US20240029202A1 (en) | Super-resolution video processing method and system for effective video compression | |
US20230336752A1 (en) | Image compression with inter-channel encoding of codewords | |
US11854235B1 (en) | Lossless integer compression scheme | |
CN117579847A (zh) | 一种基于相似块差值编码的屏幕图像压缩方法 | |
CN106878740A (zh) | 适用于液晶显示驱动的图像压缩方法和图像压缩系统 | |
CN118715773A (zh) | 图像编解码方法、装置、设备、系统、及存储介质 | |
JPH0746407A (ja) | 画像データ圧縮装置および画像データ復元装置 | |
Patel | An Efficient Image Compression Technique Based On Arithmetic Coding | |
EP2605515B1 (fr) | Procédé et appareil pour la transformée en cosinus discrète/la transformée en cosinus discrète inverse |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 19893418 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 19893418 Country of ref document: EP Kind code of ref document: A1 |