Algorithms compared Bicubic Interpolation Mitra's Directional Filter

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

Copyright © 2011 Pearson, Inc. P.7 Solving Inequalities Algebraically and Graphically.
Bellwork If you roll a die, what is the probability that you roll a 2 or an odd number? P(2 or odd) 2. Is this an example of mutually exclusive, overlapping,
Chapter 1 The Study of Body Function Image PowerPoint
Basic Steps 1.Compute the x and y image derivatives 2.Classify each derivative as being caused by either shading or a reflectance change 3.Set derivatives.
1 Applications of belief propagation in low-level vision Bill Freeman Massachusetts Institute of Technology Jan. 12, 2010 Joint work with: Egon Pasztor,
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 4 Author: Julia Richards and R. Scott Hawley.
1 Chapter 40 - Physiology and Pathophysiology of Diuretic Action Copyright © 2013 Elsevier Inc. All rights reserved.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
1 Probability and the Web Ken Baclawski Northeastern University VIStology, Inc.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
Bayesian Belief Propagation
STATISTICAL INFERENCE ABOUT MEANS AND PROPORTIONS WITH TWO POPULATIONS
Photo Composition Study Guide Label each photo with the category that applies to that image.
Requirements Diagrams With UML Models
1 Photometric Stereo Reconstruction Dr. Maria E. Angelopoulou.
Université du Québec École de technologie supérieure Face Recognition in Video Using What- and-Where Fusion Neural Network Mamoudou Barry and Eric Granger.
ABC Technology Project
O X Click on Number next to person for a question.
© S Haughton more than 3?
Twenty Questions Subject: Twenty Questions
Squares and Square Root WALK. Solve each problem REVIEW:
Linear Time Methods for Propagating Beliefs Min Convolution, Distance Transforms and Box Sums Daniel Huttenlocher Computer Science Department December,
The Normal Distribution PSYC 6130, PROF. J. ELDER 2 is the mean is the standard deviation The height of a normal density curve at any point x is given.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Week 1.
We will resume in: 25 Minutes.
CSE 473/573 Computer Vision and Image Processing (CVIP) Ifeoma Nwogu Lecture 27 – Overview of probability concepts 1.
O X Click on Number next to person for a question.
By: Mani Baghaei Fard.  During recent years number of moving vehicles in roads and highways has been considerably increased.
Observing Children in School. Aims To learn how to observe children in one of their natural habitats To understand how children experience their worlds.
Introduction to Belief Propagation and its Generalizations. Max Welling Donald Bren School of Information and Computer and Science University of California.
Markov Networks.
Graphical models, belief propagation, and Markov random fields 1.
Computer Vision Optical Flow
PSY 5018H: Math Models Hum Behavior, Prof. Paul Schrater, Spring 2004 Vision as Optimal Inference The problem of visual processing can be thought of as.
Recovering Intrinsic Images from a Single Image 28/12/05 Dagan Aviv Shadows Removal Seminar.
Face Recognition Based on 3D Shape Estimation
Learning Low-Level Vision William T. Freeman Egon C. Pasztor Owen T. Carmichael.
Motion Field and Optical Flow. Outline Motion Field and Optical Flow Definition, Example, Relation Optical Flow Constraint Equation Assumptions & Derivation,
3D Rigid/Nonrigid RegistrationRegistration 1)Known features, correspondences, transformation model – feature basedfeature based 2)Specific motion type,
Super-Resolution of Remotely-Sensed Images Using a Learning-Based Approach Isabelle Bégin and Frank P. Ferrie Abstract Super-resolution addresses the problem.
Markov Random Fields, Graph Cuts, Belief Propagation
Graphical models, belief propagation, and Markov random fields Bill Freeman, MIT Fredo Durand, MIT March 21, 2005.
PCB Soldering Inspection. Structured Highlight approach Structured Highlight method is applied to illuminating and imaging specular surfaces which yields.
Computer Vision Michael Isard and Dimitris Metaxas.
6.869 Advances in Computer Vision Bill Freeman and Antonio Torralba Lecture 11 MRF’s (continued), cameras and lenses. Spring 2011 remember correction on.
Markov Random Fields Allows rich probabilistic models for images. But built in a local, modular way. Learn local relationships, get global effects out.
Optical Flow. Distribution of apparent velocities of movement of brightness pattern in an image.
MIT AI Lab / LIDS Laboatory for Information and Decision Systems & Artificial Intelligence Laboratory Massachusetts Institute of Technology A Unified Multiresolution.
Motion Estimation using Markov Random Fields Hrvoje Bogunović Image Processing Group Faculty of Electrical Engineering and Computing University of Zagreb.
MOTION Model. Road Map Motion Model Non Parametric Motion Field : Algorithms 1.Optical flow field estimation. 2.Block based motion estimation. 3.Pel –recursive.
From local motion estimates to global ones - physiology:
Nonparametric Semantic Segmentation
Markov Networks.
Markov Networks.
Presentation transcript:

Algorithms compared Bicubic Interpolation Mitra's Directional Filter Fuzzy Logic Filter Vector Quantization VISTA

Bicubic spline Altamira VISTA

Bicubic spline Altamira VISTA

User preference test results “The observer data indicates that six of the observers ranked Freeman’s algorithm as the most preferred of the five tested algorithms. However the other two observers rank Freeman’s algorithm as the least preferred of all the algorithms…. Freeman’s algorithm produces prints which are by far the sharpest out of the five algorithms. However, this sharpness comes at a price of artifacts (spurious detail that is not present in the original scene). Apparently the two observers who did not prefer Freeman’s algorithm had strong objections to the artifacts. The other observers apparently placed high priority on the high level of sharpness in the images created by Freeman’s algorithm.”

Training images

Training image

Processed image

Inference in Markov Random Fields Gibbs sampling, simulated annealing Iterated conditional modes (ICM) Belief propagation Application examples: super-resolution motion analysis shading/reflectance separation Graph cuts Variational methods

Motion application image patches image scene patches scene

What behavior should we see in a motion algorithm? Aperture problem Resolution through propagation of information Figure/ground discrimination

The aperture problem

The aperture problem

Motion analysis: related work Markov network Luettgen, Karl, Willsky and collaborators. Neural network or learning-based Nowlan & T. J. Senjowski; Sereno. Optical flow analysis Weiss & Adelson; Darrell & Pentland; Ju, Black & Jepson; Simoncelli; Grzywacz & Yuille; Hildreth; Horn & Schunk; etc.

Motion estimation results Inference: Motion estimation results (maxima of scene probability distributions displayed) Image data Initial guesses only show motion at edges. Iterations 0 and 1

Motion estimation results (maxima of scene probability distributions displayed) Iterations 2 and 3 Figure/ground still unresolved here.

Motion estimation results (maxima of scene probability distributions displayed) Iterations 4 and 5 Final result compares well with vector quantized true (uniform) velocities.

Inference in Markov Random Fields Gibbs sampling, simulated annealing Iterated conditional modes (ICM) Belief propagation Application examples: super-resolution motion analysis shading/reflectance separation Graph cuts Variational methods

Forming an Image Illuminate the surface to get: Surface (Height Map) Shading Image Surface (Height Map) The shading image is the interaction of the shape of the surface and the illumination

Painting the Surface Scene Image Add a reflectance pattern to the surface. Points inside the squares should reflect less light

Problem What if we want to do shape from shading? Image Height Map Need some mechanism of informing the shape from shading algorithm about the reflectance pattern.

Represent Scene As =  Image Shading Image Reflectance Image These types of images are known as intrinsic images (Barrow and Tenenbaum)

Not Just for Shape from Shading Ability to reason about shading and reflectance independently is necessary for most image understanding tasks Material recognition Image segmentation Intrinsic images are a convenient representation of the scene Less complex than fully reconstructing the scene

Goal Image Shading Image Reflectance Image