By Topic

Algorithms for manipulating compressed images

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

2 Author(s)
Smith, B.C. ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; Rowe, L.A.

A family of algorithms that implement operations on compressed digital images is described. These algorithms allow many traditional image manipulation operations to be performed 50 to 100 times faster than their brute-force counterparts. It is shown how the algebraic operations of pixel-wise and scalar addition and multiplication, which are the basis for many image transformations, can be implemented on compressed images. These operations are used to implement two common video transformations: dissolving one video sequence into another and subtitling. The performance of these operations is compared with the brute-force approach. The limitations of the technique, extensions to other compression standards and the relationship of this research to other work in the area are discussed.<>

Published in:

Computer Graphics and Applications, IEEE  (Volume:13 ,  Issue: 5 )