Fast algorithms for ridge construction

David H. Eberly

doi:10.1117/12.198611

4 January 1995 Fast algorithms for ridge construction

David H. Eberly

Proceedings Volume 2356, Vision Geometry III; (1995) https://doi.org/10.1117/12.198611
Event: Photonics for Industrial Applications, 1994, Boston, MA, United States

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.

Citation Download Citation

David H. Eberly "Fast algorithms for ridge construction", Proc. SPIE 2356, Vision Geometry III, (4 January 1995); https://doi.org/10.1117/12.198611

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available