Sciweavers

591 search results - page 72 / 119
» Computing fundamental groups from point clouds
Sort
View
85
Voted
ICPR
2000
IEEE
16 years 3 days ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
EUC
2008
Springer
15 years 24 days ago
RT-P2P: A Scalable Real-Time Peer-to-Peer System with Probabilistic Timing Assurances
We present RT-P2P, a real-time peer-to-peer (P2P) system that allows application-level end-to-end timing requirements to be satisfied in P2P systems. P2P systems are fundamentally...
Fei Huang, Binoy Ravindran, E. Douglas Jensen
FTDCS
2003
IEEE
15 years 4 months ago
Looking for a Common View for Mobile Worlds
This paper considers central issues of distributed computing in a mobile environment. Its aim is to light on the first brick of a common view for mobile systems. We pool together...
Maria Gradinariu, Michel Raynal, Gwendal Simon
MVA
2010
126views Computer Vision» more  MVA 2010»
14 years 9 months ago
Rapid automated detection of roots in minirhizotron images
An approach for rapid, automatic detection of plant roots in minirhizotron images is presented. The problem is modeled as a Gibbs point process with a modified Candy model, in wh...
Guang Zeng, Stanley T. Birchfield, Christina E. We...
CVPR
2008
IEEE
16 years 1 months ago
Clustering and dimensionality reduction on Riemannian manifolds
We propose a novel algorithm for clustering data sampled from multiple submanifolds of a Riemannian manifold. First, we learn a representation of the data using generalizations of...
Alvina Goh, René Vidal