The Community for Technology Leaders
RSS Icon
Subscribe
Anchorage, AK, USA
June 23, 2008 to June 28, 2008
ISBN: 978-1-4244-2339-2
pp: 1-8
Stepan Obdrzalek , Center for Machine Perception, Czech Technical University Prague, Czech Republic
Michal Perd'och , Center for Machine Perception, Czech Technical University Prague, Czech Republic
Jiri Matas , Center for Machine Perception, Czech Technical University Prague, Czech Republic
ABSTRACT
A novel method is proposed for the problem of frame-to-frame correspondence search in video sequences. The method, based on hashing of low-dimensional image descriptors, establishes dense correspondences and allows large motions. All image pixels are considered for matching, the notion of interest points is reviewed. In our formulation, points of interest are those that can be reliably matched. Their saliency depends on properties of the chosen matching function and on actual image content.
CITATION
Stepan Obdrzalek, Michal Perd'och, Jiri Matas, "Dense linear-time correspondences for tracking", CVPRW, 2008, 2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops 2008, pp. 1-8, doi:10.1109/CVPRW.2008.4563130
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool