Recognition using Regions (Demo) Sudheendra V. Outline Generating multiple segmentations –Normalized cuts [Ren & Malik (2003)] Uniform regions –Watershed.

Slides:



Advertisements
Similar presentations
Automatic Photo Pop-up Derek Hoiem Alexei A.Efros Martial Hebert Carnegie Mellon University.
Advertisements

Top-Down & Bottom-Up Segmentation
Learning Trajectory Patterns by Clustering: Comparative Evaluation Group D.
Foreground Focus: Finding Meaningful Features in Unlabeled Images Yong Jae Lee and Kristen Grauman University of Texas at Austin.
Interactively Co-segmentating Topically Related Images with Intelligent Scribble Guidance Dhruv Batra, Carnegie Mellon University Adarsh Kowdle, Cornell.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Shape Sharing for Object Segmentation
Carolina Galleguillos, Brian McFee, Serge Belongie, Gert Lanckriet Computer Science and Engineering Department Electrical and Computer Engineering Department.
CS395: Visual Recognition Spatial Pyramid Matching Heath Vinicombe The University of Texas at Austin 21 st September 2012.
Computer Vision Lecture 16: Texture
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.
1 P. Arbelaez, M. Maire, C. Fowlkes, J. Malik. Contour Detection and Hierarchical image Segmentation. IEEE Trans. on PAMI, Student: Hsin-Min Cheng.
Quadtrees, Octrees and their Applications in Digital Image Processing
Ghunhui Gu, Joseph J. Lim, Pablo Arbeláez, Jitendra Malik University of California at Berkeley Berkeley, CA
Contour Based Approaches for Visual Object Recognition Jamie Shotton University of Cambridge Joint work with Roberto Cipolla, Andrew Blake.
Biased Normalized Cuts 1 Subhransu Maji and Jithndra Malik University of California, Berkeley IEEE Conference on Computer Vision and Pattern Recognition.
Young Deok Chun, Nam Chul Kim, Member, IEEE, and Ick Hoon Jang, Member, IEEE IEEE TRANSACTIONS ON MULTIMEDIA,OCTOBER 2008.
Recognition using Regions CVPR Outline Introduction Overview of the Approach Experimental Results Conclusion.
WISE: Large Scale Content-Based Web Image Search Michael Isard Joint with: Qifa Ke, Jian Sun, Zhong Wu Microsoft Research Silicon Valley 1.
Robust Higher Order Potentials For Enforcing Label Consistency
CS 376b Introduction to Computer Vision 04 / 08 / 2008 Instructor: Michael Eckmann.
Normalized Cuts and Image Segmentation Jianbo Shi and Jitendra Malik, Presented by: Alireza Tavakkoli.
Unsupervised Learning of Categories from Sets of Partially Matching Image Features Dominic Rizzo and Giota Stratou.
Abstract We present a model of curvilinear grouping using piecewise linear representations of contours and a conditional random field to capture continuity.
Normalized Cuts Demo Original Implementation from: Jianbo Shi Jitendra Malik Presented by: Joseph Djugash.
Quadtrees, Octrees and their Applications in Digital Image Processing
Unsupervised discovery of visual object class hierarchies Josef Sivic (INRIA / ENS), Bryan Russell (MIT), Andrew Zisserman (Oxford), Alyosha Efros (CMU)
WORD-PREDICTION AS A TOOL TO EVALUATE LOW-LEVEL VISION PROCESSES Prasad Gabbur, Kobus Barnard University of Arizona.
Video Google: Text Retrieval Approach to Object Matching in Videos Authors: Josef Sivic and Andrew Zisserman University of Oxford ICCV 2003.
1 Segmentation with Scene and Sub-Scene Categories Joseph Djugash Input Image Scene/Sub-Scene Classification Segmentation.
Segmentation and Perceptual Grouping. The image of this cube contradicts the optical image.
Presentation By Michael Tao and Patrick Virtue. Agenda History of the problem Graph cut background Compute graph cut Extensions State of the art Continued.
Computer Vision Group University of California Berkeley Recognizing Objects in Adversarial Clutter: Breaking a Visual CAPTCHA Greg Mori and Jitendra Malik.
Multiple Object Class Detection with a Generative Model K. Mikolajczyk, B. Leibe and B. Schiele Carolina Galleguillos.
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.
Unsupervised Category Modeling, Recognition and Segmentation Sinisa Todorovic and Narendra Ahuja.
Generic object detection with deformable part-based models
Graph-based Segmentation
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
CSE 185 Introduction to Computer Vision
Linked Edges as Stable Region Boundaries* Michael Donoser, Hayko Riemenschneider and Horst Bischof This work introduces an unsupervised method to detect.
CSSE463: Image Recognition Day 34 This week This week Today: Today: Graph-theoretic approach to segmentation Graph-theoretic approach to segmentation Tuesday:
Chapter 14: SEGMENTATION BY CLUSTERING 1. 2 Outline Introduction Human Vision & Gestalt Properties Applications – Background Subtraction – Shot Boundary.
Classifying Images with Visual/Textual Cues By Steven Kappes and Yan Cao.
Video Google: A Text Retrieval Approach to Object Matching in Videos Josef Sivic and Andrew Zisserman.
Quadtrees, Octrees and their Applications in Digital Image Processing.
80 million tiny images: a large dataset for non-parametric object and scene recognition CS 4763 Multimedia Systems Spring 2008.
Stylization and Abstraction of Photographs Doug Decarlo and Anthony Santella.
Category Independent Region Proposals Ian Endres and Derek Hoiem University of Illinois at Urbana-Champaign.
Image Segmentation Superpixel methods Speaker: Hsuan-Yi Ko.
Towards Total Scene Understanding: Classification, Annotation and Segmentation in an Automatic Framework N 工科所 錢雅馨 2011/01/16 Li-Jia Li, Richard.
A New Method for Crater Detection Heather Dunlop November 2, 2006.
Object-Graphs for Context-Aware Category Discovery Yong Jae Lee and Kristen Grauman University of Texas at Austin 1.
Object Recognition as Ranking Holistic Figure-Ground Hypotheses Fuxin Li and Joao Carreira and Cristian Sminchisescu 1.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Learning Hierarchical Features for Scene Labeling Cle’ment Farabet, Camille Couprie, Laurent Najman, and Yann LeCun by Dong Nie.
Normalized Cuts and Image Segmentation Patrick Denis COSC 6121 York University Jianbo Shi and Jitendra Malik.
Edge Preserving Spatially Varying Mixtures for Image Segmentation Giorgos Sfikas, Christophoros Nikou, Nikolaos Galatsanos (CVPR 2008) Presented by Lihan.
Recent developments in object detection
Object detection with deformable part-based models
CSSE463: Image Recognition Day 34
Saliency detection Donghun Yeo CV Lab..
Mean Shift Segmentation
Cheng-Ming Huang, Wen-Hung Liao Department of Computer Science
Outline Announcement Texture modeling - continued Some remarks
The topic discovery models
Fourier Transform of Boundaries
CSSE463: Image Recognition Day 34
“Traditional” image segmentation
MS-SEG Challenge: Results and Analysis on Testing Data
Presentation transcript:

Recognition using Regions (Demo) Sudheendra V

Outline Generating multiple segmentations –Normalized cuts [Ren & Malik (2003)] Uniform regions –Watershed transform [ Arbel´aez1et al. (2009)] Non-uniform Multiple scales Discovering object regions using LDA –ground truth segments –multiple segmentation –single segmentation –hierarchical segmentation

Multiple Segmentations Normalized cuts –segmentation as graph partitioning nodes -> pixels, edge between neighboring pixels edge weight -> affinity between pixels partition graph into K components –parameters number of partitions K –properties similar sized partitions (normalized) preserves region boundaries for large enough K –multiple segmentations vary number of partitions K resize image to different resolutions affinity matrix

Normalized cuts (examples) K = 4 K = 6 K = 7

Normalized cuts (examples) K = 3 K = 5 K = 7 Extra edge “normalized” regions

Normalized cuts (examples) K = 3 K = 5 K = 7

Multiple Segmentations Watershed transform –contours are detected using texture, edge cues and oriented watershed transform used to determine contour scale –parameters thresholding scale for contours, k –properties variable sized regions preserves region boundaries –multiple segmentations vary thresholding scale k resize image to different resolutions Contours at multiple scalesThreshold at a scale

Watershed (examples) K = 200 K = 180 K = 160 Threshold at different contour scales K to generate multiple segmentations

Watershed (examples) K = 195 K = 183 K = 169 Threshold at different contour scales K to generate multiple segmentations

Watershed (Hierarchical segmentation) Thresholding scales in an increasing sequence produces a hierarchical segmentation K = 175 K = 155 K = 190 K = 140

Watershed (Hierarchical segmentation) Thresholding scales in an increasing sequence produces a hierarchical segmentation K = 175 K = 155 K = 200 K = 145

Ncuts vs Watershed Ncuts Watershed Comparison of multiple segmentations generated using Ncuts vs Watershed

Ncuts vs Watershed Ncuts Watershed Comparison of multiple segmentations generated using Ncuts vs Watershed

Outline Generating multiple segmentations –Normalized cuts [Ren & Malik (2003)] Uniform regions –Watershed transform [ Arbel´aez1et al. (2009)] Non-uniform Multiple scales Discovering object regions using LDA –ground truth segments –multiple segmentation –single segmentation –hierarchical segmentation

Multiple Segmentations

Discovering object regions using LDA Approach Parameters – number of topics to discover Generate multiple segmentations Extract local features (SIFT) Bag of words rep for each segment Use LDA to discover topics based on word co- occurrence Rank segments based on similarity to topic

Dataset Note that the paper uses a larger set containing ~ 4000 images (MSRC_v0) MSRC_v2 dataset 23 categories 591 images 1648 objects Distribution of categories in MSRC_v2

Implementation details –Dense sift on edge points and 3 different scales –2000 visual words –8 segmentations using different parameters –~ 40k segments in total –LDA takes ~ 10 mins

Ground Truth Segments ground truth segments are directly used number of topics set to 25 (~ num categories) Top 20 segments in terms of similarity of word distribution to a topic

Ground Truth Segments Number of topics = 25

Ground Truth Segments Number of topics = 50

Ground Truth Segments Number of topics = 75

Quantitative results Overlap score on top 20 segments Average precision (area under precision-recall curve) Ground Truth Segments

Multiple segmentations Normalized cuts –k = {3, 5, 7, 9} –2 resolutions

Multiple segmentations

Multiple segmentations vs. Ground truth

Quantitative results Overlap score on top 20 segments Average precision (area under precision-recall curve) Multiple segmentations

Effect of number of images Overlap score on top 20 segments topics are easier to discover with more object instances

Single segmentation Multiple segmentations vs. Single segmentation Single segmentation returns partial objects for some classes

Single segmentation Multiple segmentations vs. Single segmentation Single segmentation returns partial objects for some classes

Single segmentation Multiple segmentations vs. Single segmentation

Quantitative results Overlap score on top 20 segments Average precision (area under precision-recall curve) Single/Multiple segmentations

Hierarchical segmentation Hierarchical segmentationvs. Multiplesegmentation (Ncuts) Watershed threshold set such there are 12 leaf nodes and entire hierarchical tree is used by LDA

Hierarchical segmentation Hierarchical segmentationvs. Multiplesegmentation (Ncuts)

Hierarchical segmentation Hierarchical segmentationvs. Multiplesegmentation (Ncuts)

Quantitative results Overlap score on top 20 segments Hierarchical segmentation Contour-based watershed method does better for objects with few internal contours (grass, sky) is worse for objects with large number of contours (flower, airplane)

Conclusion Generating multiple segmentations –ncuts and watershed provide different tradeoffs –bottom-up segmentation needs different parameters for different objects Discovering objects using LDA –number of topics matters quite a bit –topics are easier to discover with more examples –multiple segmentation does better than because different objects require different parameters –contour-based watershed method does better for objects with few internal contours