Sciweavers

7351 search results - page 136 / 1471
» Segmenting Point Sets
Sort
View
PRL
2006
85views more  PRL 2006»
15 years 6 months ago
Image segmentation based on merging of sub-optimal segmentations
In this paper a heuristic segmentation algorithm is presented based on the oversegmentation of an image. The method uses a set of different segmentations of the image produced pre...
Juan Carlos Pichel, David E. Singh, Francisco F. R...
DAGM
2005
Springer
15 years 12 months ago
Spiders as Robust Point Descriptors
This paper introduces a new operator to characterize a point in an image in a distinctive and invariant way. The robust recognition of points is a key technique in computer vision:...
Adam Stanski, Olaf Hellwich

Source Code
3955views
17 years 5 months ago
Toolbox Fast Marching - A toolbox for Fast Marching and level sets computations
Very effective Matlab library that implements the fast marching methods for both 2D/3D Cartesian spaces and triangulated surfaces (Meshes). It also implements the Farthest Point Sa...
Gabriel Peyre
FGR
2011
IEEE
176views Biometrics» more  FGR 2011»
14 years 10 months ago
Prop-free pointing detection in dynamic cluttered environments
Abstract—Vision-based prop-free pointing detection is challenging both from an algorithmic and a systems standpoint. From a computer vision perspective, accurately determining wh...
Pyry Matikainen, Padmanabhan Pillai, Lily B. Mumme...
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 10 months ago
Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
Esther Ezra, Wolfgang Mulzer