Sciweavers

2262 search results - page 89 / 453
» Points with large quadrant-depth
Sort
View
ECCV
2010
Springer
15 years 10 months ago
Efficient Non-Consecutive Feature Tracking for Structure-from-Motion
Abstract. Structure-from-motion (SfM) is an important computer vision problem and largely relies on the quality of feature tracking. In image sequences, if disjointed tracks caused...
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
15 years 7 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 6 months ago
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
CVPR
2011
IEEE
15 years 2 months ago
Distributed Computer Vision Algorithms Through Distributed Averaging
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
Roberto Tron, René, Vidal
GIS
2004
ACM
16 years 7 months ago
Efficient detection of motion patterns in spatio-temporal data sets
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...
Joachim Gudmundsson, Marc J. van Kreveld, Bettina ...