Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where David Taubman is active.

Publication


Featured researches published by David Taubman.


Journal of Electronic Imaging | 2013

JPEG2000 Image Compression Fundamentals, Standards and Practice

David Taubman; Michael W. Marcellin

This is nothing less than a totally essential reference for engineers and researchers in any field of work that involves the use of compressed imagery. Beginning with a thorough and up-to-date overview of the fundamentals of image compression, the authors move on to provide a complete description of the JPEG2000 standard. They then devote space to the implementation and exploitation of that standard. The final section describes other key image compression systems. This work has specific applications for those involved in the development of software and hardware solutions for multimedia, internet, and medical imaging applications.


IEEE Transactions on Image Processing | 1994

Multirate 3-D subband coding of video

David Taubman; Avideh Zakhor

We propose a full color video compression strategy, based on 3-D subband coding with camera pan compensation, to generate a single embedded bit stream supporting multiple decoder display formats and a wide, finely gradated range of bit rates. An experimental implementation of our algorithm produces a single bit stream, from which suitable subsets are extracted to be compatible with many decoder frame sizes and frame rates and to satisfy transmission bandwidth constraints ranging from several tens of kilobits per second to several megabits per second. Reconstructed video quality from any of these bit stream subsets is often found to exceed that obtained from an MPEG-1 implementation, operated with equivalent bit rate constraints, in both perceptual quality and mean squared error. In addition, when restricted to 2-D, the algorithm produces some of the best results available in still image compression.


IEEE Transactions on Image Processing | 2003

Lifting-based invertible motion adaptive transform (LIMAT) framework for highly scalable video compression

Andrew Secker; David Taubman

We propose a new framework for highly scalable video compression, using a lifting-based invertible motion adaptive transform (LIMAT). We use motion-compensated lifting steps to implement the temporal wavelet transform, which preserves invertibility, regardless of the motion model. By contrast, the invertibility requirement has restricted previous approaches to either block-based or global motion compensation. We show that the proposed framework effectively applies the temporal wavelet transform along a set of motion trajectories. An implementation demonstrates high coding gain from a finely embedded, scalable compressed bit-stream. Results also demonstrate the effectiveness of temporal wavelet kernels other than the simple Haar, and the benefits of complex motion modeling, using a deformable triangular mesh. These advances are either incompatible or difficult to achieve with previously proposed strategies for scalable video compression. Video sequences reconstructed at reduced frame-rates, from subsets of the compressed bit-stream, demonstrate the visually pleasing properties expected from low-pass filtering along the motion trajectories. The paper also describes a compact representation for the motion parameters, having motion overhead comparable to that of motion-compensated predictive coders. Our experimental results compare favorably to others reported in the literature, however, our principal objective is to motivate a new framework for highly scalable video compression.


international conference on image processing | 2001

Motion-compensated highly scalable video compression using an adaptive 3D wavelet transform based on lifting

Andrew Secker; David Taubman

This paper proposes a new framework for the construction of motion compensated wavelet transforms, with application to efficient highly scalable video compression. Motion compensated transform techniques, as distinct from motion compensated predictive coding, represent a key tool in the development of highly scalable video compression algorithms. The proposed framework overcomes a variety of limitations exhibited by existing approaches. This new method overcomes the failure of frame warping techniques to preserve perfect reconstruction when tracking complex scene motion. It also overcomes some of the limitations of block displacement methods. Specifically, the lifting framework allows the transform to exploit inter-frame redundancy without any dependence on the model selected for estimating and representing motion. A preliminary implementation of the proposed approach was tested in the context of a scalable video compression system, yielding PSNR performance competitive with other results reported in the literature.


Proceedings of the IEEE | 2002

JPEG2000: standard for interactive imaging

David Taubman; Michael W. Marcellin

JPEG2000 is the latest image compression standard to emerge from the Joint Photographic Experts Group (JPEG) working under the auspices of the International Standards Organization. Although the new standard does offer superior compression performance to JPEG, JPEG2000 provides a whole new way of interacting with compressed imagery in a scalable and interoperable fashion. This paper provides a tutorial-style review of the new standard, explaining the technology on which it is based and drawing comparisons with JPEG and other compression standards. The paper also describes new work, exploiting the capabilities of JPEG2000 in client-server systems for efficient interactive browsing of images over the Internet.


international conference on image processing | 2000

Embedded block coding in JPEG2000

David Taubman; Erik Ordentlich; Marcelo J. Weinberger; Gadiel Seroussi; Ikuro Ueno; Fumitaka Ono

This paper describes the embedded block coding algorithm at the heart of the JPEG2000 image compression standard. The algorithm achieves excellent compression performance, usually somewhat higher than that of SPIHT with arithmetic coding, but in some cases substantially higher. The algorithm utilizes the same low complexity binary arithmetic coding engine as JBIG2. Together with careful design of the bit-plane coding primitives, this enables comparable execution speed to that observed with the simpler variant of SPIHT without arithmetic coding. The coder offers additional advantages including memory locality, spatial random access and ease of geometric manipulation.


visual communications and image processing | 2003

Architecture, philosophy, and performance of JPIP: internet protocol standard for JPEG2000

David Taubman; Robert Prandolini

JPEG2000 is a family of technologies based on the image compression system defined in IS 15444-1. Presently, the ISO/IEC Joint Technical Committee of Photographic Experts (JPEG) is developing an international standard for interactivity with JPEG2000 files, called JPIP; it will become Part 9 of the standard. One of the main goals of JPIP is to exploit the multi-resolution and spatially random access properties of JPEG2000, to permit “smart dissemination” of the data for client-server based applications. The purpose of this paper is to discuss the principles and philosophy of operation underlying the JPIP standard, to outline aspects of the architecture of JPIP systems, and to report on the performance of a prototype implementation.


IEEE Transactions on Image Processing | 1994

Orientation adaptive subband coding of images

David Taubman; Avideh Zakhor

In the subband coding of images, directionality of image features has thus far been exploited very little. The proposed subband coding scheme utilizes orientation of local image features to avoid the highly objectionable Gibbs-like phenomena observed at reconstructed image edges with conventional subband schemes at low bit rates, At comparable bit rates, the subjective image quality obtained by our orientation adaptive scheme is considerably enhanced over a conventional separable subband coding scheme, as well as other separable approaches such as the JPEG compression standard.


international conference on image processing | 2002

Highly scalable video compression using a lifting-based 3D wavelet transform with deformable mesh motion compensation

Andrew Secker; David Taubman

This paper continues the development of a new framework for the construction of motion-compensated wavelet transforms for highly scalable video compression. The current authors recently proposed a motion adaptive wavelet transform based on motion-compensated lifting steps. This approach overcomes several limitations of existing methods. In particular, frame warping and block displacement methods cannot efficiently exploit complex motion without sacrificing invertibility. By contrast, the motion-compensated lifting transform remains invertible regardless of the motion model. The previous work was primarily in the context of a block motion model. However, block motion models inevitably yield discontinuous motion fields, which poorly represent complex motion in real video sequences. In this paper we consider the benefits of a continuous motion field, by incorporating a deformable mesh motion model into the existing framework. Experimental results show that this leads to improved compression performance. In addition, we show that the invertibility of continuous motion fields allows greater potential for compactly representing the motion information.


Signal Processing-image Communication | 2002

Embedded block coding in JPEG 2000

David Taubman; Erik Ordentlich; Marcelo J. Weinberger; Gadiel Seroussi

This paper describes the embedded block coding algorithm at the heart of the JPEG 2000 image compression standard. The paper discusses key considerations which led to the development and adoption of this algorithm, and also investigates performance and complexity issues. The JPEG 2000 coding system achieves excellent compression performance, somewhat higher (and, in some cases, substantially higher) than that of SPIHT with arithmetic coding, a popular benchmark for comparison The algorithm utilizes the same low complexity binary arithmetic coding engine as JBIG2. Together with careful design of the bit-plane coding primitives, this enables comparable execution speed to that observed with the simpler variant of SPIHT without arithmetic coding. The coder offers additional advantages including memory locality, spatial random access and ease of geometric manipulation.

Collaboration


Dive into the David Taubman's collaboration.

Top Co-Authors

Avatar

Reji Mathew

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar

Saeid Nooshabadi

Michigan Technological University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Dominic Rüfenacht

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar

Avideh Zakhor

University of California

View shared research outputs
Top Co-Authors

Avatar

Rui Xu

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar

Michael Dyer

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar

Nagita Mehrseresht

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar

Sean I. Young

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar

Johnson Thie

University of New South Wales

View shared research outputs
Researchain Logo
Decentralizing Knowledge