By Topic

A Non-Iterative R-D Optimization Algorithm for Rate-Constraint Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Aminlou, A. ; Multimedia Process. Lab., Tehran Univ., Iran ; Fatemi, O. ; Homayouni, M. ; Hashemi, M.R.

R-D optimization algorithm is frequently used where subband coding or vector quantization is required. All existing R-D optimization algorithms have an iterative process which results in more computational complexity and execution time. In this paper we propose a novel R-D optimization algorithm that has a non-iterative process with lower computational complexity. This algorithm is based on exponential modeling of R-D curves and can be used in rate-constraint problems. The proposed algorithm presents a good performance with non-convex curves as well as convex ones. While the execution time of the existing algorithms is O(Ncrv×Npt), the execution time of the proposed algorithm is O(Ncrv), where Ncrv is the number of curves and Npt is the average number of points in each curve. The quality degradation is 0.32 dB, in average, when it is tested in the rate control component of a JPEG2000 encoder.

Published in:

Image Processing, 2006 IEEE International Conference on

Date of Conference:

8-11 Oct. 2006