Sciweavers

619 search results - page 69 / 124
» Random Bichromatic Matchings
Sort
View
ICCV
1999
IEEE
14 years 10 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg
ECCV
2004
Springer
14 years 10 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
ICIP
2008
IEEE
14 years 10 months ago
Efficient BP stereo with automatic paramemeter estimation
In this paper, we propose a series of techniques to enhance the computational performance of existing Belief Propagation (BP) based stereo matching that relies on automatic estima...
Shafik Huq, Andreas Koschan, Besma R. Abidi, Mongi...
MICCAI
2004
Springer
14 years 9 months ago
Deformable Registration of Tumor-Diseased Brain Images
This paper presents an approach for deformable registration of a normal brain atlas to visible anatomic structures in a tumor-diseased brain image. We restrict our attention to cor...
Tianming Liu, Dinggang Shen, Christos Davatzikos
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
14 years 9 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...