High quality image processing
a high-quality, image-encoding technology, applied in the field of image processing, can solve the problems of block artifacts, block size restriction, block artifacts, etc., and achieve the effect of efficient image encoding and image decoding, and efficient image processing
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Benefits of technology
Problems solved by technology
Method used
Image
Examples
example 1
[0190]An example of a decompression procedure for the image block illustrated in FIG. 9 is given herein. Assume that the image block has the following binary compressed representation:
10110 010110 01101 01110 100011 00001 10 10 00 01 11 00 00 11 10 10 01 00 11 00 11 01bin
00010010 01011101 110 001 111 001 011 101 000 111 101 110 100 001 011 100 001 101bin
[0191]The color components of the two color components are first expanded from RGB565 into RGB888, by replicating the three or two most significant bits to the components. For example, 10110bin becomes 1011010bin and 010110bin becomes 01011001bin. This means that the two basic colors CV0, CV1 are obtained from the color codeword:
101100bin 10110101bin=181
010110bin 01011001bin=89
01101bin 01101011bin=107
CV0=(181, 89, 107)
[0192]01110bin 01110011bin=115
100011bin 10001110bin=142
00001bin 00001000bin=4
CV1=(115, 142, 4)
[0193]The two first color representations are then (181, 89, 107) and (115, 142, 4). The other two representations CV2 an...
example 2
[0196]An example of a decompression procedure for the image block illustrated in FIG. 16 is given herein. Assume that the image block has the following binary compressed representation:
1011 0010 0000 0000 0111 0100 011 000 10 10 00 01 11 00 00 11 10 10 01 00 11 00 11 01 1 0bin
00010010 01011101 110 001 111 001 011 101 000 111 101 110 100 001 011 100 001 101bin
[0197]The eight possible green component values are calculated based on the minimum and maximum green component of the second codeword in way similar to determining the different color modifiers in Example 1 above. This will result in G0=18, G1=93, G2=28, G3=38, G4=49, G5=60, G6=71 and G7=81. The first image element in the block has color index 110bin, which implies that green component G6 should be used. Since the first image element belongs to the first 2×4 (vertical, due to flipbit=1bin) sub-block, the red R0 and blue B0 components of the first color codeword having the following bit patterns should be used 1011bin and 0111...
example 3
[0199]An example of a decompression procedure for the image block illustrated in FIG. 17 is given herein. Assume that the image block has the following binary compressed representation:
10110 010 00000 000 01110 100 011 000 10 10 00 01 11 00 00 11 10 10 01 00 11 00 11 01 0 1bin
01000010 01011101 110 001 111 001 011 101 000 111 101 110 100 001 011 100 001 101bin
[0200]In this example, the flipbit=0bin, implying that the image block consists of two 4×2 sub-blocks and the diffbit=1bin, representing the differential mode of iPACKMAN.
[0201]Firstly a starting green component is determined based on the first portion of the second color codeword, i.e. 01000010bin=66. The second part represents a table index to a table comprising multiple sets of green component modifiers. Assume that the table index of 01011101bin represents the green modifier set of [−42, −36, −27, −15, 15, 27, 36, 42]. The last image element in the block has color index 101bin, which represents a green modifier of −27. The...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com