This book is concerned with a fundamentally novel approach to graph-based pattern recognition based on vector space embedding of graphs. It aims at condensing the high representational power of graphs into a computationally efficient and mathematically convenient feature vector.This volume utilizes the dissimilarity space representation originally proposed by Duin and Pekalska to embed graphs in real vector spaces. Such an embedding gives one access to all algorithms developed in the past for feature vectors, which has been the predominant representation formalism in pattern recognition and related areas for a long time.

Graph Embedding for Pattern Recognition covers theory methods, computation, and applications widely used in statistics, machine learning, image processing, and computer vision. This book presents the latest advances in graph embedding theories, such as nonlinear manifold graph, linearization method, graph based subspace analysis, L1 graph, hypergraph, undirected graph, and graph in vector spaces. Real-world applications of these theories are spanned broadly in dimensionality reduction, subspace learning, manifold learning, clustering, classification, and feature selection. A selective group of experts contribute to different chapters of this book which provides a comprehensive perspective of this field.

This volume constitutes the refereed proceedings of the Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2012) and Statistical Techniques in Pattern Recognition (SPR 2012), held in Hiroshima, Japan, in November 2012 as a satellite event of the 21st International Conference on Pattern Recognition, ICPR 2012. The 80 revised full papers presented together with 1 invited paper and the Pierre Devijver award lecture were carefully reviewed and selected from more than 120 initial submissions. The papers are organized in topical sections on structural, syntactical, and statistical pattern recognition, graph and tree methods, randomized methods and image analysis, kernel methods in structural and syntactical pattern recognition, applications of structural and syntactical pattern recognition, clustering, learning, kernel methods in statistical pattern recognition, kernel methods in statistical pattern recognition, as well as applications of structural, syntactical, and statistical methods.

This book gives a comprehensive overview of the most advanced theories, methodologies and applications in computer vision. Particularly, it gives an extensive coverage of 3D and robotic vision problems. Example chapters featured are Fourier methods for 3D surface modeling and analysis, use of constraints for calibration-free 3D Euclidean reconstruction, novel photogeometric methods for capturing static and dynamic objects, performance evaluation of robot localization methods in outdoor terrains, integrating 3D vision with force/tactile sensors, tracking via in-floor sensing, self-calibration of camera networks, etc. Some unique applications of computer vision in marine fishery, biomedical issues, driver assistance, are also highlighted.

This book constitutes the refereed proceedings of the 8th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2011, held in Münster, Germany, in May 2011. The 34 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on graph-based representation and characterization, graph matching, classification, and querying, graph-based learning, graph-based segmentation, and applications.

The two volume set LNCS 8047 and 8048 constitutes the refereed proceedings of the 15th International Conference on Computer Analysis of Images and Patterns, CAIP 2013, held in York, UK, in August 2013. The 142 papers presented were carefully reviewed and selected from 243 submissions. The scope of the conference spans the following areas: 3D TV, biometrics, color and texture, document analysis, graph-based methods, image and video indexing and database retrieval, image and video processing, image-based modeling, kernel methods, medical imaging, mobile multimedia, model-based vision approaches, motion analysis, natural computation for digital imagery, segmentation and grouping, and shape representation and analysis.

This book constitutes the refereed proceedings of the 11th IAPR-TC-15 International Workshop on Graph-Based Representation in Pattern Recognition, GbRPR 2017, held in Anacapri, Italy, in May 2017. The 25 full papers and 2 abstracts of invited papers presented in this volume were carefully reviewed and selected from 31 submissions. The papers discuss research results and applications in the intersection of pattern recognition, image analysis, graph theory, and also the application of graphs to pattern recognition problems in other fields like computational topology, graphic recognition systems and bioinformatics.

Keyword Spotting (KWS) has been proposed as a flexible and more error-tolerant alternative to full transcriptions. In most cases, it allows to retrieve arbitrary query words in handwritten historical document.This comprehensive compendium gives a self-contained preamble and visually attractive description to the field of graph-based KWS. The volume highlights a profound insight into each step of the whole KWS pipeline, viz. image preprocessing, graph representation and graph matching.Written by two world-renowned co-authors, this unique title combines two very current research fields of graph-based pattern recognition and document analysis. The book serves as an attractive teaching material for graduate students, as well as a useful reference text for professionals, academics and researchers.

This volume constitutes the refereed proceedings of the 5th Iberian Conference on Pattern Recognition and Image Analysis, IbPRIA 2011, held in Las Palmas de Gran Canaria, Spain, in June 2011. The 34 revised full papers and 58 revised poster papers presented were carefully reviewed and selected from 158 submissions. The papers are organized in topical sections on computer vision; image processing and analysis; medical applications; and pattern recognition.

This unique text/reference presents a thorough introduction to the field of structural pattern recognition, with a particular focus on graph edit distance (GED). The book also provides a detailed review of a diverse selection of novel methods related to GED, and concludes by suggesting possible avenues for future research. Topics and features: formally introduces the concept of GED, and highlights the basic properties of this graph matching paradigm; describes a reformulation of GED to a quadratic assignment problem; illustrates how the quadratic assignment problem of GED can be reduced to a linear sum assignment problem; reviews strategies for reducing both the overestimation of the true edit distance and the matching time in the approximation framework; examines the improvement demonstrated by the described algorithmic framework with respect to the distance accuracy and the matching time; includes appendices listing the datasets employed for the experimental evaluations discussed in the book.