2,007 research outputs found
Computational role of eccentricity dependent cortical magnification
We develop a sampling extension of M-theory focused on invariance to scale
and translation. Quite surprisingly, the theory predicts an architecture of
early vision with increasing receptive field sizes and a high resolution fovea
-- in agreement with data about the cortical magnification factor, V1 and the
retina. From the slope of the inverse of the magnification factor, M-theory
predicts a cortical "fovea" in V1 in the order of by basic units at
each receptive field size -- corresponding to a foveola of size around
minutes of arc at the highest resolution, degrees at the lowest
resolution. It also predicts uniform scale invariance over a fixed range of
scales independently of eccentricity, while translation invariance should
depend linearly on spatial frequency. Bouma's law of crowding follows in the
theory as an effect of cortical area-by-cortical area pooling; the Bouma
constant is the value expected if the signature responsible for recognition in
the crowding experiments originates in V2. From a broader perspective, the
emerging picture suggests that visual recognition under natural conditions
takes place by composing information from a set of fixations, with each
fixation providing recognition from a space-scale image fragment -- that is an
image patch represented at a set of increasing sizes and decreasing
resolutions
Generalizations of the sampling theorem: Seven decades after Nyquist
The sampling theorem is one of the most basic and fascinating topics in engineering sciences. The most well-known form is Shannon's uniform-sampling theorem for bandlimited signals. Extensions of this to bandpass signals and multiband signals, and to nonuniform sampling are also well-known. The connection between such extensions and the theory of filter banks in DSP has been well established. This paper presents some of the less known aspects of sampling, with special emphasis on non bandlimited signals, pointwise stability of reconstruction, and reconstruction from nonuniform samples. Applications in multiresolution computation and in digital spline interpolation are also reviewed
Real-Time Anisotropic Diffusion using Space-Variant Vision
Many computer and robot vision applications require multi-scale image analysis. Classically, this has been accomplished through the use of a linear scale-space, which is constructed by convolution of visual input with Gaussian kernels of varying size (scale). This has been shown to be equivalent to the solution of a linear diffusion equation on an infinite domain, as the Gaussian is the Green's function of such a system (Koenderink, 1984). Recently, much work has been focused on the use of a variable conductance function resulting in anisotropic diffusion described by a nonlinear partial differential equation (PDF). The use of anisotropic diffusion with a conductance coefficient which is a decreasing function of the gradient magnitude has been shown to enhance edges, while decreasing some types of noise (Perona and Malik, 1987). Unfortunately, the solution of the anisotropic diffusion equation requires the numerical integration of a nonlinear PDF which is a costly process when carried out on a fixed mesh such as a typical image. In this paper we show that the complex log transformation, variants of which are universally used in mammalian retino-cortical systems, allows the nonlinear diffusion equation to be integrated at exponentially enhanced rates due to the non-uniform mesh spacing inherent in the log domain. The enhanced integration rates, coupled with the intrinsic compression of the complex log transformation, yields a seed increase of between two and three orders of magnitude, providing a means of performing real-time image enhancement using anisotropic diffusion.Office of Naval Research (N00014-95-I-0409
Adaptive multiscale detection of filamentary structures in a background of uniform random points
We are given a set of points that might be uniformly distributed in the
unit square . We wish to test whether the set, although mostly
consisting of uniformly scattered points, also contains a small fraction of
points sampled from some (a priori unknown) curve with -norm
bounded by . An asymptotic detection threshold exists in this problem;
for a constant , if the number of points sampled from the
curve is smaller than , reliable detection
is not possible for large . We describe a multiscale significant-runs
algorithm that can reliably detect concentration of data near a smooth curve,
without knowing the smoothness information or in advance,
provided that the number of points on the curve exceeds
. This algorithm therefore has an optimal
detection threshold, up to a factor . At the heart of our approach is
an analysis of the data by counting membership in multiscale multianisotropic
strips. The strips will have area and exhibit a variety of lengths,
orientations and anisotropies. The strips are partitioned into anisotropy
classes; each class is organized as a directed graph whose vertices all are
strips of the same anisotropy and whose edges link such strips to their ``good
continuations.'' The point-cloud data are reduced to counts that measure
membership in strips. Each anisotropy graph is reduced to a subgraph that
consist of strips with significant counts. The algorithm rejects
whenever some such subgraph contains a path that connects many consecutive
significant counts.Comment: Published at http://dx.doi.org/10.1214/009053605000000787 in the
Annals of Statistics (http://www.imstat.org/aos/) by the Institute of
Mathematical Statistics (http://www.imstat.org
A semidiscrete version of the Citti-Petitot-Sarti model as a plausible model for anthropomorphic image reconstruction and pattern recognition
In his beautiful book [66], Jean Petitot proposes a sub-Riemannian model for
the primary visual cortex of mammals. This model is neurophysiologically
justified. Further developments of this theory lead to efficient algorithms for
image reconstruction, based upon the consideration of an associated
hypoelliptic diffusion. The sub-Riemannian model of Petitot and Citti-Sarti (or
certain of its improvements) is a left-invariant structure over the group
of rototranslations of the plane. Here, we propose a semi-discrete
version of this theory, leading to a left-invariant structure over the group
, restricting to a finite number of rotations. This apparently very
simple group is in fact quite atypical: it is maximally almost periodic, which
leads to much simpler harmonic analysis compared to Based upon this
semi-discrete model, we improve on previous image-reconstruction algorithms and
we develop a pattern-recognition theory that leads also to very efficient
algorithms in practice.Comment: 123 pages, revised versio
The Local Structure of Space-Variant Images
Local image structure is widely used in theories of both machine and biological vision. The form of the differential operators describing this structure for space-invariant images has been well documented (e.g. Koenderink, 1984). Although space-variant coordinates are universally used in mammalian visual systems, the form of the operators in the space-variant domain has received little attention. In this report we derive the form of the most common differential operators and surface characteristics in the space-variant domain and show examples of their use. The operators include the Laplacian, the gradient and the divergence, as well as the fundamental forms of the image treated as a surface. We illustrate the use of these results by deriving the space-variant form of corner detection and image enhancement algorithms. The latter is shown to have interesting properties in the complex log domain, implicitly encoding a variable grid-size integration of the underlying PDE, allowing rapid enhancement of large scale peripheral features while preserving high spatial frequencies in the fovea.Office of Naval Research (N00014-95-I-0409
- …