Tree Recovery by Dynamic Programming

Tree-like structures are common, naturally occurring objects that are of interest to many fields of study, such as plant science and biomedicine. Analysis of these structures is typically based on skeletons extracted from captured data, which often contain spurious cycles that need to be removed. We...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on pattern analysis and machine intelligence Jg. 45; H. 12; S. 1 - 15
Hauptverfasser:	Gratacos, Gustavo, Chakrabarti, Ayan, Ju, Tao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms beam search carving decomposition Costs Dynamic programming Heuristic algorithms Merging Optimization Partitioning algorithms Polytrees Recovery Search algorithms Shape Skeleton Tree recovery Trees (mathematics)
ISSN:	0162-8828, 1939-3539, 2160-9292, 1939-3539
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!