Illumination Planning for Object Recognition Using Parametric Eigenspaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
A non-linear generalisation of PDMs using polynomial regression
BMVC 94 Proceedings of the conference on British machine vision (vol. 2)
Non-linear point distribution modelling using a multi-layer perceptron
BMVC '95 Proceedings of the 1995 British conference on Machine vision (Vol. 1)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Robust recognition using eigenimages
Computer Vision and Image Understanding - Special issue on robusst statistical techniques in image understanding
IEEE Transactions on Pattern Analysis and Machine Intelligence
EigenTracking: Robust Matching and Tracking of Articulated Objects Using a View-Based Representation
ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
MICCAI '01 Proceedings of the 4th International Conference on Medical Image Computing and Computer-Assisted Intervention
A Unified Information-Theoretic Approach to the Correspondence Problem in Image Registration
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Optimal Sub-Shape Models by Minimum Description Length
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Journal of Cognitive Neuroscience
ASM driven snakes in rheumatoid arthritis assessment
SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
Paper: Modeling by shortest data description
Automatica (Journal of IFAC)
Universal coding, information, prediction, and estimation
IEEE Transactions on Information Theory
Robust autonomous model learning from 2D and 3D data sets
MICCAI'07 Proceedings of the 10th international conference on Medical image computing and computer-assisted intervention - Volume Part I
Hi-index | 0.01 |
This paper investigates a concept for modelling complex data based on sub-models. The task of building and choosing optimal models is addressed in a generic information theoretic fashion. We propose an algorithm based on minimum description length to find an optimal sub-division of the data into sub-parts, each adequate for linear modelling. This results in an overall more compact model configuration called a model clique and in better generalization behavior. The algorithm is applied to active appearance models, active shape models and eigenimages and is evaluated on 4 different data sets. Experiments indicate that model cliques exhibit better generalization behavior than single models and mimic intuitive sub-division of data.