Learning issues in image segmentation
Description
Image segmentation is often defined as a partitioning of pixels or image blocks into homogeneous groups. These groups are characterized by a prototypical vector in feature space, e.g., the space of Gabor filter responses, by a prototypical histograms of features or by pairwise dissimilarities between image blocks. For all three data formats cost functions have been proposed to measure distortion and, thereby, to encode the quality of a partition. Learning in image segmentation can be defined as the inference of prototypical descriptors of segments like codebook vectors or average feature probability within a segment. Contrary to classification or regression, the empirical risk of image segmentation is often composed of sums of dependent random variables like in Normalized Cut, Pairwise Clustering or k-means clustering with smoothness constraints. One of the core challenges for machine learning is to discover what kind of information can be learned from these data sources assuming MRF cost functions as image models. The validation procedure for image segmentations strongly depends on this issue. I will demonstrate the learning and validation issue in the context of image analysis based on color and texture features.
| Slides | |
| 0:00 | Learning Issues in & Image Segmentation |
| 0:50 | The Problem of Data Clustering |
| 3:09 | Application: Image segmentation |
| 6:42 | Clustering Approach to Image Segmentation |
| 7:24 | Problem Formalization |
| 8:44 | Cost Function Idea |
| 12:00 | Cost Function-Based Clustering |
| 15:18 | Cost Function Optimization |
| 16:48 | Extension |
| 18:51 | Unsupervised vs. supervised |
| 20:17 | What is Data Clustering? |
| 21:19 | Generalization Problem in Classification |
| 23:46 | Structure of the Tutorial |
| 25:15 | Data Types in Clustering Problems |
| 26:44 | Part I: Clustering Principles |
| 30:27 | Vectorial Data: |
| 30:39 | k-Means Problem |
| 32:12 | k-Means Algorithm |
| 32:46 | k-Means Segmentation of LANDSAT Images |
| 35:38 | Example Mixture Model |
| 36:04 | Parametric Distributional Clustering |
| 36:31 | Parametric Distributional Clustering |
| 36:34 | Parametric Distributional Clustering |
| 37:05 | Parametric Distributional Clustering |
| 37:37 | Gaussian Mixture Models |
| 38:25 | Gaussian Mixture Models |
| 38:53 | Gaussian Mixture Models |
| 39:01 | Gaussian Mixture Models |
| 39:03 | Gaussian Mixture Models |
| 39:04 | Gaussian Mixture Models |
| 39:09 | Gaussian Mixture Models |
| 39:12 | Gaussian Mixture Models |
| 39:14 | Gaussian Mixture Models |
| 39:19 | Gaussian Mixture Models |
| 39:20 | Gaussian Mixture Models |
| 39:22 | Gaussian Mixture Models |
| 39:30 | Gaussian Mixture Models |
| 39:53 | Generative Model |
| 40:35 | Maximum Likelihood Approach |
| 41:43 | Cost Function for PDC |
| 43:30 | Information Bottleneck |
| 45:04 | Information Bottleneck |
| 46:15 | PDC Segmentation |
| 46:20 | PDC Segmentation |
| 47:06 | PDC Resampling |
| 47:39 | SAR Imagery |
| 47:59 | Proximity Data |
| 55:04 | Proximity Data: Example |
| 55:11 | Proximity Data in Segmentation |
| 56:46 | The Pairwise Clustering Cost Function |
| 58:21 | Invariance Properties of Hpc |
| 59:57 | Constant Shift Embedding |
| 63:00 | Clustering of Bacterial GyrB Sequences |
| 63:49 | Globin Proteins: Cluster Solution |
| 63:55 | Normalized Cut |
| 66:02 | Relaxation of NCut |
| 67:26 | Example Normalized Cut |
| 68:47 | Part II: Optimization Methods |
| 70:19 | The Maximum Entropy Principle |
| 71:15 | Metropolis Sampler for Clustering |
| 72:42 | Algorithm Design for Maximum Entropy Estimation |
| 73:23 | Phase Transitions in K-means Clustering |
| 74:36 | Cooling Dynamics of PDC |
| 75:02 | Cooling Dynamics of PDC |
| 75:29 | Cooling Dynamics of PDC |
| 75:30 | Cooling Dynamics of PDC |
| 75:32 | Cooling Dynamics of PDC |
| 75:41 | Cooling Dynamics of PDC |
| 75:42 | Cooling Dynamics of PDC |
| 75:42 | Cooling Dynamics of PDC |
| 75:59 | Phase Transitions in Segmentation |
| 76:50 | Part III: Cluster Validation |
| 78:50 | The Problem of Cluster Validity |
| 79:52 | Validation Methods ... |
| 81:00 | Complexity-based Validation |
| 81:31 | Underlying Principle |
| 82:18 | BIC Validation of a Mixture |
| 82:44 | Stability-based Validation |
| 84:24 | Stability |
| 85:15 | Two Sample Scenario |
| 86:36 | Measuring disagreement |
| 87:48 | Stability Measure: Labelings on disjoint sets |
| 89:32 | Stability Measure: Breaking Permutation Symmetry |
| 89:59 | Stability Measure: Different Values of k |
| 90:36 | The Final Stability Measure |
| 92:12 | Results on Toy Data |
| 93:42 | Class Discovery |
| 94:16 | Clustering of Globins |
| 94:34 | Stability: Summary |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




