loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Computing: Theory and Applications (ICCTA'07)
ICE: The Isothetic Convex Envelope of a Digital Object
Kolkata, India
March 05-March 07
ISBN: 0-7695-2770-1
Partha Bhowmick, Bengal Engineering and Science University, India
Arindam Biswas, Bengal Engineering and Science University, India
Bhargab B. Bhattacharya, Indian Statistical Institute, India
A novel algorithm to derive the isothetic convex envelope (ICE) of an object using a digital geometric technique is proposed in this paper. ICE is defined as the isothetic convex polygon that contains the digital object, with an aim of capturing its underlying shape information. Slackening the tightness of an ICE corresponding to a digital object is achievable by increasing the grid size, and for a slackened ICE with lesser output complexity (i.e., with lesser number of vertices), the runtime of the algorithm falls significantly. The proposed algorithm is marked by its dependence on object boundary instead of object size, and usage of primitive integer operations in the digital domain, which, in entirety, ensures its speedy execution and acceptability in a real-world application. Experimental results including CPU time demonstrate the elegance of ICE and the efficiency of the proposed algorithm.
Citation:
Partha Bhowmick, Arindam Biswas, Bhargab B. Bhattacharya, "ICE: The Isothetic Convex Envelope of a Digital Object," iccta, pp.219-223, International Conference on Computing: Theory and Applications (ICCTA'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.