Height Ridge Computation and Filtering for Visualization

11 years 2 months ago
Height Ridge Computation and Filtering for Visualization
Motivated by the growing interest in the use of ridges in scientific visualization, we analyze the two height ridge definitions by Eberly and Lindeberg. We propose a raw feature definition leading to a superset of the ridge points as obtained by these two definitions. The set of raw feature points has the correct dimensionality, and it can be narrowed down to either Eberly's or Lindeberg's ridges by using Boolean filters which we formulate. While the straight-forward computation of height ridges requires explicit eigenvalue calculation, this can be avoided by using an equivalent definition of the raw feature set, for which we give a derivation. We describe efficient algorithms for two special cases, height ridges of dimension one and of co-dimension one. As an alternative to the aforementioned filters, we propose a new criterion for filtering raw features based on the distance between contours which generally makes better decisions, as we demonstrate on a few synthetic field...
Ronald Peikert, Filip Sadlo
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Authors Ronald Peikert, Filip Sadlo
Comments (0)