Springer Information Theory in Computer Vision and Pattern Recognition

Product Description Information theory has proved to be effective for solving many computer vision and pattern recognition (CVPR) problems (such as image matching, clustering and segmentation, saliency detection, feature selection, optimal classifier design and many others). Nowadays, researchers are widely bringing information theory elements to the CVPR arena. Among these elements there are measures (entropy, mutual information…), principles (maximum entropy, minimax entropy…) and theories (rate distortion theory, method of types…). This book explores and introduces the latter elements through an incremental complexity approach at the same time where CVPR problems are formulated and the most representative algorithms are presented. Interesting connections between information theory principles when applied to different problems are highlighted, seeking a comprehensive research roadmap. The result is a novel tool both for CVPR and machine learning researchers, and contributes to a cross-fertilization of both areas. From the Back Cover Information Theory (IT) can be highly effective for formulating and designing algorithmic solutions to many problems in Computer Vision and Pattern Recognition (CVPR). This text introduces and explores the measures, principles, theories, and entropy estimators from IT underlying modern CVPR algorithms, providing comprehensive coverage of the subject through an incremental complexity approach. The authors formulate the main CVPR problems and present the most representative algorithms. In addition, they highlight interesting connections between elements of IT when applied to different problems, leading to the development of a basic research roadmap (the ITinCVPR tube). The result is a novel tool, unique in its conception, both for CVPR and IT researchers, which is intended to contribute as much as possible to a cross-fertilization of both areas. Topics and features: Introduces contour and region-based image segmentation in computer vision, covering Jensen-Shannon divergence, the maximum entropy principle, the minimum description length (MDL) principle, and discriminative-generative approaches to segmentation Explores problems in image and pattern clustering, discussing Gaussian mixtures, information bottleneck, robust information clustering, and IT-based mean-shift, as well as strategies to form clustering ensembles Includes a selection of problems at the end of each chapter, to both consolidate what has been learnt and to test the ability of generalizing the concepts discussed Investigates the application of IT to interest points, edge detection and grouping in computer vision, including the concept of Shannon’s entropy, Chernoff information and mutual information, Sanov’s theorem, and the theory of types Reviews methods of registration, matching and recognition of images and patterns, considering measures related to the concept of mutual information, alternative derivations of Jensen-Shannon divergence, the Fisher-Rao metric tensor, and the application of the MDL principle to tree registration Supplies additional material, including sketched solutions and additional references, at http://www.rvg.ua.es/ITinCVPR Examines the main approaches to feature selection and feature transform, describing the methods of principal component analysis and its generalization, and independent component analysis, together with filter, wrapper and on-line methods Explores the IT approach for classifier design including classifiers ensembles and connections with information projection and information geometry. Contains a Foreword by Professor Alan Yuille A must-read not only for researchers in CVPR-IT, but also for the wider CVPR community, this text is also suitable for a one semester IT-based course in CVPR. --- Information theory has found widespread use in modern computer vision, and provides one of the most powerful current paradigms in the field. To date, though, t