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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence Vol. 45; no. 12; pp. 1 - 15
Main Authors: Gratacos, Gustavo, Chakrabarti, Ayan, Ju, Tao
Format: Journal Article
Language:English
Published: United States IEEE 01.12.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first