Human-Computer Interaction Human-Computer Interaction Segmentation Hanyang University Jong-Il Park.

Slides:



Advertisements
Similar presentations
Pseudo-Relevance Feedback For Multimedia Retrieval By Rong Yan, Alexander G. and Rong Jin Mwangi S. Kariuki
Advertisements

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.
E.G.M. PetrakisImage Segmentation1 Segmentation is the process of partitioning an image into regions –region: group of connected pixels with similar properties.
Clustering & image segmentation Goal::Identify groups of pixels that go together Segmentation.
Real-Time Human Pose Recognition in Parts from Single Depth Images Presented by: Mohammad A. Gowayyed.
A Gimp Plugin that uses “GrabCut” to perform image segmentation
MPEG-4 Objective Standardize algorithms for audiovisual coding in multimedia applications allowing for Interactivity High compression Scalability of audio.
Stephen J. Guy 1. Photomontage Photomontage GrabCut – Interactive Foreground Extraction 1.
Segmentation Course web page: vision.cis.udel.edu/~cv May 2, 2003  Lecture 29.
GrabCut Interactive Image (and Stereo) Segmentation Joon Jae Lee Keimyung University Welcome. I will present Grabcut – an Interactive tool for foreground.
Lecture 6 Image Segmentation
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.
Segmentation. Terminology Segmentation, grouping, perceptual organization: gathering features that belong together Fitting: associating a model with observed.
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”.
Segmentation and Clustering. Segmentation: Divide image into regions of similar contentsSegmentation: Divide image into regions of similar contents Clustering:
Segmentation CSE P 576 Larry Zitnick Many slides courtesy of Steve Seitz.
Segmentation Divide the image into segments. Each segment:
Clustering Color/Intensity
Computer Vision Segmentation Marc Pollefeys COMP 256 Some slides and illustrations from D. Forsyth, T. Darrel,...
Segmentation by Clustering Reading: Chapter 14 (skip 14.5) Data reduction - obtain a compact representation for interesting image data in terms of a set.
Computer Vision Segmentation Marc Pollefeys COMP 256 Some slides and illustrations from D. Forsyth, T. Darrel,...
Computer Vision - A Modern Approach Set: Segmentation Slides by D.A. Forsyth Segmentation and Grouping Motivation: not information is evidence Obtain a.
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 Rob Atlas Nick Bridle Evan Radkoff.
Chapter 5 Segmentation Presenter: 蘇唯誠
Methods in Medical Image Analysis Statistics of Pattern Recognition: Classification and Clustering Some content provided by Milos Hauskrecht, University.
Computer Vision James Hays, Brown
1 Mean shift and feature selection ECE 738 course project Zhaozheng Yin Spring 2005 Note: Figures and ideas are copyrighted by original authors.
Human-Computer Interaction Human-Computer Interaction Tracking Hanyang University Jong-Il Park.
Segmentation by Clustering
1Ellen L. Walker Segmentation Separating “content” from background Separating image into parts corresponding to “real” objects Complete segmentation Each.
Chapter 14: SEGMENTATION BY CLUSTERING 1. 2 Outline Introduction Human Vision & Gestalt Properties Applications – Background Subtraction – Shot Boundary.
CSE 185 Introduction to Computer Vision Pattern Recognition 2.
Computer Vision Why study Computer Vision? Images and movies are everywhere Fast-growing collection of useful applications –building representations.
EECS 274 Computer Vision Segmentation by Clustering II.
MACHINE LEARNING 8. Clustering. Motivation Based on E ALPAYDIN 2004 Introduction to Machine Learning © The MIT Press (V1.1) 2  Classification problem:
CS654: Digital Image Analysis Lecture 30: Clustering based Segmentation Slides are adapted from:
Mixture of Gaussians This is a probability distribution for random variables or N-D vectors such as… –intensity of an object in a gray scale image –color.
Segmentation of Vehicles in Traffic Video Tun-Yu Chiang Wilson Lau.
Student Name: Honghao Chen Supervisor: Dr Jimmy Li Co-Supervisor: Dr Sherry Randhawa.
CSSE463: Image Recognition Day 23 Midterm behind us… Midterm behind us… Foundations of Image Recognition completed! Foundations of Image Recognition completed!
Image Segmentation Shengnan Wang
Digital Image Processing
Presented by: Idan Aharoni
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP10 Advanced Segmentation Miguel Tavares.
Similarity Measurement and Detection of Video Sequences Chu-Hong HOI Supervisor: Prof. Michael R. LYU Marker: Prof. Yiu Sang MOON 25 April, 2003 Dept.
Image Processing Intro2CS – week 6 1. Image Processing Many devices now have cameras on them Lots of image data recorded for computers to process. But.
1 Kernel Machines A relatively new learning methodology (1992) derived from statistical learning theory. Became famous when it gave accuracy comparable.
Processing Images and Video for An Impressionist Effect Automatic production of “painterly” animations from video clips. Extending existing algorithms.
Motion tracking TEAM D, Project 11: Laura Gui - Timisoara Calin Garboni - Timisoara Peter Horvath - Szeged Peter Kovacs - Debrecen.
CSSE463: Image Recognition Day 21
Presenter: Ibrahim A. Zedan
COMP 9517 Computer Vision Segmentation 7/2/2018 COMP 9517 S2, 2017.
Overview of machine learning for computer vision
Segmentation and Grouping
CSSE463: Image Recognition Day 23
Revision (Part II) Ke Chen
CS654: Digital Image Analysis
“grabcut”- Interactive Foreground Extraction using Iterated Graph Cuts
Emel Doğrusöz Esra Ataer Muhammet Baştan Tolga Can
CSCI N317 Computation for Scientific Applications Unit Weka
CSSE463: Image Recognition Day 23
Announcements Project 4 questions Evaluations.
CSSE463: Image Recognition Day 23
CSSE463: Image Recognition Day 23
Saliency Optimization from Robust Background Detection
Presentation transcript:

Human-Computer Interaction Human-Computer Interaction Segmentation Hanyang University Jong-Il Park

Why segment images? Form large chunks of pixels that can be dealt with together  for efficiency  because these might represent objects Join up image tokens that together convey information

Grouping Humans interpret image information collectively  in “groups”  Eg. Muller-Lyer illusion

Applications Shot boundary detection  summarize video by  find shot boundaries  obtain “most representative” frame Background subtraction  find “interesting bits” of image by subtracting known background  Eg. find person in an office  Eg. find cars on a road Interactive segmentation  user marks some foreground/background pixels  system cuts object out of image  useful for image editing, etc.

Technique: Shot Boundary Detection Find the shots in a sequence of video  shot boundaries cause big differences between succeeding frames Strategy:  compute interframe distances  declare a boundary where these are big Possible distances  frame differences  histogram differences  block comparisons  edge differences

Technique: Background Subtraction If we know the background, easy to find “interesting bits” Approach:  use a moving average to estimate background image  subtract from current frame  large absolute values are interesting pixels trick: use morphological operations to clean up pixels

Interactive segmentation Goals  User cuts an object out of one image to paste into another  User forms a matte  weights between 0 and 1 to mix pixels with background  to cope with, say, hair Interactions  mark some foreground, background pixels with strokes  put a box around foreground Technical problem  allocate pixels to foreground/background class  consistent with interaction information  segments are internally coherent and different from one another

Superpixels Pixels are too small and too detailed a representation  for recognition  for some kinds of reconstruction Replace with superpixels  small groups of pixels that are  clumpy  like one another  a reasonable representation of the underlying pixels

Segmentation as clustering Cluster together (pixels, tokens, etc.) that belong together Agglomerative clustering  attach closest to cluster it is closest to  repeat Divisive clustering  split cluster along best boundary  repeat

The watershed algorithm An agglomerative clusterer with a special metric

Clustering pixels Natural to use k-means  represent pixels with  intensity vector; color vector; vector of nearby filter responses  perhaps position

The Mean Shift Algorithm Originally intended to find modes in scattered data Strategy  start at a promising estimate of mode  iterate until the estimate doesn’t change  fit a model of probability density to some points near estimate  find the peak of this model Model  smoothing kernel  the update takes a special form  shift the mode to a weighted mean of the nearby points  hence the name.

Clustering with Mean Shift Model data points as samples from a probability model  clusters are associated with modes  but it might be hard to find one mode per cluster  if there’s more than one mode per cluster, they should be close together Apply mean shift to find modes  modes should form small, widely separated clusters Now cluster the modes with (say) agglomerative clusterer  easy, because there are small, widely separated clusters Point belongs to cluster that its closest mode belongs to

Mean Shift Segmentation Cluster pixels using mean shift  each cluster is a segment Represent with color, position  important  color distances are not the same as position distances  choose one scale for each

Evaluating Segmenters Collect “correct” segmentations  from human labellers  these may not be perfect, but... Now apply your segmenter  Count  % human boundary pixels close to your boundary pixels -- Recall  % of your boundary pixels close to human boundary pixels -- Precision

Segmentation codes