• DocumentCode
    3047805
  • Title

    Optimal multiresolution polygonal approximation

  • Author

    Kolesnikov, Alexander ; Fränti, Pasi

  • Author_Institution
    Dept. CS, Joensuu Univ., Finland
  • Volume
    5
  • fYear
    2004
  • fDate
    24-27 Oct. 2004
  • Firstpage
    3037
  • Abstract
    We propose optimal and near-optimal algorithm for multiresolution polygonal approximation of digital curves. The solution with minimum number of segments is constructed as the shortest path in a weighted graph where the weights are recursively defined as the number of segments of all embedded layers.
  • Keywords
    image resolution; image segmentation; recursive functions; digital curve; near-optimal algorithm; optimal multiresolution polygonal approximation; weighted graph; Approximation algorithms; Approximation error; Dynamic programming; Encoding; Heuristic algorithms; Iterative algorithms; Partitioning algorithms; Q measurement; Shape; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing, 2004. ICIP '04. 2004 International Conference on
  • ISSN
    1522-4880
  • Print_ISBN
    0-7803-8554-3
  • Type

    conf

  • DOI
    10.1109/ICIP.2004.1421753
  • Filename
    1421753
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3047805