- Multi-scale approaches
The scale-space representation of a signal obtained by Gaussian smoothing satisfies a number of special properties, scale-space axioms, which make it into a special form of multi-scale representation. There are, however, also other types of 'multi-scale approaches' in the areas of computer vision, image processing and signal processing, in particular the notion of wavelets. The purpose of this article is to describe a few of these approaches:
Scale-space theory for one-dimensional signals
For one-dimensional signals, there exists quite a well-developed theory for continuous and discrete kernels that guarantee that new local extrema or zero-crossings cannot be created by a convolution operation . For continuous signals, it holds that all scale-space kernels can be decomposed into the following sets of primitive smoothing kernels:
- the Gaussian kernel : where t > 0,
- truncated exponential kernels (filters with one real pole in the s-plane):
- h(x) = exp( − ax) if and 0 otherwise where a > 0
- h(x) = exp(bx) if and 0 otherwise where b > 0,
For discrete signals, we can, up to trivial translations and rescalings, decompose any discrete scale-space kernel into the following primitive operations:
- the discrete Gaussian kernel
- T(n,t) = In(αt) where α,t > 0 where In are the modified Bessel functions of integer order,
- generalized binomial kernels corresponding to linear smoothing of the form
- fout(x) = pfin(x) + qfin(x − 1) where p,q > 0
- fout(x) = pfin(x) + qfin(x + 1) where p,q > 0,
- first-order recursive filters corresponding to linear smoothing of the form
- fout(x) = fin(x) + αfout(x − 1) where α > 0
- fout(x) = fin(x) + βfout(x + 1) where β > 0,
- the one-sided Poisson kernel
- for where
- for where .
From this classification, it is apparent that it we require a continuous semi-group structure, there are only three classes of scale-space kernels with a continuous scale parameter; the Gaussian kernel which forms the scale-space of continuous signals, the discrete Gaussian kernel which forms the scale-space of discrete signals and the time-causal Poisson kernel that forms a temporal scale-space over discrete time. If we on the other hand sacrifice the continuous semi-group structure, there are more options:
For discrete signals, the use of generalized binomial kernels provides a formal basis for defining the smoothing operation in a pyramid. For temporal data, the one-sided truncated exponential kernels and the first-order recursive filters provide a way to define time-causal scale-spaces  that allow for efficient numerical implementation and respect causality over time without access to the future. The first-order recursive filters also provide a framework for defining recursive approximations to the Gaussian kernel that in a weaker sense preserve some of the scale-space properties .
- ^ Lindeberg, T., "Scale-space for discrete signals," PAMI(12), No. 3, March 1990, pp. 234-254.
- ^ Richard F. Lyon. "Speech recognition in scale space," Proc. of 1987 ICASSP. San Diego, March, pp. 29.3.14, 1987.
- ^ Lindeberg, T. and Fagerstrom, F.: Scale-space with causal time direction, Proc. 4th European Conference on Computer Vision, Cambridge, England, april 1996. Springer-Verlag LNCS Vol 1064, pages 229--240.
- ^ Young, I.I., van Vliet, L.J.: Recursive implementation of the Gaussian filter, Signal Processing, vol. 44, no. 2, 1995, 139-151.
- ^ Deriche, R: Recursively implementing the Gaussian and its derivatives, INRIA Research Report 1893, 1993.
Wikimedia Foundation. 2010.
Look at other dictionaries:
Scale space — theory is a framework for multi scale signal representation developed by the computer vision, image processing and signal processing communities with complementary motivations from physics and biological vision. It is a formal theory for handling … Wikipedia
Scale space implementation — Scale space Scale space axioms Scale space implementation Feature detection Edge detection Blob detection Corner detection … Wikipedia
Scale-space axioms — In image processing and computer vision, a scale space framework can be used to represent an image as a family of gradually smoothed images. This framework is very general and a variety of scale space representations has been described in the… … Wikipedia
Scale-space segmentation — or multi scale segmentation is a general framework for signal and image segmentation, based on the computation of image descriptors at multiple scales of smoothing. One dimensional hierarchical signal segmentationWitkin s seminal work in scale… … Wikipedia
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
Multi-core processor — Diagram of a generic dual core processor, with CPU local level 1 caches, and a shared, on die level 2 cache … Wikipedia
Multi-core — A multi core processor (or chip level multiprocessor, CMP) combines two or more independent cores into a single package composed of a single integrated circuit (IC), called a die, or more dies packaged together. The individual core is normally a… … Wikipedia
Ultra-Large-Scale Systems — Systems of the future will push far beyond the size of today’s systems and systems of systems by every measure: number of lines of code; number of people employing the system for different purposes; amount of data stored, accessed, manipulated,… … Wikipedia
Pyramid (image processing) — Pyramid or pyramid representation is a type of multi scale signal representation developed by the computer vision, image processing and signal processing communities, in which a signal or an image is subject to repeated smoothing and subsampling … Wikipedia
Multiscale geometric analysis — or geometric multiscale analysis is an emerging area of high dimensional signal processing and data analysis. See also Wavelet Scale space Multi scale approaches Multiresolution analysis Singular value decomposition Compressed sensing Further… … Wikipedia