Distributed Algorithms
Distributed Systems: Principles and Paradigms
Distributed Systems: Principles and Paradigms
TRIP: A Low-Cost Vision-Based Location System for Ubiquitous Computing
Personal and Ubiquitous Computing
M2Tracker: A Multi-View Approach to Segmenting and Tracking People in a Cluttered Scene
International Journal of Computer Vision
Multi-view Matching for Unordered Image Sets, or "How Do I Organize My Holiday Snaps?"
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
A Fault-Tolerant Distributed Vision System Architecture for Object Tracking in a Smart Room
ICVS '01 Proceedings of the Second International Workshop on Computer Vision Systems
Continuous Multi-Views Tracking using Tensor Voting
MOTION '02 Proceedings of the Workshop on Motion and Video Computing
Virtualized reality: concepts and early results
VSR '95 Proceedings of the IEEE Workshop on Representation of Visual Scenes
Automatic Tracking of Human Motion in Indoor Scenes Across Multiple Synchronized Video Streams
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Scale & Affine Invariant Interest Point Detectors
International Journal of Computer Vision
Machine Learning
Cyclops, image sensing and interpretation in wireless networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
3DIM'99 Proceedings of the 2nd international conference on 3-D digital imaging and modeling
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Wide-baseline multiple-view correspondences
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
| Hi-index | 0.00 |
A probabilistic algorithm is presented for finding correspondences across multiple images in systems with large numbers of cameras and considerable overlap. The algorithm employs the theory of random graphs to provide an efficient probabilistic algorithm that performs Wide-baseline Stereo (WBS) comparisons on a small number of image pairs, and then propagates correspondence information among the cameras. A concrete mathematical analysis of its performance is given. The algorithm is extended to handle false-positive and false-negative failures of the WBS computations. We characterize the detectability of the existence of such failures, and propose an efficient method for this detection. Based on this, we propose a heuristic method for discarding false matches, and demonstrate its effectiveness in reducing errors.Since in many multi-camera applications cameras are attached to processors that handle local processing and communication, it is natural to consider distributed solutions that make use of the local processors and do not use a central computer. Our algorithm is especially suited to run in a distributed setting. If the local processors are sufficiently powerful, this allows an order of magnitude increase in computational efficiency. More importantly, a distributed implementation provides strong robustness guarantees, and eliminates the existence of a single point of failure that is inherent when the application is coordinated by a central computer. We show how to efficiently overcome processor crashes and communication failures with a minimal reduction in the quality of the algorithm's results.