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.

Fast-track conference proceedings

Estimation, Learning, and Adaptation: Systems That Improve with Use.- Optimization Techniques for Geometric Estimation: Beyond Minimization.- Hierarchical Compositional Representations of Object Structure.- Information Theoretic Prototype Selection for Unattributed Graphs.- Graph Kernels: Crossing Information from Different Patterns Using Graph Edit Distance.- Mode Seeking Clustering by KNN and Mean Shift Evaluated.- Learning Sparse Kernel Classifiers in the Primal.- EvolutionaryWeighted Mean Based Framework for Generalized Median Computation with Application to Strings.- Graph Complexity from the Jensen-Shannon Divergence.- Complexity of Computing Distances between Geometric Trees.- Active Graph Matching Based on Pairwise Probabilities between Nodes.- On the Relation between the Common Labelling and the Median Graph.- A Hierarchical Image Segmentation Algorithm Based on an Observation Scale.- A Discrete Scale Space Neighborhood for Robust Deep Structure Extraction.- On the Correlation of Graph Edit Distance and L1 Distance in the