Computer Science Department Distribution Fields A Unifying Representation for Low-Level Vision Problems Erik Learned-Miller with Laura Sevilla Lara, Manju.

Slides:



Advertisements
Similar presentations
Outline Feature Extraction and Matching (for Larger Motion)
Advertisements

Image Congealing (batch/multiple) image (alignment/registration) Advanced Topics in Computer Vision (048921) Boris Kimelman.
TP14 - Local features: detection and description Computer Vision, FCUP, 2014 Miguel Coimbra Slides by Prof. Kristen Grauman.
Activity Recognition Aneeq Zia. Agenda What is activity recognition Typical methods used for action recognition “Evaluation of local spatio-temporal features.
Ghunhui Gu, Joseph J. Lim, Pablo Arbeláez, Jitendra Malik University of California at Berkeley Berkeley, CA
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Recognition using Regions CVPR Outline Introduction Overview of the Approach Experimental Results Conclusion.
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
1 Interest Operators Find “interesting” pieces of the image –e.g. corners, salient regions –Focus attention of algorithms –Speed up computation Many possible.
Mean-Shift Algorithm and Its Application Bohyung Han
Tracking with Online Appearance Model Bohyung Han
1 Interest Operator Lectures lecture topics –Interest points 1 (Linda) interest points, descriptors, Harris corners, correlation matching –Interest points.
ON THE IMPROVEMENT OF IMAGE REGISTRATION FOR HIGH ACCURACY SUPER-RESOLUTION Michalis Vrigkas, Christophoros Nikou, Lisimachos P. Kondi University of Ioannina.
Feature matching and tracking Class 5 Read Section 4.1 of course notes Read Shi and Tomasi’s paper on.
Scale Invariant Feature Transform
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.
Recognizing and Tracking Human Action Josephine Sullivan and Stefan Carlsson.
Scale Invariant Feature Transform (SIFT)
Introduction to Object Tracking Presented by Youyou Wang CS643 Texas A&M University.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Dorin Comaniciu Visvanathan Ramesh (Imaging & Visualization Dept., Siemens Corp. Res. Inc.) Peter Meer (Rutgers University) Real-Time Tracking of Non-Rigid.
KLT tracker & triangulation Class 6 Read Shi and Tomasi’s paper on good features to track
A New Correspondence Algorithm Jitendra Malik Computer Science Division University of California, Berkeley Joint work with Serge Belongie, Jan Puzicha,
Lecture 6: Feature matching and alignment CS4670: Computer Vision Noah Snavely.
Overview Introduction to local features
Recognizing Action at a Distance A.A. Efros, A.C. Berg, G. Mori, J. Malik UC Berkeley.
Computer Science Department Detection, Alignment and Recognition of Real World Faces Erik Learned-Miller with Vidit Jain, Gary Huang, Andras Ferencz, et.
Computer vision.
05 - Feature Detection Overview Feature Detection –Intensity Extrema –Blob Detection –Corner Detection Feature Descriptors Feature Matching Conclusion.
Advanced Computer Vision Chapter 4 Feature Detection and Matching Presented by: 傅楸善 & 許承偉
Prakash Chockalingam Clemson University Non-Rigid Multi-Modal Object Tracking Using Gaussian Mixture Models Committee Members Dr Stan Birchfield (chair)
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Vision System for Wing Beat Analysis of Bats in the Wild 1 Boston University Department of Computer Science 2 Boston University Department of Biology Mikhail.
Overview Harris interest points Comparing interest points (SSD, ZNCC, SIFT) Scale & affine invariant interest points Evaluation and comparison of different.
Computational Photography Tamara Berg Features. Representing Images Keep all the pixels! Pros? Cons?
The Correspondence Problem and “Interest Point” Detection Václav Hlaváč Center for Machine Perception Czech Technical University Prague
Computer Vision: Summary and Discussion Computer Vision ECE 5554 Virginia Tech Devi Parikh 11/21/
Recognizing Action at a Distance Alexei A. Efros, Alexander C. Berg, Greg Mori, Jitendra Malik Computer Science Division, UC Berkeley Presented by Pundik.
Why is computer vision difficult?
Computer Vision 776 Jan-Michael Frahm 12/05/2011 Many slides from Derek Hoiem, James Hays.
Fields of Experts: A Framework for Learning Image Priors (Mon) Young Ki Baik, Computer Vision Lab.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Pyramidal Implementation of Lucas Kanade Feature Tracker Jia Huang Xiaoyan Liu Han Xin Yizhen Tan.
Templates, Image Pyramids, and Filter Banks
Deconstruction: Discriminative learning of local image descriptors Samantha Horvath Learning Based Methods in Vision 2/14/2012.
Sean M. Ficht.  Problem Definition  Previous Work  Methods & Theory  Results.
Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Evaluation and comparison.
Features, Feature descriptors, Matching Jana Kosecka George Mason University.
SIFT DESCRIPTOR K Wasif Mrityunjay
Presented by David Lee 3/20/2006
Motion estimation Digital Visual Effects, Spring 2006 Yung-Yu Chuang 2005/4/12 with slides by Michael Black and P. Anandan.
Midterm Review. Tuesday, November 3 7:15 – 9:15 p.m. in room 113 Psychology Closed book One 8.5” x 11” sheet of notes on both sides allowed Bring a calculator.
Representation in Vision Derek Hoiem CS 598, Spring 2009 Jan 22, 2009.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
Motion estimation Digital Visual Effects, Spring 2005 Yung-Yu Chuang 2005/3/23 with slides by Michael Black and P. Anandan.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
Lecture 13: Feature Descriptors and Matching
Local features: main components
TP12 - Local features: detection and description
Paper Presentation: Shape and Matching
Feature description and matching
Geometric Blur Descriptors for Point Correspondence
Digit Recognition using SVMS
Optical Flow For Vision-Aided Navigation
Shape matching and object recognition using shape contexts
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
Paper Reading Dalong Du April.08, 2011.
Feature descriptors and matching
Presentation transcript:

Computer Science Department Distribution Fields A Unifying Representation for Low-Level Vision Problems Erik Learned-Miller with Laura Sevilla Lara, Manju Narayana, Ben Mears

2 Distribution Fields Unifying Low-Level Vision  Tracking  Optical Flow  Affine invariant matching  Stereo  Backgrounding  Registration  Image Stitching What kind of representation serves all these problems well?

3 Distribution Fields Unifying Descriptors and Representations  HOG, SIFT, Shape Contexts  Geometric blur  Multi-scale methods  Mixture of Gaussian backgrounding  Bilateral filter  Joint alignment (congealing)

4 Distribution Fields Tracking

5 Distribution Fields Basics of Tracking Frame TFrame T+d

6 Distribution Fields Basics of Tracking Frame TFrame T+d

7 Distribution Fields Basics of Tracking Frame TFrame T+d

8 Distribution Fields Basics of Tracking Frame TFrame T+d

9 Distribution Fields The Core Matching Problem patch I image J Find best match of patch I to image J, for some set of transformations.

10 Distribution Fields Key issues  Large “basin of attraction” in gradient descent  Robustness to appearance changes of target

11 Distribution Fields Local optimum problem in alignment Unaligned Stuck in a local optimum

12 Distribution Fields Common solution to gradient descent matching  Blur images? “Spreads information” Also destroys information through averaging

13 Distribution Fields Exploding an image One plane for each feature value.

14 Distribution Fields Spatial Blur: 3d convolution with 2d Gaussian

15 Distribution Fields Spatial Blur: 3d convolution with 2d Gaussian KEY PROPERTY: doesn't destroy information through averaging

16 Distribution Fields Properties of Distribution Field Representation  Much larger basin of attraction than other descriptors.  A useful probability model from a single image.  Inherently multi-scale.  Extension and unification of many popular descriptors.  State of the art performance from extremely simple algorithms.

17 Distribution Fields Properties of Distribution Field Representation  Much larger basin of attraction than other descriptors.  A useful probability model from a single image.  Inherently multi-scale.  Extension and unification of many popular descriptors.  State of the art performance with extremely simple algorithms.  THANKS!

18 Distribution Fields The likelihood match

19 Distribution Fields Sharpening match

20 Distribution Fields Understanding the sharpening match What standard deviation maximizes the likelihood of a given point under a zero-mean Gaussian?

21 Distribution Fields Intuition behind sharpening match  Increase standard deviation until it matches “average distance” to matching points.

22 Distribution Fields Properties of the sharpening match  A patch has probability of 1.0 under its own distribution field.  Probability of an image patch degrades gracefully as it is translated away from best position.  Optimum “sigma” value gives a very intuitive notion of the quality of the image match.

23 Distribution Fields Basin of attraction studies

24 Distribution Fields Basin of attraction studies GIVEN A RANDOM PATCH...

25 Distribution Fields Basin of attraction studies AND A RANDOM DISPLACEMENT...

26 Distribution Fields Basin of attraction studies

27 Distribution Fields Basin of attraction studies

28 Distribution Fields Basin of attraction results

29 Distribution Fields Tracking results  State of the art results on tracking with standard sequences Very simple code Trivial motion model Simple memory model

30 Distribution Fields Closely Related work  Mixture of Gaussian backgrounding (Stauffer...)  Shape contexts (Belongie and Malik)  Congealing (me)  Bilateral filter  SIFT (Lowe), HOG (Dalal and Triggs)  Geometric Blur (Berg)  Rectified flow techniques (Efros, Mori)  Mean-shift tracking  Kernel tracking  and many others...