Complexity analysis of two-pass algorithm and elliptical weighted average filter for VLSI implementation of perspective texture warping

Sethuraman Panchanathan; Karthik Ramaswamy; Jian-Jun Fang; Kathy Moseler; Sami Levi

doi:10.1117/12.411810

29 December 2000 Complexity analysis of two-pass algorithm and elliptical weighted average filter for VLSI implementation of perspective texture warping

Sethuraman Panchanathan, Karthik Ramaswamy, Jian-Jun Fang, Kathy Moseler, Sami Levi

Author Affiliations +

Proceedings Volume 4310, Visual Communications and Image Processing 2001; (2000) https://doi.org/10.1117/12.411810
Event: Photonics West 2001 - Electronic Imaging, 2001, San Jose, CA, United States

Abstract

In this paper we present the Elliptical Weighted Average filtering algorithm and an optimized implementation of a two- pass algorithm and used in digital image and video warping. Two-pass algorithms are well suited for hardware implementation due to their reduced complexity in using 1-D re-sampling and anti-aliasing filters. But, the primary disadvantage is the need for a large buffer to store the temporary image since warping is performed in two passes. The size of the temporary buffer is equal to or greater than the size of the input image. A dedicated, hardware, implementation for this algorithm implies huge cost in terms of real estate on chip. In our approach, Wolberg-Boult's resampling algorithm is modified to use only two rows of temporary buffer thereby making the algorithm more amenable for hardware implementation. We present the complexity analysis based on number of arithmetic and logic operations (add, shift, compare, multiply, clip and divide) per macroblock. In the case of EWA filters, it is the most cost-effective high- quality filtering method because point inclusion testing can be done with one function evaluation and the filter weights can be stored in lookup tables for reduction in computation. For mapping the quadrilaterals, four equations were needed for the four lines of the quadrilaterals, which was computationally complex, wherein the computational cost was directly proportional to the number of input pixels accessed. Also we present the complexity analysis per macroblock.

Citation Download Citation

Sethuraman Panchanathan, Karthik Ramaswamy, Jian-Jun Fang, Kathy Moseler, and Sami Levi "Complexity analysis of two-pass algorithm and elliptical weighted average filter for VLSI implementation of perspective texture warping", Proc. SPIE 4310, Visual Communications and Image Processing 2001, (29 December 2000); https://doi.org/10.1117/12.411810

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