Kakadu R & D Pty Ltd

Newsouth Innovations Pty Limited

Unisearch Limited

Other

David Scott Taubman

Aous Thabit Naman

Reji Kuruvilla Mathew

Dominic Patric Ruefenacht

Pietro Zanuttigh

Andrew Secker

Johnson Thie

Described is a method of image compression and decompression involving a variable-to-variable coding scheme, for example as used or of similar nature to a HT Cleanup encoding algorithm, as described in ISO/IEC 15444-15:2019. The method involves a lookup table that the encoder addresses using a potentially modified version of the EMB pattern, a potentially modified version of the significance pattern, and any additional context information, in order to find the associated variable length codeword. The modified significance pattern and modified EMB pattern, each consisting of 1 bit per sample in a quad, implicitly identify the quad's original significance pattern and the quad's 1-bit unsigned residual offset value, together with some or all of the quad's original EMB pattern, both when the unsigned residual offset value is 1 and, for specific values of the significance pattern, when the unsigned residual offset value is 0.

Enhanced method and apparatus for image compression

Methods and apparatuses for comparing two images to determine a set of likelihood ratios for each resolution level are described. Each location within the resolution level has its own likelihood ratio that expresses the probability that spatial features of the two images are matched, divided by the probability that spatial features of the two images are not matched. Each image may be decomposed into a multi-resolution hierarchy. A first set of likelihood ratios may be determined for each resolution level based on spatial neighborhoods of the associated locations in each of the two images within said resolution level. A second set of likelihood ratios may be determined for each resolution level by combining the first set of likelihood ratios with the final set of likelihood ratios determined at a lower resolution level, except at the lowest resolution level, where the first and second sets of likelihood ratios are the same.

Method and apparatus for communicating and recovering motion information

Methods for management of encoding complexity for image and video encoding, for example for algorithms belonging to the JPEG 2000 family of standards, where the encoding process targets a given compressed size (i.e. a total coded length) for the image or for each frame of a video sequence. A set of methods for complexity constrained encoding of HTJ2K code-streams, involving collection of local or global statistics for each sub-band (not for each code-block), generation of forecasts for the statistics of sub-band samples that have not yet been produced by spatial transformation and quantization processes, and the use of this information to generate a global quantization parameter, from which the coarsest bit-plane to generate in each code-block can be deduced. Coded length estimates can be generated in a manner that enables latency and memory to be separately optimized against encoded image quality, while maintaining low computational complexity.

Method and apparatus for complexity control in high throughput JPEG 2000 (HTJ2K) encoding

Methods for management of encoding complexity for image and video encoding, for example for algorithms belonging to the JPEG 2000 family of standards, where the encoding process targets a given compressed size (i.e. a total coded length) for the image or for each frame of a video sequence. Described are a set of methods for complexity constrained encoding of HTJ2K code-streams, involving collection of local or global statistics for each sub-band (not for each code-block), generation of forecasts for the statistics of sub-band samples that have not yet been produced by spatial transformation and quantization processes, and the use of this information to generate a global quantization parameter, from which the coarsest bit-plane to generate in each code-block can be deduced. Coded length estimates can be generated in a manner that enables latency and memory to be separately optimized against encoded image quality, while maintaining low computational complexity.

An interpolation method for coded motion information available to a video coder, comprising the steps of incorporating edge information derived from coded video frames to perform an edge-sensitive interpolation of coded motion vectors ('seeds') in order to obtain a dense motion description.

Fast, high quality optical flow estimation from coded video

The invention relates to a method and apparatus for image compression, particularly to an improved block-coding apparatus and method for image compression. Image compression systems such as JPEG and JPEG2000 are known and popular standards for image compression. Many of the advantageous features of JPEG2000 derive from the use of the EBCOT algorithm (Embedded Block-Coding with Optimized Truncation). One drawback of the JPEG2000 standards is computational complexity. This application discloses a relatively fast block-coding algorithm, particularly as compared with the standard JPEG2000 EBCOT algorithm. Computational complexity is reduced.

Block coding apparatus method and apparatus for image compression

Method and apparatus for image compression

The present invention relates to an improved method and apparatus for image compression and particularly to an improved block coding apparatus and method for compression for use with the JPEG2000 standard, although not limited to this. Methods for coding and decoding blocks and subbands samples derived from still images video frames or related media, involving three bit-streams and the partitioning of samples from the blocking to define groups, is provided. A first bit-stream encodes the significance of whole groups. A second bit-stream encodes the significance of individual samples within each group. The second bit-stream also encodes an unsigned residual value for each significant group. A third bit stream provides a sign bit and any additional magnitude bits required to represent the significant sample values. Exponent predictors are computal using both exponent bounds and the additional magnitude bits associated with previous samples in the block.

Further improved method and apparatus for image compression

This invention describes a method for communicating crude motion information using tracking metadata and recovering more accurate motion information from the received tracking metadata and partial video frame data; in particular, we use metadata to convey crude boundaries of objects in the scene and signal motion information for these objects. The proposed method leaves the task of identifying the exact boundaries of an object to the decoder/client. The proposed method is particularly appealing when metadata itself carries semantics that the client is interested in, such as tracking information in surveillance applications, because, in this case, metadata does not constitute an overhead. The proposed method involves motion descriptions that can be used to predict the appearance of an object in any one frame from its appearance in any other frame that contains the object. That is, the motion information itself allows locations within an object to be invertibly mapped to locations within the same object in any other relevant frame. This is a departure from conventional motion coding schemes, which tightly-couple motion information to the prediction strategy. This property makes the proposed method particularly suitable for applications which require flexible access to the content.

A method of representing displacement information between the frames of a video and/or multiview sequence, comprising the steps of assigning a plurality of the frames to a Group of Pictures (GOPs), providing a base displacement model for each GOP, the base displacement model describing a displacement field that carries each location in a designated base frame of the GOP to a corresponding location in each other the frame of the GOP, and inferring other displacement relationships between the frames of the GOP from the base displacement model. Embodiments include a piecewise smooth displacement field, deformable mesh, reverse displacement field, double mapping, synthesize optical blur and foreground-background discrimination process.

Base anchored models and inference for the compression and upsampling of video and multiview imagery

Embodiments of a method for incrementally coding and signaling motion information for a video compression system involving a motion adaptive transform and embedded coding of transformed video samples using a computer are disclosed herein. In one such embodiment, the method includes (a) storing computer-readable instructions in the computer which, when executed, produce an embedded motion field bit-stream, representing each, motion field in coarse to fine fashion and (b) storing computer-readable instructions in the computer which, when executed, interleave contributions from said embedded motion field bit-stream with successive contributions from said embedded coding of the transformed video samples.

Method of signalling motion information for efficient scalable video compression

The invention describes a method for representing geometry information to utilize for scalable coding of piecewise smooth spatial data sets. The method may also be applicable to vector data such as motion, where this data tends to exhibit piecewise smooth characteristics. The hierarchical geometry representation detailed in this invention is spatially scalable and amenable to embedded quantization and coding techniques. These features enable the geometry representation to be incorporated into highly scalable image coding schemes to attain efficient compression and output bit-streams with embedded resolution and quality scalability. Central elements of the invention are: the hierarchical representation of geometry information which describe points of discontinuity in the input data set; a rate-distortion driven estimation process to construct the geometry representation; a process to prioritize the geometry information in accordance to its influence on compression performance; and methods for efficient coding of the geometry information that facilitates resolution and quality scalability.

Method and apparatus for coding of spatial data

A method and apparatus for producing a fully scalable compressed representation of video sequences, so that they may be transmitted over networks, such as the Internet, for example. Because the signal is scalable, users receiving the signal can obtain the signal at the appropriate resolution and quality that their system will handle or that they desire. A 'motion compensated temporal wavelet transform' is implemented in order to enable compression of the video in a scalable fashion while still taking advantage of inter-frame redundancy in a manner which is sensitive to scene and camera motion. The motion compensated temporal wavelet transform is implemented by decomposing the video sequence into a set of temporal frequency bands and then applying a sequence of motion compensated lifting operations to alternately update an odd frame sub-sequence based upon an even sub-sequence and vice versa in a manner which is sensitive to motion.

Method and apparatus for scalable compression of video

The present invention relates to a method and apparatus for producing a fully scalable compressed representation of video sequences, so that they may be transmitted over networks, such as the Internet, for example. Because the signal is scalable, users receiving the signal can obtain the signal at the appropriate resolution and quality that their system will handle or that they desire. The invention implements a 'motion compensated temporal wavelet transform' in order to enable compression of the video in a scalable fashion while still taking advantage of inter-frame redundancy in a manner which is sensitive to scene and camera motion. The motion compensated temporal wavelet transform is implemented by decomposing the video sequence into a set of temporal frequency bands and then applying a sequence of motion compensated lifting operations to alternately update an odd frame sub-sequence based upon an even sub-sequence and vice versa in a manner which is sensitive to motion.

Growing community of inventors

Redfern, Australia

David Scott Taubman