Shape based circularity measures of planar point sets

被引:0
|
作者
Stojmenovic, Milos [1 ]
Nayak, Amiya [1 ]
机构
[1] Univ Ottawa, SITE, Ottawa, ON K1N 6N5, Canada
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We are interested in circularity measures which are invariant to rotation, scaling, and translation, are calculated very quickly and are resistant to protrusions in the data set. We propose several measures here, a of which are based on existing linearity measures that have been adapted to measure circularity. In order to make use of these linearity measures, we transfer the Cartesian coordinates of the input set into polar coordinates. The linearity of the polar coordinate set corresponds to the circularity of the original input set given a suitable center. We separately consider the circularity of ordered and unordered point sets. The circularity of unordered data is determined directly from the linearity measure, whereas the circularity of ordered data is derived by multiplying the unordered data circularity measure by a monotonicity factor. We discuss two ways of determining the center of the shape. The circularity measures are tested on a set of 25 curves. The proposed algorithms work on both open and closed curves, whereas all competing algorithms (except one) are linked with exclusively closed curves. The measures were compared with human measurements of circularity of the same set The new methods are have been found to best correspond to human perceptions.
引用
收藏
页码:1279 / 1282
页数:4
相关论文
共 50 条
  • [21] Pixelations of planar semialgebraic sets and shape recognition
    Nicolaescu, Liviu I.
    Rowekamp, Brandon
    ALGEBRAIC AND GEOMETRIC TOPOLOGY, 2014, 14 (06): : 3345 - 3394
  • [22] Circularity of planar graphs
    Hammack, RH
    HOUSTON JOURNAL OF MATHEMATICS, 1999, 25 (02): : 213 - 221
  • [23] Empty Convex Hexagons in Planar Point Sets
    Tobias Gerken
    Discrete & Computational Geometry, 2008, 39 : 239 - 272
  • [24] Empty convex hexagons in planar point sets
    Gerken, Tobias
    DISCRETE & COMPUTATIONAL GEOMETRY, 2008, 39 (1-3) : 239 - 272
  • [25] FAST NEIGHBORHOOD SEARCH IN PLANAR POINT SETS
    CHETVERIKOV, D
    PATTERN RECOGNITION LETTERS, 1991, 12 (07) : 409 - 412
  • [26] Note – On the Number of Triangulations of Planar Point Sets
    Raimund Seidel
    Combinatorica, 1998, 18 : 297 - 299
  • [27] On Point-Sets That Support Planar Graphs
    Dujmovic, Vida
    Evans, William
    Lazard, Sylvain
    Lenhart, William
    Liotta, Giuseppe
    Rappaport, David
    Wismath, Stephen
    GRAPH DRAWING, 2012, 7034 : 64 - +
  • [28] On point-sets that support planar graphs
    Dujmovic, V.
    Evans, W.
    Lazard, S.
    Lenhart, W.
    Liotta, G.
    Rappaport, D.
    Wismath, S.
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2013, 46 (01): : 29 - 50
  • [29] Open caps and cups in planar point sets
    Valtr, Pavel
    DISCRETE & COMPUTATIONAL GEOMETRY, 2007, 37 (04) : 565 - 576
  • [30] A Note on Universal Point Sets for Planar Graphs
    Scheucher, Manfred
    Schrezenmaier, Hendrik
    Steiner, Raphael
    GRAPH DRAWING AND NETWORK VISUALIZATION, 2019, 11904 : 350 - 362