User interface for presenting multi-level map clusters
US-2024401465-A1 · Dec 5, 2024 · US
US9519981B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9519981-B2 |
| Application number | US-201213539863-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 2, 2012 |
| Priority date | Nov 4, 2011 |
| Publication date | Dec 13, 2016 |
| Grant date | Dec 13, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for visualizing brain connectivity includes receiving image data including molecular diffusion of brain tissue, constructing a tree data structure from the image data, wherein the tree data structure comprises a plurality of network nodes, wherein each network node is connected to a root of the tree data structure, rendering a ring of a radial layout depicting the tree data structure, wherein a plurality of vertices may be traversed from the top to the bottom, duplicating at least one control point for spline edges sharing a common ancestor, and bundling spline edges by applying a global strength parameter β.
Opening claim text (preview).
What is claimed is: 1. A method for visualizing brain network connectivity in 3-dimensions (3D), comprising: receiving image data corresponding to a brain of interest; constructing a brain network from the image data by recursively clustering network nodes using knowledge of brain networks, wherein centroids of hierarchical clusters are determined and used as nodes to construct hierarchical brain networks to guide connections of a target network of the whole brain, wherein edges are started from leaf nodes and then converged toward ancestor nodes; rendering edges between nodes using B-Spline curves constructed from control points found by searching for a nearest common ancestor of two related nodes of the target network from the hierarchical brain networks; duplicating at least one control point for spline edges sharing a common ancestor to create an extra copy of said at least one control point; bundling spline edges by applying a global strength parameter β; displaying a 3D visualization of the brain network connectivity by rendering left/right view images into a frame buffer object (FBO) at full screen resolution, and attaching content from the FBO as textures to a corresponding viewer or viewers; and coloring edges by an alpha blending technique that blends a color of a start node and a color of an end node, wherein a local blending factor is a normalized distance to the start node and a global blending factor is a normalized line length. 2. The method of claim 1 , wherein the brain network is a tree data structure, the tree data structure comprises a plurality of layers including a top layer having a first vertex corresponding to an entirety of the image data, a bottom layer comprising second vertices corresponding to the plurality of network nodes, and a plurality of intermediate layers comprising third vertices corresponding to a clustered region, wherein each network node is connected to a root of the tree data structure. 3. The method of claim 2 , further comprising rendering a ring of a radial layout depicting the tree data structure, wherein a plurality of vertices may be traversed from the top to the bottom, wherein a segment size of the ring is proportional to a number of vertices at the bottom layer in a corresponding tree branch, and displaying a visualization of the brain network connectivity in the radial layout including bundled spline edges. 4. The method of claim 1 , further comprising applying a mono color for connection spline edges. 5. The method of claim 1 , further comprising determining a color value for each spline edge by a linear interpolation using a length of the corresponding spline edge. 6. The method of claim 1 , wherein constructing the brain network from the image data comprises determining a structural connectivity of the brain of interest, wherein the brain network depicts the structural connectivity of the brain of interest. 7. The method of claim 1 , wherein constructing the brain network from the image data comprises determining a functional connectivity of the brain of interest, wherein the brain network depicts the functional connectivity of the brain of interest. 8. The method of claim 1 , wherein the image data is obtained by one of molecular diffusion, resting-state functional magnetic resonance imaging, magnetoencephalography and electroencephalography. 9. The method of claim 1 , wherein constructing the brain network from the image data is performed using a brain atlas. 10. The method of claim 1 , wherein constructing the brain network from the image data includes recursively clustering highly interconnected nodes that are sparsely connected to nodes in other clusters. 11. A non-transitory program storage device readable by a computer, encoded with a program of instructions executed by the computer to perform the method steps for visualizing brain connectivity in 3-dimensions (3D), the method comprising the steps of: receiving image data including molecular diffusion of a brain of interest; constructing a brain network from the image data by recursively clustering network nodes using knowledge of brain networks, wherein centroids of hierarchical clusters are determined and used as nodes to construct hierarchical brain networks to guide connections of a target network of the whole brain, wherein edges are started from leaf nodes and then converged toward ancestor nodes; rendering edges between nodes using B-Spline curves constructed from control points found by searching for a nearest common ancestor of two related nodes of the target network from the hierarchical brain networks; duplicating at least one control point for spline edges sharing a common ancestor to create an extra copy of said at least one control point; bundling spline edges by applying a global strength parameter β; and displaying a 3D visualization of the brain network connectivity by rendering left/right view images into a frame buffer object (FBO) at full screen resolution, and attaching content from the FBO as textures to a corresponding viewer or viewers, wherein constructing the brain network from the image data includes recursively clustering highly interconnected nodes that are sparsely connected to nodes in other clusters. 12. The computer program product of claim 11 , wherein the brain network is a tree data structure, the tree data structure comprises a plurality of layers including a top layer having a first vertex corresponding to an entirety of the image data, a bottom layer comprising second vertices corresponding to the plurality of network nodes, and a plurality of intermediate layers comprising third vertices corresponding to a clustered region, wherein each network node is connected to a root of the tree data structure. 13. The computer program product of claim 12 , the method further comprising rendering a ring of a radial layout depicting the tree data structure, wherein a plurality of vertices may be traversed from the top to the bottom, wherein a segment size of the ring is proportional to a number of vertices at the bottom layer in a corresponding tree branch, and displaying a visualization of the brain network connectivity in the radial layout including bundled spline edges. 14. The computer program product of claim 11 , further comprising applying a mono color for connection spline edges. 15. The computer program product of claim 11 , further comprising determining a color value for each spline edge by a linear interpolation using a length of the corresponding spline edge. 16. The computer program product of claim 11 , the method further comprising coloring edges by an alpha blending technique that blends a color of a start node and a color of an end node, wherein a local blending factor is a normalized distance to the start node and a global blending factor is a normalized line length. 17. The computer program product of claim 11 , wherein constructing the brain network from the image data comprises determining a structural connectivity of the brain of interest, wherein the brain network depicts the structural connectivity of the brain of interest. 18. The computer program product of claim 11 , wherein constructing the brain network from the image data comprises determining a functional connectivity of the brain of interest, wherein the brain network depicts the functional connectivity of the brain of interest. 19. The computer program product of claim 11 , wherein the image data is obtained by one of molecular diffusion, resting-state functional magnet
Drawing of charts or graphs · CPC title
Evaluating the brain (for intracranial pressure A61B5/031; for cerebral blood gases A61B5/14553; using EEG A61B5/369) · CPC title
for the brain · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.