Results 1  10
of
61,178
On the Behavior of Spatial Critical Points under Gaussian Blurring: A Folklore Theorem and ScaleSpace Constraints
 In Kerckhove [8
, 2001
"... The main theorem we present is a version of a "Folklore Theorem" from scalespace theory for nonnegative compactly supported functions from R to R. The theorem states that, if we take the scale in scalespace sufficiently large, the Gaussianblurred function has only one spatial criti ..."
Abstract

Cited by 22 (10 self)
 Add to MetaCart
The main theorem we present is a version of a "Folklore Theorem" from scalespace theory for nonnegative compactly supported functions from R to R. The theorem states that, if we take the scale in scalespace sufficiently large, the Gaussianblurred function has only one spatial
On the Behavior of Spatial Critical Points under Gaussian Blurring
 In Kerckhove [8
, 2001
"... The main theorem we present is a version of a "Folklore Theorem" from scalespace theory for nonnegative compactly supported functions from R to R. The theorem states that, if we take the scale in scalespace su#ciently large, the Gaussianblurred function has only one spatial criti ..."
Abstract
 Add to MetaCart
The main theorem we present is a version of a "Folklore Theorem" from scalespace theory for nonnegative compactly supported functions from R to R. The theorem states that, if we take the scale in scalespace su#ciently large, the Gaussianblurred function has only one spatial
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
, 2008
"... ..."
Time Discounting and Time Preference: A Critical Review
 Journal of Economic Literature
, 2002
"... www.people.cornell.edu/pages/edo1/. ..."
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5350 (67 self)
 Add to MetaCart
progressed also to the study of socalled stationary points, critical points, and other indications of singularity that a point might have relative to its neighbors, especially in association with existence theorems for differential equations.
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting of mu ..."
Abstract

Cited by 459 (36 self)
 Add to MetaCart
Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting
Shiftable Multiscale Transforms
, 1992
"... Orthogonal wavelet transforms have recently become a popular representation for multiscale signal and image analysis. One of the major drawbacks of these representations is their lack of translation invariance: the content of wavelet subbands is unstable under translations of the input signal. Wavel ..."
Abstract

Cited by 557 (36 self)
 Add to MetaCart
lack of aliasing; thus, the conditions under which the property holds are specified by the sampling theorem. Shiftability may also be considered in the context of other domains, particularly orientation and scale. We explore "jointly shiftable" transforms that are simultaneously shiftable
A computational approach to edge detection
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1986
"... AbstractThis paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal ..."
Abstract

Cited by 4621 (0 self)
 Add to MetaCart
AbstractThis paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal
Mean shift, mode seeking, and clustering
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... AbstractMean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some kmeans like clustering algorithms its special cases. It is shown that mean shift is a modeseeki ..."
Abstract

Cited by 620 (0 self)
 Add to MetaCart
seeking process on a surface constructed with a “shadow ” kernel. For Gaussian kernels, mean shift is a gradient mapping. Convergence is studied for mean shift iterations. Cluster analysis is treated as a deterministic problem of finding a fixed point of mean shift that characterizes the data. Applications
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
problem in o very short time. One kind of computation for which massively porollel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found
Results 1  10
of
61,178