Design and Perceptual Validation of Performance Measures for Salient Object Segmentation Vida Movahedi, James H. Elder Centre for Vision Research York.

Slides:



Advertisements
Similar presentations
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 The Struggle for Network Control: How Can Distributed and Centralized Controls Effectively Collaborate?
Advertisements

Open Archive Forum ECDL2001, (c) Susanne Dobratz, Humboldt-University1 European Support for Open Archives Susanne Dobratz Humboldt-University.
1/31/01 Professor Richard Fikes Frame Representation of Electronic Circuit Example Computer Science Department Stanford University CS222 Winter 2001 Knowledge.
2/13/2014Bucknell University1 Health Care Issues BOF Cindy Bilger,
T. S. Eugene Ng Mellon University1 Towards Global Network Positioning T. S. Eugene Ng and Hui Zhang Department of Computer.
Opole University1 Jerzy Jendrośka Implementing the CCS Directive in Poland: key findings from the transposition process Implementing the EU CO2 Storage.
April 2004NUCAD Northwestern University1 Minimal Period Retiming Under Process Variations Jia Wang and Hai Zhou Electrical & Computer Engineering Northwestern.
Automatic Tuning of Scientific Applications Apan Qasem Ken Kennedy Rice University Houston, TX Apan Qasem Ken Kennedy Rice University Houston, TX.
Now…Public Access Redistricting Open Data Open Access Open Source Prepared for 2011 CGA Conference at Harvard University2.
Ningning HuCarnegie Mellon University1 Towards Tunable Measurement Techniques for Available Bandwidth Ningning Hu, Peter Steenkiste Carnegie Mellon University.
Ningning HuCarnegie Mellon University1 Improving TCP Startup Performance using Active Measurements Ningning Hu, Peter Steenkiste Carnegie Mellon University.
Best PracticesUSCA Fall 2010: Baylor University3.
Teaching Computer Forensics at a Distance HE Academy Workshop on the Teaching of Computer Forensics University of Glamorgan, 27 November 2008 Blaine Price.
9th October 2003James Loken – Oxford University1 SCT X-ray Alignment Software A First Look.
Rob Walker, May 2008Student Learning Unit Victoria University1 Essay Writing A workshop for ASW 3102: Critical Social Work Theories.
RMIT University1 Southern United H.C. Coaching Workshop Nov 2007 Welcome Stop, Reflect and Grow.
Identifying Novice Difficulties in Object Oriented Design Benjy Thomasson Mark Ratcliffe Lynda Thomas Aberystwyth University, Wales, UK.
Tianjin Foreign Studies University1 Harmony or Antagonism, which is the Mainstream in the Library? A Comprehensive Study on E-Book and Print Book.
Spatial Views: Space-aware Programming for Networks of Embedded Systems Yang Ni, Ulrich Kremer, and Liviu Iftode Rutgers University This work has been.
Regular expressions Day 2
BALANCED CACHE Ayşe BAKIR, Zeynep ZENGİN. Ayse Bakır,CMPE 511,Bogazici University2 Outline  Introduction  Motivation  The B-Cache Organization  Experimental.
Benoit Pigneur and Kartik Ariyur School of Mechanical Engineering Purdue University June 2013 Inexpensive Sensing For Full State Estimation of Spacecraft.
CSE202: Lecture 3The Ohio State University1 Assignment.
Direct Data Access, Data Binding. Content Direct Data Access Data Binding Muzaffer DOĞAN - Anadolu University2.
Caroline Rougier, Jean Meunier, Alain St-Arnaud, and Jacqueline Rousseau IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 21, NO. 5,
Recovering Human Body Configurations: Combining Segmentation and Recognition Greg Mori, Xiaofeng Ren, and Jitentendra Malik (UC Berkeley) Alexei A. Efros.
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.
Video Shot Boundary Detection at RMIT University Timo Volkmer, Saied Tahaghoghi, and Hugh E. Williams School of Computer Science & IT, RMIT University.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Active Contour Models (Snakes)
Hierarchical Region-Based Segmentation by Ratio-Contour Jun Wang April 28, 2004 Course Project of CSCE 790.
Efficient Moving Object Segmentation Algorithm Using Background Registration Technique Shao-Yi Chien, Shyh-Yih Ma, and Liang-Gee Chen, Fellow, IEEE Hsin-Hua.
Page-level Template Detection via Isotonic Smoothing Deepayan ChakrabartiYahoo! Research Ravi KumarYahoo! Research Kunal PuneraUniv. of Texas at Austin.
Contents Description of the big picture Theoretical background on this work The Algorithm Examples.
SNAKES Adapted from : Octavia Camps, Penn. State UCF.
Tracking Video Objects in Cluttered Background
1 How do ideas from perceptual organization relate to natural scenes?
Jeremy Wyatt Thanks to Gavin Brown
Presentation By Michael Tao and Patrick Virtue. Agenda History of the problem Graph cut background Compute graph cut Extensions State of the art Continued.
Unsupervised Category Modeling, Recognition and Segmentation Sinisa Todorovic and Narendra Ahuja.
02/08/2015Regional Writing Centre2 02/08/2015Regional Writing Centre3.
Performance Evaluation of Grouping Algorithms Vida Movahedi Elder Lab - Centre for Vision Research York University Spring 2009.
PixelLaser: Range scans from image segmentation Nicole Lesperance ’11 Michael Leece ’11 Steve Matsumoto ’12 Max Korbel ’13 Kenny Lei ’15 Zach Dodds ‘62.
Globally Optimal Grouping for Symmetric Closed Boundaries with Stahl/ Wang Method Vida Movahedi September 2007.
Geodesic Minimal Paths Vida Movahedi Elder Lab, January 2010.
Classifier Evaluation Vasileios Hatzivassiloglou University of Texas at Dallas.
A 3D Model Alignment and Retrieval System Ding-Yun Chen and Ming Ouhyoung.
A B CA’ B’ C’ Similar Shapes The following diagram shows an enlargement by a scale factor 3 of triangle ABC Note Each length on the enlargement A’B’C’
1 Optimal Cycle Vida Movahedi Elder Lab, January 2008.
Automatic Image Annotation by Using Concept-Sensitive Salient Objects for Image Content Representation Jianping Fan, Yuli Gao, Hangzai Luo, Guangyou Xu.
EE459 Neural Networks Examples of using Neural Networks Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Image-Based Segmentation of Indoor Corridor Floors for a Mobile Robot Yinxiao Li and Stanley T. Birchfield The Holcombe Department of Electrical and Computer.
A Critique and Improvement of an Evaluation Metric for Text Segmentation A Paper by Lev Pevzner (Harvard University) Marti A. Hearst (UC, Berkeley) Presented.
A Multiresolution Symbolic Representation of Time Series Vasileios Megalooikonomou Qiang Wang Guo Li Christos Faloutsos Presented by Rui Li.
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],
CSSE463: Image Recognition Day 25 Today: introduction to object recognition: template matching Today: introduction to object recognition: template matching.
PROBABILISTIC DETECTION AND GROUPING OF HIGHWAY LANE MARKS James H. Elder York University Eduardo Corral York University.
SUMMERY 1. VOLUMETRIC FEATURES FOR EVENT DETECTION IN VIDEO correlate spatio-temporal shapes to video clips that have been automatically segmented we.
Semantic Alignment Spring 2009 Ben-Gurion University of the Negev.
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
Shape2Pose: Human Centric Shape Analysis CMPT888 Vladimir G. Kim Siddhartha Chaudhuri Leonidas Guibas Thomas Funkhouser Stanford University Princeton University.
Hierarchical Clustering: Time and Space requirements
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering Northern Arizona University.
Investigating the Hausdorff Distance
Enhanced-alignment Measure for Binary Foreground Map Evaluation
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
Cyclic string-to-string correction
CSSE463: Image Recognition Day 25
Outline Announcement Perceptual organization, grouping, and segmentation Hough transform Read Chapter 17 of the textbook File: week14-m.ppt.
Saliency Optimization from Robust Background Detection
Presentation transcript:

Design and Perceptual Validation of Performance Measures for Salient Object Segmentation Vida Movahedi, James H. Elder Centre for Vision Research York University, Canada

Evaluation of Salient Object Segmentation Centre for Vision Research, York University2 Source: Berkeley Segmentation Dataset

Evaluation of Salient Object Segmentation Centre for Vision Research, York University3 How do we measure success?

Existing literature  Salient object segmentation  [Liu07, Zhang07, Park07, Zhuang09, Achanta09, Pirnog09, …]  Evaluation of salient object segmentation algorithms  [Ge06,?]  Evaluation of segmentation algorithms  [Huang95, Zhang96, Martin01, Monteiro06, Goldmann08, Estrada09] Centre for Vision Research, York University4

Contributions Centre for Vision Research, York University5  Analysis of previously suggested measures  Contour Mapping Measure (CM)  Order-preserving matching  A new dataset of salient objects (SOD)  Psychophysics experiments  Evaluation of above measures  Matching paradigm in Precision and Recall measures

Evaluation measures in literature Centre for Vision Research, York University6  Region-based error measures  Based on false positive/ false negative pixels  [Young05], [Ge06], [Goldmann08],...  Boundary-based error measures  Based on distance between boundaries  [Huttenlocher93], [Monteiro06],...  Mixed measures  Based on distance of misclassified pixels to the boundaries  [Young05], [Monteiro06],...

Region-based error measures [Young05], [Ge06], [Goldmann08],... Centre for Vision Research, York University7  A and B two boundaries  R A the region corresponding to a boundary A and |R A | the area of this region, False NegativesFalse Positives Not sensitive to shape differences

Boundary-based error measures [Huang95],[Huttenlocher93], [Monteiro06],... Centre for Vision Research, York University8  A and B two boundaries  Distance of one point a on A from B is  Hausdorff distance:  Mean distance: Not sensitive to shape differences a

 Penalizing the over-detected and under-detected regions by their distances to intersection Mixture error measures [Young05], [Monteiro06],... Centre for Vision Research, York University9 False NegativesFalse Positives Not sensitive to shape difference

Another example Centre for Vision Research, York University10 Different shapes with low errors

Comparing two boundaries Centre for Vision Research, York University11  The two boundaries need to follow each other  Thus it is not sufficient to map points to the closest point on the other boundary  The ordering of mapped points must be preserved Small False Negative Region Small False Positive Region

 The order of mapped points on the two boundaries must be monotonically non-decreasing.  Allowing for different levels of detail:  One-to-one  Many-to-one  One-to-many Order-preserving Mapping Centre for Vision Research, York University12

Contour Mapping Measure Centre for Vision Research, York University13  Given two contours A=a 1 a 2..a n and B=b 1 b 2..b m,  Find the correct order-preserving mapping Contour mapping error measure: Average distance between matched pairs of points  Bimorphism [Tagare02]  Elastic Matching [Geiger95, Basri98, Sebastian03,..]

 A dynamic programming implementation to find the optimum mapping  Closed contours  point indices are assigned cyclically  Based on string correction techniques [Maes90]  Complexity: if m<n and m, n points on two boundaries Contour Mapping Measure Centre for Vision Research, York University14

Contour Mapping Example Centre for Vision Research, York University15 Ground Truth BoundaryAlgorithm Boundary Matched pairs shown as line segments CM= average length of line segments connecting matched pairs

Contour Mapping Measure  Order- preserving mapping avoids problems experienced by other measures Centre for Vision Research, York University16

SOD: Salient Object Dataset Centre for Vision Research, York University17  A dataset of salient objects  Based on Berkeley Segmentation Dataset (BSD) [Martin01]  300 images  7 subjects Source: Berkeley Segmentation DatasetAvailable in SOD

Psychophysical experiments Centre for Vision Research, York University18  Which error measure is closer to human judgements of shape similarity?  9 subjects  5 error measures  Regional Intersection (RI)  Mean distance (MD)  Hausdorff distance (HD)  Mixed distance (MM)  Contour Mapping (CM)

Psychophysical Experiments Experiment 1 - SOD Reference & test shapes all from SOD Experiment 2 - ALG Reference from SOD, test shapes algorithm-generated Centre for Vision Research, York University19 Reference: Human segmentation Test cases: Algorithm- generated Test cases: Human segmentations Reference: Human segmentation

Agreement with Human Subjects  Human subject chooses Left or Right  An error measure M also chooses Left or Right, based on their error w.r.t. the reference shape  If M chooses the same as the human, it is a case of agreement  Human-Human consistency: defined based on agreement between human subjects Centre for Vision Research, York University20 Left Right Reference

Psychophysical Experiments Centre for Vision Research, York University21 Experiment 1- SOD Reference & tests shapes all from SOD Experiment 2 - ALG Reference from SOD, test shapes algorithm-generated RI: region intersection, MD: mean distance, HD: Hausdorff distance, MM: mixed measure, CM: contour mapping

Precision and Recall measures Centre for Vision Research, York University22  For algorithm boundary A and ground truth boundary B  Precision: proportion of true positives on A  Recall:proportion of detected points on B  Martin’s PR (M-PR) [Martin04]  Minimum cost bipartite matching, cost proportional to distance  Estrada’s PR (E-PR) [Estrada09]  ‘No intervening contours’ and ‘Same side’ constraints  Contour Mapping PR (CM-PR)  Order-preserving mapping

Matching paradigm in Precision/Recall Centre for Vision Research, York University23 Experiment 1- SOD Reference & test shapes all from SOD Experiment 2 - ALG Reference from SOD, test shapes algorithm-generated

Summary Centre for Vision Research, York University24  Analysis of available measures for evaluation of salient object segmentation algorithms  A new measure- contour mapping measure (CM)  Code available online:  A new dataset of salient objects  Dataset available online :  Psychophysical Experiment  CM has a higher agreement with human subjects  Order-preserving matching paradigm in Precision/Recall analysis  Code available online:

Centre for Vision Research, York University25 Thank You!