Efficient Schemes for Computing α-tree Representations

DOI10.1007/978-3-642-38294-9_10zbMath1382.68298OpenAlexW171804864MaRDI QIDQ4925100

Jiří Havel, Sébastien Lefèvre, François Merciol

Publication date: 11 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38294-9_10

zbMATH Keywords

hierarchiesefficient algorithmsimage partition\(\alpha \)-treequasi-flat zones

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

This page was built for publication: Efficient Schemes for Computing α-tree Representations