Conference Paper

M. Trocan, B. Pesquet-Popescu, and J. E. Fowler, “Graph-Cut Rate Distortion Algorithm for Contourlet-Based Image Compression,” in Proceedings of the International Conference on Image Processing, San Antonio, TX, September 2007, vol. 3, pp. 169-172.

• Abstract:
  The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more difficult. In this paper we present a new rate-distortion optimization algorithm based on graph theory that can encode efficiently the coefficients of a critically sampled or even redundant transform, like the countourlet decomposition. The basic idea is to construct a specialized graph such that its minimum cut minimizes the energy functional. We propose to apply this technique for rate-distortion Lagrangian optimization in subband image coding. The method yields good compression results compared to the state-of-art JPEG2000 codec, as well as a general improvement in visual quality.
• Text:

© Copyright 2007 IEEE. Published in the IEEE 2007 International Conference on Image Processing (ICIP 2007), scheduled for September 16-19, 2007 in San Antonio, Texas, U.S.A. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: +1-908-562-3966.