Hubbry Logo
Ridge detectionRidge detectionMain
Open search
Ridge detection
Community hub
Ridge detection
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Ridge detection
Ridge detection
from Wikipedia

In image processing, ridge detection is the attempt, via software, to locate ridges in an image, defined as curves whose points are local maxima of the function, akin to geographical ridges.

For a function of N variables, its ridges are a set of curves whose points are local maxima in N − 1 dimensions. In this respect, the notion of ridge points extends the concept of a local maximum. Correspondingly, the notion of valleys for a function can be defined by replacing the condition of a local maximum with the condition of a local minimum. The union of ridge sets and valley sets, together with a related set of points called the connector set, form a connected set of curves that partition, intersect, or meet at the critical points of the function. This union of sets together is called the function's relative critical set.[1][2]

Ridge sets, valley sets, and relative critical sets represent important geometric information intrinsic to a function. In a way, they provide a compact representation of important features of the function, but the extent to which they can be used to determine global features of the function is an open question. The primary motivation for the creation of ridge detection and valley detection procedures has come from image analysis and computer vision and is to capture the interior of elongated objects in the image domain. Ridge-related representations in terms of watersheds have been used for image segmentation. There have also been attempts to capture the shapes of objects by graph-based representations that reflect ridges, valleys and critical points in the image domain. Such representations may, however, be highly noise sensitive if computed at a single scale only. Because scale-space theoretic computations involve convolution with the Gaussian (smoothing) kernel, it has been hoped that use of multi-scale ridges, valleys and critical points in the context of scale space theory should allow for more a robust representation of objects (or shapes) in the image.

In this respect, ridges and valleys can be seen as a complement to natural interest points or local extremal points. With appropriately defined concepts, ridges and valleys in the intensity landscape (or in some other representation derived from the intensity landscape) may form a scale invariant skeleton for organizing spatial constraints on local appearance, with a number of qualitative similarities to the way the Blum's medial axis transform provides a shape skeleton for binary images. In typical applications, ridge and valley descriptors are often used for detecting roads in aerial images and for detecting blood vessels in retinal images or three-dimensional magnetic resonance images.

Differential geometric definition of ridges and valleys at a fixed scale in a two-dimensional image

[edit]

Let denote a two-dimensional function, and let be the scale-space representation of obtained by convolving with a Gaussian function

.

Furthermore, let and denote the eigenvalues of the Hessian matrix

of the scale-space representation with a coordinate transformation (a rotation) applied to local directional derivative operators,

where p and q are coordinates of the rotated coordinate system.

It can be shown that the mixed derivative in the transformed coordinate system is zero if we choose

,.

Then, a formal differential geometric definition of the ridges of at a fixed scale can be expressed as the set of points that satisfy [3]

Correspondingly, the valleys of at scale are the set of points

In terms of a coordinate system with the direction parallel to the image gradient

where

it can be shown that this ridge and valley definition can instead be equivalently[4] written as

where

and the sign of determines the polarity; for ridges and for valleys.

Computation of variable scale ridges from two-dimensional images

[edit]

A main problem with the fixed scale ridge definition presented above is that it can be very sensitive to the choice of the scale level. Experiments show that the scale parameter of the Gaussian pre-smoothing kernel must be carefully tuned to the width of the ridge structure in the image domain, in order for the ridge detector to produce a connected curve reflecting the underlying image structures. To handle this problem in the absence of prior information, the notion of scale-space ridges has been introduced, which treats the scale parameter as an inherent property of the ridge definition and allows the scale levels to vary along a scale-space ridge. Moreover, the concept of a scale-space ridge also allows the scale parameter to be automatically tuned to the width of the ridge structures in the image domain, in fact as a consequence of a well-stated definition. In the literature, a number of different approaches have been proposed based on this idea.

Let denote a measure of ridge strength (to be specified below). Then, for a two-dimensional image, a scale-space ridge is the set of points that satisfy

where is the scale parameter in the scale-space representation. Similarly, a scale-space valley is the set of points that satisfy

An immediate consequence of this definition is that for a two-dimensional image the concept of scale-space ridges sweeps out a set of one-dimensional curves in the three-dimensional scale-space, where the scale parameter is allowed to vary along the scale-space ridge (or the scale-space valley). The ridge descriptor in the image domain will then be a projection of this three-dimensional curve into the two-dimensional image plane, where the attribute scale information at every ridge point can be used as a natural estimate of the width of the ridge structure in the image domain in a neighbourhood of that point.

In the literature, various measures of ridge strength have been proposed. When Lindeberg (1996, 1998)[5] coined the term scale-space ridge, he considered three measures of ridge strength:

  • The main principal curvature
expressed in terms of -normalized derivatives with
.
  • The square of the -normalized square eigenvalue difference
  • The square of the -normalized eigenvalue difference

The notion of -normalized derivatives is essential here, since it allows the ridge and valley detector algorithms to be calibrated properly. By requiring that for a one-dimensional Gaussian ridge embedded in two (or three dimensions) the detection scale should be equal to the width of the ridge structure when measured in units of length (a requirement of a match between the size of the detection filter and the image structure it responds to), it follows that one should choose . Out of these three measures of ridge strength, the first entity is a general purpose ridge strength measure with many applications such as blood vessel detection and road extraction. Nevertheless, the entity has been used in applications such as fingerprint enhancement,[6] real-time hand tracking and gesture recognition[7] as well as for modelling local image statistics for detecting and tracking humans in images and video.[8]

There are also other closely related ridge definitions that make use of normalized derivatives with the implicit assumption of .[9] Develop these approaches in further detail. When detecting ridges with , however, the detection scale will be twice as large as for , resulting in more shape distortions and a lower ability to capture ridges and valleys with nearby interfering image structures in the image domain.

History

[edit]

The notion of ridges and valleys in digital images was introduced by Haralick in 1983[10] and by Crowley concerning difference of Gaussians pyramids in 1984.[11][12] The application of ridge descriptors to medical image analysis has been extensively studied by Pizer and his co-workers[13][14][15] resulting in their notion of M-reps.[16] Ridge detection has also been furthered by Lindeberg with the introduction of -normalized derivatives and scale-space ridges defined from local maximization of the appropriately normalized main principal curvature of the Hessian matrix (or other measures of ridge strength) over space and over scale. These notions have later been developed with application to road extraction by Steger et al.[17][18] and to blood vessel segmentation by Frangi et al.[19] as well as to the detection of curvilinear and tubular structures by Sato et al.[20] and Krissian et al.[21] A review of several of the classical ridge definitions at a fixed scale including relations between them has been given by Koenderink and van Doorn.[22] A review of vessel extraction techniques has been presented by Kirbas and Quek.[23]

Definition of ridges and valleys in N dimensions

[edit]

In its broadest sense, the notion of ridge generalizes the idea of a local maximum of a real-valued function. A point in the domain of a function is a local maximum of the function if there is a distance with the property that if is within units of , then . It is well known that critical points, of which local maxima are just one type, are isolated points in a function's domain in all but the most unusual situations (i.e., the nongeneric cases).

Consider relaxing the condition that for in an entire neighborhood of slightly to require only that this hold on an dimensional subset. Presumably this relaxation allows the set of points which satisfy the criteria, which we will call the ridge, to have a single degree of freedom, at least in the generic case. This means that the set of ridge points will form a 1-dimensional locus, or a ridge curve. Notice that the above can be modified to generalize the idea to local minima and result in what might call 1-dimensional valley curves.

This following ridge definition follows the book by Eberly[24] and can be seen as a generalization of some of the abovementioned ridge definitions. Let be an open set, and be smooth. Let . Let be the gradient of at , and let be the Hessian matrix of at . Let be the ordered eigenvalues of and let be a unit eigenvector in the eigenspace for . (For this, one should assume that all the eigenvalues are distinct.)

The point is a point on the 1-dimensional ridge of if the following conditions hold:

  1. , and
  2. for .

This makes precise the concept that restricted to this particular -dimensional subspace has a local maximum at .

This definition naturally generalizes to the k-dimensional ridge as follows: the point is a point on the k-dimensional ridge of if the following conditions hold:

  1. , and
  2. for .

In many ways, these definitions naturally generalize that of a local maximum of a function. Properties of maximal convexity ridges are put on a solid mathematical footing by Damon[1] and Miller.[2] Their properties in one-parameter families was established by Keller.[25]

Maximal scale ridge

[edit]

The following definition can be traced to Fritsch[26] who was interested in extracting geometric information about figures in two dimensional greyscale images. Fritsch filtered his image with a "medialness" filter that gave him information analogous to "distant to the boundary" data in scale-space. Ridges of this image, once projected to the original image, were to be analogous to a shape skeleton (e.g., the Blum medial axis) of the original image.

What follows is a definition for the maximal scale ridge of a function of three variables, one of which is a "scale" parameter. One thing that we want to be true in this definition is, if is a point on this ridge, then the value of the function at the point is maximal in the scale dimension. Let be a smooth differentiable function on . The is a point on the maximal scale ridge if and only if

  1. and , and
  2. and .

Relations between edge detection and ridge detection

[edit]

The purpose of ridge detection is usually to capture the major axis of symmetry of an elongated object,[citation needed] whereas the purpose of edge detection is usually to capture the boundary of the object. However, some literature on edge detection erroneously[citation needed] includes the notion of ridges into the concept of edges, which confuses the situation.

In terms of definitions, there is a close connection between edge detectors and ridge detectors. With the formulation of non-maximum as given by Canny,[27] it holds that edges are defined as the points where the gradient magnitude assumes a local maximum in the gradient direction. Following a differential geometric way of expressing this definition,[28] we can in the above-mentioned -coordinate system state that the gradient magnitude of the scale-space representation, which is equal to the first-order directional derivative in the -direction , should have its first order directional derivative in the -direction equal to zero

while the second-order directional derivative in the -direction of should be negative, i.e.,

.

Written out as an explicit expression in terms of local partial derivatives , ... , this edge definition can be expressed as the zero-crossing curves of the differential invariant

that satisfy a sign-condition on the following differential invariant

(see the article on edge detection for more information). Notably, the edges obtained in this way are the ridges of the gradient magnitude.

See also

[edit]

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
Ridge detection is a fundamental technique in image processing and aimed at identifying and extracting curvilinear structures in digital images, where ridges are defined as curves along which the image intensity exhibits local maxima in the direction perpendicular to the curve itself. These structures typically appear as thin, elongated features with relative to their surroundings, distinguishing them from broader edges or blobs. Ridge detection plays a crucial role in applications requiring the analysis of linear or tubular patterns, such as detecting roads and rivers in , blood vessels in medical scans, or fingerprints in . Early approaches to ridge detection relied on differential geometry and scale-space analysis, modeling ridges through explicit line profiles and using Gaussian derivatives to compute eigenvalues of the Hessian matrix of the image intensity for subpixel accuracy and bias correction in asymmetrical profiles. A seminal method, proposed by Steger in 1998, introduced an unbiased detector for curvilinear structures by explicitly modeling line profiles and estimating width and direction to achieve precise localization even in noisy conditions. Concurrently, Frangi et al. developed a multiscale vessel enhancement filter in 1998, leveraging Hessian-based analysis to quantify "vesselness" through eigenvalue ratios, effectively enhancing tubular ridges while suppressing non-ridge features like noise or plate-like structures. Subsequent advancements have incorporated various filtering techniques, including Laplacian of Gaussian (LoG), steerable filters, and , to handle multi-scale ridges and varying widths, with objective evaluations showing superior performance in metrics like for specific domains. In , Hessian-derived methods excel at segmenting vasculature for diagnostics, while in , they facilitate infrastructure mapping; however, challenges persist in handling occlusions, varying illumination, and computational efficiency for real-time applications. Overall, ridge detection continues to evolve, integrating for improved robustness in complex scenes.

Fundamentals

Definition of ridges in images

In image processing and , ridges are curvilinear structures characterized by loci where the image intensity achieves local maxima in the direction transverse to the curve itself. This property distinguishes ridges as elongated features that stand out due to their elevated intensity compared to neighboring regions to their orientation. Such structures are fundamental for capturing prominent linear or branching patterns within or intensity-based images. Intuitive examples of ridges abound in various imaging domains, including the centerlines of roads visible in aerial or satellite photographs, the tubular forms of blood vessels in retinal scans, and the parallel raised patterns in fingerprint impressions. These instances highlight ridges' utility in representing slim, extended elements that convey essential geometric information about scenes or objects. In each case, the ridge aligns with the core axis of the feature, providing a compact descriptor for analysis. Ridges hold perceptual significance in human vision, acting as salient cues that support the grouping of visual elements into coherent shapes and aid in by emphasizing elongated, high-contrast formations akin to those in the retinal image's primal sketch. Their continuity as thin, unbroken paths further enhances their role in delineating structures against varied backgrounds, promoting efficient scene interpretation. These intuitive attributes underpin ridges' importance, with differential geometric formalizations explored in advanced treatments.

Ridges versus edges and other features

In image processing, edges represent abrupt transitions in intensity, typically marking boundaries between homogeneous regions such as object silhouettes or changes in material properties. These features arise from step-like or ramp discontinuities in the intensity profile and are commonly detected by locating points where the magnitude achieves a local maximum along the direction. Ridges, by contrast, are elongated loci of local intensity maxima oriented transverse to their principal direction, capturing internal structural features rather than boundaries. They correspond to smooth, crest-like variations in the image, such as the symmetry axes of elongated objects or centerlines in tubular structures, and are characterized by the image function being maximal in the direction perpendicular to the while varying gradually along it. This distinguishes ridges from edges, as ridges emphasize proto-geometric properties like width and elongation over mere intensity jumps. Unlike , which trace level sets connecting points of equal intensity and thus follow iso-value curves orthogonal to the , ridges align with the principal direction of curvature, tracing paths where one reaches an extremum. Contours are suited for delineating regions of uniform intensity, such as object boundaries in segmentation tasks, whereas ridges provide skeletal representations that preserve topological and geometric invariants of internal shapes. Valleys serve as the symmetric dual to ridges, defined as curves where intensity exhibits local minima transverse to their axis, often detected by inverting the image polarity or applying analogous measures with opposite sign. While ridges highlight bright linear features like crests, valleys identify dark troughs, enabling comprehensive analysis of both protuberant and depressed structures in the same framework. For example, in an aerial image of a building, would isolate the sharp outlines of roof facets, whereas ridge detection would extract the central peak line along the roof's apex, revealing its structural ; similarly, valley detection might trace gutters or shadowed depressions. In vascular , edges could mark vessel walls, but ridges would follow the vessel centerlines for path extraction.

Mathematical Definitions in 2D

Differential geometric definition at fixed scale

In two-dimensional images, the differential geometric definition of ridges at a fixed scale is grounded in the local extremal properties of the image intensity surface, analyzed through the second-order partial derivatives without any prior blurring or scale normalization. This approach treats the image f(x,y)f(x, y) as a smooth surface in three dimensions, where ridges correspond to curves along which the surface exhibits maximal in the transverse direction. The HfH_f at a point (x,y)(x, y) encapsulates this second-order structure: Hf=(fxxfxyfxyfyy),H_f = \begin{pmatrix} f_{xx} & f_{xy} \\ f_{xy} & f_{yy} \end{pmatrix}, where fxx=2fx2f_{xx} = \frac{\partial^2 f}{\partial x^2}, fyy=2fy2f_{yy} = \frac{\partial^2 f}{\partial y^2}, and fxy=2fxyf_{xy} = \frac{\partial^2 f}{\partial x \partial y}. The eigenvalues λ1λ2\lambda_1 \leq \lambda_2 of HfH_f represent the principal curvatures, with corresponding orthogonal eigenvectors v1v_1 and v2v_2. For a point to qualify as a ridge point, it must satisfy the condition that the f=(fx,fy)\nabla f = (f_x, f_y) is orthogonal to v1v_1, the eigenvector associated with the most negative eigenvalue λ1<0\lambda_1 < 0, ensuring a local maximum of curvature transverse to the ridge direction; additionally, λ1<λ2\lambda_1 < \lambda_2 distinguishes ridges from other features. Mathematically, the ridge condition is expressed as: fv1=0,\nabla f \cdot v_1 = 0, where v1v_1 satisfies Hfv1=λ1v1H_f v_1 = \lambda_1 v_1 and λ1=min(eigenvalues of Hf)<0\lambda_1 = \min(\text{eigenvalues of } H_f) < 0. This orthogonality implies that the ridge curve is aligned with v1v_1, the direction of minimal change (or maximal convexity), while the gradient points normal to the ridge, highlighting the locus of principal curvature maxima. Computation at fixed scale involves direct evaluation of these derivatives from the discrete image data, often approximated via finite differences, to identify such points without introducing a scale parameter. In two-dimensional image analysis at a fixed scale, valleys represent loci of local minima in the transverse direction, providing a symmetric counterpart to ridges and enabling joint extraction of extremal structures for enhanced feature understanding. Formally, a point in the image domain is classified as a valley if the image gradient L\nabla L is orthogonal to the eigenvector v2v_2 corresponding to the largest (most positive) eigenvalue λ2>0\lambda_2 > 0 of the HLH_L, where λ1λ2\lambda_1 \leq \lambda_2 are the ordered eigenvalues. This condition ensures that the image intensity exhibits a local minimum along the direction v2v_2, while allowing variation along the valley axis v1v_1. The is expressed as: Lv2=0,\nabla L \cdot v_2 = 0, with the additional requirement that λ2>λ1\lambda_2 > \lambda_1 to distinguish true valleys from other critical points, confirmed by the indicating positive transversely. This definition mirrors the ridge condition from but inverts the sign of the principal , highlighting the duality between maxima and minima in landscapes. Practically, valleys can be detected by applying ridge extraction to the negated function L-L, which transforms local minima into maxima and thus inverts ridges to valleys without altering the underlying computational framework. This symmetry facilitates efficient joint analysis, where ridges and valleys together delineate boundaries between regions, such as in topographic or applications. Related structures include crest lines, which extend the ridge concept to projections of three-dimensional surfaces onto two dimensions, and their 2D analogs in valleys that similarly capture inflections in intensity profiles. In 2D, these analogs manifest as curves where the transverse minimality condition holds, aiding in the segmentation of elongated dark features like vessels or furrows, often analyzed alongside ridges for comprehensive extremal curve extraction.

Multi-Scale Ridge Detection

Variable scale computation in 2D images

Variable-scale ridge detection in 2D images involves tracing the loci of points as the scale parameter tt varies, applied to progressively blurred versions of the to capture features robust to noise and scale differences. This approach extends fixed-scale ridge definitions by embedding the into a representation, where ridges manifest as curves in a three-dimensional domain of spatial coordinates and scale. Seminal work by Lindeberg formalized this by defining scale-space ridges as integral curves satisfying differential geometric conditions across scales, enabling the detection of salient structures like vessels or that persist or evolve with blurring. The computation begins by convolving the input image f(x,y)f(x, y) with a Gaussian kernel g(x,y;t)=12πtexp(x2+y22t)g(x, y; t) = \frac{1}{2\pi t} \exp\left( -\frac{x^2 + y^2}{2t} \right) at discrete scales tt, yielding the image L(x,y;t)=g(x,y;t)f(x,y)L(x, y; t) = g(x, y; t) * f(x, y). At each scale tt, the of second-order derivatives is computed: H=(LxxLxyLxyLyy),H = \begin{pmatrix} L_{xx} & L_{xy} \\ L_{xy} & L_{yy} \end{pmatrix}, with eigenvalues λ1(t)λ2(t)\lambda_1(t) \leq \lambda_2(t) and corresponding eigenvectors v1,v2v_1, v_2. points are then identified where the is orthogonal to the principal eigenvector: Lv1=0\nabla L \cdot v_1 = 0, typically with λ1(t)<0\lambda_1(t) < 0 to ensure a local maximum in the transverse direction and λ1(t)λ2(t)|\lambda_1(t)| \geq |\lambda_2(t)| for ridge-like elongation. These conditions are evaluated at multiple scales, often using normalized measures like tγ/2λ1t^{\gamma/2} \lambda_1 (with γ=2\gamma = 2 for ridges) to compare strengths across tt. Ridge tracing connects these fixed-scale points into continuous curves by tracking the evolution of ridge loci in scale-space, often via algorithms that follow zero-crossings of differential invariants such as Z1L=λ1LppZ_1 L = \lambda_1 L_{pp} or intersections of surfaces defined by Lv1=0\nabla L \cdot v_1 = 0. This forms ridge "worms" or trajectories that represent multi-scale feature persistence, with automatic scale selection at points where the normalized ridge strength Rγ-normLR_{\gamma\text{-norm}} L is locally maximal over tt, satisfying t(Rγ-normL)=0\partial_t (R_{\gamma\text{-norm}} L) = 0 and tt(Rγ-normL)<0\partial_{tt} (R_{\gamma\text{-norm}} L) < 0. In practice, discrete scales (e.g., 40 levels from t=1t = 1 to t=512t = 512 with constant ratios) are used, linking nearby points via proximity in position and scale. Bifurcations occur at scales where ridges split or merge, often due to noise or overlapping structures, appearing as points where ridge curves branch in the scale-space domain. These are handled by analyzing decreases in normalized strength near bifurcation scales tbt_b, avoiding selection at unstable points and instead selecting pre- or post-bifurcation segments with maximal persistence; for instance, in step-edge models, bifurcations at fine scales are discarded in favor of coarser, more stable ridges. This ensures robust tracing without fragmentation, as demonstrated in applications like road or vessel detection.

Scale-space framework

The scale-space representation provides a foundational framework for analyzing image structures across multiple scales, enabling the study of features like ridges without commitment to a single resolution. In this approach, an image f(x,y)f(x, y) is convolved with a Gaussian kernel g(x,y;t)g(x, y; t) of variance tt, yielding the scale-space image L(x,y;t)=fg(x,y;t)L(x, y; t) = f * g(x, y; t), where tt parameterizes the scale and acts as a diffusion time parameter. This linear filtering smooths the image progressively, preserving significant structures while suppressing fine-scale details such as noise. The Gaussian kernel is uniquely determined by a set of axiomatic properties that ensure the scale-space representation is well-behaved and biologically plausible. These include linearity, which allows superposition of image components; shift-invariance, ensuring translation of the input does not alter the representation; isotropy (or rotational invariance), maintaining consistency under image rotations; and the semigroup property, which guarantees that convolving at scale t1t_1 followed by t2t_2 equals convolution at scale t1+t2t_1 + t_2. These axioms derive from principles of early visual processing and dimensional analysis, leading to the diffusion equation tL=122L\partial_t L = \frac{1}{2} \nabla^2 L satisfied by the scale-space family. Derivatives in scale-space are computed by differentiating the convolved image, providing multi-scale descriptions of local image geometry. The second-order derivatives form the Hessian matrix at scale tt: HL(x,y;t)=[Lxx(x,y;t)Lxy(x,y;t)Lyx(x,y;t)Lyy(x,y;t)],H_L(x, y; t) = \begin{bmatrix} L_{xx}(x, y; t) & L_{xy}(x, y; t) \\ L_{yx}(x, y; t) & L_{yy}(x, y; t) \end{bmatrix}, where LxxL_{xx}, LxyL_{xy}, and so on denote partial derivatives. In ridge detection, this scale-space framework facilitates robust extraction by analyzing eigenvalue decompositions of HLH_L across scales, where ridges correspond to loci of principal curvature maxima, inherently filtering out noise-dominated fine scales. This multi-scale perspective links variable-scale ridge computation to a unified theoretical structure, enhancing invariance to illumination and scale variations.

Generalizations to Higher Dimensions

Definition of ridges and valleys in N dimensions

In N-dimensional images, ridges and valleys generalize the concepts from lower dimensions by leveraging the spectral properties of the Hessian matrix to identify loci of extremal curvature. For an N-dimensional scalar function f:RNRf: \mathbb{R}^N \to \mathbb{R}, the Hessian matrix H(f)(x)H(f)(x) at a point xx is the symmetric matrix of second partial derivatives, with real eigenvalues λ1λ2λN\lambda_1 \leq \lambda_2 \leq \cdots \leq \lambda_N and corresponding orthonormal eigenvectors v1,v2,,vNv_1, v_2, \dots, v_N. These eigenvalues quantify the principal curvatures of the level sets of ff at xx, where negative values indicate concave regions and positive values indicate convex regions. A ridge point in N dimensions is defined as a location xx where the gradient f(x)\nabla f(x) is orthogonal to the eigenvector v1v_1 associated with the most negative eigenvalue λ1\lambda_1, ensuring that xx lies on a hypersurface of local maxima along the principal direction of strongest negative curvature. Mathematically, this condition is expressed as: f(x)v1=0,\nabla f(x) \cdot v_1 = 0, with the additional requirement that λ1<λk\lambda_1 < \lambda_k for all k=2,,Nk = 2, \dots, N to confirm the extremal nature in that direction. This definition captures ridges as (N-1)-dimensional manifolds where the function achieves local maxima transverse to the ridge axis, analogous to crests in 2D but extended to higher-dimensional volumes such as 3D medical scans. Valleys in N dimensions are dually defined as points xx where f(x)\nabla f(x) is orthogonal to the eigenvector vNv_N corresponding to the most positive eigenvalue λN\lambda_N, representing loci of local minima along the direction of strongest positive curvature. The condition is: f(x)vN=0,\nabla f(x) \cdot v_N = 0, accompanied by λN>λk\lambda_N > \lambda_k for all k=1,,N1k = 1, \dots, N-1. These structures manifest as (N-1)-dimensional manifolds of local minima in the principal directions, providing complementary information to ridges for delineating boundaries or depressions in multidimensional data.

Maximal scale ridges

In N-dimensional images, maximal scale ridges extend the concept of ridges by incorporating persistence across multiple scales in the representation, identifying loci where ridge structures exhibit maximal stability and salience. These ridges are defined as points along ridge curves where the principal eigenvalue λ1(t)\lambda_1(t) of the of the Gaussian-smoothed image L(x;t)L(\mathbf{x}; t) is the most negative across varying scales t>0t > 0, reflecting the strongest transverse while maintaining alignment with the ridge direction. Equivalently, maximal scale ridge points satisfy the standard ridge condition Lv1=0\nabla L \cdot \mathbf{v}_1 = 0, where v1\mathbf{v}_1 is the eigenvector corresponding to λ1(t)\lambda_1(t), combined with the scale selection criterion t(λ1(t)t)=0\frac{\partial}{\partial t} \left( \frac{\lambda_1(t)}{\sqrt{t}} \right) = 0
Add your contribution
Related Hubs
User Avatar
No comments yet.