A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation Nicolaie Popescu-Bodorin, IEEE Member, Artificial Intelligence.

Slides:



Advertisements
Similar presentations
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
Advertisements

Recursive Definitions and Structural Induction
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Automatic Histogram Threshold Using Fuzzy Measures 呂惠琪.
Fuzzy Expert Systems. Lecture Outline What is fuzzy thinking? What is fuzzy thinking? Fuzzy sets Fuzzy sets Linguistic variables and hedges Linguistic.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
Discrete Structures Chapter 5 Relations and Functions Nurul Amelina Nasharuddin Multimedia Department.
Image Segmentation A Hybrid Method Using Clustering & Region Growing
WELCOME TO THE WORLD OF FUZZY SYSTEMS. DEFINITION Fuzzy logic is a superset of conventional (Boolean) logic that has been extended to handle the concept.
The Fundamentals: Algorithms, the Integers & Matrices.
Combinational Logic Chapter 4.
MATH-331 Discrete Mathematics Fall Organizational Details Class Meeting: 11 :00am-12:15pm; Monday, Wednesday; Room SCIT215 Instructor: Dr. Igor.
Set theory Sets: Powerful tool in computer science to solve real world problems. A set is a collection of distinct objects called elements. Traditionally,
Classical Sets and Fuzzy Sets
Fuzzy Logic. Lecture Outline Fuzzy Systems Fuzzy Sets Membership Functions Fuzzy Operators Fuzzy Set Characteristics Fuzziness and Probability.
Foundations of Computer Science Computing …it is all about Data Representation, Storage, Processing, and Communication of Data 10/4/20151CS 112 – Foundations.
Chapter 3 – Set Theory  .
Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 3.1 Mathematical Foundation.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
Sets Defined A set is an object defined as a collection of other distinct objects, known as elements of the set The elements of a set can be anything:
1 Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 1 Adaptation to this.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
So Far……  Clustering basics, necessity for clustering, Usage in various fields : engineering and industrial fields  Properties : hierarchical, flat,
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
A Universal Turing Machine
Lógica difusa  Bayesian updating and certainty theory are techniques for handling the uncertainty that arises, or is assumed to arise, from statistical.
CompSci 102 Discrete Math for Computer Science
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Fast accurate fuzzy clustering through data reduction Advisor.
FUZZY LOGIC INFORMATION RETRIEVAL MODEL Ferddie Quiroz Canlas, ME-CoE.
Presenter : Kuang-Jui Hsu Date : 2011/3/24(Thur.).
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 29 Nov 11, 2005 Nanjing University of Science & Technology.
Image Emotional Semantic Query Based On Color Semantic Description Wei-Ning Wang, Ying-Lin Yu Department of Electronic and Information Engineering, South.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 30 Nov 11, 2005 Nanjing University of Science & Technology.
Chapter 2 With Question/Answer Animations. Section 2.1.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
Faculty of Electronics, Telecommunications and Information Technology University POLITEHNICA of Bucharest.
Lecture 3 Fuzzy sets. 1.1 Sets Elements of sets An universal set X is defined in the universe of discourse and it includes all possible elements.
Yixin Chen and James Z. Wang The Pennsylvania State University
Nottingham Image Analysis School, 23 – 25 June NITS Image Segmentation Guoping Qiu School of Computer Science, University of Nottingham
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 28 Nov 9, 2005 Nanjing University of Science & Technology.
CompSci 102 Discrete Math for Computer Science March 13, 2012 Prof. Rodger Slides modified from Rosen.
Adiabatic quantum computer (AQC) Andrii Rudavskyi Supervisor: prof. Petra Rudolf.
Fuzzy C-means Clustering Dr. Bernard Chen University of Central Arkansas.
ECE DIGITAL LOGIC LECTURE 2: DIGITAL COMPUTER AND NUMBER SYSTEMS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 01/14/2016.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
K-MEANS CLUSTERING. INTRODUCTION- What is clustering? Clustering is the classification of objects into different groups, or more precisely, the partitioning.
VIDYA PRATISHTHAN’S COLLEGE OF ENGINEERING, BARAMATI.
1. 2 What is Digital Image Processing? The term image refers to a two-dimensional light intensity function f(x,y), where x and y denote spatial(plane)
CPCS 222 Discrete Structures I
1 Chapter 8 The Discrete Fourier Transform (cont.)
Chapter 4 Introduction to Set Theory
Invitation to Computer Science, C++ Version, Fourth Edition
A Universal Turing Machine
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
CSNB 143 Discrete Mathematical Structures
Introduction to Combinatorics
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
Invitation to Computer Science, Java Version, Third Edition
CS201: Data Structures and Discrete Mathematics I
Trevor Savage, Bogdan Dit, Malcom Gethers and Denys Poshyvanyk
The aim of education is to teach students how to think rather than what to think. Sets The set is the fundamental discrete structure on which all other.
Everything is an Integer Countable and Uncountable Sets
Sets and Probabilistic Models
Sets and Probabilistic Models
Experiments, Outcomes, Events and Random Variables: A Revisit
Sets and Probabilistic Models
Sets and Probabilistic Models
Presentation transcript:

A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation Nicolaie Popescu-Bodorin, IEEE Member, Artificial Intelligence & Computational Logic Laboratory, Mathematics and Computer Science Department, ‘Spiru Haret’ University of Bucharest, ROMANIA, bodorin☺ieee.org, November th Telecommunications Forum, TELFOR 2009, Belgrade, SERBIA, November 24-26, 2009

1. Outline Here we show that k-means quantization of a signal can be interpreted both as a crisp indicator function and as a fuzzy membership assignment describing fuzzy clusters and fuzzy boundaries. Combined crisp and fuzzy indicator functions are defined here as natural generalizations of the ordinary crisp and fuzzy indicator functions, respectively. An application to iris segmentation is presented together with a demo program. A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation

2. Why a new type of fuzzification? We consider that a segmentation technique working on discrete signals is a semantic operator encoding the input signal using a finite set of labels (symbols) which are somehow meaningful in human understanding of the input signal. The first difficulty in interpreting a segmentation as being fuzzy is the lack of instruments that could enable us to view the result of a segmentation as a crisp or a fuzzy membership function defined from the input signal to a collection of segments encoded as a list of arbitrary symbols, possibly non-numeric, and more often found outside [0, 1] interval. 17th Telecommunications Forum, TELFOR 2009, Belgrade, SERBIA, November 24-26, 2009

A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation 3. Ordinary Crisp Indicator of a Set If A is a subset of X, the ordinary crisp indicator of A is: We may consider that the crisp indicator of A is nothing more than an encoding (in two symbols) of a disjoint cover of X containing two sets: A and its complement (regardless of the nature or the values of those two symbols and of the nature of sets A and X).

4. Combined Crisp Indicator of a Disjoint Reunion If (1) it is natural to define the combined crisp indicator of X as a linear combination of ordinary indicator functions: (2) or more generaly, as follows: (3) where is a sequence of distinct symbols. 17th Telecommunications Forum, TELFOR 2009, Belgrade, SERBIA, November 24-26, 2009

5. What About k-Means Quantization? A combined crisp indicator of a disjoint reunion is unique up to a bijective correspondence between the sequences of symbols that are used to encode the memberships to each set within the reunion. Consequently, any discrete step function (in particular, any k-means quantization of a discrete signal) is equivalent to a combined crisp indicator. Therefore, it doesn’t really matter what symbols (or values) are used to encode the crisp indicator function. Chromatic k-means centroids and cluster indices {1,…,n} are both equally suitable to encode a crisp indicator function describing the k-means clusters. A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation

6. Combined Fuzzy Indicator of a Disjoint Reunion The combined fuzzy indicator of a disjoint reunion is defined here as follows: given a combined crisp indicator of the form (2), any monotone function satisfying the relation: (4) where [·] denotes the integer part function, is a combined fuzzy indicator (combined fuzzy membership assignment). In other words, the function: (5) is an ordinary fuzzy indicator of the boundaries between the sets of the reunion (1). 17th Telecommunications Forum, TELFOR 2009, Belgrade, SERBIA, November 24-26, 2009

7. A fuzzy view on k-means quantized images – fuzzy clusters, fuzzy boundaries a) k-means quantized image: b) Combined crisp indicator for k-means clusters: c) Combined fuzzy indicator for k-means clusters: d) Ordinary fuzzy indicator for cluster boundaries: A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation

8. Circular Fuzzy Iris Ring, Circular Fuzzy Iris Boundaries 17th Telecommunications Forum, TELFOR 2009, Belgrade, SERBIA, November 24-26, 2009

9. Circular Fuzzy Iris Segmentation A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation

10. Where to find the demo program Circular Fuzzy Iris Segmentation Demo Program, 17th Telecommunications Forum, TELFOR 2009, Belgrade, SERBIA, November 24-26, 2009

11. Where to find implementation details [1] Nicolaie Popescu-Bodorin, Circular Fuzzy Iris Segmentation, 4th Annual South-East European Doctoral Student Conference (DSC 2009), 6-7 July 2009, Thessaloniki, GREECE. [2] Nicolaie Popescu-Bodorin, Searching for 'Fragile Bits' in Iris Codes Generated with Gabor Analytic Iris Texture Binary Encoder, 17th Conference on Applied and Industrial Mathematics ( CAIM 2009 ), September 2009, Constantza, ROMANIA. [3] Nicolaie Popescu-Bodorin, Exploring New Directions in Iris Recognition 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing ( SYNASC 2009 ), September 2009, Timisoara, ROMANIA. [4] Nicolaie Popescu-Bodorin, A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation, 17th Telecommuni- cations Forum (TELFOR 2009), November 2009, Belgrade, SERBIA. A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation

Acknowledgment I wish to thank my PhD Coordinator, Professor Luminita State (University of Pitesti, RO) - for her comments, criticism, and constant moral and academic support during the last two years, and Professor Donald Monro (University of Bath, UK) - for granting me access to the Bath University Iris Database. Thank you for your attention! 17th Telecommunications Forum, TELFOR 2009, Belgrade, SERBIA, November 24-26, 2009