H04N19/169—Methods 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/17—Methods 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 an image region, e.g. an object

H04N19/102—Methods 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/102—Methods 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/124—Quantisation

Abstract

Methods and apparatus, including computer program products, for compression include decomposing an image into wavelet transform coefficients, applying a first quantizer to the wavelet transform coefficients, and applying a second quantizer to a set of wavelet transform coefficients representing a background of the image. The method can include rounding the wavelet transform coefficients and rounding the wavelet transform coefficients can include rounding to a nearest integer value. The method can include multiplying the set rounded quantized background wavelet transform coefficients by the second quantizer and rounding all wavelet transform coefficients. Rounding all wavelet transform coefficients can include rounding to a nearest integer value.

Description

BACKGROUND

The present invention relates to image region of interest encoding.

Image compression is minimizing the size in bytes of a graphics file without degrading the quality of the image to an unacceptable level. The reduction in file size allows more images to be stored in a given amount of disk or memory space. It also reduces the time required for images to be sent over the Internet or downloaded from Web pages.

There are several different standards that define the ways in which image files can be compressed. Three common standards, for example, are the Joint Photographic Experts Group (JPEG) standard, the JPEG2000 standard and the Graphics Interchange Format (GIF) standard.

The JPEG2000 digital image compression standard, for example, allows the compression of an arbitrary region of interest (e.g., foreground) within an image to be compressed at a higher quality than the remainder of the image (e.g., background). The JPEG2000 digital image standard uses the “max shift” method in conjunction with a post compression rate distortion (PCRD) optimization. In the max shift method, an image is first transformed into a wavelet domain and a subset of coefficients that contribute to a foreground are determined. The foreground coefficients are “left shifted” so that the modified foreground coefficients are larger than the largest possible background coefficient.

A decoder can now identify whether a coefficient belongs to the foreground or background by simply looking at its value. The coefficients of the foreground are now very large numbers and hence an error occurring in these coefficients is penalized by a large distortion. The PCRD optimization ensures that these foreground coefficients are included prior to background coefficients, which ensures that a large part of the bit budget is given to the encoding of the foreground coefficients.

SUMMARY

The present invention provides methods and apparatus, including computer program products, for image region of interest encoding.

In general, in one aspect, the invention features a method of encoding including decomposing an image into wavelet transform coefficients, quantizing the wavelet transform coefficients with a high resolution scalar quantizer, quantizing a set of background wavelet transform coefficients with a low resolution scalar quantizer, rounding the set of quantized background wavelet transform coefficients, multiplying the set rounded quantized background wavelet transform coefficients by the low resolution scalar quantizer, and rounding all wavelet transform coefficients.

In embodiments, the method can include entropy encoding all wavelet transform coefficients. The method can include generating a preview of the encoded wavelet transform coefficients and/or signaling the high resolution scalar quantizer in a header.

Rounding all wavelet transform coefficients can include flooring to a largest integer smaller than a value of the quantized wavelet coefficient or choosing a smallest integer value larger than a value of the quantized wavelet coefficient.

In another aspect, the invention features a method of encoding including decomposing an image into wavelet transform coefficients, quantizing the wavelet transform coefficients with a high resolution scalar quantizer, rounding the wavelet transform coefficients, quantizing a set of rounded background wavelet transform coefficients with a low resolution scalar quantizer, rounding the set of quantized background wavelet transform coefficients to a nearest integer value, and multiplying the set rounded quantized background wavelet transform coefficients by the low resolution scalar quantizer.

In embodiments, the method can include entropy encoding all wavelet transform coefficients.

The method can include generating a preview of the encoded wavelet transform coefficients and/or signaling the high resolution scalar quantizer in a header.

Rounding the set of quantized background wavelet transform coefficients can include rounding to a nearest integer value and rounding all wavelet transform coefficients can include rounding to a nearest integer value.

Rounding the set of quantized background wavelet transform coefficients and rounding all wavelet transform coefficients can include flooring to a largest integer smaller than a value of the quantized wavelet coefficient.

Rounding the set of quantized background wavelet transform coefficients and rounding all wavelet transform coefficients can include choosing a smallest integer value larger than a value of the quantized wavelet coefficient.

In another aspect, the invention features a method of compression including decomposing an image into wavelet transform coefficients, applying a first quantizer to the wavelet transform coefficients, and applying a second quantizer to a set of wavelet transform coefficients representing a background of the image.

In embodiments, the method can include rounding the wavelet transform coefficients and rounding the wavelet transform coefficients can include rounding to a nearest integer value.

The method can include multiplying the set rounded quantized background wavelet transform coefficients by the second quantizer and rounding all wavelet transform coefficients. Rounding all wavelet transform coefficients can include rounding to a nearest integer value.

The method can include entropy encoding all wavelet transform coefficients, generating a preview of the encoded wavelet transform coefficients, and/or signaling the first quantizer in a header.

In another aspect, the invention features a system of encoding including a means for decomposing an image into wavelet transform coefficients, a means for quantizing the wavelet transform coefficients with a high resolution scalar quantizer, a means for quantizing a set of background wavelet transform coefficients with a low resolution scalar quantizer, a means for rounding the set of quantized background wavelet transform coefficients, a means for multiplying the set rounded quantized background wavelet transform coefficients by the low resolution scalar quantizer, and a means rounding all wavelet transform coefficients.

In embodiments, the system can include a means for entropy encoding all wavelet transform coefficients and/or a means for generating a preview of the encoded wavelet transform coefficients. The system can also include a means for signaling the high resolution scalar quantizer in a header.

The means for rounding the set of quantized background wavelet transform coefficients can include rounding to a nearest integer value. The means for rounding all wavelet transform coefficients can include rounding to a nearest integer value. The means for rounding all wavelet transform coefficients can include flooring to a largest integer smaller than a value of the quantized wavelet coefficient. The means for rounding all wavelet coefficients can include choosing a smallest integer value larger than a value of the quantized wavelet coefficient.

The invention can be implemented to realize one or more of the following advantages.

A user's choice of image quality for a region of interest (foreground) is mapped to a high resolution scalar quantizer and the image quality chosen for a background is mapped to a low resolution (coarse) scalar quantizer. The quantizers for the foreground and the background can be chosen independently.

After wavelet transform, the transformed image includes several sub-bands. The term quantization implies quantizing each coefficient of each sub-band with a quantizer; the quantizer can be different for different sub-bands but is same for all coefficients within a sub-band. Thus, there is a set of high and coarse resolution quantizers, one for each sub-band.

The image is transformed into the wavelet domain by applying the forward discrete wavelet transform and the wavelet coefficients of each sub-band that contribute to the foreground are determined. All coefficients of each sub-band are then quantized, background as well as foreground, with a high resolution quantizer. The background is then quantized with the low resolution quantizer, rounded to a nearest integer value and multiplied back by the low resolution quantizer.

The modified wavelet coefficients are now encoded and the values of the high resolution quantizer are signaled in the encoded stream. Upon decoding, the foreground will appear with a better quality compared to the background.

The process can encode different regions with more than two qualities. That is, one can have regions r1, r2, r3 . . . , with qualities q1, q2, q3 . . . . The process quantizes all wavelet transform coefficients with the smallest quantizer (high resolution) and then each region of interest is individually subjected to quantization by the coarse quantizer for that region; rounding the coefficients to nearest integer values and multiplying back by the coarse resolution quantizer.

The region of interest encoding process is not restricted to JPEG2000. The process can be used in any place where a wavelet based transform is performed.

The quantized wavelet transform coefficients finally may or may not be entropy coded. Entropy encoding is not restricted to the JPEG2000 entropy coding system. Entropy encoding can include, for example, Huffmann based systems, zip systems, flate, run length, and so forth. One need not perform any compression and only write the coefficients as they are to a codestream.

The process can include generating a preview of the encoded image before performing actual encoding. Thus, a user gets feedback on the quality of the foreground and background and can adjust the qualities to his satisfaction.

The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features and advantages of the invention will become apparent from the description, the drawings, and the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is block diagram.

FIG. 2 is a flow diagram.

Like reference numbers and designations in the various drawings indicate like elements.

DETAILED DESCRIPTION

As shown in FIG. 1, the JPEG2000 standard includes encoding 10 and decoding 12. We use the JPEG2000 standard as one example. However, the process described herein in not limited to the JPEG2000 standard, and can be used in any place where a wavelet based transform is performed.

In encoding 10, a discrete wavelet transform 14 is first applied on the source image data 16. The transform coefficients are then quantized 18 and entropy coded 20, before forming the output codestream (bitstream) 22. In decoding 12, the codestream 24 is first entropy-decoded 26, dequantized 28 and undergoes the inverse discrete wavelet transform 30 to produce the reconstructed image 32. The JPEG2000 standard allows tiling of the image. Tiles are encoded independently.

As shown in FIG. 2, a process 100 of region of interest encoding includes decomposing (102) an image into wavelet transform coefficients. A wavelet transform is a transformation to basis functions that are localized in both frequency and spatial domains. As basis functions one uses wavelets. An advantage over a Fourier transform is the temporal (or spatial) locality of the base functions and the smaller complexity (O(N) instead of O(N log N) for the fast Fourier transform (where N is the data size).

Process 100 includes quantizing (104) the wavelet transform coefficients with a high resolution scalar quantizer. Quantization (104) is a process by which the coefficients are reduced in precision. This operation is lossy, unless the quantization (104) is 1 and the coefficients are integers, as produced by the reversible integer 5/3 wavelet. For example, each of the transform coefficients ab(u,v) of a subband b is quantized to a value qb(u,v) according to the formula:

qb⁡(u,v)=sign⁡(ab⁡(u,v))⁢⁢⌊ab⁡(u,v)Δb⌋

The quantization Δb is represented relative to the dynamic range Rb of subband b, by the exponent εb and mantissa μb as:

Δb=2Rb-zb⁢(1+μb211)

The dynamic range Rb depends on a number of bits used to represent the original image component and on the choice of the wavelet transform. All quantized transform coefficients are signed values even when the original components are unsigned. These coefficients are expressed in a sign-magnitude representation prior to coding.

Process 100 includes quantizing (106) a set of background wavelet transform coefficients, which have already been quantized (104) by a high resolution quantizer, with a low resolution (i.e., coarse) scalar quantizer and rounding (108) the set of quantized background wavelet transform coefficients.

The set of rounded quantized background wavelet transform coefficients are multiplied (110) by the low resolution scalar quantizer and all wavelet transform coefficients are rounded (112).

Process 100 includes entropy encoding (114) all wavelet transform coefficients. After entropy encoding (114) the high resolution scalar quantizer is signaled in a header.

Process 100 encodes a region of interest without performing a PCRD optimization. Instead, a set of foreground wavelet transform coefficients (e.g., a region of interest) and a set of background wavelet transform coefficients are quantized by two different quantizers. Since there are two independent quantizers, background and foreground qualities can be set independently. Process 100 does not introduce extra bitplanes in the region of interest, and as PCRD optimization is not involved, encoding is fast and memory constrained.

Images with regions of interest are smaller than images without regions of interest because by quantizing the background with a coarse quantizer, rounding to nearest integer and multiplying back with the quantizer, many zeros are introduced in the lower significant bitplanes of the background. These zeros get compressed to a higher degree by entropy coding (114).

Process 100 can be understood more fully by an example. Consider the following example set of wavelet transform coefficients belonging to a particular sub-band from decomposing (102) an image:

10.30

5.70

11.20

9.80

20.50

21.40

9.00

6.10

4.20

10.70

8.30

12.60

13.00

12.00

15.20

6.80

7.20

8.30

8.54

9.60

4.90

In this example, we designate columns 3, 4 and 5 as belonging to a region of interest (also referred as a foreground), and columns 1, 2, 6 and 7 as belonging to a background. Any region of interest can be selected by a user. In this example we arbitrarily select a value of a low resolution (coarse) scalar quantizer at 3.5 and a value of a high resolution scalar quantizer as 1.2.

After quantizing (104) the above wavelet transform coefficients with the high resolution scalar quantizer we obtain the following values for the wavelet transform coefficients:

8.58

4.75

9.33

8.16

17.08

17.83

7.50

5.08

3.50

8.92

6.92

10.5

10.83

10.00

12.66

5.66

6.00

6.92

7.12

8.0

4.08

The set of background wavelet transform coefficients (i.e., coefficients contained in columns 1, 2, 6 and 7) are quantized (106) with the low resolution scalar quantizer to obtain the following results:

2.45

1.36

9.33

8.16

17.08

5.09

2.14

1.45

1.00

8.92

6.92

10.50

3.09

2.86

3.62

1.62

6.00

6.92

7.12

2.29

1.166

The set of background wavelet transform coefficients are rounded (108) to obtain the following:

2.00

1.00

9.33

8.16

17.08

5.00

2.00

1.00

1.00

8.92

6.92

10.50

3.00

3.00

4.00

2.00

6.00

6.92

7.12

2.00

1.00

The set of background wavelet transform coefficients above are multiplied (110) by the low resolution scalar quantizer to obtain the following:

7.00

3.50

9.33

8.16

17.08

17.50

7.00

3.50

3.50

8.92

6.92

10.50

10.50

10.50

14.00

7.00

6.00

6.92

7.12

7.00

3.50

All wavelet transform coefficients are rounded (112):

7.00

4.00

9.00

8.00

17.00

18.00

7.00

4.00

4.00

9.00

7.00

11.00

11.00

11.00

14.00

7.00

6.00

7.00

7.00

7.00

4.00

The above set of wavelet transform coefficients are entropy coded (114). The high resolution quantizer is signaled in a header.

The invention can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. The invention can be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable storage device or in a propagated signal, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers. A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.

Method steps of the invention can be performed by one or more programmable processors executing a computer program to perform functions of the invention by operating on input data and generating output. Method steps can also be performed by, and apparatus of the invention can be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).

Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. Information carriers suitable for embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in special purpose logic circuitry.

The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features and advantages of the invention will become apparent from the description, the drawings, and the claims.

Claims (27)

1. A method of encoding comprising:

decomposing an image into wavelet transform coefficients;

quantizing the wavelet transform coefficients with a high resolution scalar quantizer;

quantizing a set of background wavelet transform coefficients with a low resolution scalar quantizer;

rounding the set of quantized background wavelet transform coefficients;

multiplying the set of rounded quantized background wavelet transform coefficients by the low resolution scalar quantizer; and

rounding all wavelet transform coefficients;

wherein quantizing the wavelet transform coefficients is performed by one or more processors.

13. The method of claim 8 wherein rounding the set of quantized background wavelet transform coefficients and rounding all wavelet transform coefficients comprises flooring to a largest integer smaller than a value of the quantized wavelet coefficient.

14. The method of claim 8 wherein rounding the set of quantized background wavelet transform coefficients and rounding all wavelet transform coefficients comprises choosing a smallest integer value larger than a value of the quantized wavelet coefficient.

Method for generating and collecting random vibratory seismic data wherein a pre-specified wavelet of minimum side lobe content is always produced in the final correlations by maintaining domain consistency

Method for generating and collecting random vibratory seismic data wherein a pre-specified wavelet of minimum side lobe content is always produced in the final correlations by maintaining domain consistency