Boundary and Shape Complexity of a Digital Object

详细信息    查看全文

• 关键词：Outer isothetic cover ; Inner isothetic cover ; Orthogonal convex hull ; Orthogonal convex skull ; Concavity ; Convexity ; Convexity tree
• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10149
• 期：1
• 页码：105-117
• 丛书名：Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications
• ISBN：978-3-319-54609-4
• 卷排序：10149

文摘

The orthogonal convex hull is the minimal area convex polygon covering a digital object whereas an orthogonal convex skull is the maximal area convex polygon inscribing the digital object. A quantitative approach to analyse the complexity of a given hole-free digital object is presented in this paper. The orthogonal convex hull and an orthogonal convex skull are used together to derive the complexity of an object. The analysis is performed based on the regions added while deriving the orthogonal convex hull and the regions deleted while obtaining an orthogonal convex skull. Another measure for shape complexity using convexity tree derived from the orthogonal convex skull is also presented. The simple and novel approach presented in this paper is useful to derive several shape features of a digital object.