A k-segments algorithm for finding principal curves

  • Authors:
  • J. J. Verbeek;N. Vlassis;B. Kröse

  • Affiliations:
  • Computer Science Institute, University of Amsterdam, Intelligent Autonomous Systems, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands;Computer Science Institute, University of Amsterdam, Intelligent Autonomous Systems, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands;Computer Science Institute, University of Amsterdam, Intelligent Autonomous Systems, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2002

Quantified Score

Hi-index 0.10

Visualization

Abstract

We propose an incremental method to find principal curves. Line segments are fitted and connected to form polygonal lines (PLs). New segments are inserted until a performance criterion is met. Experimental results illustrate the performance of the method compared to other existing approaches.