Region-Based Segmentation

Slides:



Advertisements
Similar presentations
Pattern-based Texture Metamorphosis Z. Liu, C. Liu, and H. Shum Microsoft Research Asia Y. Yu UIUC.
Advertisements

Segmentation by Morphological Watersheds
Likelihood Ratio, Wald, and Lagrange Multiplier (Score) Tests
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.
A Gimp Plugin that uses “GrabCut” to perform image segmentation
THE WATERSHED SEGMENTATION 1 NADINE GARAISY. GENERAL DEFINITION 2 A drainage basin or watershed is an extent or an area of land where surface water from.
Segmentation and Region Detection Defining regions in an image.
On Constrained Optimization Approach To Object Segmentation Chia Han, Xun Wang, Feng Gao, Zhigang Peng, Xiaokun Li, Lei He, William Wee Artificial Intelligence.
Lecture 6 Image Segmentation
EE 7730 Image Segmentation.
Thresholding Otsu’s Thresholding Method Threshold Detection Methods Optimal Thresholding Multi-Spectral Thresholding 6.2. Edge-based.
Hierarchical Region-Based Segmentation by Ratio-Contour Jun Wang April 28, 2004 Course Project of CSCE 790.
CS 376b Introduction to Computer Vision 04 / 08 / 2008 Instructor: Michael Eckmann.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
Segmentation Divide the image into segments. Each segment:
Clustering Color/Intensity
Cutting complete weighted graphs Jameson Cahill Ido Heskia Math/CSC 870 Spring 2007.
Fitting a Model to Data Reading: 15.1,
Segmentation (Section 10.3 & 10.4) CS474/674 – Prof. Bebis.
CS292 Computational Vision and Language Segmentation and Region Detection.
Thresholding Thresholding is usually the first step in any segmentation approach We have talked about simple single value thresholding already Single value.
Chapter 5 Segmentation Presenter: 蘇唯誠
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Geodesic Minimal Paths Vida Movahedi Elder Lab, January 2010.
7.1. Mean Shift Segmentation Idea of mean shift:
CSE 185 Introduction to Computer Vision Pattern Recognition 2.
Chapter 10 Image Segmentation.
Forward-Scan Sonar Tomographic Reconstruction PHD Filter Multiple Target Tracking Bayesian Multiple Target Tracking in Forward Scan Sonar.
EECS 274 Computer Vision Segmentation by Clustering II.
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
CS654: Digital Image Analysis
Mathematical Morphology Mathematical morphology (matematická morfologie) –A special image analysis discipline based on morphological transformations of.
Compression-based Texture Merging “ Unsupervised Segmentation of Natural Images via Lossy Data Compression ” Allen Y. Yang, John Wright, Shankar Sastry,
Gaussian Mixture Models and Expectation-Maximization Algorithm.
CSSE463: Image Recognition Day 23 Midterm behind us… Midterm behind us… Foundations of Image Recognition completed! Foundations of Image Recognition completed!
Mathematical Morphology
Image Segmentation Image segmentation (segmentace obrazu)
November 5, 2013Computer Vision Lecture 15: Region Detection 1 Basic Steps for Filtering in the Frequency Domain.
Region Detection Defining regions of an image Introduction All pixels belong to a region Object Part of object Background Find region Constituent pixels.
Some links between min-cuts, optimal spanning forests and watersheds Cédric Allène, Jean-Yves Audibert, Michel Couprie, Jean Cousty & Renaud Keriven ENPC.
1 Kernel Machines A relatively new learning methodology (1992) derived from statistical learning theory. Became famous when it gave accuracy comparable.
Lecture z Chapter 10: Image Segmentation. Segmentation approaches 1) Gradient based: How different are pixels? 2) Thresholding: Converts grey-level images.
Course : T Computer Vision
Machine Vision ENT 273 Lecture 4 Hema C.R.
Hierarchical Segmentation of Polarimetric SAR Images
CSSE463: Image Recognition Day 21
Clustering and Segmentation
COMP 9517 Computer Vision Segmentation 7/2/2018 COMP 9517 S2, 2017.
Computer Vision Lecture 13: Image Segmentation III
DIGITAL SIGNAL PROCESSING
Computer Vision Lecture 12: Image Segmentation II
Paper Presentation: Shape and Matching
Likelihood Ratio, Wald, and Lagrange Multiplier (Score) Tests
Outline Perceptual organization, grouping, and segmentation
Outline Announcement Texture modeling - continued Some remarks
REMOTE SENSING Multispectral Image Classification
CSSE463: Image Recognition Day 23
Presented by: Yang Yu Spatiotemporal GMM for Background Subtraction with Superpixel Hierarchy Mingliang Chen, Xing Wei, Qingxiong.
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
Watershed Segmentation
Seam Carving Project 1a due at midnight tonight.
Quasi-linear algorithms for the topological watershed
Image Registration 박성진.
Regression Lecture-5 Additional chapters of mathematics
Announcements Project 4 questions Evaluations.
CSSE463: Image Recognition Day 23
CSSE463: Image Recognition Day 23
CS654: Digital Image Analysis
Presentation transcript:

Region-Based Segmentation the basic idea divide image into zones of maximum homogeneity for some homogeneity measure H() homogeneity can be computed based on intensity color (not usually applicable in medical imaging) texture shape 5/18/2019

Region Merging a possible approach alternatively assume every pixel is a region and merge pixels based on similarity alternatively oversegment the image into regions and merge regions partition image into regions form region adjacency graph (RAG) for each region consider its adjacent region and test for homogeneity if then merge the regions and update the RAG repeat step 3 until no regions are merged 5/18/2019

Region Merging simple homogeneity test compare mean region intensities and merge if the intensities are within a threshold distance has the same problems as other threshold approaches 5/18/2019

Region Merging homogeneity test as hypothesis testing assume or estimate a statistical distribution of the pixel intensities over a region and use a statistical hypothesis test H0: Both regions are the same (the pixel intensities come from the same distribution) H1: Both regions are different (the pixel intensities come from different distributions) 5/18/2019

Region Merging homogeneity test as hypothesis testing example if we assume that pixel intensities are Gaussian distributed if we assume pixel intensities are independent then the joint probability density under the null hypothesis is 5/18/2019

Region Merging homogeneity test as hypothesis testing example (cont) if we assume pixel intensities are independent then the joint probability density under the null hypothesis is the likelihood ratio is if L is below a threshold value then merge the two regions 5/18/2019

Watershed Segmentation topographic map of High Park 5/18/2019

Watershed Segmentation watershed segmentation models the image as a topographic landscape with the pixel intensities representing elevation there are 3 kinds of points local minima points where a drop of water would fall to a single local minima “catchment basins” points where a drop of water would be equally likely to fall into more than one minima “watersheds” 5/18/2019

Watershed Segmentation 5/18/2019

Watershed Segmentation regions boundaries are the watersheds to find the watersheds fill the catchment basins with water starting from the local minima if two catchment basins would merge by adding a little more water then build a dam between the two basins the dams are the watersheds 5/18/2019

Watershed Segmentation http://cmm.ensmp.fr/~beucher/wtshed.html http://www.mathworks.com/products/demos/image/watershed /ipexwatershed.html Jean Cousty, Gilles Bertrand, Laurent Najman, and Michel Couprie. Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle. IEEE Transactions on Pattern Analysis and Machine Intelligence. 31 (8). August 2009. pp. 1362–1374. 5/18/2019

Segmentation via Non-rigid Registration suppose that you have a contour (defined by a set of points) of a shape can we transfer the contour onto an image by finding the corresponding set of points on the image? 5/18/2019

given n corresponding control points find functions f and g such that 5/18/2019

Polynomial Transformation we might choose functions f and g to be polynomials in x and y this is easy to solve in a least-squares way 5/18/2019

Polynomial Transformation 5/18/2019

Thin Plate Spline Goshtasby, IEEE Transactions on Geoscience and Remote Sensing, 26(1), Jan 1988. undeformed rubber sheet deformed rubber sheet (pulled at edges) 5/18/2019

Thin Plate Spline using 20 control points thin plate spline polynomial (degree 2) 5/18/2019

Thin Plate Splines source image target image 5/18/2019

centrally located control points 5/18/2019

difference between warped and target images warped image difference between warped and target images 5/18/2019

control points located at periphery 5/18/2019

difference between warped and target images warped image difference between warped and target images 5/18/2019

5/18/2019

Thin Plate Spline the surface of an infinite plate loaded with point loads is called a surface spline and is given by where and (xj, yj) is the position of the jth point load 5/18/2019

Thin Plate Spline the coefficients Fj must meet certain constraints the constraints are related to the original integral equation that the thin plate spline minimizes 5/18/2019

Thin Plate Spline and imposing the constraints by choosing we can solve a linear system of equations to compute the thin plate spline 5/18/2019