James C. Bezdek – författare

Fuzzy Models and Algorithms for Pattern Recognition and Image Processing presents a comprehensive introduction of the use of fuzzy models in pattern recognition and selected topics in image processing and computer vision. Unique to this volume in the Kluwer Handbooks of Fuzzy Sets Series is the fact that this book was written in its entirety by its four authors. A single notation, presentation style, and purpose are used throughout. The result is an extensive unified treatment of many fuzzy models for pattern recognition. The main topics are clustering and classifier design, with extensive material on feature analysis relational clustering, image processing and computer vision. Also included are numerous figures, images and numerical examples that illustrate the use of various models involving applications in medicine, character and word recognition, remote sensing, military image analysis, and industrial engineering.

Fuzzy Models and Algorithms for Pattern Recognition and Image Processing presents a comprehensive introduction of the use of fuzzy models in pattern recognition and selected topics in image processing and computer vision. Unique to this volume in the Kluwer Handbooks of Fuzzy Sets Series is the fact that this book was written in its entirety by its four authors. A single notation, presentation style, and purpose are used throughout. The result is an extensive unified treatment of many fuzzy models for pattern recognition. The main topics are clustering and classifier design, with extensive material on feature analysis relational clustering, image processing and computer vision. Also included are numerous figures, images and numerical examples that illustrate the use of various models involving applications in medicine, character and word recognition, remote sensing, military image analysis, and industrial engineering.

The fuzzy set was conceived as a result of an attempt to come to grips with the problem of pattern recognition in the context of imprecisely defined categories. In such cases, the belonging of an object to a class is a matter of degree, as is the question of whether or not a group of objects form a cluster. A pioneering application of the theory of fuzzy sets to cluster analysis was made in 1969 by Ruspini. It was not until 1973, however, when the appearance of the work by Dunn and Bezdek on the Fuzzy ISODATA (or fuzzy c-means) algorithms became a landmark in the theory of cluster analysis, that the relevance of the theory of fuzzy sets to cluster analysis and pattern recognition became clearly established. Since then, the theory of fuzzy clustering has developed rapidly and fruitfully, with the author of the present monograph contributing a major share of what we know today. In their seminal work, Bezdek and Dunn have introduced the basic idea of determining the fuzzy clusters by minimizing an appropriately defined functional, and have derived iterative algorithms for computing the membership functions for the clusters in question. The important issue of convergence of such algorithms has become much better understood as a result of recent work which is described in the monograph.

The availability of packaged clustering programs means that anyone with data can easily do cluster analysis on it. But many users of this technology don't fully appreciate its many hidden dangers. In today's world of "grab and go algorithms," part of my motivation for writing this book is to provide users with a set of cautionary tales about cluster analysis, for it is very much an art as well as a science, and it is easy to stumble if you don't understand its pitfalls. Indeed, it is easy to trip over them even if you do! The parenthetical word usually in the title is very important, because all clustering algorithms can and do fail from time to time.Modern cluster analysis has become so technically intricate that it is often hard for the beginner or the non-specialist to appreciate and understand its many hidden dangers. Here's how Yogi Berra put it, and he was right:In theory there's no difference between theory and practice. In practice, there is ~Yogi BerraThis book is a step backwards, to four classical methods for clustering in small, static data sets that have all withstood the tests of time. The youngest of the four methods is now almost 50 years old:Gaussian Mixture Decomposition (GMD, 1898)SAHN Clustering (principally single linkage (SL, 1909))Hard c-means (HCM, 1956, also widely known as (aka) "k-means")Fuzzy c-means (FCM, 1973, reduces to HCM in a certain limit)The dates are the first known writing (to me, anyway) about these four models. I am (with apologies to Marvel Comics) very comfortable in calling HCM, FCM, GMD and SL the Fantastic Four.Cluster analysis is a vast topic. The overall picture in clustering is quite overwhelming, so any attempt to swim at the deep end of the pool in even a very specialized subfield requires a lot of training. But we all start out at the shallow end (or at least that's where we should start!), and this book is aimed squarely at teaching toddlers not to be afraid of the water. There is no section of this book that, if explored in real depth, cannot be expanded into its own volume. So, if your needs are for an in-depth treatment of all the latest developments in any topic in this volume, the best I can do - what I will try to do anyway - is lead you to the pool, and show you where to jump in.

The availability of packaged clustering programs means that anyone with data can easily do cluster analysis on it. But many users of this technology don't fully appreciate its many hidden dangers. In today's world of "grab and go algorithms," part of my motivation for writing this book is to provide users with a set of cautionary tales about cluster analysis, for it is very much an art as well as a science, and it is easy to stumble if you don't understand its pitfalls. Indeed, it is easy to trip over them even if you do! The parenthetical word usually in the title is very important, because all clustering algorithms can and do fail from time to time.Modern cluster analysis has become so technically intricate that it is often hard for the beginner or the non-specialist to appreciate and understand its many hidden dangers. Here's how Yogi Berra put it, and he was right:In theory there's no difference between theory and practice. In practice, there is ~Yogi BerraThis book is a step backwards, to four classical methods for clustering in small, static data sets that have all withstood the tests of time. The youngest of the four methods is now almost 50 years old:Gaussian Mixture Decomposition (GMD, 1898)SAHN Clustering (principally single linkage (SL, 1909))Hard c-means (HCM, 1956, also widely known as (aka) "k-means")Fuzzy c-means (FCM, 1973, reduces to HCM in a certain limit)The dates are the first known writing (to me, anyway) about these four models. I am (with apologies to Marvel Comics) very comfortable in calling HCM, FCM, GMD and SL the Fantastic Four.Cluster analysis is a vast topic. The overall picture in clustering is quite overwhelming, so any attempt to swim at the deep end of the pool in even a very specialized subfield requires a lot of training. But we all start out at the shallow end (or at least that's where we should start!), and this book is aimed squarely at teaching toddlers not to be afraid of the water. There is no section of this book that, if explored in real depth, cannot be expanded into its own volume. So, if your needs are for an in-depth treatment of all the latest developments in any topic in this volume, the best I can do - what I will try to do anyway - is lead you to the pool, and show you where to jump in.