Polygonal approximation using a competitive Hopfield neural network

Pau Choo Chung, Ching Tsorng Tsai, E. Liang Chen, Yung Nien Sun

Research output: Contribution to journalArticlepeer-review

87 Citations (Scopus)

Abstract

Polygonal approximation plays an important role in pattern recognition and computer vision. In this paper, a parallel method using a Competitive Hopfield Neural Network (CHNN) is proposed for polygonal approximation. Based on the CHNN, the polygonal approximation is regarded as a minimization of a criterion function which is defined as the arc-to-chord deviation between the curve and the polygon. The CHNN differs from the original Hopfield network in that a competitive winner-take-all mechanism is imposed. The winner-take-all mechanism adeptly precludes the necessity of determining the values for the weighting factors in the energy function in maintaining a feasible result. The proposed method is compared to several existing methods by the approximation error norms L2 and L with the result that promising approximation polygons are obtained.

Original languageEnglish
Pages (from-to)1505-1512
Number of pages8
JournalPattern Recognition
Volume27
Issue number11
DOIs
Publication statusPublished - 1994 Nov

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Polygonal approximation using a competitive Hopfield neural network'. Together they form a unique fingerprint.

Cite this