Methods and devices for airway tree labeling and/or matching
AssigneeUniversity of Iowa Research Foundation
InventorsJuerg Tschirren, Milan Sonka, Joseph Reinhardt, Geoffrey McLennan, Eric Hoffman
Life of this patent
Estimating the term…
Abstract
Devices, such as computer readable media, and methods, such as automated methods, for labeling and/or matching. Some of the devices and methods are particularly useful for anatomical labeling of human airway trees. Some of the devices and methods are particularly useful for matching branch-points of human airway trees from represented in two or more graphs.
Claims38
A non-transitory computer readable medium comprising machine readable instructions for:
- accessing a first representation of an airway tree of a human subject;
- accessing a second representation of the airway tree of the human subject;
- automatically pruning at least a portion of the first representation, including:
- deleting from the first representation of the airway tree a terminal branch having a length shorter than a pre-defined threshold length;
- deleting from the first representation of the airway tree a vertex having an in-edge and only one out-edge;
- and
- replacing the in-edge and out-edge of the deleted vertex with a single edge.
A non-transitory computer readable medium comprising machine readable instructions for:
- accessing a first representation of an airway tree of a human subject, the first representation including vertices;
- accessing a second representation of the airway tree of the human subject, the second representation including vertices;
- building a tree association graph, where the building includes determining whether two possible vertices of the tree association graph have a topological distance that falls within a range of acceptable topological distances;
- and
- automatically pruning at least a portion of the first representation, including:
- deleting from the first representation of the airway tree a vertex having an in-edge and only one out-edge;
- and
- replacing the in-edge and out-edge of the deleted vertex with a single edge.
A non-transitory computer readable medium comprising machine readable instructions for:
- accessing a first representation of an airway tree of a human subject, the first representation including vertices;
- accessing a second representation of the airway tree of the human subject, the second representation including vertices;
- and
- building a tree association graph, where the building includes assigning vertices to the tree association graph such that no inheritance relationships other than parent, child, or sibling exist among the vertices.
A non-transitory computer readable medium comprising machine readable instructions for:
- accessing a first representation, the first representation including a segmented, skeletonized representation of an airway tree at a first lung volume of a human subject;
- accessing a second representation, the second representation including a segmented, skeletonized representation of the airway tree at a second lung volume of a human subject;
- and
- automatically pruning at least a portion of the first representation, including:
- deleting from the first representation a vertex having an in-edge and only one out-edge;
- and
- replacing the in-edge and out-edge of the deleted vertex with a single edge.
Dependencies are inferred from the claim text.