Scanline algorithms in compressed domain

Bo Shen; Ishwar K. Sethi

doi:10.1117/12.235444

22 March 1996 Scanline algorithms in compressed domain

Bo Shen, Ishwar K. Sethi

Proceedings Volume 2668, Digital Video Compression: Algorithms and Technologies 1996; (1996) https://doi.org/10.1117/12.235444
Event: Electronic Imaging: Science and Technology, 1996, San Jose, CA, United States

Abstract

The scanline algorithms are popular in a computer graphics for complex geometric manipulations. The main characteristic of the scanline algorithms is that a geometric transformation is decomposed into multiples transforms with each pass operating only along row or column scanlines. This leads to conversion of 2D image manipulation problems to straightforward 1D problems resulting in simple and systematic methods. The goal of this work is to examine the scanline approach for manipulation of transform-compressed images without decompressing them. We show how the scanline algorithms for rotation and projective mapping can be developed for JPEG/DCT images. The performance of the proposed scanline algorithms is evaluated with respect to quality, speed, and control and memory overhead.

Citation Download Citation

Bo Shen and Ishwar K. Sethi "Scanline algorithms in compressed domain", Proc. SPIE 2668, Digital Video Compression: Algorithms and Technologies 1996, (22 March 1996); https://doi.org/10.1117/12.235444

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available