EDGEL AGGREGATION AND EDGE DESCRIPTION

被引：30

作者：

NALWA, VS ^{[1
]}

PAUCHON, E ^{[1
]}

机构：

[1] ESTAB TECH CENT ARMEMENT,F-94114 ARCEUIL,FRANCE

来源：

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING | 1987年 / 40卷 / 01期

关键词：

COMPUTER GRAPHICS - COMPUTER PROGRAMMING - Algorithms;

D O I：

10.1016/0734-189X(87)90057-0

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

An edge in an image corresponds to a discontinuity in the intensity surface of the underlying scene. It can be approximated by a piecewise straight curve composed of edgels, i. e. , short, linear edge elements, each characterized by a direction and a position. A substantial effort has been previously directed towards edgel detection. Edgels, by themselves, are of little use in vision systems. In this paper we discuss algorithms to aggregate edgels into edges and to describe these edges by best-fit curves. The edgel-linking algorithm is simple and has a local character. It relies only on edgel proximity and direction. The basis used for edge description consists of conic sections.

引用

页码：79 / 94

页数：16

共 18 条

[1] SOME INFORMATIONAL ASPECTS OF VISUAL PERCEPTION [J].