IS THERE A MORE COMPUTATIONALLY EFFICIENT TECHNIQUE FOR SEGMENTING THE OBJECTS IN THE IMAGE? Contour tracking/border following identify the pixels that.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Area and perimeter calculation using super resolution algorithms M. P. Cipolletti – C. A. Delrieux – M. C. Piccolo – G. M. E. Perillo IADO – UNS – CONICET.
電腦視覺 Computer and Robot Vision I
Human Identity Recognition in Aerial Images Omar Oreifej Ramin Mehran Mubarak Shah CVPR 2010, June Computer Vision Lab of UCF.
Lecture 07 Segmentation Lecture 07 Segmentation Mata kuliah: T Computer Vision Tahun: 2010.
電腦視覺 Computer and Robot Vision I Chapter2: Binary Machine Vision: Thresholding and Segmentation Instructor: Shih-Shinh Huang 1.
Computer Vision Lecture 16: Region Representation
MPEG-4 Objective Standardize algorithms for audiovisual coding in multimedia applications allowing for Interactivity High compression Scalability of audio.
September 10, 2013Computer Vision Lecture 3: Binary Image Processing 1Thresholding Here, the right image is created from the left image by thresholding,
Segmentation (2): edge detection
Chapter 5 Raster –based algorithms in CAC. 5.1 area filling algorithm 5.2 distance transformation graph and skeleton graph generation algorithm 5.3 convolution.
Segmentation and Region Detection Defining regions in an image.
Complex Networks for Representation and Characterization of Object For CS790g Project Bingdong Li 11/9/2009.
COMP322/S2000/L181 Pre-processing: Smooth a Binary Image After binarization of a grey level image, the resulting binary image may have zero’s (white) and.
Objective of Computer Vision
Highlights Lecture on the image part (10) Automatic Perception 16
Objective of Computer Vision
CSE 803 Fall 2008 Stockman1 Ch 10 Image Segmentation Ideally, partition an image into regions corresponding to real world objects.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
Face Processing System Presented by: Harvest Jang Group meeting Fall 2002.
E.G.M. PetrakisBinary Image Processing1 Binary Image Analysis Segmentation produces homogenous regions –each region has uniform gray-level –each region.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
Digital Image Processing
Machine Vision for Robots
Prakash Chockalingam Clemson University Non-Rigid Multi-Modal Object Tracking Using Gaussian Mixture Models Committee Members Dr Stan Birchfield (chair)
BraMBLe: The Bayesian Multiple-BLob Tracker By Michael Isard and John MacCormick Presented by Kristin Branson CSE 252C, Fall 2003.
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Lecture 06 Binary Image Analysis Lecture 06 Binary Image Analysis Mata kuliah: T Computer Vision Tahun: 2010.
Recap CSC508.
Chapter 9.  Mathematical morphology: ◦ A useful tool for extracting image components in the representation of region shape.  Boundaries, skeletons,
Chapter 14: SEGMENTATION BY CLUSTERING 1. 2 Outline Introduction Human Vision & Gestalt Properties Applications – Background Subtraction – Shot Boundary.
ENT 273 Object Recognition and Feature Detection Hema C.R.
Intelligent Vision Systems ENT 496 Object Shape Identification and Representation Hema C.R. Lecture 7.
September 23, 2014Computer Vision Lecture 5: Binary Image Processing 1 Binary Images Binary images are grayscale images with only two possible levels of.
Image Segmentation & Template Matching Multimedia Signal Processing lecture on Petri Hirvonen.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Digital Image Processing In The Name Of God Digital Image Processing Lecture2: Digital Image Fundamental M. Ghelich Oghli By: M. Ghelich Oghli
CS654: Digital Image Analysis Lecture 4: Basic relationship between Pixels.
Robot vision Martin Jagersand Addt’ slides by D. Pugh N. Krouglic.
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],
SIGNATURE RECOGNITION SYSTEM Group Number:10 Group Members: Richa Goyal(y08uc103) Rashmi Singhal(y08uc102)
CSSE463: Image Recognition Day 9 Lab 3 (edges) due Weds, 3:25 pm Lab 3 (edges) due Weds, 3:25 pm Take home quiz due Friday, 4:00 pm. Take home quiz due.
Quiz Week 8 Topical. Topical Quiz (Section 2) What is the difference between Computer Vision and Computer Graphics What is the difference between Computer.
Region Detection Defining regions of an image Introduction All pixels belong to a region Object Part of object Background Find region Constituent pixels.
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
Image Segmentation Nitin Rane. Image Segmentation Introduction Thresholding Region Splitting Region Labeling Statistical Region Description Application.
Some Basic Relationships Between Pixels Definitions: –f(x,y): digital image –Pixels: q, p –Subset of pixels of f(x,y): S.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Chapter 11 Representation and.
Course 3 Binary Image Binary Images have only two gray levels: “1” and “0”, i.e., black / white. —— save memory —— fast processing —— many features of.
Relationship between pixels Neighbors of a pixel – 4-neighbors (N,S,W,E pixels) == N 4 (p). A pixel p at coordinates (x,y) has four horizontal and vertical.
Sheng-Fang Huang Chapter 11 part I.  After the image is segmented into regions, how to represent and describe these regions? ◦ In terms of its external.
Materi 09 Analisis Citra dan Visi Komputer Representasi and Deskripsi 1.
Copyright ©2008, Thomson Engineering, a division of Thomson Learning Ltd.
CSSE463: Image Recognition Day 9
Image Representation and Description – Representation Schemes
IT472: Digital Image Processing
Lecture 07 13/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Mean Shift Segmentation
Computer Vision Lecture 5: Binary Image Processing
Fitting Curve Models to Edges
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
OBJECT RECOGNITION – BLOB ANALYSIS
Binary Image processing بهمن 92
Ch 10 Image Segmentation Ideally, partition an image into regions corresponding to real world objects. CSE 803 Fall 2012.
CSSE463: Image Recognition Day 9
CSSE463: Image Recognition Day 9
IMAGE SEGMENTATION – CONNECTED COMPONENT LABELING
A Block Based MAP Segmentation for Image Compression
Computer and Robot Vision I
Presentation transcript:

IS THERE A MORE COMPUTATIONALLY EFFICIENT TECHNIQUE FOR SEGMENTING THE OBJECTS IN THE IMAGE? Contour tracking/border following identify the pixels that fall on the boundaries of the objects, i.e., pixels that have a neighbor that belongs to the background class or region. There are two “standard” code definitions used to represent boundaries: code definitions based on 4- connectivity (crack code) and code definitions based on 8-connectivity (chain code).

BOUNDARY REPRESENTATIONS: 4-CONNECTIVITY (CRACK CODE) CRACK CODE:

CHAIN CODE: BOUNDARY REPRESENTATIONS: 8-CONNECTIVITY (CHAIN CODE)

CONTOUR TRACKING ALGORITHM FOR GENERATING CRACK CODE Identify a pixel P that belongs to the class “objects” and a neighboring pixel (4 neighbor connectivity) Q that belongs to the class “background”. Depending on the relative position of Q relative to P, identify pixels U and V as follows: CODE 0CODE 1CODE 2CODE 3 VQQPPUUV UPVUQVPQ

CONTOUR TRACKING ALGORITHM Assume that a pixel has a value of “1” if it belongs to the class “object” and “0” if it belongs to the class “background”. Pixels U and V are used to determine the next “move” (i.e., the next element of crack code) as summarized in the following truth table: UVP’Q’TURNCODE * X1VQRIGHTCODE-1 10UVNONECODE 00PULEFTCODE+1 * Implement as a modulo 4 counter

CONTOUR TRACKING ALGORITHM PQ UV V UQ V P UQ V P UQ V P U

CONTOUR TRACKING ALGORITHM FOR GENERATING CHAIN CODE Identify a pixel P that belongs to the class “objects” and a neighboring pixel (4 neighbor connectivity) R 0 that belongs to the class “background”. Assume that a pixel has a value of “1” if it belongs to the class “object” and “0” if it belongs to the class “background”. Assign the 8-connectivity neighbors of P to R 0, R 1, …, R7 as follows:

CONTOUR TRACKING ALGORITHM FOR GENERATING CHAIN CODE ALGORITHM: i=0 WHILE (R i ==0) { i++ } Move P to R i Set i=6 for next search

OBJECT RECOGNITION – BLOB ANALYSIS Once the image has been segmented into classes representing the objects in the image, the next step is to generate a high level description of the various objects. A comprehensive set of form parameters describing each object or region in an image is useful for object recognition. Ideally the form parameters should be independent of the object’s position and orientation as well as the distance between the camera and the object (i.e., scale factor).