Elements of information theory
Elements of information theory
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Determining the Epipolar Geometry and its Uncertainty: A Review
International Journal of Computer Vision
Fast and effective text mining using linear-time document clustering
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Multiple view geometry in computer visiond
Multiple view geometry in computer visiond
Similarity estimation techniques from rounding algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Novel View Synthesis by Cascading Trilinear Tensors
IEEE Transactions on Visualization and Computer Graphics
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
An Invitation to 3-D Vision: From Images to Geometric Models
An Invitation to 3-D Vision: From Images to Geometric Models
Scale & Affine Invariant Interest Point Detectors
International Journal of Computer Vision
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Shape Matching and Object Recognition Using Low Distortion Correspondences
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
A Performance Evaluation of Local Descriptors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cyclops: in situ image sensing and interpretation in wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Collaborative node localization in surveillance networks using opportunistic target observations
Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks
Determining vision graphs for distributed camera networks using feature digests
EURASIP Journal on Applied Signal Processing
International Journal of Approximate Reasoning
Rate-constrained distributed distance testing and its applications
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Comparative evaluation of binary features
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part II
Hi-index | 0.00 |
Establishing visual correspondences is a critical step in many computer vision tasks involving multiple views of a scene. In a dynamic environment and when cameras are mobile, visual correspondences need to be updated on a recurring basis. At the same time, the use of wireless links between camera motes imposes tight rate constraints. This combination of issues motivates us to consider the problem of establishing visual correspondences in a distributed fashion between cameras operating under rate constraints. We propose a solution based on constructing distance preserving hashes using binarized random projections. By exploiting the fact that descriptors of regions in correspondence are highly correlated, we propose a novel use of distributed source coding via linear codes on the binary hashes to more efficiently exchange feature descriptors for establishing correspondences across multiple camera views. A systematic approach is used to evaluate rate vs visual correspondences retrieval performance; under a stringent matching criterion, our proposed methods demonstrate superior performance to a baseline scheme employing transform coding of descriptors.