Sciweavers

4761 search results - page 76 / 953
» Generalizing Boundary Points
Sort
View
SCIA
2011
Springer
341views Image Analysis» more  SCIA 2011»
12 years 11 months ago
Interactive Image Segmentation Using Level Sets and Dempster-Shafer Theory of Evidence
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
Björn Scheuermann, Bodo Rosenhahn
CVPR
1998
IEEE
14 years 10 months ago
A Radial Cumulative Similarity Transform for Robust Image Correspondence
We develop a local image-correspondence algorithm which performs well near occluding boundaries. Unlike traditional robust methods, our method can find correspondences when the on...
Trevor Darrell
UAI
2003
13 years 9 months ago
On Triangulating Dynamic Graphical Models
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
Jeff A. Bilmes, Chris Bartels
COMGEO
2004
ACM
13 years 8 months ago
A lower bound on the number of triangulations of planar point sets
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
Oswin Aichholzer, Ferran Hurtado, Marc Noy
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan