Systems, methods, and devices for image coding

Patent metadata

Field	Value
Publication number	US-10587900-B2
Application number	US-201715433344-A
Country	US
Kind code	B2
Filing date	Feb 15, 2017
Priority date	Feb 15, 2016
Publication date	Mar 10, 2020
Grant date	Mar 10, 2020

Abstract

System and method embodiments for image coding are disclosed. In an embodiment, a method in a data processing system for image encoding includes determining a sparsity constraint according to a dimension of an input image signal. The method also includes iteratively determining a plurality of approximations to the input image signal. Each iteration provides an approximation of the input image signal. Each approximation includes a set of dictionary element indices and coefficients. The dictionary is an over-complete dictionary. Iterations of the determining step are terminated when a number of iterations is equal to the sparsity constraint. The method also includes selecting one of the plurality of approximations according to a minimum rate-distortion cost. The method also includes determining an encoded image signal according to non-zero coefficients and corresponding indices for each non-zero coefficient in the selected approximation.

First claim

What is claimed is:

1. A method in a data processing system for image encoding, comprising:
determining, by the data processing system, a sparsity constraint according to a dimension of an input image signal;
iteratively determining, by the data processing system, a plurality of approximations to the input image signal, each iteration providing an approximation of the input image signal comprising a set of dictionary element indices and coefficients in a dictionary, the dictionary comprising an over-complete dictionary, iterations of the determining terminated when a number of iterations equals the sparsity constraint;
selecting, by the data processing system, one of the plurality of approximations according to a minimum rate-distortion cost;
determining by the data processing system, an encoded image signal according to non-zero coefficients and corresponding indices for each non-zero coefficient in the selected approximation; and the sparsity constraint is proportional to a square root of a dimension of the image.

2. The method of claim 1 , wherein the sparsity constraint is equal to twice a square root of a dimension of the image.

3. The method of claim 1 , wherein iteratively determining the plurality of approximations comprises determining non-zero coefficients according to a quantization parameter.

4. The method of claim 1 , wherein iteratively determining the plurality of approximations comprises determining non-zero coefficients according to a normalization of the input image signal.

5. The method of claim 1 , wherein iteratively determining the plurality of approximations comprises performing an orthogonal matching pursuit (OMP) method.

6. The method of claim 1 , further comprising encoding the input image signal into an image bitstream.

7. An apparatus, used in coding an image, comprising:
a processor configured to:
determine a sparsity constraint according to a dimension of an input image signal;
iteratively determine a plurality of approximations to the input image signal, each iteration providing an approximation of the input image signal comprising a set of dictionary element indices and coefficients in a dictionary, the dictionary comprising an over-complete dictionary, iterations of the determining terminated when a number of iterations equals the sparsity constraint;
select one of the plurality of approximations according to a minimum rate-distortion cost;
determine an encoded image signal according to non-zero coefficients and corresponding indices for each non-zero coefficient in the selected approximation; and the sparsity constraint is proportional to a square root of a dimension of the image.

8. The apparatus of claim 7 , wherein the sparsity constraint is equal to twice a square root of a dimension of the image.

9. The apparatus of claim 7 , wherein iteratively determining the plurality of approximations comprises determining non-zero coefficients according to a quantization parameter.

10. The apparatus of claim 7 , wherein iteratively determining the plurality of approximations comprises determining non-zero coefficients according to a normalization of the input image signal.

11. The apparatus of claim 7 , wherein iteratively determining the plurality of approximations comprises performing an orthogonal matching pursuit (OMP) method.

12. The apparatus of claim 7 , wherein the processor is further configured to encode the input image signal into an image bitstream.

13. A non-transitory computer-readable medium storing computer instructions for encoding an image, that when executed by one or more processors, cause the one or more processors to perform the steps of:
determining a sparsity constraint according to a dimension of an input image signal;
iteratively determining a plurality of approximations to the input image signal, each iteration providing an approximation of the input image signal comprising a set of dictionary element indices and coefficients in a dictionary, the dictionary comprising an over-complete dictionary, iterations of the determining terminated when a number of iterations equals the sparsity constraint;
selecting one of the plurality of approximations according to a minimum rate-distortion cost;
determining an encoded image signal according to non-zero coefficients and corresponding indices for each non-zero coefficient in the selected approximation; and the sparsity constraint is proportional to a square root of a dimension of the image.

14. The non-transitory computer-readable medium of claim 13 , wherein the sparsity constraint is equal to twice a square root of a dimension of the image.

15. The non-transitory computer-readable medium of claim 13 , wherein iteratively determining the plurality of approximations comprises determining non-zero coefficients according to a quantization parameter.

16. The non-transitory computer-readable medium of claim 13 , wherein iteratively determining the plurality of approximations comprises determining non-zero coefficients according to a normalization of the input image signal.

17. The non-transitory computer-readable medium of claim 13 , wherein iteratively determining the plurality of approximations comprises performing an orthogonal matching pursuit (OMP) method.

18. The non-transitory computer-readable medium of claim 13 , wherein the computer instructions for encoding the image, that when executed by the one or more processors, cause the one or more processors to further perform the step of encoding the input image signal into an image bitstream.

Assignees

• Futurewei Technologies Inc
• Univ Santa Clara

Inventors

• Jiang Minqiang
• Zheng Jianhua
• Kalluri Madhusudan
• Ling Nam
• Zhang Chen-Xiong

Classifications

• H04N19/97 Primary

  Matching pursuit coding · CPC title