{"title":"ICE: The Isothetic Convex Envelope of a Digital Object","authors":"Partha Bhowmick, A. Biswas, B. Bhattacharya","doi":"10.1109/ICCTA.2007.70","DOIUrl":null,"url":null,"abstract":"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","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTA.2007.70","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
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