When extracting features from image data, the type of information that can be extracted may be strongly dependent on the scales at which the feature detectors are applied. This article presents a systematic methodology for addressing this problem. A mechanism is presented for automatic selection of scale levels when detecting one-dimensional features, such as edges and ridges. Anovel concept of a scale-space edge is introduced, defined as a connected set of points in scale-space at which: (i) the gradient magnitude assumes a local maximum in the gradient direction, and (ii) a normalized measure of the strength of the edge response is locally maximal over scales. An important property of this definition is that it allows the scale levels to vary along the edge. Two specific measures of edge strength are analysed in detail. It is shown that by expressing these in terms of γ-normalized derivatives, an immediate consequence of this definition is that fine scales are selected for sharp edges (so as to reduce the shape distortions due to scale-space smoothing), whereas coarse scales are selected for diffuse edges, such that an edge model constitutes a valid abstraction of the intensity profile across the edge. With slight modifications, this idea can be used for formulating a ridge detector with automatic scale selection, having the characteristic property that the selected scales on a scale-space ridge instead reflect the width of the ridge.

This article presents: (i) a multi-scale representation of grey-level shape called the scale-space primal sketch, which makes explicit both features in scale-space and the relations between structures at different scales, (ii) a methodology for extracting significant blob-like image structures from this representations, and (iii) applications to edge detection, histogram analysis, and junction classification demonstrating how the proposed method can be used for guiding later stage visual processes. The representation gives a qualitative description of image structure, which allows for detection of stable scales and associated regions of interest in a solely bottom-up data-driven way. In other words, it generates coarse segmentation cues, and can hence be seen as preceding further processing, which can then be properly tuned. It is argued that once such information is available, many other processing tasks can become much simpler. Experiments on real imagery demonstrate that the proposed theory gives intuitive results.

Rotationally symmetric operations in the image domain may give rise to shape distortions. This article describes a way of reducing this effect for a general class of methods for deriving 3-D shape cues from 2-D image data, which are based on the estimation of locally linearized distortion of brightness patterns. By extending the linear scale-space concept into an affine scale-space representation and performing affine shape adaption of the smoothing kernels, the accuracy of surface orientation estimates derived from texture and disparity cues can be improved by typically one order of magnitude. The reason for this is that the image descriptors, on which the methods are based, will be relative invariant under a ne transformations, and the error will thus be confined to the higher-order terms in the locally linearized perspective mapping.

Although traditional scale-space theory provides a well-founded framework for dealing with image structures at different scales, it does not directly address the problem of how to select appropriate scales for further analysis. This paper introduces a new tool for dealing with this problem. A heuristic principle is proposed stating that local extrema over scales of different combinations of normalized scale invariant derivatives are likely candidates to correspond to interesting structures. Support is given by theoretical considerations and experiments on real and synthetic data. The resulting methodology lends itself naturally to two-stage algorithms; feature detection at coarse scales followed by feature localization at ner scales. Experiments on blob detection, junction detection and edge detection demonstrate that the proposed method gives intuitively reasonable results.

: The problem of scale in shape from texture is addressed. The need for (at least) two scale parameters is emphasized; a local scale describing the amount of smoothing used for suppressing noise and irrelevant details when computing primitive texture descriptors from image data, and an integration scale describing the size of the region in space over which the statistics of the local descriptors is accumulated. A novel mechanism for automatic scale selection is proposed, based on normalized derivatives. It is used for adaptive determination of the two scale parameters in a multi-scale texture descriptor, the windowed second moment matrix, which is defined in terms of Gaussian smoothing, first order derivatives, and non-linear pointwise combinations of these. The same scale-selection method can be used for multi-scale blob detection without any tuning parameters or thresholding. The resulting texture description can be combined with various assumptions about surface texture in order to ...

This article describes a method for reducing the shape distortions due to scale-space smoothing that arise in the computation of 3-D shape cues using operators (derivatives) de ned from scale-space representation. More precisely, we are concerned with a general class of methods for deriving 3-D shape cues from 2-D image data based on the estimation of locally linearized deformations of brightness patterns. This class

When observing a dynamic world, the size of image structures may vary over time.

The purpose of this report 1 is to define optic flow for scalar and density images without using a priori knowledge other than its defining conservation principle, and to incorporate measurement duality, notably the scale-space paradigm. It is argued that the design of optic flow based applications may benefit from a manifest separation between factual image structure on the one hand, and goal-specific details and hypotheses about image flow formation on the other. The approach is based on a physical symmetry principle known as gauge invariance. Data-independent models can be incorporated by means of admissible gauge conditions, each of which may single out a distinct solution, but all of which must be compatible with the evidence supported by the image data. The theory is illustrated by examples and verified by simulations, and performance is compared to several techniques reported in the literature. 1 Introduction The conventional "spacetime" representation of a movie as...

The extraction and interpretation of networks of lines from images yields important organizational information of the network under consideration. In this paper, a one-parameter algorithm for the extraction of line networks from images is presented. The parameter indicates the extracted saliency level from a hierarchical graph. Input for the algorithm is the domain specific knowledge of interconnection points. Graph morphological tools are used to extract the minimum cost graph which best segments the network.

The subject of scale selection is essential to many aspects of multi-scale and multi-resolution processing of image data. This article shows how a general heuristic principle for scale selection can be appliedtotheproblem of detecting and localizing junctions. In a rst uncommitted processing step initial hypotheses about interesting scale levels (and regions of interest) are generated from scales where normalized di erential invariants assume maxima over scales (and space). Then, based on this scale (and region) information, a more re ned processing stage is invoked tuned to the task at hand. The resulting method is the rst junction detector with automatic scale selection. Whereas this article deals with the speci c problem of junction detection, the underlying ideas apply also to other types of di erential feature detectors, such as blob detectors, edge detectors, and ridge detectors. 1.