Computer Vision Group University of California Berkeley 1 Learning Scale-Invariant Contour Completion Xiaofeng Ren, Charless Fowlkes and Jitendra Malik.

Slides:



Advertisements
Similar presentations
HOPS: Efficient Region Labeling using Higher Order Proxy Neighborhoods Albert Y. C. Chen 1, Jason J. Corso 1, and Le Wang 2 1 Dept. of Computer Science.
Advertisements

Unsupervised Learning Clustering K-Means. Recall: Key Components of Intelligent Agents Representation Language: Graph, Bayes Nets, Linear functions Inference.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Constrained Approximate Maximum Entropy Learning (CAMEL) Varun Ganapathi, David Vickrey, John Duchi, Daphne Koller Stanford University TexPoint fonts used.
Supervised Learning Recap
Computer Vision Lecture 16: Texture
Presented by: Mingyuan Zhou Duke University, ECE September 18, 2009
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.
Computer Vision Group University of California Berkeley Ecological Statistics of Good Continuation: Multi-scale Markov Models for Contours Xiaofeng Ren.
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
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
Biased Normalized Cuts 1 Subhransu Maji and Jithndra Malik University of California, Berkeley IEEE Conference on Computer Vision and Pattern Recognition.
SURF: Speeded-Up Robust Features
Learning to Detect A Salient Object Reporter: 鄭綱 (3/2)
Computer Vision Group Edge Detection Giacomo Boracchi 5/12/2007
Hierarchical Region-Based Segmentation by Ratio-Contour Jun Wang April 28, 2004 Course Project of CSCE 790.
© 2003 by Davi GeigerComputer Vision October 2003 L1.1 Image Segmentation Based on the work of Shi and Malik, Carnegie Mellon and Berkley and based on.
Learning to Detect Natural Image Boundaries Using Local Brightness, Color, and Texture Cues David R. Martin Charless C. Fowlkes Jitendra Malik.
Edge detection. Edge Detection in Images Finding the contour of objects in a scene.
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.
Berkeley Vision GroupNIPS Vancouver Learning to Detect Natural Image Boundaries Using Local Brightness,
CVR05 University of California Berkeley 1 Cue Integration in Figure/Ground Labeling Xiaofeng Ren, Charless Fowlkes, Jitendra Malik.
A Database of Human Segmented Natural Images and Two Applications David Martin, Charless Fowlkes, Doron Tal, Jitendra Malik UC Berkeley
Belief Propagation, Junction Trees, and Factor Graphs
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.
Probabilistic Models for Parsing Images Xiaofeng Ren University of California, Berkeley.
Computational Vision Jitendra Malik University of California at Berkeley Jitendra Malik University of California at Berkeley.
MSRI University of California Berkeley 1 Recovering Human Body Configurations using Pairwise Constraints between Parts Xiaofeng Ren, Alex Berg, Jitendra.
1 Occlusions – the world is flat without them! : Learning-Based Methods in Vision A. Efros, CMU, Spring 2009.
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.
Computer Vision Group University of California Berkeley 1 Cue Integration in Figure/Ground Labeling Xiaofeng Ren, Charless Fowlkes and Jitendra Malik.
Presentation By Michael Tao and Patrick Virtue. Agenda History of the problem Graph cut background Compute graph cut Extensions State of the art Continued.
Information that lets you recognise a region.
Cue Integration in Figure/Ground Labeling Xiaofeng Ren, Charless Fowlkes and Jitendra Malik, U.C. Berkeley We present a model of edge and region grouping.
Heather Dunlop : Advanced Perception January 25, 2006
Handwritten Character Recognition using Hidden Markov Models Quantifying the marginal benefit of exploiting correlations between adjacent characters and.
Content-based Image Retrieval (CBIR)
Hubert CARDOTJY- RAMELRashid-Jalal QURESHI Université François Rabelais de Tours, Laboratoire d'Informatique 64, Avenue Jean Portalis, TOURS – France.
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
Linked Edges as Stable Region Boundaries* Michael Donoser, Hayko Riemenschneider and Horst Bischof This work introduces an unsupervised method to detect.
Techniques for Estimating Layers from Polar Radar Imagery Jerome E. Mitchell, Geoffrey C. Fox, and David J. Crandall :: CReSIS NSF Site Visit :: School.
MRFs and Segmentation with Graph Cuts Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/24/10.
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.
Intelligent Vision Systems ENT 496 Object Shape Identification and Representation Hema C.R. Lecture 7.
Detecting Curved Symmetric Parts using a Deformable Disc Model Tom Sie Ho Lee, University of Toronto Sanja Fidler, TTI Chicago Sven Dickinson, University.
Logistic Regression Debapriyo Majumdar Data Mining – Fall 2014 Indian Statistical Institute Kolkata September 1, 2014.
Markov Random Fields Probabilistic Models for Images
Automatic Image Annotation by Using Concept-Sensitive Salient Objects for Image Content Representation Jianping Fan, Yuli Gao, Hangzai Luo, Guangyou Xu.
CSE 185 Introduction to Computer Vision Edges. Scale space Reading: Chapter 3 of S.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
A New Method for Crater Detection Heather Dunlop November 2, 2006.
Markov Random Fields & Conditional Random Fields
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],
Convolutional Restricted Boltzmann Machines for Feature Learning Mohammad Norouzi Advisor: Dr. Greg Mori Simon Fraser University 27 Nov
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Perfect recall: Every decision node observes all earlier decision nodes and their parents (along a “temporal” order) Sum-max-sum rule (dynamical programming):
Rich feature hierarchies for accurate object detection and semantic segmentation 2014 IEEE Conference on Computer Vision and Pattern Recognition Ross Girshick,
1 Bilinear Classifiers for Visual Recognition Computational Vision Lab. University of California Irvine To be presented in NIPS 2009 Hamed Pirsiavash Deva.
Contours and Junctions in Natural Images
Computer Vision Lecture 16: Texture II
Fourier Transform of Boundaries
“Traditional” image segmentation
Presentation transcript:

Computer Vision Group University of California Berkeley 1 Learning Scale-Invariant Contour Completion Xiaofeng Ren, Charless Fowlkes and Jitendra Malik

Computer Vision Group University of California Berkeley 2 Abstract We present a model of curvilinear grouping using piecewise linear representations of contours and a conditional random field to capture continuity and the frequency of different junction types. Potential completions are generated by building a constrained Delaunay triangulation (CDT) over the set of contours found by a local edge detector. Maximum likelihood parameters for the model are learned from human labeled groundtruth. Using held out test data, we measure how the model, by incorporating continuity structure, improves boundary detection over the local edge detector. We also compare performance with a baseline local classifier that operates on pairs of edgels. Both algorithms consistently dominate the low-level boundary detector at all thresholds. To our knowledge, this is the first time that curvilinear continuity has been shown quantitatively useful for a large variety of natural images. Better boundary detection has immediate application in the problem of object detection and recognition.

Computer Vision Group University of California Berkeley 3 Boundary Detection Edge detection: 20 years after Canny Pb (Probability of Boundary): learning to combine brightness, color and texture contrasts There is psychophysical evidence that we might have been approaching the limit of local edge detection

Computer Vision Group University of California Berkeley 4 Curvilinear Continuity Boundaries are smooth in nature A number of associated phenomena –Good continuation –Visual completion –Illusory contours Well studied in human vision –Wertheimer, Kanizsa, von der Heydt, Kellman, Field, Geisler, … Extensively explored in computer vision –Shashua, Zucker, Mumford, Williams, Jacobs, Elder, Jermyn, Wang, … Is the net effect of completion positive? Or negative? Lack of quantitative evaluation Boundaries are smooth in nature A number of associated phenomena –Good continuation –Visual completion –Illusory contours Well studied in human vision –Wertheimer, Kanizsa, von der Heydt, Kellman, Field, Geisler, … Extensively explored in computer vision –Shashua, Zucker, Mumford, Williams, Jacobs, Elder, Jermyn, Wang, … Is the net effect of completion positive? Or negative? Lack of quantitative evaluation

Computer Vision Group University of California Berkeley 5 Scale Invariance Sources of scale invariance arbitrary viewing distancehierarchy of parts Power laws in natural images –Lots of findings, e.g. in power spectra or wavelet coefficients (Ruderman, Mumford, Simoncelli, …) –Also in boundary contours [Ren and Malik 02] How to incorporate scale-invariance?

Computer Vision Group University of California Berkeley 6 A Scale-Invariant Representation Piecewise linear approximation of low-level contours –recursive splitting based on angle Constrained Delaunay Triangulation –a variant of the standard Delaunay Triangulation –maximizes the minimum angle (avoids skinny triangles)

Computer Vision Group University of California Berkeley 7 The CDT Graph scale-invariant fast to compute <1000 edges completes gaps little loss of structure

Computer Vision Group University of California Berkeley 8 No Loss of Structure Use P human the soft groundtruth label defined on CDT graphs: precision close to 100% Pb averaged over CDT edges: no worse than the orignal Pb Increase in asymptotic recall rate: completion of gradientless contours

Computer Vision Group University of California Berkeley 9 CDT vs. K-Neighbor Completion An alternative scheme for completion: connect to k- nearest neighbor vertices, subject to visibility CDT achieves higher asymptotic recall rates

Computer Vision Group University of California Berkeley 10 Inference on the CDT Graph Xe Local inference: Xe Global inference:

Computer Vision Group University of California Berkeley 11 Baseline Local Model “Bi-gram” model:  contrast + continuity  binary classification (0,0) vs (1,1) logistic classifier “Tri-gram” model: 11 22 LL  Pb L = Xe

Computer Vision Group University of California Berkeley 12 Global Model w/ Conditional Random Fields Graphical model with expoential potential functions edge potentials exp(  i ) junction potentials exp(  j ) Inference with loopy belief propagation Maximum likelihood learning (convex) with gradient descent converges < 10 iterations

Computer Vision Group University of California Berkeley 13 Junctions and Continuity Junction types (deg g,deg c ): deg g =1,deg c =0deg g =0,deg c =2deg g =1,deg c =2 Continuity term for degree-2 junctions deg g +deg c =2  deg g =0,deg c =0

Computer Vision Group University of California Berkeley 14 Continuity improves boundary detection in both low-recall and high-recall ranges Global inference helps; mostly in low-recall/high-precision Roughly speaking, CRF>Local>CDT only>Pb

Computer Vision Group University of California Berkeley 15

Computer Vision Group University of California Berkeley 16

Computer Vision Group University of California Berkeley 17 ImagePbLocalGlobal

Computer Vision Group University of California Berkeley 18 ImagePbLocalGlobal

Computer Vision Group University of California Berkeley 19 ImagePbLocalGlobal

Computer Vision Group University of California Berkeley 20 Conclusion Constrained Delaunay Triangulation is a scale-invariant discretization of images with little loss of structure; Moving from 100,000 pixels to <1000 edges, CDT achieves great statistical and computational efficiency; Curvilinear Continuity improves boundary detection; –the local model of continuity is simple yet very effective –global inference of continuity further improves performance –Conditional Random Fields w/ loopy belief propagation works well on CDT graphs Curvilinear Continuity improves boundary detection; –the local model of continuity is simple yet very effective –global inference of continuity further improves performance –Conditional Random Fields w/ loopy belief propagation works well on CDT graphs Mid-level vision is useful.

Computer Vision Group University of California Berkeley 21 Thank You

Computer Vision Group University of California Berkeley 22