Record Details

Fast image transforms using Diophantine methods

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Fast image transforms using Diophantine methods
 
Creator SHARAT CHANDRAN
POTTY, ANANTH K
SOHONI, MILIND
 
Subject approximation theory
computer vision
floating point arithmetic
computational methods
hough transforms
matrix algebra
 
Description Many image transformations in computer vision and graphics involve a pipeline when an initial integer image is processed with floating point computations for purposes of symbolic information. Traditionally, in the interests of time, the floating point computation is approximated by integer computations where the integerization process requires a guess of an integer. Examples of this phenomenon include the discretization interval of ρ and θ in the accumulator array in classical Hough transform, and in geometric manipulation of images (e.g., rotation, where a new grid is overlaid on the image). The result of incorrect discretization is a poor quality visual image, or worse, hampers measurements of critical parameters such as density or length in high fidelity machine vision. Correction techniques include, at best, anti-aliasing methods, or more commonly, a "kludge" to cleanup. In this paper, we present a method that uses the theory of basis reduction in Diophantine approximations; the method outperforms prior integer based computation without sacrificing accuracy (subject to machine epsilon).
 
Publisher IEEE
 
Date 2009-05-21T05:05:47Z
2011-12-08T07:28:37Z
2011-12-26T13:02:16Z
2011-12-27T05:48:13Z
2009-05-21T05:05:47Z
2011-12-08T07:28:37Z
2011-12-26T13:02:16Z
2011-12-27T05:48:13Z
2003
 
Type Article
 
Identifier IEEE Transactions on Image Processing 12(6), 678-684
1057-7149
10.1109/TIP.2002.806255
http://hdl.handle.net/10054/1398
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1398
 
Language en