Sliding Texture Volume Rendering

• US 20090033657A1
• Filed: 10/14/2008
• Published: 02/05/2009
• Est. Priority Date: 05/25/2004
• Status: Active Grant

• Current Assignee: Siemens Healthcare GMBH (Siemens AG)
• Original Assignee: Siemens Medical Solutions USA Incorporated (Siemens AG)
• Inventors: Engel, Klaus, Paladini, Gianluca
• Granted Patent: US 7,649,533 B2
• Time in Patent Office: Days
• US Class Current: 345/420
• CPC Class Codes: G06T 15/04 Texture mapping
• CPC Class Codes: G06T 15/08 Volume rendering

Abstract

Subsets of volume data are sequentially stored for volume rendering from two dimensional textures. For example, pairs of adjacent two-dimensional images are loaded into RAM or cache. Strips of texture data are interpolated for polygons extending between the two-dimensional images. The strips or polygons are more orthogonal to a viewing direction than the two-dimensional images. After interpolating texture data from the two-dimensional images for a plurality of non-coplanar polygons, the texture data is rendered. The rendered information represents one portion of the three dimensional representation. Other portions are rendered by repeating the process for other pairs or subset groups of adjacent two-dimensional images. A lower cost apparatus, such as a programmed computer or a GPU with a limited amount of memory, is able to render images for three dimensional representations of very large three-dimensional arrays. The images may be rendered without copying volume data for different main axes.

Claims

1. A method for volume rendering from two dimensional textures, the method comprising:

sequentially loading subsets of two-dimensional textures from a set of data representing a volume into a memory, each new one of the subsets formed by replacing at least one of the two-dimensional textures of a previous subset with another one of the two-dimensional textures, such that less of the memory is used at a given time for rendering than loading the entire volume into the memory; and

for each subset, rendering a portion of an image from the subset.

2. The method of claim 1 wherein the memory or addressing is insufficient to handle the entire volume, and wherein rendering comprises rendering the image as a representation of the entire volume.

3. The method of claim 1 wherein rendering comprises:

identifying polygons extending as strips between adjacent two dimensional textures of each subset, the strips being non-parallel with the two dimensional textures and being on different planes intersecting the two dimensional textures;

generating texture data for the polygons; and

rendering a portion of the image from the texture data for the polygons.

5. The method of claim 3 wherein identifying polygons comprises identifying a plurality of polygons in the different planes extending between the same adjacent two dimensional textures, wherein generating texture data comprises interpolating, for each polygon of the plurality of polygons, from data at intersections of the polygons with the same adjacent two dimensional textures, and wherein rendering comprises interpolating between the polygons of the plurality of polygons.

6. The method of claim 3 wherein identifying polygons comprises calculating a first polygon of the polygons for a first set of the adjacent two dimensional textures and translating the first polygon for a second, different set of the two dimensional textures, the translated first polygon being a second polygon.

7. The method of claim 3 wherein the adjacent two dimensional textures represent a volume at a first orientation;

wherein rendering comprises texture rendering for any viewing direction without generating copies of data representing the volume at a different orientation than the first orientation.

8. The method of claim 1 wherein rendering comprises texture rendering a three dimensional representation as the image with different areas of the image being rendered as a function of different strips between the two-dimensional textures of each subset.

9. A system for generating data for volume rendering, the system comprising:

a memory operable to sequentially store different subsets of a plurality of two dimensional images, the two-dimensional images of each subsequent subset replacing the two-dimensional images of each previous subset; and

a processor operable to render a rendered two-dimensional image as a function of the subsets, different portions of the rendered two-dimensional image rendered sequentially from the sequentially stored different subsets.

10. The system of claim 9 further comprising a data source operable to provide two-dimensional images representing an entire volume, wherein the memory is insufficient to store the entire volume, the processing being operable to render the rendered two-dimensional image as a representation of the entire volume using the sequential rendering and storage.

11. The system of claim 9 wherein the processor, to render, is operable to generate texture data, for each different subset, on each of a plurality of strips representing areas between the two dimensional images of each different subset, the areas being non-parallel with and intersecting the two dimensional images, the texture data for each different subset being a function from the two dimensional images of the respective different subset.

12. The system of claim 11 wherein the processor comprises a graphic processing unit and the memory comprises a graphic processing unit memory.

13. The system of claim 11 wherein the memory is operable in a first-in first-out format, and the processor is operable to generate the texture data, for each pair of two-dimensional images currently stored in the memory as the subset, by identifying a plurality of substantially parallel, non-coplanar polygons extending between the pair of two-dimensional images and by interpolating data from the pair of two dimensional images on the polygons.

14. The system of claim 11 wherein the processor is operable to rasterize a series of the strips textured with the texture data.

15. The system of claim 11 wherein the processor is operable to set the areas as a function of the viewing direction.

16. A method for volume rendering from two dimensional textures, the method comprising:

identifying polygons extending as strips between adjacent two dimensional textures, the strips being non-parallel with the two dimensional textures and being on different planes intersecting the two dimensional textures;

generating texture data for the polygons, wherein generating texture data comprises 2D texture mapping with object-order data access achieved through the use of data-aligned polygon strips; and

rendering an image from the texture data for the polygons.

17. The method of claim 16 wherein rendering comprises texture rendering a three dimensional representation as a two dimensional image, with different areas of the two dimensional image being rendered as a function of different ones of the strips corresponding to different sets of the adjacent two dimensional textures.

18. The method of claim 16 wherein identifying polygons comprises identifying a plurality of polygons in the different planes extending between the same adjacent two dimensional textures, wherein generating texture data comprises interpolating, for each polygon of the plurality of polygons, from data at intersections of the polygons with the same adjacent two dimensional textures, and wherein rendering comprises interpolating between the polygons of the plurality of polygons.

19. The method of claim 16 wherein identifying polygons comprises calculating a first polygon of the polygons for a first set of the adjacent two dimensional textures and translating the first polygon for a second, different set of the two dimensional textures, the translated first polygon being a second polygon.

20. The method of claim 16 wherein identifying polygons comprises identifying substantially parallel, non-coplanar polygons corresponding to three or more of the adjacent two dimensional textures:

wherein rendering comprises clipping the polygons to correspond to a fewer number of the three or more adjacent two dimensional textures.

21. The method of claim 16 wherein identifying comprises sequentially identifying polygons for different subsets of a plurality of the adjacent two dimensional textures;

wherein rendering comprises rendering different portions of the image sequentially as a function of the different subsets.

22. The method of claim 21 further comprising loading the different subsets sequentially into memory, where unneeded two dimensional textures are replaced to form each new subset such that less memory is used for rendering an entire volume than if the entire volume were loaded.

23. The method of claim 16 wherein the adjacent two dimensional textures represent a volume at a first orientation;

wherein rendering comprises texture rendering for any viewing direction without generating copies of data representing the volume at a different orientation than the first orientation.

24. The method of claim 16 wherein the adjacent two dimensional textures include three or more two dimensional textures with non-uniform distance, non-uniform scaling or both non-uniform distance and non-uniform scaling;

and

wherein rendering comprises texture rendering free of resampling the adjacent two dimensional textures themselves to a uniform grid.