Share Email Print
cover

Proceedings Paper

Scanline algorithms in compressed domain
Author(s): Bo Shen; Ishwar K. Sethi
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 22 March 1996
PDF: 12 pages
Proc. SPIE 2668, Digital Video Compression: Algorithms and Technologies 1996, (22 March 1996); doi: 10.1117/12.235444
Show Author Affiliations
Bo Shen, Wayne State Univ. (United States)
Ishwar K. Sethi, Wayne State Univ. (United States)


Published in SPIE Proceedings Vol. 2668:
Digital Video Compression: Algorithms and Technologies 1996
Vasudev Bhaskaran; Frans Sijstermans; Sethuraman Panchanathan, Editor(s)

© SPIE. Terms of Use
Back to Top