Segmentation and Boundary Detection Using Multiscale Intensity Measurements Eitan Sharon, Meirav Galun, Ronen Basri, Achi Brandt Dept. of Computer Science.

Slides:

Advertisements

Similar presentations

Active Shape Models Suppose we have a statistical shape model –Trained from sets of examples How do we use it to interpret new images? Use an “Active Shape.

Advertisements

Top-Down & Bottom-Up Segmentation

Top-Down & Bottom Up Segmentation

Recovering Human Body Configurations: Combining Segmentation and Recognition Greg Mori, Xiaofeng Ren, and Jitentendra Malik (UC Berkeley) Alexei A. Efros.

MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA

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.

Biased Normalized Cuts 1 Subhransu Maji and Jithndra Malik University of California, Berkeley IEEE Conference on Computer Vision and Pattern Recognition.

Matching with Invariant Features

Computer Vision Group, University of BonnVision Laboratory, Stanford University Abstract This paper empirically compares nine image dissimilarity measures.

The Visual Recognition Machine Jitendra Malik University of California at Berkeley Jitendra Malik University of California at Berkeley.

Lecture 6 Image Segmentation

Stas Goferman Lihi Zelnik-Manor Ayellet Tal. …

Image segmentation. The goals of segmentation Group together similar-looking pixels for efficiency of further processing “Bottom-up” process Unsupervised.

Algorithms & Applications in Computer Vision Lihi Zelnik-Manor Lecture 11: Structure from Motion.

Segmentation. Terminology Segmentation, grouping, perceptual organization: gathering features that belong together Fitting: associating a model with observed.

Robust Higher Order Potentials For Enforcing Label Consistency

Fast, Multiscale Image Segmentation: From Pixels to Semantics Ronen Basri The Weizmann Institute of Science Joint work with Achi Brandt, Meirav Galun,

Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.

Image Segmentation Chapter 14, David A. Forsyth and Jean Ponce, “Computer Vision: A Modern Approach”.

Direct Methods for Visual Scene Reconstruction Paper by Richard Szeliski & Sing Bing Kang Presented by Kristin Branson November 7, 2002.

Segmentation Kyongil Yoon. Segmentation Obtain a compact representation of what is helpful (in the image) No comprehensive theory of segmentation Human.

Region-based Voting Exemplar 1 Query 1 Exemplar 2.

Computer Vision Introduction to Image formats, reading and writing images, and image environments Image filtering.

Snakes Goes from edges to boundaries. Edge is strong change in intensity. Boundary is boundary of an object. –Smooth (more or less) –Closed. –…

Berkeley Vision GroupNIPS Vancouver Learning to Detect Natural Image Boundaries Using Local Brightness,

Efficient Spatiotemporal Grouping Using the Nyström Method Charless Fowlkes, U.C. Berkeley Serge Belongie, U.C. San Diego Jitendra Malik, U.C. Berkeley.

Cutting complete weighted graphs Jameson Cahill Ido Heskia Math/CSC 870 Spring 2007.

WORD-PREDICTION AS A TOOL TO EVALUATE LOW-LEVEL VISION PROCESSES Prasad Gabbur, Kobus Barnard University of Arizona.

Segmentation and Perceptual Grouping Kaniza (Introduction to Computer Vision, )

Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.

Lecture#6: segmentation Anat Levin Introduction to Computer Vision Class Fall 2009 Department of Computer Science and App math, Weizmann Institute of Science.

Research at Intel Distributed Localization of Modular Robot Ensembles Robotics: Science and Systems 25 June 2008 Stanislav Funiak, Michael Ashley-Rollman.

Segmentation and Perceptual Grouping. The image of this cube contradicts the optical image.

Perceptual Organization: Segmentation and Optical Flow.

Opportunities of Scale, Part 2 Computer Vision James Hays, Brown Many slides from James Hays, Alyosha Efros, and Derek Hoiem Graphic from Antonio Torralba.

Segmentation and Perceptual Grouping The problem Gestalt Edge extraction: grouping and completion Image segmentation.

Segmentation and Boundary Detection Using Multiscale Measurements Ronen Basri Achi Brandt Meirav Galun Eitan Sharon.

Introduction of Saliency Map

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.

~5,617,000 population in each state

Image Segmentation Image segmentation is the operation of partitioning an image into a collection of connected sets of pixels. 1. into regions, which usually.

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.

Segmentation and Grouping Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/23/10.

Computer Vision James Hays, Brown

Region Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided K-means Clustering (text) EM Clustering (paper) Graph Partitioning (text)

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

1 Contours and Junctions in Natural Images Jitendra Malik University of California at Berkeley (with Jianbo Shi, Thomas Leung, Serge Belongie, Charless.

Multiscale Symmetric Part Detection and Grouping Alex Levinshtein, Sven Dickinson, University of Toronto and Cristian Sminchisescu, University of Bonn.

Cut-based & divisive clustering Clustering algorithms: Part 2b Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern.

Detecting Curved Symmetric Parts using a Deformable Disc Model Tom Sie Ho Lee, University of Toronto Sanja Fidler, TTI Chicago Sven Dickinson, University.

CSE 185 Introduction to Computer Vision Pattern Recognition 2.

1 Optimal Cycle Vida Movahedi Elder Lab, January 2008.

Representations for object class recognition David Lowe Department of Computer Science University of British Columbia Vancouver, Canada Sept. 21, 2006.

CS654: Digital Image Analysis

Computer Vision Lecture #10 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical.

Geodesic Saliency Using Background Priors

Associative Hierarchical CRFs for Object Class Image Segmentation

Object Recognition by Integrating Multiple Image Segmentations Caroline Pantofaru, Cordelia Schmid, Martial Hebert ECCV 2008 E.

Image segmentation.

Saliency detection with background model

Saliency detection Donghun Yeo CV Lab..

Mean Shift Segmentation

Color-Texture Analysis for Content-Based Image Retrieval

Image gradients and edges

Paper Presentation: Shape and Matching

Efficient Graph Cut Optimization for Full CRFs with Quantized Edges

Clustering appearance and shape by Jigsaw, and comparing it with Epitome. Papers (1) Clustering appearance and shape by learning jigsaws (2006 NIPS) (2)

Announcements Project 1 is out today help session at the end of class.

Presentation transcript:

Segmentation and Boundary Detection Using Multiscale Intensity Measurements Eitan Sharon, Meirav Galun, Ronen Basri, Achi Brandt Dept. of Computer Science and Applied Mathematics The Weizmann Institute of Science

Eitan Sharon - Weizmann Institute Image Segmentation

Eitan Sharon - Weizmann Institute Local Uncertainty

Eitan Sharon - Weizmann Institute Global Certainty

Eitan Sharon - Weizmann Institute Local Uncertainty

Eitan Sharon - Weizmann Institute Global Certainty

Eitan Sharon - Weizmann Institute Coarse Measurements for Texture

Eitan Sharon - Weizmann Institute A Chicken and Egg Problem Problem: Coarse measurements mix neighboring statistics Solution: support of measurements is determined as the segmentation process proceeds

Eitan Sharon - Weizmann Institute  Normalized-cuts measure in graphs  Complete hierarchy in linear time  Use multiscale measures of intensity, texture, shape, and boundary integrity Segmentation by Weighted Aggregation

Eitan Sharon - Weizmann Institute  Normalized-cuts measure in graphs  Complete hierarchy in linear time  Use multiscale measures of intensity, texture, shape, and boundary integrity Segmentation by Weighted Aggregation

Eitan Sharon - Weizmann Institute Segmentation by Weighted Aggregation  Normalized-cuts measure in graphs  Complete hierarchy in linear time  Use multiscale measures of intensity, texture, shape and boundary integrity

Eitan Sharon - Weizmann Institute The Pixel Graph Couplings Reflect intensity similarity Low contrast – strong coupling High contrast – weak coupling

Eitan Sharon - Weizmann Institute Hierarchical Graph

Eitan Sharon - Weizmann Institute Hierarchy in SWA

Eitan Sharon - Weizmann Institute Normalized-Cut Measure

Eitan Sharon - Weizmann Institute Normalized-Cut Measure

Eitan Sharon - Weizmann Institute Normalized-Cut Measure

Eitan Sharon - Weizmann Institute Normalized-Cut Measure Minimize:

Eitan Sharon - Weizmann Institute Normalized-Cut Measure High-energy cut Minimize:

Eitan Sharon - Weizmann Institute Normalized-Cut Measure Low-energy cut Minimize:

Eitan Sharon - Weizmann Institute Recursive Coarsening

Eitan Sharon - Weizmann Institute Recursive Coarsening Representative subset

Eitan Sharon - Weizmann Institute Recursive Coarsening For a salient segment :, sparse interpolation matrix

Eitan Sharon - Weizmann Institute Weighted Aggregation aggregate

Eitan Sharon - Weizmann Institute Segment Detection

Eitan Sharon - Weizmann Institute SWA Linear in # of points (a few dozen operations per point) Detects the salient segments Hierarchical structure

Eitan Sharon - Weizmann Institute Coarse-Scale Measurements Average intensities of aggregates Multiscale intensity-variances of aggregates Multiscale shape-moments of aggregates Boundary alignment between aggregates

Eitan Sharon - Weizmann Institute Adaptive vs. Rigid Measurements Averaging Our algorithm - SWA Geometric Original

Eitan Sharon - Weizmann Institute Our algorithm - SWA Adaptive vs. Rigid Measurements Interpolation Geometric Original

Eitan Sharon - Weizmann Institute Recursive Measurements: Intensity aggregate intensity of pixel i average intensity of aggregate

Eitan Sharon - Weizmann Institute Use Averages to Modify the Graph

Eitan Sharon - Weizmann Institute Use Averages to Modify the Graph

Eitan Sharon - Weizmann Institute Texture Examples

Eitan Sharon - Weizmann Institute Isotropic and Oriented Filters Textons by K-Means Malik et al IJCV2001 A brief tutorial

Eitan Sharon - Weizmann Institute Isotropic Texture in SWA Intensity Variance Isotropic Texture of aggregate – average of variances in all scales

Eitan Sharon - Weizmann Institute Isotropic Texture in SWA Intensity Variance Isotropic Texture of aggregate – average of variances in all scales

Eitan Sharon - Weizmann Institute Isotropic Texture in SWA Intensity Variance Isotropic Texture of aggregate – average of variances in all scales

Eitan Sharon - Weizmann Institute Oriented Texture in SWA Shape Moments Oriented Texture of aggregate – orientation, width and length in all scales center of mass width length orientation with Meirav Galun

Eitan Sharon - Weizmann Institute Gestalt – Perceptual Grouping A brief Tutorial Sharon, Brandt, Basri PAMI 2000: Shashua and Ullman ICCV 1988: Group curves by: Proximity Co-linearity

Eitan Sharon - Weizmann Institute Boundary Integrity in SWA

Eitan Sharon - Weizmann Institute Sharpen the Aggregates Top-down Sharpening: Expand core Sharpen boundaries

Eitan Sharon - Weizmann Institute Hierarchy in SWA

Eitan Sharon - Weizmann Institute Experiments Our SWA algorithm (CVPR’00 + CVPR’01) run-time: 5-10 seconds. Normalized cuts (Shi and Malik, PAMI ’ 00; Malik et al., IJCV ’ 01) run-time: about minutes. Software courtesy of Doron Tal, UC Berkeley. images on a pentium III 1000MHz PC:

Eitan Sharon - Weizmann Institute Isotropic Texture - Horse I Our Algorithm (SWA) Normalized Cuts

Eitan Sharon - Weizmann Institute Isotropic Texture - Horse II Our Algorithm (SWA)Normalized Cuts

Eitan Sharon - Weizmann Institute Isotropic Texture - Tiger Normalized Cuts Our Algorithm (SWA)

Eitan Sharon - Weizmann Institute Isotropic Texture - Butterfly Our Algorithm (SWA) Normalized Cuts

Eitan Sharon - Weizmann Institute Isotropic Texture - Leopard Our Algorithm (SWA)

Eitan Sharon - Weizmann Institute Isotropic Texture - Dalmatian Dog Our Algorithm (SWA)

Eitan Sharon - Weizmann Institute Isotropic Texture - Squirrel Our Algorithm (SWA)Normalized Cuts

Eitan Sharon - Weizmann Institute Full Texture - Squirrel Our Algorithm (SWA)Normalized Cuts with Meirav Galun

Eitan Sharon - Weizmann Institute Full Texture - Composition Our Algorithm (SWA) with Meirav Galun

Eitan Sharon - Weizmann Institute Full Texture – Lion Cub Our Algorithm (SWA) with Meirav Galun

Eitan Sharon - Weizmann Institute Full Texture – Polar Bear Our Algorithm (SWA) with Meirav Galun

Eitan Sharon - Weizmann Institute Full Texture – Penguin Our Algorithm (SWA) with Meirav Galun

Eitan Sharon - Weizmann Institute Full Texture –Leopard Our Algorithm (SWA) with Meirav Galun

Eitan Sharon - Weizmann Institute Full Texture - Zebra Our Algorithm (SWA) with Meirav Galun

Eitan Sharon - Weizmann Institute Segmentation by Weighted Aggregation Efficient approximation to Ncut-like measures Recursive computation of multiscale measurements Novel adaptive pyramid representing the image

Eitan Sharon - Weizmann Institute Matching Experiment (Chen Brestel)

Eitan Sharon - Weizmann Institute Matching Experiment (Chen Brestel)

Eitan Sharon - Weizmann Institute Matching Experiment (Chen Brestel)

Eitan Sharon - Weizmann Institute Experiments – Clustering Silhouettes Data from: Gdalyahu, Weinshall, Werman – CVPR 99 (Also: Domany, Blatt, Gdalyahu, Weinshall)

Eitan Sharon - Weizmann Institute Descending order of prominence – objects are fully categorized most prominentless prominent

Eitan Sharon - Weizmann Institute Bottom-Up and Top-Down