公开(公告)号：US20070065001A1

公开(公告)日：2007-03-22

申请号：US11337772

申请日：2006-01-23

申请人： Daphne Yu ,  Robert Schneider

发明人： Daphne Yu ,  Robert Schneider

IPC分类号： G06K9/00

CPC分类号： G06T19/00 ,  G06T15/08 ,  G06T2219/008

摘要： This invention describes an optimization and view dependency reduction method for multiplanar reformatting (MPR) of slice-based volume images. This method utilizes a traversal scheme that allows for efficient access of the computer memory layout of a sliced based volume, and therefore optimizes overall processing time. This method does not require changes to the volume memory layout or additional volume memory. Instead, efficient memory access is achieved by adaptive traversal patterns on the reformatting planes. The traversal pattern is adapted on-the-fly during rendering as the reformatting plane location and orientation is changed arbitrarily relative to the volume. In this way, the typical speed differences between various reformatting planes orientations caused by inefficient memory access is greatly reduced. Computer cache coherency, SIMD coherent implementation, and multiprocessing environments are also considered in the design of the traversal pattern.

摘要翻译： 本发明描述了用于基于片的体积图像的多平面重新格式化（MPR）的优化和视图依赖性降低方法。 该方法利用遍历方案，允许有效地访问基于片段的卷的计算机存储器布局，因此优化整个处理时间。 此方法不需要更改卷内存布局或额外的卷内存。 相反，通过重新格式化平面上的自适应遍历模式实现高效的存储器访问。 随着重新格式化平面位置和方向相对于卷的任意改变，遍历模式在渲染期间随时适应。 以这种方式，由于低效的存储器访问引起的各种重新格式化平面方向之间的典型速度差异大大降低。 在遍历模式的设计中也考虑了计算机缓存一致性，SIMD相干实现和多处理环境。

公开(公告)号：US20050260658A1

公开(公告)日：2005-11-24

申请号：US11110077

申请日：2005-04-20

申请人： Gianluca Paladini ,  Daphne Yu

发明人： Gianluca Paladini ,  Daphne Yu

IPC分类号： C12Q1/68 ,  G01N33/48 ,  G01N33/50 ,  G06F19/00 ,  G06T5/00 ,  G06T15/00 ,  G06T15/40

CPC分类号： G06T15/08 ,  G06K9/346 ,  G06K2209/05 ,  G06T5/005 ,  G06T7/11 ,  G06T2200/04 ,  G06T2207/10081 ,  G06T2207/30008

摘要： A method for detecting and removing small isolated fragments in a 3D segmented volume is disclosed. The 3D segmented volume is projected onto several 2D images from different viewing directions. Isolated 2D fragments are detected in the 2D images. Corresponding 3D fragments are found in the 3D volume by unprojecting corresponding detected 2D fragment locations. The unprojected detected 2D fragment locations are used as seed points for region growing of isolated 3D fragments. Any of the 3D fragments having a volume size below a user-defined threshold are discarded.

摘要翻译： 公开了一种用于检测和去除3D分段体积中的小分离碎片的方法。 3D分割的体积被投影到来自不同观察方向的几个2D图像上。 在2D图像中检测到孤立的2D片段。 通过取消投影相应的检测到的2D片段位置，在3D体积中找到相应的3D片段。 未投影检测到的2D片段位置用作分离的3D片段的区域生长的种子点。 任何具有低于用户定义阈值的体积大小的3D片段都被丢弃。

公开(公告)号：US08761474B2

公开(公告)日：2014-06-24

申请号：US13535607

申请日：2012-06-28

申请人： Daphne Yu ,  Wei Li ,  Feng Qiu

发明人： Daphne Yu ,  Wei Li ,  Feng Qiu

IPC分类号： G06K9/00 ,  G06K9/34 ,  G06K9/48

CPC分类号： G06T7/0016 ,  G06T11/206 ,  G06T2200/24 ,  G06T2207/10016 ,  G06T2207/10072 ,  G06T2207/30104 ,  G06T2207/30172

摘要： A method (100) of computing and displaying flow information of vascular blood flow patterns, especially in the form of quantitative data plots.

摘要翻译： 一种计算和显示血管血流模式的流动信息的方法（100），特别是以定量数据图的形式。

公开(公告)号：US08711144B2

公开(公告)日：2014-04-29

申请号：US11881944

申请日：2007-07-30

申请人： Jeffrey P. Johnson ,  John Patrick Collins ,  Mariappan S. Nadar ,  John S. Nafziger ,  Thomas Stingl ,  Daphne Yu

发明人： Jeffrey P. Johnson ,  John Patrick Collins ,  Mariappan S. Nadar ,  John S. Nafziger ,  Thomas Stingl ,  Daphne Yu

IPC分类号： G06T17/00

CPC分类号： G06T15/08 ,  G06T7/0002 ,  G06T2207/30168

摘要： Artifact quantification is provided in volume rendering. Since the visual conspicuity of rendering artifacts strongly influences subjective assessments of image quality, quantitative metrics that accurately correlate with human visual perception may provide consistent values over a range of imaging conditions.

摘要翻译： 在体绘制中提供了人工定量。 由于渲染工件的视觉显着性强烈影响图像质量的主观评估，与人类视觉感知准确相关的定量度量可能会在成像条件范围内提供一致的值。

公开(公告)号：US07844113B2

公开(公告)日：2010-11-30

申请号：US11685815

申请日：2007-03-14

申请人： Andrew Delong ,  Yuri Boykov ,  Daphne Yu

发明人： Andrew Delong ,  Yuri Boykov ,  Daphne Yu

IPC分类号： G06K9/34

CPC分类号： G06T7/162 ,  G06T7/11 ,  G06T7/12

摘要： A region-based push-relabel formulation is disclosed that removes the requirement that the entire graph should fit into the computer memory and yields an implementation that can reduce the required size and redundancy of accesses to the data memory, thus improving speed performance, while allowing for an efficient parallel processing implementation. The algorithm assigns all vertices that are not part of the sources or sinks with a value of 1. Sinks are assigned with zeros and sources are assigned a label equal to the number of their vertices. The preflow is then pushed from the sources to their neighbors, if any. When the preflow has all reached the boundaries, an adjacent region of the neighboring set is selected and preflow is pushed within this region. When the values of the preflow have been exhausted, region relabeling is done to update the label values. This is repeated within the region until all preflow has exited to the boundary of this region. The operation is then repeated for the neighboring regions that now contain the preflow. Regions which have no preflow may be skipped, thereby realizing a savings in processing resources.

摘要翻译： 公开了一种基于区域的推 - 重新标签公式，其消除了整个图形应该适合于计算机存储器的要求，并且产生可以减少对数据存储器的访问所需的大小和冗余度的实现，从而提高速度性能，同时允许 用于高效的并行处理实现。 算法将不是源或汇的一部分的所有顶点赋值为1。将使用零分配陷阱，并为源分配一个等于其顶点数的标签。 然后将预流从源推送到其邻居（如果有的话）。 当预流全部达到边界时，选择相邻集合的相邻区域，并且在该区域内推进预流。 当预流的值已经耗尽时，进行区域重新标签来更新标签值。 这在区域内重复，直到所有预流已经退出到该区域的边界。 然后对于现在包含预流的相邻区域重复操作。 可以跳过没有预先流动的区域，从而实现了处理资源的节省。

公开(公告)号：US20090295800A1

公开(公告)日：2009-12-03

申请号：US12365926

申请日：2009-02-05

申请人： Christoph Vetter ,  Daphne Yu ,  Wei Li ,  Wei Hong

发明人： Christoph Vetter ,  Daphne Yu ,  Wei Li ,  Wei Hong

IPC分类号： G06T17/00

CPC分类号： G06T15/08 ,  G06T17/005

摘要： A method for rendering a deformable object. The method includes: obtaining a 3D volumetric voxel dataset of a region, such region having therein an object to be rendered; building a tree hierarchical structure for the obtained volumetric dataset, such tree structure blocks as the nodes of a primary tree hierarchy and bricks being those blocks stored as textures in a video memory; augmenting the primary tree hierarchical structure with maximum and minimum values of the data contained within a block; creating a neighborhood tree hierarchy having for each leaf block of the neighborhood tree hierarchy a reference to the neighboring leaf blocks in the neighborhood tree hierarchy as well as references to neighboring bricks in the neighborhood tree hierarchy; updating the information about minimum and maximum in the primary tree hierarchy by saving for each block the minimum and maximum of the neighboring blocks; and rendering the leaf blocks in visibility order.

摘要翻译： 一种用于渲染可变形对象的方法。 该方法包括：获得区域的3D体积体元数据集，其中具有要渲染的对象的区域; 为所获得的体数据集构建树分层结构，这样的树结构块作为主树层次结构的节点，砖是作为纹理存储在视频存储器中的块; 以包含在块内的数据的最大值和最小值来增加主树分层结构; 创建邻域树层次结构，对于邻域树层次中的每个叶块，对邻域树层次中的相邻叶块的引用以及邻域树层次中的相邻砖的引用; 通过为每个块保存相邻块的最小值和最大值来更新主树层次结构中关于最小和最大值的信息; 并以可见性顺序呈现叶块。

公开(公告)号：US07469073B2

公开(公告)日：2008-12-23

申请号：US11110077

申请日：2005-04-20

申请人： Gianluca Paladini ,  Daphne Yu

发明人： Gianluca Paladini ,  Daphne Yu

IPC分类号： G06K9/40 ,  G06K9/00

CPC分类号： G06T15/08 ,  G06K9/346 ,  G06K2209/05 ,  G06T5/005 ,  G06T7/11 ,  G06T2200/04 ,  G06T2207/10081 ,  G06T2207/30008

摘要： A method for detecting and removing small isolated fragments in a 3D segmented volume is disclosed. The 3D segmented volume is projected onto several 2D images from different viewing directions. Isolated 2D fragments are detected in the 2D images. Corresponding 3D fragments are found in the 3D volume by unprojecting corresponding detected 2D fragment locations. The unprojected detected 2D fragment locations are used as seed points for region growing of isolated 3D fragments. Any of the 3D fragments having a volume size below a user-defined threshold are discarded.

摘要翻译： 公开了一种用于检测和去除3D分段体积中的小分离碎片的方法。 3D分割的体积被投影到来自不同观察方向的几个2D图像上。 在2D图像中检测到孤立的2D片段。 通过取消投影相应的检测到的2D片段位置，在3D体积中找到相应的3D片段。 未投影检测到的2D片段位置用作分离的3D片段的区域生长的种子点。 任何具有低于用户定义阈值的体积大小的3D片段都被丢弃。

公开(公告)号：US20070286483A1

公开(公告)日：2007-12-13

申请号：US11685815

申请日：2007-03-14

申请人： Andrew Delong ,  Yuri Boykov ,  Daphne Yu

发明人： Andrew Delong ,  Yuri Boykov ,  Daphne Yu

IPC分类号： G06K9/20

CPC分类号： G06T7/162 ,  G06T7/11 ,  G06T7/12

摘要： A region-based push-relabel formulation is disclosed that removes the requirement that the entire graph should fit into the computer memory and yields an implementation that can reduce the required size and redundancy of accesses to the data memory, thus improving speed performance, while allowing for an efficient parallel processing implementation. The algorithm assigns all vertices that are not part of the sources or sinks with a value of 1. Sinks are assigned with zeros and sources are assigned a label equal to the number of their vertices. The preflow is then pushed from the sources to their neighbors, if any. When the preflow has all reached the boundaries, an adjacent region of the neighboring set is selected and preflow is pushed within this region. When the values of the preflow have been exhausted, region relabeling is done to update the label values. This is repeated within the region until all preflow has exited to the boundary of this region. The operation is then repeated for the neighboring regions that now contain the preflow. Regions which have no preflow may be skipped, thereby realizing a savings in processing resources.

摘要翻译： 公开了一种基于区域的推 - 重新标签公式，其消除了整个图形应该适合于计算机存储器的要求，并且产生可以减少对数据存储器的访问所需的大小和冗余度的实现，从而提高速度性能，同时允许 用于高效的并行处理实现。 该算法将不是源或汇的一部分的所有顶点赋值为1. Sinks分配为零，并为源分配一个等于其顶点数的标签。 然后将预流从源推送到其邻居（如果有的话）。 当预流全部达到边界时，选择相邻集合的相邻区域，并且在该区域内推进预流。 当预流的值已经耗尽时，进行区域重新标签来更新标签值。 这在区域内重复，直到所有预流已经退出到该区域的边界。 然后对于现在包含预流的相邻区域重复操作。 可以跳过没有预先流动的区域，从而实现了处理资源的节省。

公开(公告)号：US20070237038A1

公开(公告)日：2007-10-11

申请号：US11687728

申请日：2007-03-19

申请人： Wei Li ,  Daphne Yu

发明人： Wei Li ,  Daphne Yu

IPC分类号： G11B11/00

CPC分类号： G06T15/08

摘要： Rendering with a punching mask is performed without voxelization. A plurality of sub-volumes are identified as a function of the punching mask. The sub-volumes are generally layered in range. Each sub-volume is rendered separately or independently. The renderings from multiple passes or sub-volumes are composited together.

摘要翻译： 使用冲孔掩模进行渲染，而不进行体素化。 多个子体积被识别为穿孔掩模的函数。 子体积通常分层。 每个子卷单独或单独渲染。 来自多个遍或子卷的渲染合成在一起。

公开(公告)号：US08493388B2

公开(公告)日：2013-07-23

申请号：US11835508

申请日：2007-08-08

申请人： Matthieu Dederichs ,  Klaus Engel ,  Daphne Yu

发明人： Matthieu Dederichs ,  Klaus Engel ,  Daphne Yu

IPC分类号： G06T15/60

CPC分类号： G06T15/00

摘要： The rendering pipeline is divided into multiple components or modules in a scene graph based visual programming environment. Different stages of the rendering pipeline, such as data conversion, transform function, shading, and rendering, are grouped into independent conceptual modules, and each module is implemented by separate nodes in a scene graph. The user may select different nodes belonging to different modules for inclusion into the scene graph to program the rendering pipeline. The visual program is implicitly compiled and run using an application programming interface for hardware acceleration.

摘要翻译： 渲染管线在基于场景图形的可视化编程环境中分为多个组件或模块。 渲染流水线的不同阶段（如数据转换，变换功能，阴影和渲染）分为独立的概念模块，每个模块由场景图中的单独节点实现。 用户可以选择属于不同模块的不同节点，以便包含在场景图中以对渲染管线进行编程。 可视化程序使用用于硬件加速的应用程序编程接口进行隐式编译和运行。