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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on pattern analysis and machine intelligence Ročník 45; číslo 12; s. 1 - 15
Hlavní autoři:	Gratacos, Gustavo, Chakrabarti, Ayan, Ju, Tao
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!