Iterative Image Registration: Lucas & Kanade Revisited. Kentaro Toyama Vision Technology Group Microsoft Research

Size: px
Start display at page:

Download "Iterative Image Registration: Lucas & Kanade Revisited. Kentaro Toyama Vision Technology Group Microsoft Research"

Transcription

1 Iterative Image Registration: Lucas & Kanade Revisited Kentaro Toyama Vision Technology Group Microsoft Research

2 Every writer creates his own precursors. His work modifies our conception of the past, as it will modify the future. Jorge Luis Borges

3 History Lucas & Kanade (IUW 1981) Bergen, Anandan, Hanna, Hingorani (ECCV 1992) Shi & Tomasi (CVPR 1994) Szeliski & Coughlan (CVPR 1994) Szeliski (WACV 1994) Black & Jepson (ECCV 1996) Hager & Belhumeur (CVPR 1996) Bainbridge-Smith & Lane (IVC 1997) Gleicher (CVPR 1997) Sclaroff & Isidoro (ICCV 1998) Cootes, Edwards, & Taylor (ECCV 1998) LK BAHH ST SC S BJ HB BL G SI CET

4 Image Registration

5 Applications

6 Applications Stereo LK BAHH ST SC S BJ HB BL G SI CET

7 Applications Stereo Dense optic flow LK BAHH ST SC S BJ HB BL G SI CET

8 Applications Stereo Dense optic flow Image mosaics LK BAHH ST SC S BJ HB BL G SI CET

9 Applications Stereo Dense optic flow Image mosaics Tracking LK BAHH ST SC S BJ HB BL G SI CET

10 Applications Stereo Dense optic flow Image mosaics Tracking Recognition? LK BAHH ST SC S BJ HB BL G SI CET

11 Lucas & Kanade Derivation #1

12 L&K Derivation 1 I 0 (x)

13 L&K Derivation 1 h I 0 (x) I 0 (x+h)

14 L&K Derivation 1 h I 0 (x) I(x)

15 L&K Derivation 1 h I 0 (x) I(x)

16 L&K Derivation 1 I 0 (x) I(x) R

17 L&K Derivation 1 I 0 (x) I(x)

18 L&K Derivation 1 h 0 I 0 (x) I(x)

19 L&K Derivation 1 I 0 (x+h 0 ) I(x)

20 L&K Derivation 1 I 0 (x+h 1 ) I(x)

21 L&K Derivation 1 I 0 (x+h k ) I(x)

22 L&K Derivation 1 I 0 (x+h f ) I(x)

23 Lucas & Kanade Derivation #2

24 L&K Derivation 2 Sum-of-squared-difference (SSD) error E(h) = Σ [ I(x) - I 0 (x+h) ] 2 x ε R E(h) Σ [ I(x) - I 0 (x) - hi 0 (x) ] 2 x ε R

25 L&K Derivation 2 = 0 Σ 2[I 0 (x)(i(x) - I 0 (x) ) - hi 0 (x) 2 ] x ε R h Σ I 0 (x)(i(x) - I 0 (x)) x ε R Σ I 0 (x) 2 x ε R

26 Comparison h Σx w(x)[i(x) - I 0 (x)] I 0 (x) Σ w(x) x h Σ I 0 (x)[i(x) - I 0 (x)] x Σ I 0 (x) 2 x

27 Comparison h Σx w(x)[i(x) - I 0 (x)] I 0 (x) Σ w(x) x h Σ I 0 (x)[i(x) - I 0 (x)] x Σ I 0 (x) 2 x

28 Generalizations

29 Original Σ E ( h ) = [I( x + h ) - I (x)] 2 0 x ε R

30 Original Dimension of image Σ E ( h ) = [I( x + h ) - (x)] 2 x ε R I 0 1-dimensional LK BAHH ST SC S BJ HB BL G SI CET

31 Generalization 1a Dimension of image Σ E ( h ) = [I( x + h ) - (x) ] 2 x ε R I 0 2D: LK BAHH ST SC S BJ HB BL G SI CET

32 Generalization 1b Dimension of image Σ E ( h ) = [I( x + h ) - (x) ] 2 x ε R I 0 Homogeneous 2D: LK BAHH ST SC S BJ HB BL G SI CET

33 Problem A Does the iteration converge? LK BAHH ST SC S BJ HB BL G SI CET

34 Local minima: Problem A

35 Local minima: Problem A

36 Problem B Zero gradient: h -Σ I 0 (x)(i(x) - I 0 (x)) x ε R Σ I 0 (x) 2 x ε R h is undefined if Σ I 0 (x) 2 is zero x ε R LK BAHH ST SC S BJ HB BL G SI CET

37 Problem B Zero gradient:?

38 Problem B Aperture problem: h y -Σ (x)(i(x) - I 0 (x)) x ε R Σ x ε R 2 LK BAHH ST SC S BJ HB BL G SI CET

39 Problem B No gradient along one direction:?

40 Solutions to A & B Possible solutions: Manual intervention LK BAHH ST SC S BJ HB BL G SI CET

41 Solutions to A & B Possible solutions: Manual intervention Zero motion default LK BAHH ST SC S BJ HB BL G SI CET

42 Solutions to A & B Possible solutions: Manual intervention Zero motion default Coefficient dampening LK BAHH ST SC S BJ HB BL G SI CET

43 Solutions to A & B Possible solutions: Manual intervention Zero motion default Coefficient dampening Reliance on good features LK BAHH ST SC S BJ HB BL G SI CET

44 Solutions to A & B Possible solutions: Manual intervention Zero motion default Coefficient dampening Reliance on good features Temporal filtering LK BAHH ST SC S BJ HB BL G SI CET

45 Solutions to A & B Possible solutions: Manual intervention Zero motion default Coefficient dampening Reliance on good features Temporal filtering Spatial interpolation / hierarchical estimation LK BAHH ST SC S BJ HB BL G SI CET

46 Solutions to A & B Possible solutions: Manual intervention Zero motion default Coefficient dampening Reliance on good features Temporal filtering Spatial interpolation / hierarchical estimation Higher-order terms LK BAHH ST SC S BJ HB BL G SI CET

47 Original Σ E ( h ) = [I( x + h ) - I (x) ] 2 0 x ε R

48 Original Transformations/warping of image Σ E ( h ) = [I( x + h ) - I 0 (x) ] 2 x ε R Translations: LK BAHH ST SC S BJ HB BL G SI CET

49 Problem C What about other types of motion?

50 Generalization 2a Transformations/warping of image Σ E ( A, h) = [I(Ax +h) - (x) ] 2 x ε R I 0 Affine: LK BAHH ST SC S BJ HB BL G SI CET

51 Generalization 2a Affine:

52 Generalization 2b Transformations/warping of image Σ E ( A ) = [I( A x ) - (x) ] 2 x ε R I 0 Planar perspective: LK BAHH ST SC S BJ HB BL G SI CET

53 Generalization 2b Affine + Planar perspective:

54 Generalization 2c Transformations/warping of image Σ E ( h ) = [I(f(x, h)) - (x) ] 2 x ε R I 0 Other parametrized transformations LK BAHH ST SC S BJ HB BL G SI CET

55 Generalization 2c Other parametrized transformations

56 Problem B h -Σ I 0 (x)(i(x) - I 0 (x)) x ε R Σ I 0 (x) 2 x ε R Generalized aperture problem: h ~ -(J T J) -1 J (I(f(x,h)) - I 0 (x)) LK BAHH ST SC S BJ HB BL G SI CET

57 Problem B Generalized aperture problem:?

58 Original Σ E ( h ) = [I( x + h ) - I (x) ] 2 0 x ε R

59 Original Image type Σ E ( h ) = [I( x + h ) - (x) ] 2 x ε R I 0 Grayscale images LK BAHH ST SC S BJ HB BL G SI CET

60 Generalization 3 Image type Σ E ( h ) = I( x + h ) - I 0 (x) 2 x ε R Color images LK BAHH ST SC S BJ HB BL G SI CET

61 Original Σ E ( h ) = [I( x + h ) - I (x) ] 2 0 x ε R

62 Original Constancy assumption Σ E ( h ) = [I( x + h ) - I 0 (x) ] 2 x ε R Brightness constancy LK BAHH ST SC S BJ HB BL G SI CET

63 Problem C What if illumination changes?

64 Generalization 4a Constancy assumption )=Σ E ( h,α,β [I( x + h ) - αi 0 (x)+β] 2 x ε R Linear brightness constancy LK BAHH ST SC S BJ HB BL G SI CET

65 Generalization 4a

66 Generalization 4b Constancy assumption Σ E ( h,λ) = [I( x + h ) - λ Τ B(x] ) 2 x ε R Illumination subspace constancy LK BAHH ST SC S BJ HB BL G SI CET

67 Problem C What if the texture changes?

68 Generalization 4c Constancy assumption Σ E ( h,λ) = [I( x + h ) - λ Τ B(x) ] 2 x ε R Texture subspace constancy LK BAHH ST SC S BJ HB BL G SI CET

69 Problem D Convergence is slower as #parameters increases.

70 Solutions to D Faster convergence: Coarse-to-fine, filtering, interpolation, etc. LK BAHH ST SC S BJ HB BL G SI CET

71 Solutions to D Faster convergence: Coarse-to-fine, filtering, interpolation, etc. Selective parametrization LK BAHH ST SC S BJ HB BL G SI CET

72 Solutions to D Faster convergence: Coarse-to-fine, filtering, interpolation, etc. Selective parametrization Offline precomputation LK BAHH ST SC S BJ HB BL G SI CET

73 Solutions to D Faster convergence: Coarse-to-fine, filtering, interpolation, etc. Selective parametrization Offline precomputation Difference decomposition LK BAHH ST SC S BJ HB BL G SI CET

74 Solutions to D Difference decomposition

75 Solutions to D Difference decomposition

76 Solutions to D Faster convergence: Coarse-to-fine, filtering, interpolation, etc. Selective parametrization Offline precomputation Difference decomposition Improvements in gradient descent LK BAHH ST SC S BJ HB BL G SI CET

77 Solutions to D Faster convergence: Coarse-to-fine, filtering, interpolation, etc. Selective parametrization Offline precomputation Difference decomposition Improvements in gradient descent Multiple estimates of spatial derivatives LK BAHH ST SC S BJ HB BL G SI CET

78 Solutions to D Multiple estimates / state-space sampling

79 Generalizations Modifications made so far: Σ x ε R [I( x + h ) - I (x)] 2 0

80 Original Error norm Σ E ( h ) = [I( x + h ) - I 0 (x) ] 2 x ε R Squared difference: LK BAHH ST SC S BJ HB BL G SI CET

81 Problem E What about outliers?

82 Generalization 5a Error norm Σ E ( h ) = ρ(i( x + h ) - I 0 (x) ) x ε R Robust error norm: LK BAHH ST SC S BJ HB BL G SI CET

83 Original Σ E ( h ) = [I( x + h ) - I (x) ] 2 0 x ε R

84 Original Image region / pixel weighting Σ E ( h ) = [I( x + h ) - I 0 (x) ] 2 x ε R Rectangular: LK BAHH ST SC S BJ HB BL G SI CET

85 Problem E What about background clutter?

86 Generalization 6a Image region / pixel weighting Σ E ( h ) = [I( x + h ) - I 0 (x) ] 2 x ε R Irregular: LK BAHH ST SC S BJ HB BL G SI CET

87 Problem E What about foreground occlusion?

88 Generalization 6b Image region / pixel weighting Σ E ( h ) = [I( x + h ) - I 0 (x) ] 2 w(x) x ε R Weighted sum: LK BAHH ST SC S BJ HB BL G SI CET

89 Generalizations Modifications made so far: Σ x ε R [I( x + h ) - I (x)] 2 0

90 Generalizations: Summary Σ E ( h ) = [I( x + h ) - I (x)] 2 0 x ε R Σ E ( h ) = ρ(i( f(x, h) ) - λβ(x )) w(x) x ε R

91 Foresight Lucas & Kanade (IUW 1981) Bergen, Anandan, Hanna, Hingorani (ECCV 1992) Shi & Tomasi (CVPR 1994) Szeliski & Coughlan (CVPR 1994) Szeliski (WACV 1994) Black & Jepson (ECCV 1996) Hager & Belhumeur (CVPR 1996) Bainbridge-Smith & Lane (IVC 1997) Gleicher (CVPR 1997) Sclaroff & Isidoro (ICCV 1998) Cootes, Edwards, & Taylor (ECCV 1998) LK BAHH ST SC S BJ HB BL G SI CET

92 Summary Generalizations Dimension of image Image transformations / motion models Pixel type Constancy assumption Error norm Image mask L&K? Y Y n Y n Y

93 Summary Common problems: Local minima Aperture effect Illumination changes Convergence issues Outliers and occlusions L&K? Y maybe Y Y n

94 Summary Mitigation of aperture effect: Manual intervention Zero motion default Coefficient dampening Elimination of poor textures Temporal filtering Spatial interpolation / hierarchical Higher-order terms L&K? n n n n Y Y n

95 Summary Better convergence: Coarse-to-fine, filtering, etc. Selective parametrization Offline precomputation Difference decomposition Improvements in gradient descent Multiple estimates of spatial derivatives L&K? Y n maybe maybe maybe maybe

96 Hindsight Lucas & Kanade (IUW 1981) Bergen, Anandan, Hanna, Hingorani (ECCV 1992) Shi & Tomasi (CVPR 1994) Szeliski & Coughlan (CVPR 1994) Szeliski (WACV 1994) Black & Jepson (ECCV 1996) Hager & Belhumeur (CVPR 1996) Bainbridge-Smith & Lane (IVC 1997) Gleicher (CVPR 1997) Sclaroff & Isidoro (ICCV 1998) Cootes, Edwards, & Taylor (ECCV 1998)

Motion estimation. Digital Visual Effects Yung-Yu Chuang. with slides by Michael Black and P. Anandan

Motion estimation. Digital Visual Effects Yung-Yu Chuang. with slides by Michael Black and P. Anandan Motion estimation Digital Visual Effects Yung-Yu Chuang with slides b Michael Black and P. Anandan Motion estimation Parametric motion image alignment Tracking Optical flow Parametric motion direct method

More information

Motion Estimation (I) Ce Liu Microsoft Research New England

Motion Estimation (I) Ce Liu Microsoft Research New England Motion Estimation (I) Ce Liu celiu@microsoft.com Microsoft Research New England We live in a moving world Perceiving, understanding and predicting motion is an important part of our daily lives Motion

More information

Image Alignment and Mosaicing

Image Alignment and Mosaicing Image Alignment and Mosaicing Image Alignment Applications Local alignment: Tracking Stereo Global alignment: Camera jitter elimination Image enhancement Panoramic mosaicing Image Enhancement Original

More information

Motion Estimation (I)

Motion Estimation (I) Motion Estimation (I) Ce Liu celiu@microsoft.com Microsoft Research New England We live in a moving world Perceiving, understanding and predicting motion is an important part of our daily lives Motion

More information

Introduction to motion correspondence

Introduction to motion correspondence Introduction to motion correspondence 1 IPAM - UCLA July 24, 2013 Iasonas Kokkinos Center for Visual Computing Ecole Centrale Paris / INRIA Saclay Why estimate visual motion? 2 Tracking Segmentation Structure

More information

Global parametric image alignment via high-order approximation

Global parametric image alignment via high-order approximation Global parametric image alignment via high-order approximation Y. Keller, A. Averbuch 2 Electrical & Computer Engineering Department, Ben-Gurion University of the Negev. 2 School of Computer Science, Tel

More information

Methods in Computer Vision: Introduction to Optical Flow

Methods in Computer Vision: Introduction to Optical Flow Methods in Computer Vision: Introduction to Optical Flow Oren Freifeld Computer Science, Ben-Gurion University March 22 and March 26, 2017 Mar 22, 2017 1 / 81 A Preliminary Discussion Example and Flow

More information

Image Alignment and Mosaicing Feature Tracking and the Kalman Filter

Image Alignment and Mosaicing Feature Tracking and the Kalman Filter Image Alignment and Mosaicing Feature Tracking and the Kalman Filter Image Alignment Applications Local alignment: Tracking Stereo Global alignment: Camera jitter elimination Image enhancement Panoramic

More information

Elaborazione delle Immagini Informazione multimediale - Immagini. Raffaella Lanzarotti

Elaborazione delle Immagini Informazione multimediale - Immagini. Raffaella Lanzarotti Elaborazione delle Immagini Informazione multimediale - Immagini Raffaella Lanzarotti OPTICAL FLOW Thanks to prof. Mubarak Shah,UCF 2 Video Video: sequence of frames (images) catch in the time Data: function

More information

Optical flow. Subhransu Maji. CMPSCI 670: Computer Vision. October 20, 2016

Optical flow. Subhransu Maji. CMPSCI 670: Computer Vision. October 20, 2016 Optical flow Subhransu Maji CMPSC 670: Computer Vision October 20, 2016 Visual motion Man slides adapted from S. Seitz, R. Szeliski, M. Pollefes CMPSC 670 2 Motion and perceptual organization Sometimes,

More information

CS4495/6495 Introduction to Computer Vision. 6B-L1 Dense flow: Brightness constraint

CS4495/6495 Introduction to Computer Vision. 6B-L1 Dense flow: Brightness constraint CS4495/6495 Introduction to Computer Vision 6B-L1 Dense flow: Brightness constraint Motion estimation techniques Feature-based methods Direct, dense methods Motion estimation techniques Direct, dense methods

More information

TRACKING and DETECTION in COMPUTER VISION

TRACKING and DETECTION in COMPUTER VISION Technischen Universität München Winter Semester 2013/2014 TRACKING and DETECTION in COMPUTER VISION Template tracking methods Slobodan Ilić Template based-tracking Energy-based methods The Lucas-Kanade(LK)

More information

Optical Flow, KLT Feature Tracker.

Optical Flow, KLT Feature Tracker. Optical Flow, KL Feature racker E-mail: hogijung@hanang.ac.kr Motion in Computer Vision Motion Structure rom motion Detection/segmentation with direction [1] E-mail: hogijung@hanang.ac.kr Motion Field.s..

More information

Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction

Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction Qifa Ke and Takeo Kanade Department of Computer Science, Carnegie Mellon University Email: ke@cmu.edu, tk@cs.cmu.edu Abstract

More information

Lecture 8: Interest Point Detection. Saad J Bedros

Lecture 8: Interest Point Detection. Saad J Bedros #1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Last Lecture : Edge Detection Preprocessing of image is desired to eliminate or at least minimize noise effects There is always tradeoff

More information

Video and Motion Analysis Computer Vision Carnegie Mellon University (Kris Kitani)

Video and Motion Analysis Computer Vision Carnegie Mellon University (Kris Kitani) Video and Motion Analysis 16-385 Computer Vision Carnegie Mellon University (Kris Kitani) Optical flow used for feature tracking on a drone Interpolated optical flow used for super slow-mo optical flow

More information

Lucas-Kanade Optical Flow. Computer Vision Carnegie Mellon University (Kris Kitani)

Lucas-Kanade Optical Flow. Computer Vision Carnegie Mellon University (Kris Kitani) Lucas-Kanade Optical Flow Computer Vision 16-385 Carnegie Mellon University (Kris Kitani) I x u + I y v + I t =0 I x = @I @x I y = @I u = dx v = dy I @y t = @I dt dt @t spatial derivative optical flow

More information

Differential Motion Analysis

Differential Motion Analysis Differential Motion Analysis Ying Wu Electrical Engineering and Computer Science Northwestern University, Evanston, IL 60208 yingwu@ece.northwestern.edu http://www.eecs.northwestern.edu/~yingwu July 19,

More information

Optical Flow, Motion Segmentation, Feature Tracking

Optical Flow, Motion Segmentation, Feature Tracking BIL 719 - Computer Vision May 21, 2014 Optical Flow, Motion Segmentation, Feature Tracking Aykut Erdem Dept. of Computer Engineering Hacettepe University Motion Optical Flow Motion Segmentation Feature

More information

Efficient & Robust LK for Mobile Vision

Efficient & Robust LK for Mobile Vision Efficient & Robust LK for Mobile Vision Instructor - Simon Lucey 16-623 - Designing Comuter Vision As Direct Method (ours) Indirect Method (ORB+RANSAC) H. Alismail, B. Browning, S. Lucey Bit-Planes: Dense

More information

6.869 Advances in Computer Vision. Prof. Bill Freeman March 1, 2005

6.869 Advances in Computer Vision. Prof. Bill Freeman March 1, 2005 6.869 Advances in Computer Vision Prof. Bill Freeman March 1 2005 1 2 Local Features Matching points across images important for: object identification instance recognition object class recognition pose

More information

Robustifying the Flock of Trackers

Robustifying the Flock of Trackers 16 th Computer Vision Winter Workshop Andreas Wendel, Sabine Sternig, Martin Godec (eds.) Mitterberg, Austria, February 2-4, 2011 Robustifying the Flock of Trackers Jiří Matas and Tomáš Vojíř The Center

More information

CSC487/2503: Foundations of Computer Vision. Visual Tracking. David Fleet

CSC487/2503: Foundations of Computer Vision. Visual Tracking. David Fleet CSC487/2503: Foundations of Computer Vision Visual Tracking David Fleet Introduction What is tracking? Major players: Dynamics (model of temporal variation of target parameters) Measurements (relation

More information

INTEREST POINTS AT DIFFERENT SCALES

INTEREST POINTS AT DIFFERENT SCALES INTEREST POINTS AT DIFFERENT SCALES Thank you for the slides. They come mostly from the following sources. Dan Huttenlocher Cornell U David Lowe U. of British Columbia Martial Hebert CMU Intuitively, junctions

More information

Computer Vision Motion

Computer Vision Motion Computer Vision Motion Professor Hager http://www.cs.jhu.edu/~hager 12/1/12 CS 461, Copyright G.D. Hager Outline From Stereo to Motion The motion field and optical flow (2D motion) Factorization methods

More information

Lecture 8: Interest Point Detection. Saad J Bedros

Lecture 8: Interest Point Detection. Saad J Bedros #1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Review of Edge Detectors #2 Today s Lecture Interest Points Detection What do we mean with Interest Point Detection in an Image Goal:

More information

Edges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise

Edges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise Edges and Scale Image Features From Sandlot Science Slides revised from S. Seitz, R. Szeliski, S. Lazebnik, etc. Origin of Edges surface normal discontinuity depth discontinuity surface color discontinuity

More information

Lecture 13: Tracking mo3on features op3cal flow

Lecture 13: Tracking mo3on features op3cal flow Lecture 13: Tracking mo3on features op3cal flow Professor Fei- Fei Li Stanford Vision Lab Lecture 14-1! What we will learn today? Introduc3on Op3cal flow Feature tracking Applica3ons Reading: [Szeliski]

More information

Linear Subspace Models

Linear Subspace Models Linear Subspace Models Goal: Explore linear models of a data set. Motivation: A central question in vision concerns how we represent a collection of data vectors. The data vectors may be rasterized images,

More information

Revisiting Horn and Schunck: Interpretation as Gauß-Newton Optimisation

Revisiting Horn and Schunck: Interpretation as Gauß-Newton Optimisation ZIKIC, KAMEN, AND NAVAB: REVISITING HORN AND SCHUNCK 1 Revisiting Horn and Schunck: Interpretation as Gauß-Newton Optimisation Darko Zikic 1 zikic@in.tum.de Ali Kamen ali.kamen@siemens.com Nassir Navab

More information

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros Corners, Blobs & Descriptors With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros Motivation: Build a Panorama M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 How do we build panorama?

More information

Differential Motion Analysis (II)

Differential Motion Analysis (II) Differential Motion Analysis (II) Ying Wu Electrical Engineering and Computer Science Northwestern University, Evanston, IL 60208 yingwu@northwestern.edu http://www.eecs.northwestern.edu/~yingwu 1/30 Outline

More information

Level-Set Person Segmentation and Tracking with Multi-Region Appearance Models and Top-Down Shape Information Appendix

Level-Set Person Segmentation and Tracking with Multi-Region Appearance Models and Top-Down Shape Information Appendix Level-Set Person Segmentation and Tracking with Multi-Region Appearance Models and Top-Down Shape Information Appendix Esther Horbert, Konstantinos Rematas, Bastian Leibe UMIC Research Centre, RWTH Aachen

More information

Do We Really Have to Consider Covariance Matrices for Image Feature Points?

Do We Really Have to Consider Covariance Matrices for Image Feature Points? Electronics and Communications in Japan, Part 3, Vol. 86, No. 1, 2003 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol. J85-A, No. 2, February 2002, pp. 231 239 Do We Really Have to Consider Covariance

More information

SIFT: Scale Invariant Feature Transform

SIFT: Scale Invariant Feature Transform 1 SIFT: Scale Invariant Feature Transform With slides from Sebastian Thrun Stanford CS223B Computer Vision, Winter 2006 3 Pattern Recognition Want to find in here SIFT Invariances: Scaling Rotation Illumination

More information

Human Pose Tracking I: Basics. David Fleet University of Toronto

Human Pose Tracking I: Basics. David Fleet University of Toronto Human Pose Tracking I: Basics David Fleet University of Toronto CIFAR Summer School, 2009 Looking at People Challenges: Complex pose / motion People have many degrees of freedom, comprising an articulated

More information

OBJECT DETECTION FROM MMS IMAGERY USING DEEP LEARNING FOR GENERATION OF ROAD ORTHOPHOTOS

OBJECT DETECTION FROM MMS IMAGERY USING DEEP LEARNING FOR GENERATION OF ROAD ORTHOPHOTOS OBJECT DETECTION FROM MMS IMAGERY USING DEEP LEARNING FOR GENERATION OF ROAD ORTHOPHOTOS Y. Li 1,*, M. Sakamoto 1, T. Shinohara 1, T. Satoh 1 1 PASCO CORPORATION, 2-8-10 Higashiyama, Meguro-ku, Tokyo 153-0043,

More information

Subspace Methods for Visual Learning and Recognition

Subspace Methods for Visual Learning and Recognition This is a shortened version of the tutorial given at the ECCV 2002, Copenhagen, and ICPR 2002, Quebec City. Copyright 2002 by Aleš Leonardis, University of Ljubljana, and Horst Bischof, Graz University

More information

Computer Vision I. Announcements

Computer Vision I. Announcements Announcements Motion II No class Wednesda (Happ Thanksgiving) HW4 will be due Frida 1/8 Comment on Non-maximal supression CSE5A Lecture 15 Shi-Tomasi Corner Detector Filter image with a Gaussian. Compute

More information

Deformation and Viewpoint Invariant Color Histograms

Deformation and Viewpoint Invariant Color Histograms 1 Deformation and Viewpoint Invariant Histograms Justin Domke and Yiannis Aloimonos Computer Vision Laboratory, Department of Computer Science University of Maryland College Park, MD 274, USA domke@cs.umd.edu,

More information

Dense Optical Flow Estimation from the Monogenic Curvature Tensor

Dense Optical Flow Estimation from the Monogenic Curvature Tensor Dense Optical Flow Estimation from the Monogenic Curvature Tensor Di Zang 1, Lennart Wietzke 1, Christian Schmaltz 2, and Gerald Sommer 1 1 Department of Computer Science, Christian-Albrechts-University

More information

Gradient-domain image processing

Gradient-domain image processing Gradient-domain image processing http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2018, Lecture 10 Course announcements Homework 3 is out. - (Much) smaller

More information

Hypergeometric Filters For Optical Flow and Ane Matching. Carnegie Mellon University. Pittsburgh, PA matching problems.

Hypergeometric Filters For Optical Flow and Ane Matching. Carnegie Mellon University. Pittsburgh, PA matching problems. Hypergeometric Filters For Optical Flow and Ane Matching Yalin Xiong Steven A. Shafer The Robotics Institute Carnegie Mellon University Pittsburgh, PA 15213 Abstract This paper proposes new \hypergeometric"

More information

Super-Resolution. Dr. Yossi Rubner. Many slides from Miki Elad - Technion

Super-Resolution. Dr. Yossi Rubner. Many slides from Miki Elad - Technion Super-Resolution Dr. Yossi Rubner yossi@rubner.co.il Many slides from Mii Elad - Technion 5/5/2007 53 images, ratio :4 Example - Video 40 images ratio :4 Example Surveillance Example Enhance Mosaics Super-Resolution

More information

CS 3710: Visual Recognition Describing Images with Features. Adriana Kovashka Department of Computer Science January 8, 2015

CS 3710: Visual Recognition Describing Images with Features. Adriana Kovashka Department of Computer Science January 8, 2015 CS 3710: Visual Recognition Describing Images with Features Adriana Kovashka Department of Computer Science January 8, 2015 Plan for Today Presentation assignments + schedule changes Image filtering Feature

More information

An Axiomatic Approach to Corner Detection

An Axiomatic Approach to Corner Detection An Axiomatic Approach to Corner Detection C S Kenney M Zuliani B S Manjunath Vision Research Lab Department of Electrical and Computer Engineering University of California, Santa Barbara Abstract This

More information

An Adaptive Confidence Measure for Optical Flows Based on Linear Subspace Projections

An Adaptive Confidence Measure for Optical Flows Based on Linear Subspace Projections An Adaptive Confidence Measure for Optical Flows Based on Linear Subspace Projections Claudia Kondermann, Daniel Kondermann, Bernd Jähne, Christoph Garbe Interdisciplinary Center for Scientific Computing

More information

Templates, Image Pyramids, and Filter Banks

Templates, Image Pyramids, and Filter Banks Templates, Image Pyramids, and Filter Banks 09/9/ Computer Vision James Hays, Brown Slides: Hoiem and others Review. Match the spatial domain image to the Fourier magnitude image 2 3 4 5 B A C D E Slide:

More information

Robust Motion Segmentation by Spectral Clustering

Robust Motion Segmentation by Spectral Clustering Robust Motion Segmentation by Spectral Clustering Hongbin Wang and Phil F. Culverhouse Centre for Robotics Intelligent Systems University of Plymouth Plymouth, PL4 8AA, UK {hongbin.wang, P.Culverhouse}@plymouth.ac.uk

More information

Asaf Bar Zvi Adi Hayat. Semantic Segmentation

Asaf Bar Zvi Adi Hayat. Semantic Segmentation Asaf Bar Zvi Adi Hayat Semantic Segmentation Today s Topics Fully Convolutional Networks (FCN) (CVPR 2015) Conditional Random Fields as Recurrent Neural Networks (ICCV 2015) Gaussian Conditional random

More information

Advances in Computer Vision. Prof. Bill Freeman. Image and shape descriptors. Readings: Mikolajczyk and Schmid; Belongie et al.

Advances in Computer Vision. Prof. Bill Freeman. Image and shape descriptors. Readings: Mikolajczyk and Schmid; Belongie et al. 6.869 Advances in Computer Vision Prof. Bill Freeman March 3, 2005 Image and shape descriptors Affine invariant features Comparison of feature descriptors Shape context Readings: Mikolajczyk and Schmid;

More information

Feature extraction: Corners and blobs

Feature extraction: Corners and blobs Feature extraction: Corners and blobs Review: Linear filtering and edge detection Name two different kinds of image noise Name a non-linear smoothing filter What advantages does median filtering have over

More information

Single-Image-Based Rain and Snow Removal Using Multi-guided Filter

Single-Image-Based Rain and Snow Removal Using Multi-guided Filter Single-Image-Based Rain and Snow Removal Using Multi-guided Filter Xianhui Zheng 1, Yinghao Liao 1,,WeiGuo 2, Xueyang Fu 2, and Xinghao Ding 2 1 Department of Electronic Engineering, Xiamen University,

More information

Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix René Vidal Stefano Soatto Shankar Sastry Department of EECS, UC Berkeley Department of Computer Sciences, UCLA 30 Cory Hall,

More information

Lecture 12. Local Feature Detection. Matching with Invariant Features. Why extract features? Why extract features? Why extract features?

Lecture 12. Local Feature Detection. Matching with Invariant Features. Why extract features? Why extract features? Why extract features? Lecture 1 Why extract eatures? Motivation: panorama stitching We have two images how do we combine them? Local Feature Detection Guest lecturer: Alex Berg Reading: Harris and Stephens David Lowe IJCV We

More information

SURF Features. Jacky Baltes Dept. of Computer Science University of Manitoba WWW:

SURF Features. Jacky Baltes Dept. of Computer Science University of Manitoba   WWW: SURF Features Jacky Baltes Dept. of Computer Science University of Manitoba Email: jacky@cs.umanitoba.ca WWW: http://www.cs.umanitoba.ca/~jacky Salient Spatial Features Trying to find interest points Points

More information

Temporal Factorization Vs. Spatial Factorization

Temporal Factorization Vs. Spatial Factorization Temporal Factorization Vs. Spatial Factorization Lihi Zelnik-Manor 1 and Michal Irani 2 1 California Institute of Technology, Pasadena CA, USA, lihi@caltech.edu, WWW home page: http://www.vision.caltech.edu/lihi

More information

Digital Matting. Outline. Introduction to Digital Matting. Introduction to Digital Matting. Compositing equation: C = α * F + (1- α) * B

Digital Matting. Outline. Introduction to Digital Matting. Introduction to Digital Matting. Compositing equation: C = α * F + (1- α) * B Digital Matting Outline. Introduction to Digital Matting. Bayesian Matting 3. Poisson Matting 4. A Closed Form Solution to Matting Presenting: Alon Gamliel,, Tel-Aviv University, May 006 Introduction to

More information

Covariance-Based PCA for Multi-Size Data

Covariance-Based PCA for Multi-Size Data Covariance-Based PCA for Multi-Size Data Menghua Zhai, Feiyu Shi, Drew Duncan, and Nathan Jacobs Department of Computer Science, University of Kentucky, USA {mzh234, fsh224, drew, jacobs}@cs.uky.edu Abstract

More information

Galilean-diagonalized spatio-temporal interest operators

Galilean-diagonalized spatio-temporal interest operators Galilean-diagonalized spatio-temporal interest operators Tony Lindeberg, Amir Akbarzadeh and Ivan Laptev Computational Vision and Active Perception Laboratory (CVAP) Department of Numerical Analysis and

More information

Mixture Models and EM

Mixture Models and EM Mixture Models and EM Goal: Introduction to probabilistic mixture models and the expectationmaximization (EM) algorithm. Motivation: simultaneous fitting of multiple model instances unsupervised clustering

More information

Announcements. Tracking. Comptuer Vision I. The Motion Field. = ω. Pure Translation. Motion Field Equation. Rigid Motion: General Case

Announcements. Tracking. Comptuer Vision I. The Motion Field. = ω. Pure Translation. Motion Field Equation. Rigid Motion: General Case Announcements Tracking Computer Vision I CSE5A Lecture 17 HW 3 due toda HW 4 will be on web site tomorrow: Face recognition using 3 techniques Toda: Tracking Reading: Sections 17.1-17.3 The Motion Field

More information

Reconnaissance d objetsd et vision artificielle

Reconnaissance d objetsd et vision artificielle Reconnaissance d objetsd et vision artificielle http://www.di.ens.fr/willow/teaching/recvis09 Lecture 6 Face recognition Face detection Neural nets Attention! Troisième exercice de programmation du le

More information

CSE 473/573 Computer Vision and Image Processing (CVIP)

CSE 473/573 Computer Vision and Image Processing (CVIP) CSE 473/573 Computer Vision and Image Processing (CVIP) Ifeoma Nwogu inwogu@buffalo.edu Lecture 11 Local Features 1 Schedule Last class We started local features Today More on local features Readings for

More information

Juergen Gall. Analyzing Human Behavior in Video Sequences

Juergen Gall. Analyzing Human Behavior in Video Sequences Juergen Gall Analyzing Human Behavior in Video Sequences 09. 10. 2 01 7 Juer gen Gall Instit u t e of Com puter Science III Com puter Vision Gr oup 2 Analyzing Human Behavior Analyzing Human Behavior Human

More information

Advanced Features. Advanced Features: Topics. Jana Kosecka. Slides from: S. Thurn, D. Lowe, Forsyth and Ponce. Advanced features and feature matching

Advanced Features. Advanced Features: Topics. Jana Kosecka. Slides from: S. Thurn, D. Lowe, Forsyth and Ponce. Advanced features and feature matching Advanced Features Jana Kosecka Slides from: S. Thurn, D. Lowe, Forsyth and Ponce Advanced Features: Topics Advanced features and feature matching Template matching SIFT features Haar features 2 1 Features

More information

Scale & Affine Invariant Interest Point Detectors

Scale & Affine Invariant Interest Point Detectors Scale & Affine Invariant Interest Point Detectors Krystian Mikolajczyk and Cordelia Schmid Presented by Hunter Brown & Gaurav Pandey, February 19, 2009 Roadmap: Motivation Scale Invariant Detector Affine

More information

Augmented Reality VU Camera Registration. Prof. Vincent Lepetit

Augmented Reality VU Camera Registration. Prof. Vincent Lepetit Augmented Reality VU Camera Registration Prof. Vincent Lepetit Different Approaches to Vision-based 3D Tracking [From D. Wagner] [From Drummond PAMI02] [From Davison ICCV01] Consider natural features Consider

More information

Riemannian Metric Learning for Symmetric Positive Definite Matrices

Riemannian Metric Learning for Symmetric Positive Definite Matrices CMSC 88J: Linear Subspaces and Manifolds for Computer Vision and Machine Learning Riemannian Metric Learning for Symmetric Positive Definite Matrices Raviteja Vemulapalli Guide: Professor David W. Jacobs

More information

TRACKING and DETECTION in COMPUTER VISION Filtering and edge detection

TRACKING and DETECTION in COMPUTER VISION Filtering and edge detection Technischen Universität München Winter Semester 0/0 TRACKING and DETECTION in COMPUTER VISION Filtering and edge detection Slobodan Ilić Overview Image formation Convolution Non-liner filtering: Median

More information

On Single-Sequence and Multi-Sequence Factorizations

On Single-Sequence and Multi-Sequence Factorizations On Single-Sequence and Multi-Sequence Factorizations Lihi Zelnik-Manor Department of Electrical Engineering California Institute of Technology Pasadena, CA 91125, USA lihi@vision.caltech.edu Michal Irani

More information

Visual Object Recognition

Visual Object Recognition Visual Object Recognition Lecture 2: Image Formation Per-Erik Forssén, docent Computer Vision Laboratory Department of Electrical Engineering Linköping University Lecture 2: Image Formation Pin-hole, and

More information

SIFT: SCALE INVARIANT FEATURE TRANSFORM BY DAVID LOWE

SIFT: SCALE INVARIANT FEATURE TRANSFORM BY DAVID LOWE SIFT: SCALE INVARIANT FEATURE TRANSFORM BY DAVID LOWE Overview Motivation of Work Overview of Algorithm Scale Space and Difference of Gaussian Keypoint Localization Orientation Assignment Descriptor Building

More information

Interest Operators. All lectures are from posted research papers. Harris Corner Detector: the first and most basic interest operator

Interest Operators. All lectures are from posted research papers. Harris Corner Detector: the first and most basic interest operator Interest Operators All lectures are from posted research papers. Harris Corner Detector: the first and most basic interest operator SIFT interest point detector and region descriptor Kadir Entrop Detector

More information

Mutual information for multi-modal, discontinuity-preserving image registration

Mutual information for multi-modal, discontinuity-preserving image registration Mutual information for multi-modal, discontinuity-preserving image registration Giorgio Panin German Aerospace Center (DLR) Institute for Robotics and Mechatronics Münchner Straße 20, 82234 Weßling Abstract.

More information

Harris Corner Detector

Harris Corner Detector Multimedia Computing: Algorithms, Systems, and Applications: Feature Extraction By Dr. Yu Cao Department of Computer Science The University of Massachusetts Lowell Lowell, MA 01854, USA Part of the slides

More information

The framework of least squares template matching

The framework of least squares template matching BIWI-TR-180 March 1998 The framework of least squares template matching Martin Berger Swiss Federal Institute of Technology Communication Technology Lab, Image Science 8092 Zürich, Switzerland berger@vision.ee.ethz.ch

More information

Shape Outlier Detection Using Pose Preserving Dynamic Shape Models

Shape Outlier Detection Using Pose Preserving Dynamic Shape Models Shape Outlier Detection Using Pose Preserving Dynamic Shape Models Chan-Su Lee and Ahmed Elgammal Rutgers, The State University of New Jersey Department of Computer Science Outline Introduction Shape Outlier

More information

The recovery of motion information from visual input is an important task for both natural

The recovery of motion information from visual input is an important task for both natural MIT Media Laboratory Vision and Modeling Technical Report 65. Computing Optical Flow Distributions Using Spatio-temporal Filters Eero P. Simoncelli y and Edward H. Adelson z Vision and Modeling Group,

More information

The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views

The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views Richard Hartley 1,2 and RenéVidal 2,3 1 Dept. of Systems Engineering 3 Center for Imaging Science Australian National University

More information

CS 4495 Computer Vision Principle Component Analysis

CS 4495 Computer Vision Principle Component Analysis CS 4495 Computer Vision Principle Component Analysis (and it s use in Computer Vision) Aaron Bobick School of Interactive Computing Administrivia PS6 is out. Due *** Sunday, Nov 24th at 11:55pm *** PS7

More information

Recap: edge detection. Source: D. Lowe, L. Fei-Fei

Recap: edge detection. Source: D. Lowe, L. Fei-Fei Recap: edge detection Source: D. Lowe, L. Fei-Fei Canny edge detector 1. Filter image with x, y derivatives of Gaussian 2. Find magnitude and orientation of gradient 3. Non-maximum suppression: Thin multi-pixel

More information

Shape of Gaussians as Feature Descriptors

Shape of Gaussians as Feature Descriptors Shape of Gaussians as Feature Descriptors Liyu Gong, Tianjiang Wang and Fang Liu Intelligent and Distributed Computing Lab, School of Computer Science and Technology Huazhong University of Science and

More information

Loss Functions and Optimization. Lecture 3-1

Loss Functions and Optimization. Lecture 3-1 Lecture 3: Loss Functions and Optimization Lecture 3-1 Administrative Assignment 1 is released: http://cs231n.github.io/assignments2017/assignment1/ Due Thursday April 20, 11:59pm on Canvas (Extending

More information

Color Image Correction

Color Image Correction FLDE. p. 1/48 Color Image Correction Benasque, September 2007 Vicent Caselles Departament de Tecnologia Universitat Pompeu Fabra joint work with M.Bertalmío, R. Palma, E. Provenzi FLDE. p. 2/48 Overview

More information

Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix ECCV Workshop on Vision and Modeling of Dynamic Scenes, Copenhagen, Denmark, May 2002 Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix René Vidal Dept of EECS, UC Berkeley Berkeley,

More information

Introduction to Computer Vision

Introduction to Computer Vision Introduction to Computer Vision Michael J. Black Oct. 2009 Lecture 10: Images as vectors. Appearance-based models. News Assignment 1 parts 3&4 extension. Due tomorrow, Tuesday, 10/6 at 11am. Goals Images

More information

Lecture 7: Finding Features (part 2/2)

Lecture 7: Finding Features (part 2/2) Lecture 7: Finding Features (part 2/2) Dr. Juan Carlos Niebles Stanford AI Lab Professor Fei- Fei Li Stanford Vision Lab 1 What we will learn today? Local invariant features MoPvaPon Requirements, invariances

More information

Example: Face Detection

Example: Face Detection Announcements HW1 returned New attendance policy Face Recognition: Dimensionality Reduction On time: 1 point Five minutes or more late: 0.5 points Absent: 0 points Biometrics CSE 190 Lecture 14 CSE190,

More information

CSCI 250: Intro to Robotics. Spring Term 2017 Prof. Levy. Computer Vision: A Brief Survey

CSCI 250: Intro to Robotics. Spring Term 2017 Prof. Levy. Computer Vision: A Brief Survey CSCI 25: Intro to Robotics Spring Term 27 Prof. Levy Computer Vision: A Brief Survey What Is Computer Vision? Higher-order tasks Face recognition Object recognition (Deep Learning) What Is Computer Vision?

More information

A Semi-direct Approach to Structure from Motion. Abstract

A Semi-direct Approach to Structure from Motion. Abstract A Semi-direct Approach to Structure from Motion Hailin Jin Paolo Favaro Stefano Soatto Department of Electrical Engineering, Washington University, Saint Louis - MO 6313 Computer Science Department, UCLA,

More information

Statistical Filters for Crowd Image Analysis

Statistical Filters for Crowd Image Analysis Statistical Filters for Crowd Image Analysis Ákos Utasi, Ákos Kiss and Tamás Szirányi Distributed Events Analysis Research Group, Computer and Automation Research Institute H-1111 Budapest, Kende utca

More information

Tracking. Readings: Chapter 17 of Forsyth and Ponce. Matlab Tutorials: motiontutorial.m. 2503: Tracking c D.J. Fleet & A.D. Jepson, 2009 Page: 1

Tracking. Readings: Chapter 17 of Forsyth and Ponce. Matlab Tutorials: motiontutorial.m. 2503: Tracking c D.J. Fleet & A.D. Jepson, 2009 Page: 1 Goal: Tracking Fundamentals of model-based tracking with emphasis on probabilistic formulations. Examples include the Kalman filter for linear-gaussian problems, and maximum likelihood and particle filters

More information

Multigrid Acceleration of the Horn-Schunck Algorithm for the Optical Flow Problem

Multigrid Acceleration of the Horn-Schunck Algorithm for the Optical Flow Problem Multigrid Acceleration of the Horn-Schunck Algorithm for the Optical Flow Problem El Mostafa Kalmoun kalmoun@cs.fau.de Ulrich Ruede ruede@cs.fau.de Institute of Computer Science 10 Friedrich Alexander

More information

Efficient Nonlocal Regularization for Optical Flow

Efficient Nonlocal Regularization for Optical Flow Efficient Nonlocal Regularization for Optical Flow Philipp Krähenbühl and Vladlen Koltun Stanford University {philkr,vladlen}@cs.stanford.edu Abstract. Dense optical flow estimation in images is a challenging

More information

Feature detectors and descriptors. Fei-Fei Li

Feature detectors and descriptors. Fei-Fei Li Feature detectors and descriptors Fei-Fei Li Feature Detection e.g. DoG detected points (~300) coordinates, neighbourhoods Feature Description e.g. SIFT local descriptors (invariant) vectors database of

More information

Degeneracies, Dependencies and their Implications in Multi-body and Multi-Sequence Factorizations

Degeneracies, Dependencies and their Implications in Multi-body and Multi-Sequence Factorizations Degeneracies, Dependencies and their Implications in Multi-body and Multi-Sequence Factorizations Lihi Zelnik-Manor Michal Irani Dept. of Computer Science and Applied Math The Weizmann Institute of Science

More information

Modeling Blurred Video with Layers Supplemental material

Modeling Blurred Video with Layers Supplemental material Modeling Blurred Video with Layers Supplemental material Jonas Wulff, Michael J. Black Max Planck Institute for Intelligent Systems, Tübingen, Germany {jonas.wulff,black}@tue.mpg.de July 6, 204 Contents

More information

Overview. Introduction to local features. Harris interest points + SSD, ZNCC, SIFT. Evaluation and comparison of different detectors

Overview. Introduction to local features. Harris interest points + SSD, ZNCC, SIFT. Evaluation and comparison of different detectors Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Evaluation and comparison of different detectors Region descriptors and

More information

Generic a-posteriori uncertainty quantification for PIV vector fields by correlation statistics

Generic a-posteriori uncertainty quantification for PIV vector fields by correlation statistics Generic a-posteriori uncertainty quantification for PIV vector fields by correlation statistics Bernhard Wieneke LaVision GmbH, Göttingen, Germany bwieneke@lavision.de Abstract The uncertainty of a PIV

More information