How fast can one arbitrarily and precisely scale images?

Leonid Bilevich*, Leonid Yaroslavsky

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Image scaling is a frequent operation in video processing for optical metrology. In the paper, results of comparative study of computational complexity of different algorithms for scaling digital images with arbitrary scaling factors are presented and discussed. The following algorithms were compared: different types of spatial domain processing algorithms (linear, cubic, cubic spline interpolation) and a new DCT-based algorithm, which implements perfect (interpolation error free) scaling through discrete sinc-interpolation and is virtually free of boundary effects (characteristic for the DFT-based scaling algorithms). The comparison results enable evaluation of the feasibility of realtime implementation of the algorithms for arbitrary image scaling.

Original languageEnglish
Title of host publicationProceedings of SPIE-IS and T Electronic Imaging - Real-Time Image and Video Processing 2013
DOIs
StatePublished - 2013
EventReal-Time Image and Video Processing 2013 - Burlingame, CA, United States
Duration: 6 Feb 20137 Feb 2013

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume8656
ISSN (Print)0277-786X

Conference

ConferenceReal-Time Image and Video Processing 2013
Country/TerritoryUnited States
CityBurlingame, CA
Period6/02/137/02/13

Keywords

  • DCT
  • convolution
  • fast algorithm
  • scaling

Fingerprint

Dive into the research topics of 'How fast can one arbitrarily and precisely scale images?'. Together they form a unique fingerprint.

Cite this