Computer Vision Group University of California Berkeley Ecological Statistics of Good Continuation: Multi-scale Markov Models for Contours Xiaofeng Ren.

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

CSCE643: Computer Vision Bayesian Tracking & Particle Filtering Jinxiang Chai Some slides from Stephen Roth.
Boundary Detection - Edges Boundaries of objects –Usually different materials/orientations, intensity changes.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Human Identity Recognition in Aerial Images Omar Oreifej Ramin Mehran Mubarak Shah CVPR 2010, June Computer Vision Lab of UCF.
Learning to Combine Bottom-Up and Top-Down Segmentation Anat Levin and Yair Weiss School of CS&Eng, The Hebrew University of Jerusalem, Israel.
Recovering Human Body Configurations: Combining Segmentation and Recognition Greg Mori, Xiaofeng Ren, and Jitentendra Malik (UC Berkeley) Alexei A. Efros.
1 Computational Vision CSCI 363, Fall 2012 Lecture 35 Perceptual Organization II.
Approaches for Retinex and Their Relations Yu Du March 14, 2002.
Computer Vision Lecture 16: Texture
Texture. Edge detectors find differences in overall intensity. Average intensity is only simplest difference. many slides from David Jacobs.
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.
1 Contours and Junctions in Natural Images Jitendra Malik University of California at Berkeley (with Jianbo Shi, Thomas Leung, Serge Belongie, Charless.
Ghunhui Gu, Joseph J. Lim, Pablo Arbeláez, Jitendra Malik University of California at Berkeley Berkeley, CA
Biased Normalized Cuts 1 Subhransu Maji and Jithndra Malik University of California, Berkeley IEEE Conference on Computer Vision and Pattern Recognition.
A Statistical Model for Domain- Independent Text Segmentation Masao Utiyama and Hitoshi Isahura Presentation by Matthew Waymost.
Edge and Corner Detection Reading: Chapter 8 (skip 8.1) Goal: Identify sudden changes (discontinuities) in an image This is where most shape information.
1 Hierarchical Image-Motion Segmentation using Swendsen-Wang Cuts Adrian Barbu Siemens Corporate Research Princeton, NJ Acknowledgements: S.C. Zhu, Y.N.
EE663 Image Processing Edge Detection 1
Computer Vision Group University of California Berkeley 1 Learning Scale-Invariant Contour Completion Xiaofeng Ren, Charless Fowlkes and Jitendra Malik.
Hierarchical Region-Based Segmentation by Ratio-Contour Jun Wang April 28, 2004 Course Project of CSCE 790.
Announcements Big mistake on hint in problem 1 (I’m very sorry).
Understanding Gestalt Cues and Ecological Statistics using a Database of Human Segmented Images Charless Fowlkes, David Martin and Jitendra Malik Department.
Abstract We present a model of curvilinear grouping using piecewise linear representations of contours and a conditional random field to capture continuity.
1 Learning to Detect Natural Image Boundaries David Martin, Charless Fowlkes, Jitendra Malik Computer Science Division University of California at Berkeley.
CVR05 University of California Berkeley 1 Familiar Configuration Enables Figure/Ground Assignment in Natural Scenes Xiaofeng Ren, Charless Fowlkes, Jitendra.
Computer Vision Group University of California Berkeley Visual Grouping and Object Recognition Jitendra Malik * U.C. Berkeley * with S. Belongie, C. Fowlkes,
Berkeley Vision GroupNIPS Vancouver Learning to Detect Natural Image Boundaries Using Local Brightness,
A Database of Human Segmented Natural Images and Two Applications David Martin, Charless Fowlkes, Doron Tal, Jitendra Malik UC Berkeley
1 The Ecological Statistics of Grouping by Similarity Charless Fowlkes, David Martin, Jitendra Malik Computer Science Division University of California.
Computer Vision Group University of California Berkeley 1 Scale-Invariant Random Fields for Mid-level Vision Xiaofeng Ren, Charless Fowlkes and Jitendra.
Segmentation and Perceptual Grouping Kaniza (Introduction to Computer Vision, )
Filters and Edges. Zebra convolved with Leopard.
On Measuring * the Ecological Validity of Local Figure-Ground Cues Charless Fowlkes, David Martin, Jitendra Malik Computer Science Division University.
CS292 Computational Vision and Language Visual Features - Colour and Texture.
1 How do ideas from perceptual organization relate to natural scenes?
1 Ecological Statistics and Perceptual Organization Charless Fowlkes work with David Martin and Jitendra Malik at University of California at Berkeley.
© 2003 by Davi GeigerComputer Vision November 2003 L1.1 Tracking We are given a contour   with coordinates   ={x 1, x 2, …, x N } at the initial frame.
Representation and Compression of Multi-Dimensional Piecewise Functions Dror Baron Signal Processing and Systems (SP&S) Seminar June 2009 Joint work with:
Computer Vision P. Schrater Spring 2003
The Hilbert Problems of Computer Vision
Entropy and some applications in image processing Neucimar J. Leite Institute of Computing
Texture Synthesis by Non-parametric Sampling Alexei Efros and Thomas Leung UC Berkeley.
The Three R’s of Vision Jitendra Malik.
1 Patch Complexity, Finite Pixel Correlations and Optimal Denoising Anat Levin, Boaz Nadler, Fredo Durand and Bill Freeman Weizmann Institute, MIT CSAIL.
Geodesic Minimal Paths Vida Movahedi Elder Lab, January 2010.
1 Contours and Junctions in Natural Images Jitendra Malik University of California at Berkeley (with Jianbo Shi, Thomas Leung, Serge Belongie, Charless.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
Visual Grouping and Recognition Jitendra Malik University of California at Berkeley Jitendra Malik University of California at Berkeley.
5. SUMMARY & CONCLUSIONS We have presented a coarse to fine minimization framework using a coupled dual ellipse model to form a subspace constraint that.
MIT AI Lab / LIDS Laboatory for Information and Decision Systems & Artificial Intelligence Laboratory Massachusetts Institute of Technology A Unified Multiresolution.
Colour and Texture. Extract 3-D information Using Vision Extract 3-D information for performing certain tasks such as manipulation, navigation, and recognition.
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
Sensation & Perception. Motion Vision I: Basic Motion Vision.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
A model for detecting illusory contours Caveat: Response decreases gradually with increasing intermeshing of gratings. This does not correspond with subjective.
Instructor: Mircea Nicolescu Lecture 7
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Computational Vision Jitendra Malik University of California, Berkeley.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
- photometric aspects of image formation gray level images
Tracking We are given a contour G1 with coordinates G1={x1 , x2 , … , xN} at the initial frame t=1, were the image is It=1 . We are interested in tracking.
Enhanced-alignment Measure for Binary Foreground Map Evaluation
Computer Vision Lecture 16: Texture II
Learning to Combine Bottom-Up and Top-Down Segmentation
Texture.
CS-565 Computer Vision Nazar Khan Lecture 15.
Fourier Transform of Boundaries
Presentation transcript:

Computer Vision Group University of California Berkeley Ecological Statistics of Good Continuation: Multi-scale Markov Models for Contours Xiaofeng Ren and Jitendra Malik

Computer Vision Group University of California Berkeley Good Continuation Wertheimer ’23 Kanizsa ’55 von der Heydt, Peterhans & Baumgartner ’84 Kellman & Shipley ’91 Field, Hayes & Hess ’93 Kapadia, Westheimer & Gilbert ’00 … Parent & Zucker ’89 Heitger & von der Heydt ’93 Mumford ’94 Williams & Jacobs ’95 … Wertheimer ’23 Kanizsa ’55 von der Heydt, Peterhans & Baumgartner ’84 Kellman & Shipley ’91 Field, Hayes & Hess ’93 Kapadia, Westheimer & Gilbert ’00 … Parent & Zucker ’89 Heitger & von der Heydt ’93 Mumford ’94 Williams & Jacobs ’95 …

Computer Vision Group University of California Berkeley Approach: Ecological Statistics Brunswick & Kamiya ’53 Ruderman ’94 Huang & Mumford ’99 Martin et. al. ’01 Brunswick & Kamiya ’53 Ruderman ’94 Huang & Mumford ’99 Martin et. al. ’01 E. Brunswick Ecological validity of perceptual cues: characteristics of perception match to underlying statistical properties of the environment Gibson ’66 Olshausen & Field ’96 Geisler et. al. ’01 … Gibson ’66 Olshausen & Field ’96 Geisler et. al. ’01 …

Computer Vision Group University of California Berkeley Human-Segmented Natural Images D. Martin et. al., ICCV ,000 images, >14,000 segmentations

Computer Vision Group University of California Berkeley More Examples D. Martin et. al. ICCV 2001

Computer Vision Group University of California Berkeley Segmentations are Consistent A BC A,C are refinements of B A,C are mutual refinements A,B,C represent the same percept Attention accounts for differences Image BGL-birdR-bird grass bush head eye beak far body head eye beak body Perceptual organization forms a tree: Two segmentations are consistent when they can be explained by the same segmentation tree (i.e. they could be derived from a single perceptual organization).

Computer Vision Group University of California Berkeley Outline of Experiments Prior model of contours in natural images –First-order Markov model Test of Markov property –Multi-scale Markov models Information-theoretic evaluation Contour synthesis Good continuation algorithm and results Prior model of contours in natural images –First-order Markov model Test of Markov property –Multi-scale Markov models Information-theoretic evaluation Contour synthesis Good continuation algorithm and results

Computer Vision Group University of California Berkeley Contour Geometry First-Order Markov Model ( Mumford ’94, Williams & Jacobs ’95 ) –Curvature: white noise ( independent from position to position ) –Tangent t(s): random walk –Markov property: the tangent at the next position, t(s+1), only depends on the current tangent t(s) First-Order Markov Model ( Mumford ’94, Williams & Jacobs ’95 ) –Curvature: white noise ( independent from position to position ) –Tangent t(s): random walk –Markov property: the tangent at the next position, t(s+1), only depends on the current tangent t(s) t(s) t(s+1) s s+1

Computer Vision Group University of California Berkeley Test of Markov Property Segment the contours at high-curvature positions

Computer Vision Group University of California Berkeley Prediction: Exponential Distribution If the first-order Markov property holds… At every step, there is a constant probability p that a high curvature event will occur High curvature events are independent from step to step  Then the probability of finding a segment of length k with no high curvature is (1-p) k If the first-order Markov property holds… At every step, there is a constant probability p that a high curvature event will occur High curvature events are independent from step to step  Then the probability of finding a segment of length k with no high curvature is (1-p) k

Computer Vision Group University of California Berkeley Exponential ? Empirical Distribution NO

Computer Vision Group University of California Berkeley Empirical Distribution: Power Law Contour segment length Probability density

Computer Vision Group University of California Berkeley Power Laws in Nature Power Law widely exists in nature –Brightness of stars –Magnitude of earthquakes –Population of cities –Word frequency in natural languages –Revenue of commercial corporations –Connectivity in Internet topology … Usually characterized by self-similarity and multi-scale phenomena Power Law widely exists in nature –Brightness of stars –Magnitude of earthquakes –Population of cities –Word frequency in natural languages –Revenue of commercial corporations –Connectivity in Internet topology … Usually characterized by self-similarity and multi-scale phenomena

Computer Vision Group University of California Berkeley Multi-scale Markov Models Assume knowledge of contour orientation at coarser scales t(s) t(s+1) 2 nd Order Markov: P( t(s+1) | t(s), t (1) (s+1) ) Higher Order Models: P( t(s+1) | t(s), t (1) (s+1), t (2) (s+1), … ) s+1 s t (1) (s+1) s+1

Computer Vision Group University of California Berkeley Information Gain in Multi-scale 14.6% of total entropy ( at order 5 ) H( t(s+1) | t(s), t (1) (s+1), t (2) (s+1), … )

Computer Vision Group University of California Berkeley Contour Synthesis Multi-scale Markov First-Order Markov

Computer Vision Group University of California Berkeley Multi-scale Contour Completion Coarse-to-Fine –Coarse-scale completes large gaps –Fine-scale detects details Completed contours at coarser scales are used in the higher-order Markov models of contour prior for finer scales P( t(s+1) | t(s), t (1) (s+1), … ) Coarse-to-Fine –Coarse-scale completes large gaps –Fine-scale detects details Completed contours at coarser scales are used in the higher-order Markov models of contour prior for finer scales P( t(s+1) | t(s), t (1) (s+1), … )

Computer Vision Group University of California Berkeley Multi-scale: Example input coarse scalefine scale w/o multi-scale fine scale w/ multi-scale

Computer Vision Group University of California Berkeley Our resultCanny Comparison: same number of edge pixels

Computer Vision Group University of California Berkeley Our resultCanny Comparison: same number of edge pixels

Computer Vision Group University of California Berkeley Conclusion Contours are multi-scale in nature; the first-order Markov property does not hold for contours in natural images. Higher-order Markov models explicitly model the multi-scale nature of contours. We have shown: –The information gain is significant –Synthesized contours are smooth and rich in structure –Efficient good continuation algorithm has produced promising results Contours are multi-scale in nature; the first-order Markov property does not hold for contours in natural images. Higher-order Markov models explicitly model the multi-scale nature of contours. We have shown: –The information gain is significant –Synthesized contours are smooth and rich in structure –Efficient good continuation algorithm has produced promising results Ren & Malik, ECCV 2002

Computer Vision Group University of California Berkeley Thank You