Results 1  10
of
270
Deformable Kernels for Early Vision
 IEEE Trans. Pattern Anal. Mach. Intell
, 1995
"... AbstractEarly vision algorithms often have a first stage of linearfiltering that ‘extracts ’ from the image information at multiple scales of resolution and multiple orientations. A common difficulty in the design and implementation of such schemes is that one feels compelled to discretize coarsel ..."
Abstract

Cited by 130 (9 self)
 Add to MetaCart
AbstractEarly vision algorithms often have a first stage of linearfiltering that ‘extracts ’ from the image information at multiple scales of resolution and multiple orientations. A common difficulty in the design and implementation of such schemes is that one feels compelled to discretize coarsely the space of scales and orientations in order to reduce computation and storage costs. This discretization produces anisotropies due to a loss of translation, rotation, and scalinginvariance that makes early vision algorithms less precise and more difficult to design. This need not be so: one can compute and store efficiently the response of families of linear filters defined on a continuum of orientations and scales. A technique is presented that allows 1) computing the best approximation of a given family using linear combinations of a small number of ‘basis ’ functions; 2) describing all finitedimensional families, i.e., the families of filters for which a finite dimensional representation is possible with no error. The technique is based on singular value decomposition and may be applied to generating filters in arbitrary dimensions and subject to arbitrary deformations; the relevant functional analysis results are reviewed and precise conditions for the decomposition to be feasible are stated. Experimental results are presented that demonstrate the applicability of the technique to generating multiorientation multiscale 2D edgedetection kernels. The implementation issues are also discussed. Index TermsSteerable filters, wavelets, early vision, multiresolution image analysis, multirate filtering, deformable filters, scalespace I.
Weierstrass and Approximation Theory
"... We discuss and examine Weierstrass' main contributions to approximation theory. ..."
Abstract

Cited by 120 (9 self)
 Add to MetaCart
We discuss and examine Weierstrass' main contributions to approximation theory.
Group and field definitions
 Journal of Formalized Mathematics
, 1989
"... Summary. The article contains exactly the same definitions of group and field as those in [4]. These definitions were prepared without the help of the definitions and properties of Nat and Real modes included in the MML. This is the first of a series of articles in which we are going to introduce th ..."
Abstract

Cited by 92 (1 self)
 Add to MetaCart
Summary. The article contains exactly the same definitions of group and field as those in [4]. These definitions were prepared without the help of the definitions and properties of Nat and Real modes included in the MML. This is the first of a series of articles in which we are going to introduce the concept of the set of real numbers in a elementary axiomatic way.
Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
 J. Amer. Math. Soc
, 1996
"... Recall that a subset of R n is called semialgebraic if it can be represented as a (finite) boolean combination of sets of the form {�α ∈ R n: p(�α) =0}, {�α ∈R n: q(�α)>0}where p(�x), q(�x) arenvariable polynomials with real coefficients. A map from R n to R m is called semialgebraic if its gr ..."
Abstract

Cited by 92 (3 self)
 Add to MetaCart
Recall that a subset of R n is called semialgebraic if it can be represented as a (finite) boolean combination of sets of the form {�α ∈ R n: p(�α) =0}, {�α ∈R n: q(�α)>0}where p(�x), q(�x) arenvariable polynomials with real coefficients. A map from R n to R m is called semialgebraic if its graph, considered
SteerableScalable Kernels for Edge Detection and Junction Analysis
 Image and Vision Computing
, 1992
"... Families of kernels that are useful in a variety of early vision algorithms may be obtained by rotating and scaling in a continuum a `template' kernel. These multiscale multiorientation family may be approximated by linear interpolation of a discrete finite set of appropriate `basis' ker ..."
Abstract

Cited by 84 (1 self)
 Add to MetaCart
Families of kernels that are useful in a variety of early vision algorithms may be obtained by rotating and scaling in a continuum a `template' kernel. These multiscale multiorientation family may be approximated by linear interpolation of a discrete finite set of appropriate `basis' kernels. A scheme for generating such a basis together with the appropriate interpolation weights is described. Unlike previous schemes by Perona, and Simoncelli et al. it is guaranteed to generate the most parsimonious one. Additionally, it is shown how to exploit two symmetries in edgedetection kernels for reducing storage and computational costs and generating simultaneously endstop and junctiontuned filters for free.
Fading Memory and the Problem of Approximating Nonlinear Operators with Volterra Series
, 1985
"... Using the notion of fading memory we prove very strong versions of two folk theorems. The first is that any timeinvariant (TZ) continuous nonlinear operator can be approximated by a Volterra series operator, and the second is that the approximating operator can be realized as a finitedimensional l ..."
Abstract

Cited by 54 (0 self)
 Add to MetaCart
Using the notion of fading memory we prove very strong versions of two folk theorems. The first is that any timeinvariant (TZ) continuous nonlinear operator can be approximated by a Volterra series operator, and the second is that the approximating operator can be realized as a finitedimensional linear dynamical system with a nonlinear readout map. While previous approximation results are valid over finite time intervals and for signals in compact sets, the approximations presented here hold for all time and for signals in useful (noncompact) sets. The discretetime analog of the second theorem asserts that any TZ operator with fading memory can be approximated (in our strong sense) by a nonlinear movingaverage operator. Some further discussion of the notion of fading memory is given.
Little Theories
 Automated DeductionCADE11, volume 607 of Lecture Notes in Computer Science
, 1992
"... In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theories may be related by inclusion or by theory interpretation. We argue that the little theories approach is a desirable wa ..."
Abstract

Cited by 51 (16 self)
 Add to MetaCart
In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theories may be related by inclusion or by theory interpretation. We argue that the little theories approach is a desirable way to formalize mathematics, and we describe how imps, an Interactive Mathematical Proof System, supports it.
Richardson: Cohomology and deformations in graded Lie algebras
 Bull. Amer. Math. Soc
, 1966
"... authors gave an outline of the similarities between the deformations of complexanalytic structures on compact manifolds on one hand, and the deformations of associative algebras on the other. The first theory had been stimulated in 1957 by a paper [7] by Nijenhuis ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
authors gave an outline of the similarities between the deformations of complexanalytic structures on compact manifolds on one hand, and the deformations of associative algebras on the other. The first theory had been stimulated in 1957 by a paper [7] by Nijenhuis
Affine processes and applications in finance
 Annals of Applied Probability
, 2003
"... Abstract. We provide the definition and a complete characterization of regular affine processes. This type of process unifies the concepts of continuousstate branching processes with immigration and OrnsteinUhlenbeck type processes. We show, and provide foundations for, a wide range of financial ap ..."
Abstract

Cited by 39 (5 self)
 Add to MetaCart
Abstract. We provide the definition and a complete characterization of regular affine processes. This type of process unifies the concepts of continuousstate branching processes with immigration and OrnsteinUhlenbeck type processes. We show, and provide foundations for, a wide range of financial applications for regular affine processes.
Distance between Herbrand Interpretations: A Measure for Approximations to a Target Concept, in
 Proc. of the 7th International Workshop on Inductive Logic Programming, LNAI 1297
, 1997
"... ..."