Exploring the Parameter Space of Image Segmentation Algorithms Talk at NCHU 2010 - p 1 TexPoint fonts used in EMF. Read the TexPoint manual before you.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

MASTERS THESIS By: Rahul Suresh
Image Repairing: Robust Image Synthesis by Adaptive ND Tensor Voting IEEE Computer Society Conference on Computer Vision and Pattern Recognition Jiaya.
E.G.M. PetrakisImage Segmentation1 Segmentation is the process of partitioning an image into regions –region: group of connected pixels with similar properties.
Carolina Galleguillos, Brian McFee, Serge Belongie, Gert Lanckriet Computer Science and Engineering Department Electrical and Computer Engineering Department.
1Ellen L. Walker ImageJ Java image processing tool from NIH Reads / writes a large variety of images Many image processing operations.
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Lecture 07 Segmentation Lecture 07 Segmentation Mata kuliah: T Computer Vision Tahun: 2010.
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.
Machine Learning and Data Mining Clustering
Kapitel 13 “Interactive Segmentation” – p. 1 Interactive Segmentation  Live-wire approach  Random walker segmentation TexPoint fonts used in EMF. Read.
Texture Segmentation Based on Voting of Blocks, Bayesian Flooding and Region Merging C. Panagiotakis (1), I. Grinias (2) and G. Tziritas (3)
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Lecture 6 Image Segmentation
Clustering II.
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
EE 7730 Image Segmentation.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
Rodent Behavior Analysis Tom Henderson Vision Based Behavior Analysis Universitaet Karlsruhe (TH) 12 November /9.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Radial Basis Function Networks
Super-Resolution of Remotely-Sensed Images Using a Learning-Based Approach Isabelle Bégin and Frank P. Ferrie Abstract Super-resolution addresses the problem.
Tal Mor  Create an automatic system that given an image of a room and a color, will color the room walls  Maintaining the original texture.
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
Image Renaissance Using Discrete Optimization Cédric AllèneNikos Paragios ENPC – CERTIS ESIEE – A²SI ECP - MAS France.
Interactive Image Segmentation of Non-Contiguous Classes using Particle Competition and Cooperation Fabricio Breve São Paulo State University (UNESP)
Presented by: Kamakhaya Argulewar Guided by: Prof. Shweta V. Jain
Chapter 10: Image Segmentation
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
Graph-based Segmentation. Main Ideas Convert image into a graph Vertices for the pixels Vertices for the pixels Edges between the pixels Edges between.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
EE 492 ENGINEERING PROJECT LIP TRACKING Yusuf Ziya Işık & Ashat Turlibayev Yusuf Ziya Işık & Ashat Turlibayev Advisor: Prof. Dr. Bülent Sankur Advisor:
Lecture 2: Edge detection CS4670: Computer Vision Noah Snavely From Sandlot ScienceSandlot Science.
Automatic Minirhizotron Root Image Analysis Using Two-Dimensional Matched Filtering and Local Entropy Thresholding Presented by Guang Zeng.
Supervised Learning of Edges and Object Boundaries Piotr Dollár Zhuowen Tu Serge Belongie.
EECS 274 Computer Vision Segmentation by Clustering II.
CSC508 What You Should Be Doing Code, code, code –Programming Gaussian Convolution Sobel Edge Operator.
Pattern Recognition April 19, 2007 Suggested Reading: Horn Chapter 14.
A Region Based Stereo Matching Algorithm Using Cooperative Optimization Zeng-Fu Wang, Zhi-Gang Zheng University of Science and Technology of China Computer.
Image Segmentation and Edge Detection Digital Image Processing Instructor: Dr. Cheng-Chien LiuCheng-Chien Liu Department of Earth Sciences National Cheng.
CS654: Digital Image Analysis
A split-and-merge framework for 2D shape summarization D. Gerogiannis, C. Nikou and A. Likas Department of Computer Science, University of Ioannina, Greece.
Image-Based Segmentation of Indoor Corridor Floors for a Mobile Robot Yinxiao Li and Stanley T. Birchfield The Holcombe Department of Electrical and Computer.
Machine Learning and Data Mining Clustering (adapted from) Prof. Alexander Ihler TexPoint fonts used in EMF. Read the TexPoint manual before you delete.
Image Segmentation Superpixel methods Speaker: Hsuan-Yi Ko.
Edge Based Segmentation Xinyu Chang. Outline Introduction Canny Edge detector Edge Relaxation Border Tracing.
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],
Machine Vision ENT 273 Regions and Segmentation in Images Hema C.R. Lecture 4.
November 5, 2013Computer Vision Lecture 15: Region Detection 1 Basic Steps for Filtering in the Frequency Domain.
Course 5 Edge Detection. Image Features: local, meaningful, detectable parts of an image. edge corner texture … Edges: Edges points, or simply edges,
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Cell Segmentation in Microscopy Imagery Using a Bag of Local Bayesian Classifiers Zhaozheng Yin RI/CMU, Fall 2009.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
Unsupervised Classification
Martina Uray Heinz Mayer Joanneum Research Graz Institute of Digital Image Processing Horst Bischof Graz University of Technology Institute for Computer.
Deep Learning Overview Sources: workshop-tutorial-final.pdf
Shadow Detection in Remotely Sensed Images Based on Self-Adaptive Feature Selection Jiahang Liu, Tao Fang, and Deren Li IEEE TRANSACTIONS ON GEOSCIENCE.
Course : T Computer Vision
Computer Vision Lecture 13: Image Segmentation III
Mean Shift Segmentation
Computer Vision Lecture 12: Image Segmentation II
Dynamical Statistical Shape Priors for Level Set Based Tracking
Other Algorithms Follow Up
Detecting Artifacts and Textures in Wavelet Coded Images
Jeremy Bolton, PhD Assistant Teaching Professor
Computer Vision Lecture 9: Edge Detection II
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
EE 492 ENGINEERING PROJECT
“Traditional” image segmentation
Presentation transcript:

Exploring the Parameter Space of Image Segmentation Algorithms Talk at NCHU p 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA Xiaoyi Jiang Department of Mathematics and Computer Science University of Münster Germany

Talk at NCHU p 2 Typical approaches:  Not consider the problem at all  “We have experimentally determined the parameter values ……“  Supervised: training of parameter values based on training images with (manually specified) ground truth  Unsupervised: based on heuristics to measure segmentation quality How to deal with parameters?

Talk at NCHU p 3 Drawbacks:  “We have experimentally determined ……“  Who believes that?  Supervised: training of parameter values based on GT  GT not always available  trained parameters not optimal for a particular image  Unsupervised: based on self-judgement heuristics  still no good solution for self-judgement How to deal with parameters?

Talk at NCHU p 4 Basic assumption: Known reasonable range of good values for each parameter Our intention: explore the parameter subspace without GT  A: investigate local behavior of parameters  B: adaptively compute an “optimal“ segmentation within a parameter subspace (construction approach)  C: adaptively select an “optimal“ parameter setting within a subspace (selection approach) How to deal with parameters?

Talk at NCHU p 5 Natural landscape p1p1 p2p2 Quality measure optimal parameters

Talk at NCHU p 6 A. Investigate local behavior of parameters Belief: There is a subspace of good parameter values Reality: Yes, but there are local outliers within such a subspace!

Talk at NCHU p 7 A. Investigate local behavior of parameters Felzenszwalb / Huttenlocher: Efficient graph-based image segmentation. Int. J. Computer Vision 59 (2004) 167–181

Talk at NCHU p 8 A. Investigate local behavior of parameters Close-up: NMI = 0.70 NMI = 0.26

Talk at NCHU p 9 A. Investigate local behavior of parameters Deng / Manjunath: Unsupervised segmentation of color- texture regions in images and video. IEEE T-PAMI 23 (2001) 800–810 (JSEG) NMI = 0.61NMI = 0.76

Talk at NCHU p 10 A. Investigate local behavior of parameters Frequency study on Berkeley image set: Strong (weak) outliers = segmentation results with NMI lower than 15% (10%) of the maximum NMI of the current image ensemble (5x5 subspace) FH JSEG

Talk at NCHU p 11 A. Investigate local behavior of parameters Danger: There are local outliers (salt-and-pepper noise)! Solution: similar to median filtering : Segmentations around some parameter setting : distance function between segmentations Set median:

Talk at NCHU p 12 A. Investigate local behavior of parameters FH: best worst set median

Talk at NCHU p 13 A. Investigate local behavior of parameters JSEG:

Talk at NCHU p 14 B: Adaptively compute an “optimal“ segmentation Belief: There is a reasonable subspace of good parameter values. Some optimal parameter setting can be determined by experiments or training. Reality: Yes, but this parameter setting is not optimal for a particular image!

Talk at NCHU p 15 B: Adaptively compute an “optimal“ segmentation Exactly the same parameter set applied to two images

Talk at NCHU p 16 B: Adaptively compute an “optimal“ segmentation Segmentation ensemble technique:  Use a sampled parameter subspace to compute an ensemble of segmentations  Compute a final segmentation based on S This combined segmentation tends to be a good one within the explored parameter subspace

Talk at NCHU p 17 B: Adaptively compute an “optimal“ segmentation

Talk at NCHU p 18 L.Grady: Random walks for image segmentation. IEEE-TPAMI, 28: 1768–1783, 2006 Excursus: Random walker based segmentation 18 (a) A two-region image(b) Use-defined seeds for each region (c) A 4-connected lattice topology seeded (labeled) pixelsunseeded (unlabeled) pixel edge weight: similarity between two nodes, based on e.g., intensity gradient, color changes (d) An undirected weighted graph low-weight edge (sharp color gradient)

Talk at NCHU p 19 The algorithm labels an unseeded pixel in following steps: Step 1. Calculate the probability that a random walker starting at an unseeded pixel x first reaches a seed with label s Excursus: Random walker based segmentation 19 Probability that a random walker starting from each unseeded node first reaches red seed Probability that a random walker starting from each unseeded node first reaches blue seed

Talk at NCHU p 20 Step 2. Label each pixel with the most probable seed destination Excursus: Random walker based segmentation 20 (0.97,0.03)(0.90,0.10)(0.85,0.15)(0.15,0.85) (0.10,0.90)(0.03,0.97) (0.97,0.03)(0.85,0.15)(0.15,0.85) (0.03,0.97) (0.97,0.03)(0.90,0.10)(0.85,0.15)(0.15,0.85) (0.10,0.90)(0.03,0.97) A segmentation corresponding to region boundary is obtained by biasing the random walker to avoid crossing sharp color gradients

Talk at NCHU p 21 Excursus: Random walker based segmentation Original Seeds indicating four objects Resulting segmentation Label 1 probabilities Label 2 probabilities Label 3 probabilities Label 4 probabilities

Talk at NCHU p 22 B: Adaptively compute an “optimal“ segmentation Connection to random walker based segmentation:  The input segmentations provide strong hints about where to automatically place some seeds  Then, the same situation as image segmentation with manually specified seeds  apply the random walker algorithm to achieve a final segmentation Random walker based segmentation ensemble technique:  Generate a graph from input segmentations  Extract seed regions  Compute a final combined segmentation result

Talk at NCHU p 23 B: Adaptively compute an “optimal“ segmentation Graph generation:  Weight e ij in G: indicate how probably two pixels p i and p j belong to the same image region  Solution: Counting number n ij of initial segmentations, in which p i and p j share the same region label. Then, we define the weight function as a Gaussian weighting: w ij = exp [-β (1- n ij /N)]

Talk at NCHU p 24 B: Adaptively compute an “optimal“ segmentation Candidate seed region extraction: We build a new graph G * by preserving those edges with weight w ij = 1 only (p i and p j have the same label in all initial segmentations) and removing all other edges. Then, all connected subgraphs in G * build the initial seed regions. Grouping candidate seed regions: A reduction of seed regions is performed by iteratively merging the two closest candidate seed regions until some termination criterion (thresholding) is satisfied. Optimization of K (number of seed regions): Based on an approximation of generalized median segmentation by investigating the subspace consisting of the combination segmentations for all possible K 2 [K min,K max ] only.

Talk at NCHU p 25 B: Adaptively compute an “optimal“ segmentation graph G initial seeds final result (optimal K)

Talk at NCHU p 26 B: Adaptively compute an “optimal“ segmentation worst / median / best input segmentation  combination segmentation

Talk at NCHU p 27 B: Adaptively compute an “optimal“ segmentation Comparison (per image): Worst / best / average input & combination

Talk at NCHU p 28 B: Adaptively compute an “optimal“ segmentation f(n): Number of images for which the combination result is worse than the best n input segmentations Ensemble technique outperforms all 24 input segmentations in 78 cases. For 70% (210) of all 300 test images, the goodness of our solution is beaten by at most 5 input segmentations only.

Talk at NCHU p 29 B: Adaptively compute an “optimal“ segmentation Comparison: Average performance for all 300 test images (for each of 24 parameter settings)

Talk at NCHU p 30 B: Adaptively compute an “optimal“ segmentation The dream must go on! DreamDream

Talk at NCHU p 31 Additional applications:  2.5D range image segmentation  detect double contours by dynamic programming (layer of intima and adventitia for computing the intima-media thickness) B: Adaptively compute an “optimal“ segmentation

Talk at NCHU p 32 B: Adaptively compute an “optimal“ segmentation Segmenter combination: There exists no universal segmentation algorithm that can successfully segment all images. It is not easy to know the optimal algorithm for one particular image. Instead of looking for the best segmenter which is hardly possible on a per-image basis, now we look for the best segmenter combiner. Instead of looking for the best set of features and the best classifier, now we look for the best set of classifiers and then the best combination method. Ho, 2002

Talk at NCHU p 33 Belief: There are heuristics to measure segmentation quality Reality: Yes, but optimizing such heuristic do not necessarily correspond to segmentations perceived by humans! C: Adaptively select an optimal parameter setting

Talk at NCHU p 34 C: Adaptively select an optimal parameter setting Observations: Different segmenters tend to produce similar good segmentations, but dissimilar bad segmentations (The subspace of bad segmentations is substantially larger than the subspace of good segmentations)  Compare segmentation results of different segmenters and figure out good segmentations by means of similarity tests

Talk at NCHU p 35 C: Adaptively select an optimal parameter setting

Talk at NCHU p 36 C: Adaptively select an optimal parameter setting Outline of the framework:  Compute for each segmentation algorithm N segmentations  Compute an N × N similarity matrix by comparing each segmentation of the first algorithm with each segmentation of the second algorithm  Determine the best parameter setting from the similarity matrix

Talk at NCHU p 37 C: Adaptively select an optimal parameter setting Weaker segmenter CSC benefits from stronger FH/JSEG

Talk at NCHU p 38 C: Adaptively select an optimal parameter setting Also FH benefits from weaker CSC

Talk at NCHU p 39 C: Adaptively select an optimal parameter setting Also JSEG benefits from weaker CSC

Talk at NCHU p 40 Conclusions Basic assumption: Known reasonable range of good values for each parameter Our intention: Explore the parameter subspace without GT A: investigate local behavior of parameters B: adaptively compute an “optimal“ segmentation within a parameter subspace C: adaptively select an optimal parameter setting within a subspace on a per image basis

Talk at NCHU p 41 Conclusions We could demonstrate:  A: Local outliers can be successfully removed by set median operator  B: The combination performance tends to reach the best input segmentation; in some cases the combined segmentation even outperforms the entire input ensemble  C: Segmenters can help each other for selecting good parameter values

Talk at NCHU p 42 Conclusions Combination (ensemble) techniques:  Generalized median: Strings, graphs, clusterings, …  Multiple classifier systems  ……  Combining image segmentations Three cobblers combined equal the master mind - Chinese proverb - gracias