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

Original language | English (US) |
---|---|

Pages (from-to) | 330-339 |

Number of pages | 10 |

Journal | Unknown Journal |

Volume | 4310 |

DOIs | |

State | Published - 2001 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Condensed Matter Physics

### Cite this

*Unknown Journal*,

*4310*, 330-339. https://doi.org/10.1117/12.411810

**Complexity analysis of two-pass algorithm and elliptical weighted average filter for VLSI implementation of perspective texture warping.** / Panchanathan, Sethuraman; Ramaswamy, K.; Fang, J. J.; Moseler, K.; Levi, S.

Research output: Contribution to journal › Article

*Unknown Journal*, vol. 4310, pp. 330-339. https://doi.org/10.1117/12.411810

}

TY - JOUR

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

AU - Panchanathan, Sethuraman

AU - Ramaswamy, K.

AU - Fang, J. J.

AU - Moseler, K.

AU - Levi, S.

PY - 2001

Y1 - 2001

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

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

UR - http://www.scopus.com/inward/record.url?scp=0035062858&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035062858&partnerID=8YFLogxK

U2 - 10.1117/12.411810

DO - 10.1117/12.411810

M3 - Article

VL - 4310

SP - 330

EP - 339

JO - Scanning Electron Microscopy

JF - Scanning Electron Microscopy

SN - 0586-5581

ER -