Results 1  10
of
185,151
Probabilistic Matching of Planar Regions
, 2009
"... We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes A and B, the algorithm computes a transformation t such that with high probability the area of overlap of t(A) and B is close to maximal. I ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes A and B, the algorithm computes a transformation t such that with high probability the area of overlap of t(A) and B is close to maximal
Planar region detection and motion recovery
 Image and Vision Computing
, 1992
"... This paper presents a means of segmenting planar regions from two views of a scene using point correspondences. The initial selection of groups of coplanar points is performed on the basis of conservation of two five point protective invariants (groups for which this invariant is conserved are assum ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
This paper presents a means of segmenting planar regions from two views of a scene using point correspondences. The initial selection of groups of coplanar points is performed on the basis of conservation of two five point protective invariants (groups for which this invariant is conserved
Computed eigenmodes of planar regions
 IN RECENT ADVANCES IN DIFFERENTIAL EQUATIONS AND MATHEMATICAL PHYSICS, VOLUME 412 OF CONTEMP. MATH
, 2006
"... ..."
HEAT CONTENT ASYMPTOTICS FOR PLANAR REGIONS WITH CUSPS
"... Asymptotic results are given for the heat content of planar regions with cusps. 1. ..."
Abstract
 Add to MetaCart
Asymptotic results are given for the heat content of planar regions with cusps. 1.
A Separator Theorem for Planar Graphs
, 1977
"... Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which ..."
Abstract

Cited by 465 (1 self)
 Add to MetaCart
Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which
Topological maps based on graphs of planar regions
 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS
, 2009
"... Abstract—Topological visual maps contain different abstraction levels of information that can be used by robots to carry out different activities. We propose here a new hierarchical structure in which landmarks extracted from conventional images are grouped creating a graph of planar regions. The n ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—Topological visual maps contain different abstraction levels of information that can be used by robots to carry out different activities. We propose here a new hierarchical structure in which landmarks extracted from conventional images are grouped creating a graph of planar regions
Detection of Planar Regions in Volume Data for Topology Optimization
"... Abstract. We propose a method to identify planar regions in volume data using a specialized version of the discrete Radon transform operating on a structured or unstructured grid. The algorithm uses an efficient discretization scheme for the parameter space to obtain a running time of O(N(T log T)), ..."
Abstract
 Add to MetaCart
Abstract. We propose a method to identify planar regions in volume data using a specialized version of the discrete Radon transform operating on a structured or unstructured grid. The algorithm uses an efficient discretization scheme for the parameter space to obtain a running time of O(N(T log T
Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1996
"... We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum and c ..."
Abstract

Cited by 778 (21 self)
 Add to MetaCart
We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum
BerryEsseen bounds for the number of maxima in planar regions
 ELECTRONIC JOURNAL OF PROBABILITY
, 2003
"... We derive the optimal convergence rate O(n 1/4 ) in the central limit theorem for the number of maxima in random samples chosen uniformly at random from the right triangle of the shape #. A local limit theorem with rate is also derived. The result is then applied to the number of maxima in general ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
planar regions (upperbounded by some smooth decreasing curves) for which a nearoptimal convergence rate to the normal distribution is established.
Minimum Cost Sensor Coverage of Planar Regions
"... Abstract—We consider the placement of sensors with circular sensing regions for qcoverage of planar regions. We first consider the placement of sensors of multiple types and costs over a specified set of locations to minimize the total sensors ’ cost. We present two approximate solutions to this pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—We consider the placement of sensors with circular sensing regions for qcoverage of planar regions. We first consider the placement of sensors of multiple types and costs over a specified set of locations to minimize the total sensors ’ cost. We present two approximate solutions
Results 1  10
of
185,151