Multiorder Polygonal Approximation of Digital Curves
Identifieur interne : 004339 ( Crin/Corpus ); précédent : 004338; suivant : 004340Multiorder Polygonal Approximation of Digital Curves
Auteurs : Isabelle Debled-Rennesson ; Salvatore Tabbone ; Laurent WendlingSource :
- Electronic Letters on Computer Vision and Image Analysis ; 2005.
English descriptors
- KwdEn :
Abstract
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D object from the points of its contour. For that, we have extended a method [Debled & al 03] defined in a previous paper to a multiorder analysis. It is based on the arithmetical definition of discrete lines with variable thickness. We provide a framework to analyse a digital curve at different levels of thickness. The extremities of a segment provided at a high resolution are tracked at lower resolution in order to refine their location. The method is threshold-free and automatically provides a partitioning of a digital curve into its meaningful parts.
Links to Exploration step
CRIN:debled-rennesson05bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="315">Multiorder Polygonal Approximation of Digital Curves</title></titleStmt><publicationStmt><idno type="RBID">CRIN:debled-rennesson05b</idno><date when="2005" year="2005">2005</date><idno type="wicri:Area/Crin/Corpus">004339</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Multiorder Polygonal Approximation of Digital Curves</title><author><name sortKey="Debled Rennesson, Isabelle" sort="Debled Rennesson, Isabelle" uniqKey="Debled Rennesson I" first="Isabelle" last="Debled-Rennesson">Isabelle Debled-Rennesson</name></author><author><name sortKey="Tabbone, Salvatore" sort="Tabbone, Salvatore" uniqKey="Tabbone S" first="Salvatore" last="Tabbone">Salvatore Tabbone</name></author><author><name sortKey="Wendling, Laurent" sort="Wendling, Laurent" uniqKey="Wendling L" first="Laurent" last="Wendling">Laurent Wendling</name></author></analytic><series><title level="j">Electronic Letters on Computer Vision and Image Analysis</title><imprint><date when="2005" type="published">2005</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>discrete lines</term><term>polygonal approximation</term><term>scale space</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1701">In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D object from the points of its contour. For that, we have extended a method [Debled & al 03] defined in a previous paper to a multiorder analysis. It is based on the arithmetical definition of discrete lines with variable thickness. We provide a framework to analyse a digital curve at different levels of thickness. The extremities of a segment provided at a high resolution are tracked at lower resolution in order to refine their location. The method is threshold-free and automatically provides a partitioning of a digital curve into its meaningful parts.</div></front></TEI><BibTex type="article"><ref>debled-rennesson05b</ref><crinnumber>A05-R-332</crinnumber><category>1</category><equipe>ADAGE</equipe><author><e>Debled-Rennesson, Isabelle</e><e>Tabbone, Salvatore</e><e>Wendling, Laurent</e></author><title>Multiorder Polygonal Approximation of Digital Curves</title><journal>Electronic Letters on Computer Vision and Image Analysis</journal><year>2005</year><volume>5</volume><number>2</number><pages>98--110</pages><month>Aug</month><keywords><e>polygonal approximation</e><e>scale space</e><e>discrete lines</e></keywords><abstract>In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D object from the points of its contour. For that, we have extended a method [Debled & al 03] defined in a previous paper to a multiorder analysis. It is based on the arithmetical definition of discrete lines with variable thickness. We provide a framework to analyse a digital curve at different levels of thickness. The extremities of a segment provided at a high resolution are tracked at lower resolution in order to refine their location. The method is threshold-free and automatically provides a partitioning of a digital curve into its meaningful parts.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004339 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 004339 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Corpus
|type= RBID
|clé= CRIN:debled-rennesson05b
|texte= Multiorder Polygonal Approximation of Digital Curves
}}
| This area was generated with Dilib version V0.6.33. |  |