Rate-distortion methods for image and video compression

A Ortega, K Ramchandran - IEEE Signal processing magazine, 1998 - ieeexplore.ieee.org
In this article we provide an overview of rate-distortion (RD) based optimization techniques
and their practical application to image and video coding. We begin with a short discussion …

MPEG-4 rate control for multiple video objects

A Vetro, H Sun, Y Wang - … on Circuits and Systems for Video …, 1999 - ieeexplore.ieee.org
This paper describes an algorithm which can achieve a constant bit rate when coding
multiple video objects. The implementation is a nontrivial extension of the MPEG-4 rate …

A review of the minimum maximum criterion for optimal bit allocation among dependent quantizers

GM Schuster, G Melnikov… - IEEE Transactions on …, 1999 - ieeexplore.ieee.org
In this paper, we review a general framework for the optimal bit allocation among dependent
quantizers based on the minimum maximum (MINMAX) distortion criterion. The pros and …

A video compression scheme with optimal bit allocation among segmentation, motion, and residual error

GM Schuster, AK Katsaggelos - IEEE Transactions on Image …, 1997 - ieeexplore.ieee.org
We present a theory for the optimal bit allocation among quadtree (QT) segmentation,
displacement vector field (DVF), and displaced frame difference (DFD). The theory is …

[图书][B] Rate-Distortion based video compression: optimal video frame compression and object boundary encoding

GM Schuster, A Katsaggelos - 2013 - books.google.com
One of the most intriguing problems in video processing is the removal of the redundancy or
the compression of a video signal. There are a large number of applications which depend …

MPEG-4 and rate-distortion-based shape-coding techniques

AK Katsaggelos, LP Kondi, FW Meier… - Proceedings of the …, 1998 - ieeexplore.ieee.org
We address the problem of the efficient encoding of object boundaries. This problem is
becoming increasingly important in applications such as content-based storage and …

Fast polygonal approximation of digital curves using relaxed straightness properties

P Bhowmick, BB Bhattacharya - IEEE Transactions on Pattern …, 2007 - ieeexplore.ieee.org
Several existing digital straight line segment (DSS) recognition algorithms can be used to
determine the digital straightness of a given one-pixel-thick digital curve. Because of the …

Reduced-search dynamic programming for approximation of polygonal curves

A Kolesnikov, P Fränti - Pattern Recognition Letters, 2003 - Elsevier
Approximation of polygonal curves with minimum error (min-εproblem) can be solved by
dynamic programming, or by graph-theoretical approach. These methods provide optimal …

Superresolution border segmentation and measurement in remote sensing images

MP Cipolletti, CA Delrieux, GME Perillo… - Computers & …, 2012 - Elsevier
Segmentation and measurement of linear characteristics in remote sensing imagery are
among the first stages in several geomorphologic studies, including the length estimation of …

Optimized polygonal approximation by dominant point deletion

A Masood - Pattern Recognition, 2008 - Elsevier
An algorithm for polygonal approximation based on dominant point (DP) deletion is
presented in this paper. The algorithm selects an initial set of DPs and starts eliminating …