Results 1  10
of
1,447
On active contour models and balloons
 CVGIP: Image
"... The use.of energyminimizing curves, known as “snakes, ” to extract features of interest in images has been introduced by Kass, Witkhr & Terzopoulos (Znt. J. Comput. Vision 1, 1987,321331). We present a model of deformation which solves some of the problems encountered with the original method. ..."
Abstract

Cited by 588 (43 self)
 Add to MetaCart
curve need no longer be close to the solution to converge. The curve passes over weak edges and is stopped only if the edge is strong. We give examples of extracting a ventricle in medical images. We have also made a first step toward 3D object reconstruction, by tracking the extracted contour on a
Principal Curves
, 1989
"... Principal curves are smooth onedimensional curves that pass through the middle of a pdimensional data set, providing a nonlinear summary of the data. They are nonparametric, and their shape is suggested by the data. The algorithm for constructing principal curve starts with some prior summary, suc ..."
Abstract

Cited by 394 (1 self)
 Add to MetaCart
Principal curves are smooth onedimensional curves that pass through the middle of a pdimensional data set, providing a nonlinear summary of the data. They are nonparametric, and their shape is suggested by the data. The algorithm for constructing principal curve starts with some prior summary
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing, or fai ..."
Abstract

Cited by 654 (15 self)
 Add to MetaCart
, or fairing, to lowpass filtering. We describe a very simple surface signal lowpass filter algorithm that applies to surfaces of arbitrary topology. As opposed to other existing optimizationbased fairing methods, which are computationally more expensive, this is a linear time and space complexity algorithm
0.1. Rational Plane Curves Passing Through Points. In the following, we
"... Given a complex projective variety V (as defined in [1]), we wish to count the curves in V that satisfy certain prescribed conditions. Let fC denote complex projective dimensional space. In our first example, V = fC2, the complex projective plane; in the second and third, V is a general hypersurf ..."
Abstract
 Add to MetaCart
Given a complex projective variety V (as defined in [1]), we wish to count the curves in V that satisfy certain prescribed conditions. Let fC denote complex projective dimensional space. In our first example, V = fC2, the complex projective plane; in the second and third, V is a general
The Band Pass Filter
, 1999
"... The 'ideal' band pass filter can be used to isolate the component of a time series that lies within a particular band of frequencies. However, applying this filter requires a dataset of infinite length. In practice, some sort of approximation is needed. Using projections, we derive approxi ..."
Abstract

Cited by 106 (2 self)
 Add to MetaCart
The 'ideal' band pass filter can be used to isolate the component of a time series that lies within a particular band of frequencies. However, applying this filter requires a dataset of infinite length. In practice, some sort of approximation is needed. Using projections, we derive
Principal Curves Revisited
 Statistics and Computing
, 1992
"... A principal curve (Hastie and Stuetzle, 1989) is a smooth curve passing through the "middle" of a distribution or data cloud, and is a generalization of linear principal components. We give an alternative definition of a principal curve, based on a mixture model. Estimation is carried out ..."
Abstract

Cited by 67 (0 self)
 Add to MetaCart
A principal curve (Hastie and Stuetzle, 1989) is a smooth curve passing through the "middle" of a distribution or data cloud, and is a generalization of linear principal components. We give an alternative definition of a principal curve, based on a mixture model. Estimation is carried out
Learning and Design of Principal Curves
, 2000
"... Principal curves have been defined as ``self consistent'' smooth curves which pass through the ``middle'' of a $d$dimensional probability distribution or data cloud. They give a summary of the data and also serve as an efficient feature extraction tool. We take a new approach by ..."
Abstract

Cited by 105 (4 self)
 Add to MetaCart
Principal curves have been defined as ``self consistent'' smooth curves which pass through the ``middle'' of a $d$dimensional probability distribution or data cloud. They give a summary of the data and also serve as an efficient feature extraction tool. We take a new approach
Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience
 Neural Computation
, 1995
"... We describe an algorithm and representation level theory of illusory contour shape and salience. Unlike previous theories, our model is derived from a single assumption namely, that the prior probability distribution of boundary completion shape can be modeled by a random walk in a lattice whose ..."
Abstract

Cited by 210 (14 self)
 Add to MetaCart
particle following a random walk will pass through a given position and orientation on a path joining two boundary fragments can be computed directly as the product of two vectorfield convolutions. We show that for the random walk we define, the maximum likelihood paths are curves of least energy, that is
Pointed Nodal Plane Curves with the Expected Number of Moduli
"... Abstract. Here we describe families of plane curves passing through s fixed points and with the expect number of moduli as spointed curves. ..."
Abstract
 Add to MetaCart
Abstract. Here we describe families of plane curves passing through s fixed points and with the expect number of moduli as spointed curves.
Results 1  10
of
1,447