Feature-assisted sparse to dense motion estimation using geodesic distances

IMVIP 2009 - 2009 International Machine Vision and Image Processing Conference

Volumn , Issue , 2009, Pages 7-12

  Ring, Dan ^a   Pitié, François ^a  

^a TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

Geodesic distance candidate selection; Large displacement; Local features; Motion vector estimation

Indexed keywords

CANDIDATE SELECTION; GEODESIC DISTANCES; LARGE DISPLACEMENTS; LOCAL FEATURE; MOTION VECTOR ESTIMATION;

COMPUTER VISION; ESTIMATION; GEODESY; IMAGING SYSTEMS;

MOTION ESTIMATION;

EID: 72849127142     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IMVIP.2009.9     Document Type: Conference Paper

References (21)

1. V. Kolmogorov and R. Zabih, "Computing visual correspondence with occlusions using graph cuts," in Computer Vision, IEEE International Conference on, vol. 2, 2001, pp. 508-515.
2. B. K. P. Horn and B. G. Schunck, "Determining optical flow," Artificial Intelligence, vol. 17, pp. 185-203, 1981.
3. J. Konrad and E. Dubois, "Bayesian estimation of motion vector fields," IEEE Trans. Pattern Anal. Mach. Intell, vol. 14, no. 9, pp. 910-927, 1992.
4. A. C. Kokaram, Motion Picture Restoration: Digital Algorithms for Artefact Suppression in Degraded Motion Picture Film and Video. Springer Verlag, 1998.
5. M. L. C. W. Y. Zhang, "Multi-resolution optical flow tracking algorithm based on multi-scale harris corner points feature," in Chinese Control and Decision Conference, 2008, pp. 5287-5291.
6. C. Harris, "Determination of ego-motion from matched points," in Proceedings of 3rd Alvey Vision Confernce, September 1987, pp. 189-192.
7. H. Wang and M. Brady, "Real-time corner detection algorithm for motion estimation," Image and Vision Computing, vol. 13, no. 9, pp. 695 - 703, 1995.
8. C. Tomasi and T. Kanade, "Detection and tracking of point features," Carnegie Mellon University, Tech. Rep. CMU-CS-91-132, April 1991.
9. J. Shi and C. Tomasi, "Good features to track," in Computer Vision and Pattern Recognition, IEEE Computer Society Conference on, 1994, pp. 593-600.
10. R. Chellappa, G. Qian, and S. Srinivasan, "Structure from motion: sparse versus dense correspondence methods," in Image Processing, IEEE International Conference on, 1999, pp. 492-499.
11. P. Torr and A. Zisserman, "Feature based methods for structure and motion estimation," in Vision Algorithms: Theory and Practice, number 1883 in LNCS. Springer-Verlag, 2000, pp. 278-295.
12. R. I. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision. Cambridge University Press, 2000.
13. F. Dellaert, S. Seitz, C. Thorpe, and S. Thrun, "Structure from motion without correspondence," in Computer Vision and Pattern Recognition, IEEE Computer Society Conference on, June 2000.
14. J. Wills, S. Agarwal, and S. Belongie, "A feature-based approach for dense segmentation and estimation of large disparity motion," International Journal of Computer Vision, vol. 68, no. 2, pp. 125-143, 2006.
15. Y. Boykov, O. Veksler, and R. Zabih, "Fast approximate energy minimization via graph cuts." Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 23, no. 11, pp. 1222-1239, 2001.
16. T. Smith, D. Redmill, C. Canagarajah, and D. Bull, "A framework for dense optical flow from multiple sparse hypotheses," in Image Processing, IEEE International Conference on, 2008, pp. 837-840.
17. H. Lombaert, Y. Sun, and F. Cheriet, "Landmark-based non-rigid registration via graph cuts," in International Conference on Image Analysis and Recognition. Springer-Verlag, August 2007, pp. 166-175.
18. K. Mikolajczyk, B. Leibe, and B. Schiele, "Local features for object class recognition," in Image Processing, IEEE International Conference on, 2005, pp. 1792-1799.
19. D. G. Lowe, "Distinctive image features from scale-invariant keypoints." International Journal of Computer Vision, vol. 60, no. 2, pp. 91-110, November 2004.
20. D. Comaniciu and P. Meer, "Mean shift analysis and applications," in Image Processing, IEEE International Conference on, 1999, pp. 1197-1203.
21. L. Yatziv, A. Bartesaghi, and G. Sapiro, "O(n) implementation of the fast marching algorithm," Journal of Computational Physics, vol. 212, no. 2, pp. 393-399, 2006.