Shape matching using a binary search tree structure of weak classifiers

DOI10.1016/J.PATCOG.2011.11.025MaRDI QIDQ408070zbMATH OpenOpenAlexFDO

Authors Nikolaos Tsapanos, Anastasios Tefas, Nikolaos Nikolaidis, Ioannis Pitas

Publication date 28 March 2012

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2011.11.025

zbMATH Keywords

Hausdorff distanceshape matchingbinary search treesclassification trees

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45)

Recommendations

• scientific article; zbMATH DE number 1744977
• Shape Vocabulary: A Robust and Efficient Shape Representation for Shape Matching

Cited in

(1)

• Index trees for accelerating deformable template matching

This page was built for publication: Shape matching using a binary search tree structure of weak classifiers

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