Results 1  10
of
8,925
A computational approach to edge detection
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1986
"... This 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 assumpti ..."
Abstract

Cited by 4675 (0 self)
 Add to MetaCart
This 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
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 660 (8 self)
 Add to MetaCart
A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately
Edge Point Linking by Means of Global and Local Schemes
"... Summary. This chapter presents an efficient technique for linking edge points in order to generate a closed contour representation. The original intensity image, as well as its corresponding edge map, are assumed to be given as input to the algorithm (i.e., an edge map is previously computed by some ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Summary. This chapter presents an efficient technique for linking edge points in order to generate a closed contour representation. The original intensity image, as well as its corresponding edge map, are assumed to be given as input to the algorithm (i.e., an edge map is previously computed
Comparing Images Using the Hausdorff Distance
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... The Hausdorff distance measures the extent to which each point of a `model' set lies near some point of an `image' set and vice versa. Thus this distance can be used to determine the degree of resemblance between two objects that are superimposed on one another. In this paper we provide ef ..."
Abstract

Cited by 659 (10 self)
 Add to MetaCart
The Hausdorff distance measures the extent to which each point of a `model' set lies near some point of an `image' set and vice versa. Thus this distance can be used to determine the degree of resemblance between two objects that are superimposed on one another. In this paper we provide
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating highfidelit ..."
Abstract

Cited by 542 (23 self)
 Add to MetaCart
In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high
ATOMIC DECOMPOSITION BY BASIS PURSUIT
, 1995
"... The TimeFrequency and TimeScale communities have recently developed a large number of overcomplete waveform dictionaries  stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for d ..."
Abstract

Cited by 2728 (61 self)
 Add to MetaCart
variation denoising, and multiscale edge denoising. Basis Pursuit in highly overcomplete dictionaries leads to largescale optimization problems. With signals of length 8192 and a wavelet packet dictionary, one gets an equivalent linear program of size 8192 by 212,992. Such problems can be attacked
Grouping Edge Points into Line Segments by Sequential Hough Transformation
 In Proceedings of the 15th International Conference on Pattern Recognition
, 2000
"... An algorithm to group edge points into digital line segments with Hough transformation is described in this paper. The edge points are mapped onto the parameter domain discretized at specific intervals, on which peaks appear to represent different line segments. By modeling each peak as a Gaussian f ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
An algorithm to group edge points into digital line segments with Hough transformation is described in this paper. The edge points are mapped onto the parameter domain discretized at specific intervals, on which peaks appear to represent different line segments. By modeling each peak as a Gaussian
Efficient Closed Contour Extraction from Range Image’s Edge Points
"... Abstract This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. Similarly than the previous approach, the minimum spanning tree of a partially connected graph is initially computed. T ..."
Abstract
 Add to MetaCart
Abstract This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. Similarly than the previous approach, the minimum spanning tree of a partially connected graph is initially com
Grouping Edge Points into Line Segments by Sequential Hough Transformation
 J Royal Stat Soc (Ser B
, 1999
"... An algorithm to group the edge points into digital line segment with Hough transformation is described in this paper. The edge points are mapped onto the parameter domain discretized at specific interval, on which peaks appears to represent different line segments. By modeling each peak as Gauss ..."
Abstract
 Add to MetaCart
An algorithm to group the edge points into digital line segment with Hough transformation is described in this paper. The edge points are mapped onto the parameter domain discretized at specific interval, on which peaks appears to represent different line segments. By modeling each peak
Fast linear iterations for distributed averaging.
 Systems & Control Letters,
, 2004
"... Abstract We consider the problem of finding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes. When the iteration is assumed symmetric, the problem of finding the fastest converging ..."
Abstract

Cited by 433 (12 self)
 Add to MetaCart
be exploited to speed up interiorpoint methods for solving the fastest distributed linear iteration problem, for networks with up to a thousand or so edges. We also describe a simple subgradient method that handles far larger problems, with up to one hundred thousand edges. We give several extensions
Results 1  10
of
8,925