In the fields of pattern recognition and machine learning the intrinsic dimension for a data set can be thought of as the number of variables needed in a minimal representation of the data. Similarly, in signal processing of multidimensional signals, the intrinsic dimension of the signal describes how many variables are needed to generate a good approximation of the signal.
When estimating intrinsic dimension however, a slightly broader definition based on manifold dimension is often used, where a representation in the intrinsic dimension does only need to exist locally. Such intrinsic dimension estimation methods can thus handle data sets with different intrinsic dimensions in different parts of the data set.
The intrinsic dimension can be used as a lower bound of what dimension it is possible to compress a data set into through dimension reduction, but it can also be used as a measure of the complexity of the data set or signal.
For a data set or signal of N variables, its intrinsic dimension M satisfies 0 ≤ M ≤ N.
for some one-variable function g which is not constant. This means that f varies, in accordance to g, with the first variable or along the first coordinate. On the other hand, f is constant with respect to the second variable or along the second coordinate. It is only necessary to know the value of one, namely the first, variable in order to determine the value of f. Hence, it is a two-variable function but its intrinsic dimension is one.
A slightly more complicated example is
Since the variation in f can be described by the single variable y1 its intrinsic dimension is one.
For the case that f is constant, its intrinsic dimension is zero since no variable is needed to describe variation. For the general case, when the intrinsic dimension of the two-variable function f is neither zero or one, it is two.
In the literature, functions which are of intrinsic dimension zero, one, or two are sometimes referred to as i0D, i1D or i2D, respectively.
Formal definition for signalsEdit
For an N-variable function f, the set of variables can be represented as an N-dimensional vector x:
If for some M-variable function g and M × N matrix A is it the case that
- for all x;
- M is the smallest number for which the above relation between f and g can be found,
then the intrinsic dimension of f is M.
The intrinsic dimension is a characterization of f, it is not an unambiguous characterization of g nor of A. That is, if the above relation is satisfied for some f, g, and A, it must also be satisfied for the same f and g′ and A′ given by
where B is a non-singular M × M matrix, since
The Fourier transform of signals of low intrinsic dimensionEdit
An N variable function which has intrinsic dimension M < N has a characteristic Fourier transform. Intuitively, since this type of function is constant along one or several dimensions its Fourier transform must appear like an impulse (the Fourier transform of a constant) along the same dimension in the frequency domain.
A simple exampleEdit
Let f be a two-variable function which is i1D. This means that there exists a normalized vector and a one-variable function g such that
for all . If F is the Fourier transform of f (both are two-variable functions) it must be the case that
Here G is the Fourier transform of g (both are one-variable functions), δ is the Dirac impulse function and m is a normalized vector in perpendicular to n. This means that F vanishes everywhere except on a line which passes through the origin of the frequency domain and is parallel to m. Along this line F varies according to G.
The general caseEdit
Let f be an N-variable function which has intrinsic dimension M, that is, there exists an M-variable function g and M × N matrix A such that
Its Fourier transform F can then be described as follows:
- F vanishes everywhere except for a subspace of dimension M
- The subspace M is spanned by the rows of the matrix A
- In the subspace, F varies according to G the Fourier transform of g
The type of intrinsic dimension described above assumes that a linear transformation is applied to the coordinates of the N-variable function f to produce the M variables which are necessary to represent every value of f. This means that f is constant along lines, planes, or hyperplanes, depending on N and M.
In a general case, f has intrinsic dimension M if there exist M functions a1, a2, ..., aM and an M-variable function g such that
- for all x
- M is the smallest number of functions which allows the above transformation
A simple example is transforming a 2-variable function f to polar coordinates:
- , f is i1D and is constant along any circle centered at the origin
- , f is i1D and is constant along all rays from the origin
For the general case, a simple description of either the point sets for which f is constant or its Fourier transform is usually not possible.
During the 1950s so called "scaling" methods were developed in the social sciences to explore and summarize multidimensional data sets. After Shepard introduced non-metric multidimensional scaling in 1962 one of the major research areas within multi-dimensional scaling (MDS) was estimation of the intrinsic dimension. The topic was also studied in information theory, pioneered by Bennet in 1965 who coined the term "intrinsic dimension" and wrote a computer program to estimate it.
During the 1970s intrinsic dimensionality estimation methods were constructed that did not depend on dimensionality reductions such as MDS: based on local eigenvalues., based on distance distributions, and based on other dimension-dependent geometric properties
Estimating intrinsic dimension of sets and probability measures has also been extensively studied since around 1980 in the field of dynamical systems, where dimensions of (strange) attractors have been the subject of interest. For strange attractors there is no manifold assumption, and the dimension measured is some version of fractal dimension — which also can be non-integer. However, definitions of fractal dimension yield the manifold dimension for manifolds.
The case of a two-variable signal which is i1D appears frequently in computer vision and image processing and captures the idea of local image regions which contain lines or edges. The analysis of such regions has a long history, but it was not until a more formal and theoretical treatment of such operations began that the concept of intrinsic dimension was established, even though the name has varied.
For example, the concept which here is referred to as an image neighborhood of intrinsic dimension 1 or i1D neighborhood is called 1-dimensional by Knutsson (1982), linear symmetric by Bigün & Granlund (1987) and simple neighborhood in Granlund & Knutsson (1995).
- Torgerson, Warren S. (1978) . Theory and methods of scaling. Wiley. ISBN 0471879452. OCLC 256008416.
- Shepard, Roger N. (1962). "The analysis of proximities: Multidimensional scaling with an unknown distance function. I.". Psychometrika. 27 (2): 125–140. doi:10.1007/BF02289630.
- Shepard, Roger N. (1974). "Representation of structure in similarity data: Problems and prospects". Psychometrika. 39 (4): 373–421. doi:10.1007/BF02291665.
- Bennet, Robert S. (June 1965). "Representation and analysis of signals—Part XXI: The intrinsic dimensionality of signal collections". Rep. 163. Baltimore, MD: The Johns Hopkins University.
- Robert S. Bennett (1965). Representation and Analysis of Signals Part XXI. The intrinsic dimensionality of signal collections (PDF) (PhD). Ann Arbor, Michigan: The Johns Hopkins University.
- Bennett, Robert S. (September 1969). "The intrinsic dimensionality of signal collections". IEEE Transactions on Information Theory. 15 (5): 517–525. doi:10.1109/TIT.1969.1054365.
- Fukunaga, K.; Olsen, D. R. (1971). "An algorithm for finding intrinsic dimensionality of data". IEEE Transactions on Computers. 20 (2): 176–183. doi:10.1109/T-C.1971.223208.
- Pettis, K. W.; Bailey, Thomas A.; Jain, Anil K.; Dubes, Richard C. (1979). "An intrinsic dimensionality estimator from near-neighbor information". IEEE Transactions on Pattern Analysis and Machine Intelligence. 1 (1): 25–37. doi:10.1109/TPAMI.1979.4766873.
- Trunk, G. V. (1976). "Statistical estimation of the intrinsic dimensionality of a noisy signal collection". IEEE Transactions on Computers. 100 (2): 165–171. doi:10.1109/TC.1976.5009231.
- Grassberger, P.; Procaccia, I. (1983). "Measuring the strangeness of strange attractors". Physica D: Nonlinear Phenomena. 9 (1–2): 189–208. doi:10.1016/0167-2789(83)90298-1.
- Takens, F. (1984). "On the numerical determination of the dimension of an attractor". In Tong, Howell (ed.). Dynamical Systems and Bifurcations, Proceedings of a Workshop Held in Groningen, The Netherlands, April 16-20, 1984. Lecture Notes in Mathematics. 1125. Springer-Verlag. pp. 99–106. doi:10.1007/BFb0075637. ISBN 3540394117.
- Cutler, C. D. (1993). "A review of the theory and estimation of fractal dimension". Dimension estimation and models. Nonlinear Time Series and Chaos. 1. World Scientific. pp. 1–107. ISBN 9810213530.
- Harte, D. (2001). Multifractals — Theory and Applications. Chapman and Hall/CRC. ISBN 9781584881544.
- Chavez, E. (2001). "Searching in metric spaces". ACM Computing Surveys. 33 (3): 273–321. doi:10.1145/502807.502808.
- Pestov, V. (2008). "An axiomatic approach to intrinsic dimension of a dataset". Neural Networks. 21 (2–3): 204–213. arXiv:0712.2063. doi:10.1016/j.neunet.2007.12.030.
- Knutsson, Hans (1982). Filtering and reconstruction in image processing (PDF). Linköping Studies in Science and Technology. 88. Linköping University. ISBN 91-7372-595-1. oai:DiVA.org:liu-54890.
- Bigün, Josef; Granlund, Gösta H. (1987). "Optimal orientation detection of linear symmetry" (PDF). Proceedings of the International Conference on Computer Vision. pp. 433–438.
- Granlund, Gösta H.; Knutsson, Hans (1995). Signal Processing in Computer Vision. Kluwer Academic. ISBN 978-1-4757-2377-9.
- Michael Felsberg; Sinan Kalkan; Norbert Krueger (2009). "Continuous Dimensionality Characterization of Image Structures". Image and Vision Computing. 27 (6): 628–636. doi:10.1016/j.imavis.2008.06.018.