IP Library Granted Patent US 11,645,785
Granted Patent B2
US 11,645,785 · App. 16/864,338 · Granted May 9, 2023

Method and encoder relating to encoding of pixel values to accomplish lossless compression of a digital image

Inventors: Martin Hinnerson (Linköping, SE); Mattias Johannesson (Linköping, SE)
Assignee: SICK IVP AB
G06T9/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,645,785
App. No.
16/864,338
Granted
May 9, 2023
Kind
B2
Abstract

Encoder and method for encoding of pixel values of a digital image comprising multiple lines of pixels to accomplish lossless compression of the digital image. For each of said multiple lines the encoder obtains unencoded pixels values of the line. Further, for each of said multiple lines, the encoder determines, for each of one or more pixels of the line, which encoding to be used for encoding of the unencoded pixel value of the pixel (x) in said lossless compression of the digital image. The determination being based on how said unencoded pixel value relates to unencoded pixel values of other, closest neighboring pixels (N1, N2) of said line.

Claims (19)

1. An encoder for encoding of pixel values of a digital image comprising multiple lines of pixels to accomplish lossless compression of the digital image, wherein the encoder is configured to, for each of said multiple lines:

obtain unencoded pixels values of the line; and

determine, for each of one or more pixels of the line, which encoding to be used for encoding of the unencoded pixel value of the pixel (x) in said lossless compression of the digital image, said determination being based on how said unencoded pixel value relates to unencoded pixel values of other, closest neighboring pixels (N1, N2) of said line, which closest neighboring pixels (N1, N2) are the two closest preceding pixels (N1, N2) in a certain direction along the line.

2. The encoder as claimed in claim 1 , wherein it is determined to use Run Length Coding, RLC, is used for encoding of pixel values of one or more subsequently occurring pixels of said line, if said unencoded pixel value for each of said one or more subsequently occurring pixels is the same as the unencoded pixel values of said closest neighboring pixels (N1, N2).

3. The encoder as claimed in claim 1 , wherein at least some pixel values are encoded based on prediction using said closest neighboring pixels (N1, N2) and a computed residual value (ε) of the prediction, which computed residual value (ε) is based on how the unencoded pixel value relate to unencoded pixel value of at least one of said closest neighboring pixels.

4. The encoder as claimed in claim 1 , wherein it is determined to use a first type of coding for encoding of said unencoded pixel value if said unencoded pixel value is between said unencoded pixel values of said closest neighboring pixels (N1, N2), and to use another, second type of coding for encoding of said unencoded pixel value if said unencoded pixel value is below or above any one of said unencoded pixel values of said closest neighboring pixels (N1, N2).

5. The encoder as claimed in claim 4 , wherein said second type of coding is a Golomb-Rice coding configured to use a context independent k-value and a predetermined maximum code length.

6. The encoder as claimed in claim 1 , wherein the encoder ( 131 ; 800 ) is further configured to:

provide, based on the determination, encoded pixel values, which encoded pixel values are said unencoded pixel values encoded by the encoder and part of said lossless compression of the digital image.

7. The encoder as claimed in claim 6 , wherein the encoder is further configured to:

provide the encoded pixels values of each line comprised in a number of equal length data words.

8. The encoder as claimed in claim 7 , wherein the encoded pixel values of different pixels of a line share data words among said equal length data words and encoded pixel values of different lines are in separate data words among said equal length data words.

9. The encoder as claimed claim 7 , wherein the encoder is further configured to:

provide, in association with each line, a respective identifier identifying the start location of the line within said equal length data words comprising said encoded pixel values.

10. The encoder as claimed in claim 9 , wherein the identifiers are provided as separate values in a data structure comprising one value per line of the digital image, each value indicating start location of a respective line in relation to a reference data word among said equal length data words.

11. A method, performed by an encoder, for encoding of pixel values of a digital image comprising multiple lines of pixels to accomplish lossless compression of the digital image, wherein the method comprises, for each of said multiple lines:

obtaining unencoded pixels values of the line; and

determining, for each of one or more pixels of the line, which encoding to be used for encoding of the unencoded pixel value of the pixel (x) in said lossless compression of the digital image, said determination being based on how said unencoded pixel value relates to unencoded pixel values of other, closest neighboring pixels (N1, N2) of said line, which closest neighboring pixels (N1, N2) are the two closest preceding pixels (N1, N2) in a certain direction along the line.

12. A computer program recorded on non-transitory computer readable medium comprising instructions that when executed by the encoder causes the encoder to perform the method according to claim 11 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 13, 2020
From: HINNERSON, MARTIN; JOHANNESSON, MATTIAS
To: SICK IVP AB
Reel/Frame 052644/0755 →
Priority Claims (1)
WO 19172426 · May 2, 2019 · international
Continuity (1)
Related Publication 20200349741A1 · Nov 5, 2020