Relational constraints for point distribution models

DOI10.1007/3-540-44692-3_78MaRDI QIDQ4780913zbMATH OpenFDO

Authors Bin Luo, Edwin R. Hancock

Publication date 21 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2124/21240646

zbMATH Keywords

landmark pointspoint distribution modelsrelational constraints

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Computing methodologies and applications (68U99) Biomedical imaging and signal processing (92C55)

Recommendations

• Learning mixtures of point distribution models with the EM algorithm.
• Alignment and correspondence using singular value decomposition
• Correspondence matching using kernel principal components analysis and label consistency constraints
• Inexact Bayesian point pattern matching for linear transformations

Cited in

(5)

• Learning mixtures of point distribution models with the EM algorithm.
• Independent modes of variation in point distribution models
• Alignment and correspondence using singular value decomposition
• Structural, Syntactic, and Statistical Pattern Recognition
• A dynamic generating graphical model for point-sets matching

This page was built for publication: Relational constraints for point distribution models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780913)