Multiscale Representation and Matching of Curves Using Codons

CVGIP: Graphical Models and Image Processing Pub Date : 1993-07-01 DOI:10.1006/cgip.1993.1020

Rosin P.L.

{"title":"Multiscale Representation and Matching of Curves Using Codons","authors":"Rosin P.L.","doi":"10.1006/cgip.1993.1020","DOIUrl":null,"url":null,"abstract":"<div><p>A powerful representation of plane curves by curvature primitives called codons has been proposed by Hoffman and Richards (<em>Proceedings, AAAI, 1982</em>, pp. 5-8). Previously these were limited to representing only continuously varying, smooth, closed curves. Also, in practice their extraction from real data is complicated by the presence of noise and fine detail. In this paper we have extended the set of codons so that both open and closed curves containing straight lines and cusps can be completely represented. The problems of noise and obscuring fine detail have been solved by representing curves at all their natural scales. Codons at different scales are linked to form a hierarchical curve representation, called the codon-tree. To increase their power for model matching the qualitative codon descriptions are augmented by a set of shape features. These are used in combination with an extended set of rewrite rules from Leyton′s process grammar (<em>Artificial Intelligence</em> 34, 1988, pp. 213-247), enabling one curve to be deformed until it matches another.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1993.1020","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CVGIP: Graphical Models and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1049965283710205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 29

Abstract

A powerful representation of plane curves by curvature primitives called codons has been proposed by Hoffman and Richards (Proceedings, AAAI, 1982, pp. 5-8). Previously these were limited to representing only continuously varying, smooth, closed curves. Also, in practice their extraction from real data is complicated by the presence of noise and fine detail. In this paper we have extended the set of codons so that both open and closed curves containing straight lines and cusps can be completely represented. The problems of noise and obscuring fine detail have been solved by representing curves at all their natural scales. Codons at different scales are linked to form a hierarchical curve representation, called the codon-tree. To increase their power for model matching the qualitative codon descriptions are augmented by a set of shape features. These are used in combination with an extended set of rewrite rules from Leyton′s process grammar (Artificial Intelligence 34, 1988, pp. 213-247), enabling one curve to be deformed until it matches another.

查看原文本刊更多论文

基于密码子的曲线多尺度表示与匹配

Hoffman和Richards提出了一种通过称为密码子的曲率原语来表示平面曲线的强大方法(Proceedings, AAAI, 1982, pp. 5-8)。以前，这些被限制为只表示连续变化的，光滑的，封闭的曲线。此外，在实践中，从真实数据中提取它们由于噪声和精细细节的存在而变得复杂。本文扩展了密码子集，使得包含直线和尖点的开曲线和闭曲线都可以完全表示。噪声和模糊细节的问题已经通过表示所有自然尺度的曲线来解决。不同尺度的密码子相互连接，形成层次曲线表示，称为密码子树。为了提高定性密码子描述的模型匹配能力，我们通过一组形状特征来增强定性密码子描述。它们与Leyton过程语法的扩展重写规则集(人工智能34,1988,pp. 213-247)结合使用，使一条曲线能够变形，直到它与另一条曲线匹配。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

CVGIP: Graphical Models and Image Processing

自引率

0.00%

发文量