Texture Segmentation Based on Voting of Blocks, Bayesian Flooding and Region Merging C. Panagiotakis (1), I. Grinias (2) and G. Tziritas (3) 07-07-2009.

Slides:



Advertisements
Similar presentations
Segmentation by Morphological Watersheds
Advertisements

MASTERS THESIS By: Rahul Suresh
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Image classification Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing them?
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Carolina Galleguillos, Brian McFee, Serge Belongie, Gert Lanckriet Computer Science and Engineering Department Electrical and Computer Engineering Department.
Patch to the Future: Unsupervised Visual Prediction
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
On Constrained Optimization Approach To Object Segmentation Chia Han, Xun Wang, Feng Gao, Zhigang Peng, Xiaokun Li, Lei He, William Wee Artificial Intelligence.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Young Deok Chun, Nam Chul Kim, Member, IEEE, and Ick Hoon Jang, Member, IEEE IEEE TRANSACTIONS ON MULTIMEDIA,OCTOBER 2008.
CS 376b Introduction to Computer Vision 04 / 08 / 2008 Instructor: Michael Eckmann.
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
Segmentation and Clustering. Segmentation: Divide image into regions of similar contentsSegmentation: Divide image into regions of similar contents Clustering:
Robust Object Segmentation Using Adaptive Thresholding Xiaxi Huang and Nikolaos V. Boulgouris International Conference on Image Processing 2007.
Region-Level Motion- Based Background Modeling and Subtraction Using MRFs Shih-Shinh Huang Li-Chen Fu Pei-Yung Hsiao 2007 IEEE.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Multiple Human Objects Tracking in Crowded Scenes Yao-Te Tsai, Huang-Chia Shih, and Chung-Lin Huang Dept. of EE, NTHU International Conference on Pattern.
A Wrapper-Based Approach to Image Segmentation and Classification Michael E. Farmer, Member, IEEE, and Anil K. Jain, Fellow, IEEE.
Visual Querying By Color Perceptive Regions Alberto del Bimbo, M. Mugnaini, P. Pala, and F. Turco University of Florence, Italy Pattern Recognition, 1998.
Abstract Extracting a matte by previous approaches require the input image to be pre-segmented into three regions (trimap). This pre-segmentation based.
Segmentation and Clustering. Déjà Vu? Q: Haven’t we already seen this with snakes?Q: Haven’t we already seen this with snakes? A: no, that was about boundaries,
Computer Science Department A Speech / Music Discriminator using RMS and Zero-crossings Costas Panagiotakis and George Tziritas Department of Computer.
Feature Subset Selection using Minimum Cost Spanning Trees Mike Farah Supervisor: Dr. Sid Ray.
A Probabilistic Framework for Video Representation Arnaldo Mayer, Hayit Greenspan Dept. of Biomedical Engineering Faculty of Engineering Tel-Aviv University,
Pattern Recognition. Introduction. Definitions.. Recognition process. Recognition process relates input signal to the stored concepts about the object.
Jacinto C. Nascimento, Member, IEEE, and Jorge S. Marques
Image segmentation by clustering in the color space CIS581 Final Project Student: Qifang Xu Advisor: Dr. Longin Jan Latecki.
Interactive Image Segmentation of Non-Contiguous Classes using Particle Competition and Cooperation Fabricio Breve São Paulo State University (UNESP)
Clustering methods Course code: Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern Finland Joensuu,
New Segmentation Methods Advisor : 丁建均 Jian-Jiun Ding Presenter : 蔡佳豪 Chia-Hao Tsai Date: Digital Image and Signal Processing Lab Graduate Institute.
2 Outline Introduction –Motivation and Goals –Grayscale Chromosome Images –Multi-spectral Chromosome Images Contributions Results Conclusions.
Multimodal Interaction Dr. Mike Spann
Prakash Chockalingam Clemson University Non-Rigid Multi-Modal Object Tracking Using Gaussian Mixture Models Committee Members Dr Stan Birchfield (chair)
Mean-shift and its application for object tracking
Unsupervised Object Segmentation with a Hybrid Graph Model (HGM) Reporter: 鄭綱 (6/14)
Image Segmentation Seminar III Xiaofeng Fan. Today ’ s Presentation Problem Definition Problem Definition Approach Approach Segmentation Methods Segmentation.
S EGMENTATION FOR H ANDWRITTEN D OCUMENTS Omar Alaql Fab. 20, 2014.
CSE 185 Introduction to Computer Vision Pattern Recognition 2.
Digital Image Processing CCS331 Relationships of Pixel 1.
Texture scale and image segmentation using wavelet filters Stability of the features Through the study of stability of the eigenvectors and the eigenvalues.
EECS 274 Computer Vision Segmentation by Clustering II.
Data Extraction using Image Similarity CIS 601 Image Processing Ajay Kumar Yadav.
1 Markov Random Fields with Efficient Approximations Yuri Boykov, Olga Veksler, Ramin Zabih Computer Science Department CORNELL UNIVERSITY.
The Implementation of Markerless Image-based 3D Features Tracking System Lu Zhang Feb. 15, 2005.
1Ellen L. Walker Category Recognition Associating information extracted from images with categories (classes) of objects Requires prior knowledge about.
Face Image-Based Gender Recognition Using Complex-Valued Neural Network Instructor :Dr. Dong-Chul Kim Indrani Gorripati.
Tracking Turbulent 3D Features Lu Zhang Nov. 10, 2005.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 A self-organizing map for adaptive processing of structured.
Digital Image Processing
Journal of Visual Communication and Image Representation
Discriminative Training and Machine Learning Approaches Machine Learning Lab, Dept. of CSIE, NCKU Chih-Pin Liao.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
Normalized Cuts and Image Segmentation Patrick Denis COSC 6121 York University Jianbo Shi and Jitendra Malik.
Gaussian Mixture Model classification of Multi-Color Fluorescence In Situ Hybridization (M-FISH) Images Amin Fazel 2006 Department of Computer Science.
A. M. R. R. Bandara & L. Ranathunga
Markov Random Fields with Efficient Approximations
A New Approach to Track Multiple Vehicles With the Combination of Robust Detection and Two Classifiers Weidong Min , Mengdan Fan, Xiaoguang Guo, and Qing.
Image Segmentation Techniques
Dingding Liu* Yingen Xiong† Linda Shapiro* Kari Pulli†
Computer Vision Lecture 16: Texture II
CSSE463: Image Recognition Day 23
SMEM Algorithm for Mixture Models
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
Text Categorization Berlin Chen 2003 Reference:
EM Algorithm and its Applications
“Traditional” image segmentation
Presentation transcript:

Texture Segmentation Based on Voting of Blocks, Bayesian Flooding and Region Merging C. Panagiotakis (1), I. Grinias (2) and G. Tziritas (3) th International Conference on Pattern Recognition (2): Geoinformatics and Surveying Dep., TEI of Serres, Serres, Greece (3): Computer Science Department, University Of Crete, Greece Presenter: Dr. Costas Panagiotakis, Assistant Professor, (1) Business Administrator Administration Dep., TEI of Crete, Agios Nikolaos, Greece

2 Introduction: Related Work Segmentation of images is quite important for many applications, such as content based image retrieval and object recognition. In our previous work [1], we proposed a framework that performs automatic segmentation of images, knowing only the number of regions, which involves feature extraction and classification in feature space, followed by flooding (PMCFA) and merging in spatial domain. PMCFA has been also successfully applied on interactive image segmentation [2], where the goal is to classify the image pixels into foreground and background classes, when some foreground and background markers are given. [1] C. Panagiotakis, I. Grinias and G. Tziritas, Natural Image Segmentation based on Tree Equipartition, Bayesian Flooding and Region Merging, IEEE Transactions on Image Processing, Vol. 20, No. 8, pp , Aug [2] C. Panagiotakis, H. Papadakis, E. Grinias, N. Komodakis, P. Fragopoulou and G. Tziritas, Interactive Image Segmentation Based on Synthetic Graph Coordinates, Pattern Recognition, vol. 46, no. 11, pp , Nov

3 Introduction: Contribution 1.The proposed method uses features that are optimized and tested for textured images. 2.We solve the problem to find subset of blocks that represent well the whole dataset of blocks by a new framework that takes into account the blocks’ similarity and topology. The representative blocks are used to extract the features for each class. 3.The proposed method automatically computes the number of classes regions by a new criterion that takes into account the average likelihood per pixel of the classification map and penalizes the complexity of the regions boundaries. In [1-2] the number of classes were given. [1] C. Panagiotakis, I. Grinias and G. Tziritas, Natural Image Segmentation based on Tree Equipartition, Bayesian Flooding and Region Merging, IEEE Transactions on Image Processing, Vol. 20, No. 8, pp , Aug [2] C. Panagiotakis, H. Papadakis, E. Grinias, N. Komodakis, P. Fragopoulou and G. Tziritas, Interactive Image Segmentation Based on Synthetic Graph Coordinates, Pattern Recognition, vol. 46, no. 11, pp , Nov

4 System Overview The proposed framework can operate completely unsupervised. In this work, MINR = 3 and MAXR = 15 Main Steps:

5 Methodology: Feature Selection The image is divided into overlapping blocks (50% overlapping). 64 × 64 block for a frame of 512 × 512 pixels is used. We use the three components of Lab color space to represent the color The last component is the energy of horizontal and vertical components from wavelet transform using the fourth-order binomial filter [ ]/16. We show that these components of wavelet transform suffice to represent well the texture information.

6 Methodology: MAXR BLOCKS SELECTION Goal: Select the MAXR most representative image blocks taking into account the blocks similarity and topology. Main Steps: The M image blocks are represented by a graph G, whose weights are given by the Mallows distance of three color components and of the texture component of the corresponding blocks (4-connections neighborhood). Next, we find the MxM matrix of all shortest paths in graph G – taking into account similarity and topology. Similar results are also obtained and by using the MST of G instead of G. MxM matrix of all shortest paths in graph G

7 Methodology: MAXR BLOCKS SELECTION The proposed MAXR BLOCKS SELECTION is inspired from [1]. Main Steps: The first block is given by the block of minimum mean distance from others (centroid). Next, we repeat MAXR-1 times the following procedure: o The next block is given taking into account the current selected blocks. o We get the block that has low distances from others (non selected blocks) and high distance from the selected blocks. MAXR Selected Blocks [1] C. Panagiotakis, Clustering via Voting Maximization, Journal of Classification, 2014 (accepted).

8 Definition of a topographic map for each class k using the computed conditional probabilities: –Height of pixel s represents the dissimilarity of s from class k, defined as –ln P{k|ξ(s)} where P{k|ξ(s)} is the a-posteriori probability of class k given the feature vector ξ(s). Flooding Process for Class Propagation PMCFA (1/3) Class [1] C. Panagiotakis, I. Grinias and G. Tziritas, Natural Image Segmentation based on Tree Equipartition, Bayesian Flooding and Region Merging, IEEE Transactions on Image Processing, Vol. 20, No. 8, pp , Aug

Flooding Process for Class Propagation PMCFA (2/3) Path cost C i (s 0,s) between pixels s and s 0 : the maximum height of pixels in that path. Topographic distance δ k (s) between s and s 0 : the minimum cost of paths between s and s 0. [1] C. Panagiotakis, I. Grinias and G. Tziritas, Natural Image Segmentation based on Tree Equipartition, Bayesian Flooding and Region Merging, IEEE Transactions on Image Processing, Vol. 20, No. 8, pp , Aug

Flooding Process for Class Propagation PMCFA (3/3) ¨ Input Topographic map and initial regions of high confidence per class. Priority Multi-Class Flooding Algorithm: ¨ Competitive growing for both the computation of topographic map and pixel labeling. ¨ Flooding stops when all image pixels are labeled. PMCFA Result 4 [1] C. Panagiotakis, I. Grinias and G. Tziritas, Natural Image Segmentation based on Tree Equipartition, Bayesian Flooding and Region Merging, IEEE Transactions on Image Processing, Vol. 20, No. 8, pp , Aug Topographic map Original image Class

Merging Process Usually, the number of computed regions is greater than the real number of classes. A merging state solves this over-segmentation problem. We have used a greedy algorithm that iteratively merges the regions taking into account the dissimilarity in appearance of the segments and the gradient on region boundaries. 11

Selection of the appropriate segmentation Map We select the segmentation that minimizes a criterion C(k) = FS(K) + λ PC(k) taking into account –the average likelihood per pixel of the classification map (FS(K)) and –penalizes the complexity of the regions boundaries (PC(K)) that is computed from the points with curvature higher than 0.5 multiplied by a normalization factor. 12

Experimental Results on Prague Texture Segmentation Benchmark 4

14 Conclusions An unsupervised segmentation algorithm is proposed which combines color and texture features, region features and topology. yielding high performance results. Results on Prague Texture Segmentation Benchmark: