Sciweavers

76 search results - page 10 / 16
» Fast approximation of convex hull
Sort
View
PAMI
2006
99views more  PAMI 2006»
13 years 9 months ago
A New Convexity Measure Based on a Probabilistic Interpretation of Images
In this article we present a novel convexity measure for object shape analysis. The proposed method is based on the idea of generating pairs of points from a set, and measuring th...
Esa Rahtu, Mikko Salo, Janne Heikkilä
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 11 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
PODC
2012
ACM
12 years 6 days ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
ICML
2007
IEEE
14 years 10 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
PAMI
2012
12 years 7 days ago
Fast Joint Estimation of Silhouettes and Dense 3D Geometry from Multiple Images
—We propose a probabilistic formulation of joint silhouette extraction and 3D reconstruction given a series of calibrated 2D images. Instead of segmenting each image separately i...
Kalin Kolev, Thomas Brox, Daniel Cremers