Share Email Print

Proceedings Paper

Fast algorithms for ridge construction
Author(s): David H. Eberly
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Ridges are generalizations of local maxima for smooth functions of n independent variables. At a ridge point x the function has a local maximum when restricted to an affine (n - d)- dimensional plane located at x, the plane varying with x. The set of ridge points generically lie on d-dimensional manifolds. The ridge definition is extremely flexible since the dimension d and the affine planes can be chosen to suit an application's needs. Fast algorithms for constructing 1-dimensional ridges in n-dimensional images are presented in this paper. The algorithms require an initial approximation to a ridge point, which can be supplied interactively or via a model of a previously analyzed image. Similar algorithms can be implemented for higher dimensional ridges.

Paper Details

Date Published: 4 January 1995
PDF: 12 pages
Proc. SPIE 2356, Vision Geometry III, (4 January 1995); doi: 10.1117/12.198611
Show Author Affiliations
David H. Eberly, Univ. of North Carolina/Chapel Hill (United States)

Published in SPIE Proceedings Vol. 2356:
Vision Geometry III
Robert A. Melter; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top