A graph labelling approach for connected feature selection

DOI10.1007/3-540-44522-6_30MaRDI QIDQ4536502zbMATH OpenFDO

Authors Jocelyn Marchadier, Sylvain Michelin, Yves Egels

Publication date 5 November 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44522-6_30

zbMATH Keywords

contour mapfeature extractionMDLmodel selection

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45) Computing methodologies and applications (68U99)

Recommendations

• Application of mathematical morphology and Markov random field theory to the automatic extraction of linear features in airborne images
• Shape feature extraction
• Linear-time connected-component labeling based on sequential local operations
• scientific article; zbMATH DE number 1750471
• A graph-based representation to detect linear features

Cited in

(3)

• A robust graph-based semi-supervised sparse feature selection method
• A Graph-Based Approach to Feature Selection
• Adaptive Feature Selection Based on the Most Informative Graph-Based Features

This page was built for publication: A graph labelling approach for connected feature selection

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