A linear algorithm for polygonal approximations of thick curves

被引：0
|
作者：
Nguyen, T [1 ]
机构：
[1] Ecole Normale Super, F-75005 Paris, France
来源：
COMPUTER ANALYSIS OF IMAGES AND PATTERNS, PROCEEDINGS | 2005年 / 3691卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The concept of fuzzy segment was introduced in [2]. In this paper we suggest a notion of strict fuzzy segment and provide a linear algorithm for recognizing it thanks to a simple property of convex hull. A linear method to decompose a thick curve into strict fuzzy segments is also given. The quality of decomposition can be easily controlled by setting two threshold values: the maximum order and the minimum density of the fuzzy segments. The algorithm is fast, practical and multi-purpose.
引用
收藏
页码：17 / 25
页数：9
相关论文
共 50 条
  • [1] Techniques for assessing polygonal approximations of curves
    Rosin, PL
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (06) : 659 - 666
  • [2] Invariant signatures from polygonal approximations of smooth curves
    Shaked, Doran
    HP Laboratories Technical Report, 2000, (131):
  • [3] On automatic threshold selection for polygonal approximations of digital curves
    Pikaz, A
    Averbuch, A
    PATTERN RECOGNITION, 1996, 29 (11) : 1835 - 1845
  • [4] Fast guaranteed polygonal approximations of closed digital curves
    Feschet, F
    IMAGE ANALYSIS, PROCEEDINGS, 2005, 3540 : 910 - 919
  • [5] Speeding up simplification of polygonal curves using nested approximations
    Marteau, P. F.
    Menier, G.
    PATTERN ANALYSIS AND APPLICATIONS, 2009, 12 (04) : 367 - 375
  • [6] Speeding up simplification of polygonal curves using nested approximations
    P. F. Marteau
    G. Ménier
    Pattern Analysis and Applications, 2009, 12 : 367 - 375
  • [7] A polygonal line algorithm for constructing principal curves
    Kégl, B
    Krzyzak, A
    Linder, T
    Zeger, K
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 11, 1999, 11 : 501 - 507
  • [8] A polygonal decomposition algorithm for planar parametric curves
    Guo, Fenghua
    Zhang, Caiming
    Journal of Information and Computational Science, 2006, 3 (04): : 737 - 744
  • [9] Fast computation of optimal polygonal approximations of digital planar closed curves
    Aguilera-Aguilera, E. J.
    Carmona-Poyato, A.
    Madrid-Cuevas, F. J.
    Marin-Jimenez, M. J.
    GRAPHICAL MODELS, 2016, 84 : 15 - 27
  • [10] PACE: Polygonal approximation of thick digital curves using cellular envelope
    Bhowmick, Partha
    Biswas, Arindam
    Bhattacharya, Bhargab B.
    COMPUTER VISION, GRAPHICS AND IMAGE PROCESSING, PROCEEDINGS, 2006, 4338 : 299 - +
12345