Fast file server methods and systems

Information

  • Patent Grant
  • 11075978
  • Patent Number
    11,075,978
  • Date Filed
    Monday, March 30, 2020
    4 years ago
  • Date Issued
    Tuesday, July 27, 2021
    3 years ago
Abstract
The invention provides, in one aspect, an improved system for data access comprising a file server that is coupled to a client device or application executing thereon via one or more networks. The server comprises static storage that is organized in one or more directories, each containing, zero, one or more files. The server also comprises a file system operable, in cooperation with a file system on the client device, to provide authorized applications executing on the client device access to those directories and/or files. Fast file server (FFS) software or other functionality executing on or in connection with the server responds to requests received from the client by transferring requested data to the client device over multiple network pathways. That data can comprise, for example, directory trees, files (or portions thereof), and so forth.
Description
BACKGROUND OF THE INVENTION

The invention pertains to digital data processing and, more particularly, to methods and apparatus for accessing and/or delivering data in a client-server environment. The invention has application in improving file and data access over local area networks, the Internet, and other networks.


Traditional file servers or network attached storage (NAS) devices support access requests received from networked client devices (e.g., PCs, workstations and the like) using network file system capabilities built in to the server operating system—which may be, for example, Linux or Microsoft Windows Server. Typically, these file systems, e.g. SMB/CIFS, allow the clients to access files and directories maintained on the server as if they were local to the requesting clients themselves—albeit, the transfers take place via the network and, as a result, are traditionally much slower.


Thus, for example, file transfers from a NAS to a client device may be as slow as 10-50 Mbyte/s, even if Gigabit-Ethernet—which has a theoretical peak bandwidth of about 110 Mbyte/s—is used as the network. The discrepancy is more pronounced when actual transfer speeds of 10-50 Mbyte/s are measured against the read performance delivered by fast RAID systems of the type often attached to high-performance file servers. Those RAID systems are capable of delivering at rates of 200-300 MByte/s, or even higher for sufficiently large sequential reads.


Data input/output (I/O) performance is a critical component in data intensive applications such as, by way of non-limiting example, signal processing applications, visualization applications, and the like.


An object of the invention is to provide improved methods and systems for digital data processing and, more particularly, by way of non-limiting example, for accessing and/or delivering data in a client-server environment.


A related object of the invention is to provide such methods and systems as improve the speed of data transfer between file servers and client devices.


A still further related object of the invention is to provide such methods and systems as reduce the gap between high RAID performance and the performance usable at the application level, e.g., when a network is disposed in between.


SUMMARY OF THE INVENTION

The foregoing are among the objects attained by the invention which provides, in one aspect, an improved system for data access comprising a file server that is coupled to a client device via one or more networks. The server comprises static storage that is organized in one or more directories, each containing, zero, one or more files. The server also comprises a file system operable, in cooperation with a file system on the client device, to provide authorized applications executing on the client device access to those directories and/or files. Fast file server (FFS) software or other functionality executing on or in connection with the server responds to requests received from the client device or an application executing thereon (collectively, “client”) by transferring requested data to the client in parallel over multiple network pathways. That data can comprise, for example, directory trees, files (or portions thereof), and so forth.


Related aspects of the invention provide systems as described above in which the server stores a configuration file that is accessible by authorized clients (e.g., authorized applications executing on the client device) and that identifies one or more network interfaces over which the requested data can be transferred. Further related aspects of the invention provide systems as described above in which the configuration file additionally contains one or more security keys that can be used by the client and the server in connection with a requested data transfer.


Yet still further related aspects of the invention provide systems as described above in which the file system of the server controls access to the configuration file by the client. Such control can be based, for example, on access permissions associated with the configuration file and with the executing application.


Still further aspects of the invention provide systems as described above in which the client (e.g., an application executing on the client device) requests access to the configuration file and, if successful, generates a request for further data on the server. According to related aspects of the invention, the application generates such a request along with one or more of the security keys provided in the configuration file. In further related aspects of the invention, the application generates such a request on one or more network interfaces identified in that file. As noted above, the further data that is the subject of such a request can comprise, for example, directory trees, files (or portions thereof), and so forth.


Further aspects of the invention provide systems as described above in which the FFS functionality executing on (or in connection with) the server listens for requests on network interfaces identified in the configuration file. According to further related aspects of the invention, it listens only on those network interfaces that are connected to physically independent networks. Still further related aspects of the invention provide systems as described above in which the FFS functionality uses security keys provided with requests to validate those requests.


According to still further aspects of the invention, the FFS functionality responds to requests received from the client device by transferring requested data with the client via the multiple network connections over which those requests were received.


Further aspects of the invention provide systems as described above in which the server is coupled to multiple client devices via one or more networks. In such systems, the server responds to requests received from each client device by transferring requested data to that client device over multiple network pathways. According to related aspects of the invention, the configuration file specifies a different subset of network interfaces for each client (e.g., each client device and/or application executing thereon).


Still other aspects of the invention provide methods for transferring data between a server and one or more client devices paralleling the foregoing.


These and other aspects of the invention are evident in the drawings and in the description that follows.





BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the invention may be attained by reference to the drawings, in which:



FIG. 1 depicts a digital data processing system according to the invention;



FIG. 2 is a further depiction of the digital data processing system of FIG. 1; and



FIG. 3 depicts a method of operation of the system of FIG. 1.





DETAILED DESCRIPTION OF THE INVENTION

Architecture



FIGS. 1 & 2 depict a digital data processing system 10 according to the invention. The system includes a file server 12 that is coupled to a client device 14 and, more typically, multiple client devices 14-18 via a network 20 and, more typically, multiple networks 20-22.


Server 12 may comprise a conventional file server and/or network attached storage (NAS) (collectively, “server” or “file server”) of the type conventionally known in the art, as adapted in accord with the teachings hereof. Although only one server is shown in the drawing, it will be appreciated that the invention can be practiced with more such servers.


The server includes static storage that maintains user, application, enterprise or other data organized in the conventional manner known in the art—here, in one or more directories, each containing, zero, one or more files. In other embodiments, such data may be organized as serialized objects and/or in other manners known in the art. Storage device 24 typically comprises one or more disk drives (as shown) and, preferably, one or more high-speed RAID devices—though, in other embodiments, tape drives, ROM, RAM, Flash Memory, and/or CD-ROM devices may be used instead or in addition. Regardless, such storage device(s) 24 are of the type conventionally known in the art as adapted in accord with the teachings hereof.


The server 12 also comprises a file system 30 that forms part of and/or cooperates with a native operating system 32. Both of these components are of the type conventionally known in the art, as adapted in accord with the teachings hereof. Thus, for example, operating system 32 may comprise Linux or Microsoft Windows Server, both by way of non-limiting example and, file system 30 may comprise NTFS, EXT3, or XFS, again, by way of non-limiting example and by be exported by the operating system using a protocol such as SMB/CIFS or NFS, again, by way of non-limiting example. By way of said export protocols the file system 30 operates in cooperation with file systems 34-38 (discussed below) on the client devices 14-18 to provide authorized applications executing on the client device access to those directories and/or files.


Server 12 further comprises a fast file server (FFS) module 46—here, embodied in software executing on server 12, but in other instantiations embodied in hardware executing in conjunction with server 12—that responds to requests received from a client device 14-18 by transferring requested data (e.g., directory trees, files (or portions thereof), and so forth) with that client device over multiple networks 20-22.


Server 12 further comprises one or more configuration files 48 that store identities of one or more network interfaces over which the clients devices 14-18 may request data transfers. In preferred embodiments, the configuration file(s) 48 additionally store one or more security keys that can be used to validate and/or identify each requested data transfer. In the illustrated embodiment, the configuration files 38 are maintained in the conventional manner on storage unit 24, though, in other embodiments they may be stored elsewhere. The file(s) 48 may be text-based (e.g., XML), binary, or otherwise.


In the illustrated embodiment, file system 30 of the server 12 controls access to the configuration file(s) 48 in the conventional manner, e.g., using permissions (or other access controls) set so that only authorized users or applications (hereinafter, collectively, applications) executing on the client devices 14-18 can access the file(s) 48.


Networks 20-22 comprise local area networks (LANs), wide area networks (WANs), metropolitan area networks (MANs), or other networks of the type commonly known in the art supporting communications between client and server devices (and including conventional infrastructure, such as switches 26-28). These may be based in the Internet Protocol (IP) or other protocols, and they may include wireless, wired, satellite and/or other communication mechanisms of the type known in the art. The networks 20-22 may of the same variety (e.g., both megabit Ethernet, by way of non-limiting example) or of mixed varieties (e.g., megabit Ethernet and conventional Ethernet, again, by way of non-limiting example). Though two such networks are shown in the illustration, the invention contemplates a greater or lesser number thereof.


Client devices 14-18 comprise personal computers, workstations, embedded processors, single-board computers, personal digital assistants or other digital data processing device conventional in the art capable of cooperating in a client-server network and of executing software (here, referred to as “applications” or “software applications”) requiring access to storage unit 24. In the illustrated embodiment, those devices are remotely disposed from the server 12 and coupled for communications with it via network media 20-22 operating in accord with the TCP/IP protocol. In other embodiments, one or more of the client devices 14-18 are coupled with the sever 12 via a combination of network media (e.g., Ethernet and so forth) as well as via direct wired or wireless media (e.g., USB interconnect, firewire interconnect, Bluetooth, infrared, and so forth). Those applications, labeled 50-54, respectively, executing on the respective client devices may comprise signal processing applications, visualization applications, and so forth. The client devices 14-18 may be of the same and/or mixed varieties. And, though shown in the drawing coupled to server 12 via a common set of networks 20-22, may be so coupled on sets of disparate (and/or, possibly overlapping) networks.


Like server 12, client devices 14-16 comprise respective file systems 34-38 that form part of and/or cooperate with respective native operating system 40-44. These, too, are of the type conventionally known in the art, as adapted in accord with the teachings hereof. Thus, for example, operating systems 40-44 may comprise Linux or Microsoft Windows XP, both by way of non-limiting example; and, file systems 34-38 may comprise SMB/CIFS or NFS clients, again, by way of non-limiting example.


Operation



FIG. 3 depicts operation of the system 10 in connection with a client request for access to storage 24. Although the discussion focuses on requests by application 50 of device 14, it will be appreciated that requests by other applications and/or devices (collectively, “clients”) proceed similarly.


In step 60, client device 14 mounts storage device 24 (or a volume therein) as a “share” (in Windows terminology) or otherwise. This can be effected by a user of device 14, application 50 executing thereon and/or by the operating system 40 (e.g., as part of a start-up routine), though for purposes of the discussion that follows, mounting will be assumed to be effected by the application 50. Mounting proceeds in the conventional manner, as mediated by the operating system 40, file system 34 of the client device, and file system 30 of the server. Per convention, any and/or all of these may prohibit mounting unless the requesting user and/or application 50 has appropriate security permissions.


Assuming mounting is successful, client application 50 requests access to configuration file 48 on storage device 24. See step 62. In the illustrated embodiment, this is for READ access to the file 48, though, other embodiments may provide for WRITE, LOCK, or other access to that file 48. Regardless, processing of the request for (read) access proceeds in the conventional manner, as mediated by the operating system 40, file system 34 of the client device 14, and file system 30 of the server. As above and per convention, any and/or all of these may prohibit access unless the requesting user and/or client application 50 has appropriate security permissions.


Assuming access to file 48 is granted, the client application 50 obtains from that file 48 identifications of network interfaces (e.g., ports) and security keys. The client application 50 then generates a request for access to data (e.g., a directory tree, file or portion thereof) using those IDs and keys. See step 64. In the discussion that follows, this is assumed to be a request for READ access, although, requests for OPEN, CLOSE, SEEK, WRITE, DELETE FILE, RENAME FILE, MOVE FILE, and so forth, access are similarly handled. The commands are issued in the conventional ordering (e.g., READ, WRITE OR CLOSE following OPEN) and can specify a previously opened file or a file name.


Although, in some embodiments, the access request of step 62 can be made via the respective file systems 40, 34, in the illustrated embodiment, that request is made directly by client application 50 to the FFS module 46 of the server 12. To this end, the protocol for communications between the client application 50 and FFS module 46 can be simpler and/or more specialized than traditional file system access requests, thereby facilitating higher performance than standard network file systems. Moreover, that protocol can be implemented on top of physical or logical network layers which are not supported in a straight forward way by standard network file systems. An example is DAPL on INFINIBAND℠ networks.


The request specifies the data structure (e.g., directory tree, file, etc.) to be accessed, as well as the security keys (identified in the configuration file 48) for identifying and validating the request. In the illustrated embodiment, the request is transferred, in parallel, over each network interface (identified in the configuration file 48) over which the client application 50 specifies access to occur, though, in other embodiments, the request may be transmitted by remote procedure call (RPC), COM, DCOM, CORBA or otherwise, and may include identifiers for each such network interface.


In step 66, the FFS module 46—which, in the illustrated embodiment, listens for requests on network interfaces identified in the configuration file 48—validates the request received in step 64. This includes verifying that the security keys provided in the request are valid, that the application 50 has permission (per the file system 34) for access to the requested data (e.g., directory tree and/or file) and that network interfaces specified for the request are available for the transfer. In some embodiments, the FFS module 46 listens for and/or validates requests only for transfers on physically independent networks. In some embodiments, the FFS module 46 can implement validation independently of the file system 32. In other embodiments, it utilizes the operating system 32 and file system 30 for at least some of these purposes.


Assuming the FFS module 46 validates the request, the module 46 mediates the data transfer as between the storage device 24 (via the server's file system 32) and the client application 50 (via the specified interfaces to networks 20-22). For example, in the case of a READ operation, the FFS module obtains the requested data (e.g., file blocks or directory tree) and transmits it to the application 50 concurrently over the multiple network pathways specified by those interfaces. See step 68. Thus, typically, for example, the FFS module transmits the requested data to the client application 50 over two or more separate networks 20, 22; however, it may (depending on the specified interfaces) send the data over two separate channels on the same network (e.g., as where per-channel bandwidth is rate-limited). In the case of WRITE or other operations, the FFS exchanges the requisite information with the client application 50 over those interfaces and duly writes it to the storage device 24.


Once the FFS module 46 has validated access to a given file, directory tree and so forth, the application 50 may continue making requests (e.g., successive read or write requests) without further validation. This is reflected in steps 70-72.


Although the discussion focuses on responses by FFS module 46 to requests from client application 50 executing on device 14, the module 46 responds similarly to other applications on that device 14, as well as to other applications on other devices 16-18. Thus, the FFS module 46 of the illustrated embodiment responds to requests received from each such client by transferring requested data to that client over multiple network interfaces—and, therefore, network pathways—specified in the request. These may be common sets of pathways, partially overlapping sets of pathways, or entirely disparate sets of pathways.


EXAMPLE

An example of an implementation of system 10 for medical visualization is as follows. In the implementation described here, the client devices 14-18 are presumed to be visualization servers, which process large medical image studies stored on the file server 12. Upon selection of a study by a user, the data has to be loaded as fast as possible to minimize waiting time.


FFS module 46 is implemented as a process (e.g. a Windows™ service) running on file server 12, subsequently referred to as “Service.” Upon startup, the Service writes a file (configuration file 48) into each directory tree to be “exported,” i.e., available for access by a client device 14-18. Those directory trees are exported as standard Microsoft Windows Shares. The configuration file 48 has read permissions which are as restrictive as the most restrictive read permissions of any of the files in that directory tree. The configuration file 48 contains an access key randomly generated by the Service, as well as IP addresses of the network interfaces of the file server and the TCP/IP port on which the Service listens for incoming connections.


Each client device 14-18 which has access to the Windows Share and has permission to read the configuration file 48 can use the FFS module 46 for fast file transfer. It connects to the network interfaces and port specified in the configuration file 48. It transmits the contents of the access key (thereby proving that it had read permission to the configuration file 48). On the connection linked to each of the network interfaces the same session key is transmitted, thereby associating these links with one logical connection.


A data read command is satisfied by the Service using multiple simultaneous threads and double buffering. One thread reads the data from the disk 24 or RAID device. One thread per network interface transmits the data. Thereby effectively parallelizing disk read and concurrent data transmission on all network interfaces.


CONCLUSION

Described above are systems and methods meeting the aforesaid objects, among others. It will be appreciated that the embodiments shown and described herein are merely examples of the invention and that other embodiments incorporating changes therein fall within the scope of the invention. Thus, by way of non-limiting example, it will be appreciated that the invention can be practiced with peer-to-peer networks, grid networks and so forth, wherein the role of “server” is played by a set of one or more devices in such networks and the role of “client” is played by a set (possibly overlapping) of one or more (other) devices in the network.

Claims
  • 1. A method for rendering images comprising: a) executing on a server a fast file server software application, where the server includes a server digital data processor, a static storage, a file system, and a port communicating with one or more independent networks, where the fast file server software application generates a configuration file on the server, where the configuration file comprises an associated read permission, and specifies one or more network interfaces selected from the one or more independent networks, where the one or more network interfaces allow transfer of data between the server and a client;b) receiving a render request at the server from the client, where the render request requests access to the configuration file;c) validating the render request at the server with the fast file server software application comprising: i) verifying that the client has permission to access the data; andii) verifying that the one or more network interfaces are available for a transfer of the data; andd) transferring the data to the client over the one or more network interfaces.
  • 2. The method of claim 1, where the one or more network interfaces are physically independent networks.
  • 3. The method of claim 1, where the data are transmitted by a remote procedure call selected from the group consisting of Component Object Model (COM), Distributed Component Object Model (DCOM) and Common Object Request Broker Architecture (CORBA).
  • 4. The method of claim 1, where the one or more independent networks comprise a plurality of independent networks, where the plurality of independent networks comprise a plurality of physically independent computers, where a computer of the plurality of physically independent computers is connected to at least the plurality of physically independent computers.
  • 5. The method of claim 1, where the data comprise a directory tree and two or more files.
  • 6. The method of claim 5, where the directory tree comprises the configuration file.
  • 7. The method of claim 5, where the fast file server software application writes the configuration file into the directory tree.
  • 8. The method of claim 5, where the associated read permission is as restrictive as a read permission of any file in the directory tree.
  • 9. The method of claim 1, where the configuration file further comprises one or more access keys.
  • 10. The method of claim 9, where the one or more access keys proves that the client had read permission to access the configuration file.
  • 11. The method of claim 9, where the one or more access keys are randomly generated.
  • 12. The method of claim 1, where the configuration file further comprises one or more security keys.
  • 13. The method of claim 12, where the one or more security keys are used to validate a render request.
  • 14. The method of claim 12, where the one or more security keys are adapted to be used by the client in the data transfer.
  • 15. The method of claim 12, where the one or more security keys are adapted to be used by the fast file server software application in the data transfer.
  • 16. The method of claim 12, where the data comprise any of a directory tree, a file, and portions thereof.
  • 17. The method of claim 16, where the one or more security keys are used to identify the directory tree.
  • 18. The method of claim 1, where the configuration file further specifies at least two network interfaces.
  • 19. The method of claim 18, where requested data are transferred in parallel over the at least two network interfaces.
  • 20. A method for rendering images comprising: a) executing on a server a fast file server software application, where the server includes a server digital data processor, a static storage, a file system, and a port communicating with one or more independent networks, where the fast file server software application generates a configuration file on the server, where the configuration file comprises an associated read permission, and specifies one or more network interfaces selected from the one or more independent networks, where the one or more network interfaces allow transfer of data between the server and a client;b) receiving a render request at the server from the client, where the render request requests access to the configuration file;c) validating the render request at the server with the fast file server software application comprising: i) verifying that the render request comprises one or more security keys;ii) verifying that the security keys are valid;iii) verifying that the client has permission to access the data; andiv) verifying that the one or more network interfaces are available for a transfer of the data; andd) transferring the data to the client over the one or more network interfaces.
PRIORITY CLAIM

This application is a continuation of (1) U.S. application Ser. No. 16/036,438 entitled “Fast File Server Methods and System”, filed Jul. 16, 2018, which is a continuation of (2) U.S. application Ser. No. 15/679,581 entitled “Fast File Server Methods and System”, filed Aug. 17, 2017, which issued Jul. 31, 2017 as U.S. Pat. No. 10,038,739, which is a continuation of (3) Ser. No. 15/384,822 entitled “Fast File Server Methods and System”, filed Dec. 20, 2016, which issued Jan. 2, 2018 as U.S. Pat. No. 9,860,300, which is a continuation of (4) U.S. application Ser. No. 14/878,708 entitled “Fast File Server Methods and System”, filed Oct. 8, 2015 which issued Dec. 27, 2016 as U.S. Pat. No. 9,531,789, which is a continuation of (5) U.S. application Ser. No. 14/279,755 entitled “Fast File Server Methods and System”, filed May 16, 2014, which issued Oct. 20, 2015 as U.S. Pat. No. 9,167,027, which is a continuation of (6) U.S. application Ser. No. 13/755,366 entitled “Fast File Server Methods and System”, filed Jan. 31, 2013, which issued Jul. 8, 2014 as U.S. Pat. No. 8,775,510 which is a continuation of (7) U.S. application Ser. No. 11/845,511 entitled “Fast File Server Methods and System”, filed Aug. 27, 2007 which issued Mar. 5, 2013 as U.S. Pat. No. 8,392,529, where the teachings of (1)-(7) are explicitly incorporated herein by reference in their entireties and for all purposes.

US Referenced Citations (365)
Number Name Date Kind
2658310 Cook Nov 1953 A
3431200 Davis et al. Mar 1969 A
3645040 Ort Feb 1972 A
4137868 Pryor Feb 1979 A
4235043 Harasawa et al. Nov 1980 A
4258661 Margen Mar 1981 A
4267038 Thompson May 1981 A
4320594 Raymond Mar 1982 A
4746795 Stewart et al. May 1988 A
4905148 Crawford Feb 1990 A
4910912 Lowrey, III Mar 1990 A
4928250 Greenberg et al. May 1990 A
4958460 Nielson et al. Sep 1990 A
4984160 Saint Felix et al. Jan 1991 A
5031117 Minor et al. Jul 1991 A
5091960 Butler Feb 1992 A
5121708 Nuttle Jun 1992 A
5128864 Waggener et al. Jul 1992 A
5218534 Trousset et al. Jun 1993 A
5235510 Yamada Aug 1993 A
5241471 Trousset et al. Aug 1993 A
5253171 Hsiao et al. Oct 1993 A
5274759 Yoshioka Dec 1993 A
5280428 Wu et al. Jan 1994 A
5287274 Saint Felix et al. Feb 1994 A
5293313 Cecil Mar 1994 A
5307264 Waggener et al. Apr 1994 A
5355453 Row et al. Oct 1994 A
5368033 Moshfeghi Nov 1994 A
5375156 Kuo-Petravic et al. Dec 1994 A
5412703 Goodenough et al. May 1995 A
5412764 Tanaka May 1995 A
5442672 Bjorkholm et al. Aug 1995 A
5452416 Hilton Sep 1995 A
5488700 Glassner Jan 1996 A
5560360 Filler Oct 1996 A
5594842 Kaufman et al. Jan 1997 A
5602892 Llacer Feb 1997 A
5633951 Moshfeghi May 1997 A
5633999 Clowes et al. May 1997 A
5640436 Kawai et al. Jun 1997 A
5671265 Andress Sep 1997 A
5744802 Muehllehner et al. Apr 1998 A
5774519 Lindstrom et al. Jun 1998 A
5790787 Scott et al. Aug 1998 A
5793374 Guenter et al. Aug 1998 A
5793879 Benn et al. Aug 1998 A
5813988 Alfano et al. Sep 1998 A
5821541 Tumer Oct 1998 A
5825842 Taguchi Oct 1998 A
5838756 Taguchi et al. Nov 1998 A
5841140 Mc Croskey et al. Nov 1998 A
5909476 Cheng et al. Jun 1999 A
5930384 Guillemaud et al. Jul 1999 A
5931789 Alfano et al. Aug 1999 A
5950203 Stakuis Sep 1999 A
5960056 Lai Sep 1999 A
5963612 Navab Oct 1999 A
5963613 Navab Oct 1999 A
5963658 Klibanov et al. Oct 1999 A
6002739 Heumann Dec 1999 A
6018562 Willson Jan 2000 A
6032264 Beffa et al. Feb 2000 A
6044132 Navab Mar 2000 A
6049390 Notredame Apr 2000 A
6049582 Navab Apr 2000 A
6072177 Mccroskey et al. Jun 2000 A
6088423 Krug et al. Jul 2000 A
6091422 Ouaknine et al. Jul 2000 A
6104827 Benn et al. Aug 2000 A
6105029 Maddalozzo, Jr. et al. Aug 2000 A
6108007 Shochet Aug 2000 A
6108576 Alfano et al. Aug 2000 A
6123733 Dalton Sep 2000 A
6175655 George Jan 2001 B1
6205120 Packer et al. Mar 2001 B1
6219061 Lauer et al. Apr 2001 B1
6226005 Laferriere May 2001 B1
6236704 Navab et al. May 2001 B1
6243098 Lauer et al. Jun 2001 B1
6249594 Hibbard Jun 2001 B1
6255655 Mc Croskey et al. Jul 2001 B1
6264610 Zhu Jul 2001 B1
6268846 Georgiev Jul 2001 B1
6278460 Myers et al. Aug 2001 B1
6282256 Grass et al. Aug 2001 B1
6289235 Webber et al. Sep 2001 B1
6304771 Yodh et al. Oct 2001 B1
6320928 Vaillant et al. Nov 2001 B1
6324241 Besson Nov 2001 B1
6377257 Borrel Apr 2002 B1
6377266 Baldwin Apr 2002 B1
6384821 Borrel May 2002 B1
6404843 Vaillant Jun 2002 B1
6415013 Hsieh et al. Jul 2002 B1
6470067 Harding Oct 2002 B1
6470070 Menhardt Oct 2002 B2
6473793 Dillon et al. Oct 2002 B1
6475150 Haddad Nov 2002 B2
6507633 Elbakri et al. Jan 2003 B1
6510241 Vaillant et al. Jan 2003 B1
6519355 Nelson Feb 2003 B2
6526305 Mori Feb 2003 B1
6557102 Wong et al. Apr 2003 B1
6559958 Motamed May 2003 B2
6591004 VanEssen et al. Jul 2003 B1
6615063 Ntziachristos et al. Sep 2003 B1
6633688 Nixon Oct 2003 B1
6636623 Nelson et al. Oct 2003 B2
6654012 Lauer et al. Nov 2003 B1
6658142 Kam et al. Dec 2003 B1
6664963 Zatz Dec 2003 B1
6674430 Kaufman et al. Jan 2004 B1
6697508 Nelson Feb 2004 B2
6707878 Claus et al. Mar 2004 B2
6711682 Capps Mar 2004 B1
6718195 Van Der Mark et al. Apr 2004 B2
6731283 Navab May 2004 B1
6740232 Beaulieu May 2004 B1
6741730 Rahn et al. May 2004 B2
6744253 Stolarczyk Jun 2004 B2
6744845 Harding et al. Jun 2004 B2
6745070 Wexler et al. Jun 2004 B2
6747654 Laksono et al. Jun 2004 B1
6754299 Patch Jun 2004 B2
6765981 Heumann Jul 2004 B2
6768782 Hsieh et al. Jul 2004 B1
6770893 Nelson Aug 2004 B2
6771733 Katsevich Aug 2004 B2
6778127 Stolarczyk et al. Aug 2004 B2
6785409 Suri Aug 2004 B1
6798417 Taylor Sep 2004 B1
6807581 Starr et al. Oct 2004 B1
6825840 Gritz Nov 2004 B2
6825843 Allen et al. Nov 2004 B2
6915309 Conley Jul 2005 B1
6923906 Oswald et al. Aug 2005 B2
6947047 Moy et al. Sep 2005 B1
6978206 Pu Dec 2005 B1
7003547 Hubbard Feb 2006 B1
7006101 Brown et al. Feb 2006 B1
7031022 Komori et al. Apr 2006 B1
7034828 Drebin et al. Apr 2006 B1
7039723 Hu May 2006 B2
7050953 Chiang et al. May 2006 B2
7054852 Cohen May 2006 B1
7058644 Patchet et al. Jun 2006 B2
7076735 Callegari Jul 2006 B2
7098907 Houston et al. Aug 2006 B2
7120283 Thieret Oct 2006 B2
7133041 Kaufman et al. Nov 2006 B2
7154985 Dobbs Dec 2006 B2
7167176 Sloan et al. Jan 2007 B2
7184041 Heng et al. Feb 2007 B2
7185003 Bayliss et al. Feb 2007 B2
7219085 Buck et al. May 2007 B2
7242401 Yang et al. Jul 2007 B2
7262770 Sloan et al. Aug 2007 B2
7274368 Keslin Sep 2007 B1
7299232 Stakutis et al. Nov 2007 B2
7315926 Fridella et al. Jan 2008 B2
7324116 Boyd et al. Jan 2008 B2
7339585 Verstraelen et al. Mar 2008 B2
7472156 Philbrick et al. Dec 2008 B2
7502869 Boucher et al. Mar 2009 B2
7506375 Kanda et al. Mar 2009 B2
7552192 Carmichael Jun 2009 B2
7609884 Stalling Oct 2009 B1
7693318 Stalling Apr 2010 B1
7701210 Ichinose Apr 2010 B2
7774435 Ryan Aug 2010 B2
7778392 Bergman Aug 2010 B1
7876944 Stalling Jan 2011 B2
7889895 Nowinski Feb 2011 B2
7899516 Chen et al. Mar 2011 B2
7907759 Hundley Mar 2011 B2
7956612 Sorensen Jun 2011 B2
7983300 Vaughan et al. Jul 2011 B2
7991837 Tahan Aug 2011 B1
7995824 Yim Aug 2011 B2
8107592 Bergman Jan 2012 B2
8189002 Westerhoff May 2012 B1
8319781 Westerhoff Nov 2012 B2
8369600 Can et al. Feb 2013 B2
8386560 Ma Feb 2013 B2
8392529 Westerhoff Mar 2013 B2
8508539 Vlietinck Aug 2013 B2
8538108 Shekhar Sep 2013 B2
8542136 Owsley et al. Sep 2013 B1
8548215 Westerhoff Oct 2013 B2
8775510 Westerhoff Jul 2014 B2
8976190 Westerhoff Mar 2015 B1
9019287 Westerhoff Apr 2015 B2
9167027 Westerhoff Oct 2015 B2
9299156 Zalis Mar 2016 B2
9355616 Westerhoff May 2016 B2
9454813 Westerhoff Sep 2016 B2
9509802 Westerhoff Nov 2016 B1
9524577 Westerhoff Dec 2016 B1
9531789 Westerhoff Dec 2016 B2
9595242 Westerhoff Mar 2017 B1
9728165 Westerhoff Aug 2017 B1
9749245 Stalling Aug 2017 B2
9860300 Westerhoff Jan 2018 B2
9898855 Westerhoff Feb 2018 B2
9904969 Westerhoff Feb 2018 B1
9984460 Westerhoff May 2018 B2
9984478 Westerhoff May 2018 B2
10038739 Westerhoff Jul 2018 B2
10043482 Westerhoff Aug 2018 B2
10070839 Westerhoff Sep 2018 B2
10311541 Westerhoff Jun 2019 B2
10320684 Stalling Jun 2019 B2
10373368 Westerhoff Aug 2019 B2
10380970 Westerhoff Aug 2019 B2
10395398 Westerhoff Aug 2019 B2
10430914 Westerhoff Oct 2019 B2
10540803 Westerhoff Jan 2020 B2
10614543 Westerhoff Apr 2020 B2
10631812 Westerhoff Apr 2020 B2
10686868 Westerhoff Jun 2020 B2
10706538 Westerhoff Jul 2020 B2
20010026848 Van Der Mark Oct 2001 A1
20020016813 Woods et al. Feb 2002 A1
20020034817 Henry et al. Mar 2002 A1
20020049825 Jewett et al. Apr 2002 A1
20020055988 Crooks May 2002 A1
20020080143 Morgan et al. Jun 2002 A1
20020089587 White et al. Jul 2002 A1
20020099290 Haddad Jul 2002 A1
20020099844 Baumann et al. Jul 2002 A1
20020120727 Curley et al. Aug 2002 A1
20020123680 Vailant Sep 2002 A1
20020138019 Wexler Sep 2002 A1
20020150202 Harding Oct 2002 A1
20020150285 Nelson Oct 2002 A1
20020165927 Theriault Nov 2002 A1
20020180747 Lavelle et al. Dec 2002 A1
20020184238 Chylla Dec 2002 A1
20020184349 Manukyan Dec 2002 A1
20030001842 Munshi Jan 2003 A1
20030031352 Nelson et al. Feb 2003 A1
20030059110 Wilt Mar 2003 A1
20030065268 Chen et al. Apr 2003 A1
20030086599 Armato May 2003 A1
20030103666 Edie et al. Jun 2003 A1
20030120743 Coatney et al. Jun 2003 A1
20030123720 Launav et al. Jul 2003 A1
20030149812 Schoenthal et al. Aug 2003 A1
20030158786 Yaron Aug 2003 A1
20030158895 Mehra Aug 2003 A1
20030176780 Arnold Sep 2003 A1
20030179197 Sloan et al. Sep 2003 A1
20030194049 Claus et al. Oct 2003 A1
20030220569 Dione Nov 2003 A1
20030220772 Chiang et al. Nov 2003 A1
20030227456 Gritz Dec 2003 A1
20030234791 Boyd et al. Dec 2003 A1
20040010397 Barbour et al. Jan 2004 A1
20040012596 Allen et al. Jan 2004 A1
20040015062 Ntziachristos et al. Jan 2004 A1
20040022348 Heumann Feb 2004 A1
20040059822 Jiang Mar 2004 A1
20040066384 Ohba Apr 2004 A1
20040066385 Kilgard Apr 2004 A1
20040066891 Freytag Apr 2004 A1
20040078238 Thomas et al. Apr 2004 A1
20040102688 Walker May 2004 A1
20040125103 Kaufman Jul 2004 A1
20040128370 Kortright Jul 2004 A1
20040133652 Miloushev et al. Jul 2004 A1
20040147039 Van Der Mark Jul 2004 A1
20040162677 Bednar Aug 2004 A1
20040170302 Museth et al. Sep 2004 A1
20040186903 Lambertz Sep 2004 A1
20040210584 Nir et al. Oct 2004 A1
20040215858 Armstrong et al. Oct 2004 A1
20040215868 Solomon et al. Oct 2004 A1
20040239672 Schmidt Dec 2004 A1
20040240753 Hu Dec 2004 A1
20050012753 Karlov Jan 2005 A1
20050017972 Poole et al. Jan 2005 A1
20050066095 Mullick et al. Mar 2005 A1
20050088440 Sloan et al. Apr 2005 A1
20050128195 Houston et al. Jun 2005 A1
20050152590 Thieret Jul 2005 A1
20050165623 Landi et al. Jul 2005 A1
20050225554 Bastos et al. Oct 2005 A1
20050231503 Heng et al. Oct 2005 A1
20050239182 Berzin Oct 2005 A1
20050240628 Jiang et al. Oct 2005 A1
20050256742 Kohan et al. Nov 2005 A1
20050259103 Kilgard et al. Nov 2005 A1
20050270298 Thieret Dec 2005 A1
20050271302 Khamene et al. Dec 2005 A1
20060010438 Brady et al. Jan 2006 A1
20060010454 Napoli et al. Jan 2006 A1
20060028479 Chun Feb 2006 A1
20060034511 Verstraelen Feb 2006 A1
20060066609 Iodice Mar 2006 A1
20060197780 Watkins et al. Sep 2006 A1
20060214949 Zhang Sep 2006 A1
20060239540 Serra Oct 2006 A1
20060239589 Omernick Oct 2006 A1
20060282253 Buswell et al. Dec 2006 A1
20070005798 Gropper et al. Jan 2007 A1
20070038939 Challen Feb 2007 A1
20070046966 Mussack Mar 2007 A1
20070067497 Craft et al. Mar 2007 A1
20070092864 Reinhardt Apr 2007 A1
20070097133 Stauffer et al. May 2007 A1
20070116332 Cai et al. May 2007 A1
20070127802 Odry Jun 2007 A1
20070156955 Royer, Jr. Jul 2007 A1
20070165917 Cao et al. Jul 2007 A1
20070185879 Roublev et al. Aug 2007 A1
20070188488 Choi Aug 2007 A1
20070226314 Eick et al. Sep 2007 A1
20070255704 Baek et al. Nov 2007 A1
20070263598 Chen Nov 2007 A1
20070280518 Nowinski Dec 2007 A1
20080009055 Lewnard Jan 2008 A1
20080031238 Harmelin Feb 2008 A1
20080042923 De Laet Feb 2008 A1
20080086557 Roach Apr 2008 A1
20080115139 Inglett et al. May 2008 A1
20080137929 Chen et al. Jun 2008 A1
20080147554 Stevens et al. Jun 2008 A1
20080155890 Oyler Jul 2008 A1
20080174593 Ham Jul 2008 A1
20080208961 Kim et al. Aug 2008 A1
20080224700 Sorensen Sep 2008 A1
20080281908 McCanne et al. Nov 2008 A1
20080317317 Shekhar Dec 2008 A1
20090005693 Brauner et al. Jan 2009 A1
20090043988 Archer et al. Feb 2009 A1
20090063658 Westerhoff Mar 2009 A1
20090077097 Lacapra et al. Mar 2009 A1
20090147793 Hayakawa et al. Jun 2009 A1
20090208082 Westerhoff et al. Aug 2009 A1
20090210487 Westerhoff et al. Aug 2009 A1
20090225076 Vlietinck Sep 2009 A1
20090245610 Can et al. Oct 2009 A1
20090313170 Goldner et al. Dec 2009 A1
20100054556 Novatzky Mar 2010 A1
20100060652 Karlsson Mar 2010 A1
20100123733 Zaharia May 2010 A1
20100174823 Huang Jul 2010 A1
20100272342 Berman et al. Oct 2010 A1
20100278405 Kakadiaris et al. Nov 2010 A1
20110044524 Wang et al. Feb 2011 A1
20110112862 Yu May 2011 A1
20120078088 Whitestone et al. Mar 2012 A1
20120226916 Hahn Sep 2012 A1
20120233153 Roman et al. Sep 2012 A1
20130176319 Westerhoff Jul 2013 A1
20130195329 Canda Aug 2013 A1
20150213288 Bilodeau et al. Jul 2015 A1
20160012181 Massey Jan 2016 A1
20170011514 Westerhoff Jan 2017 A1
20170346883 Westerhoff Mar 2017 A1
20170098329 Westerhoff Apr 2017 A1
20170104811 Westerhoff Apr 2017 A1
20170178593 Westerhoff Jun 2017 A1
20190318512 Westerhoff Oct 2019 A1
Foreign Referenced Citations (44)
Number Date Country
10317384 Apr 2004 DE
0492897 Jul 1992 EP
0502187 Sep 1992 EP
0611181 Aug 1994 EP
0476070 Aug 1996 EP
0925556 Jun 1999 EP
0953943 Nov 1999 EP
0964 366 Dec 1999 EP
187340 Mar 2001 EP
2098895 Sep 2009 EP
2098994 Sep 2009 EP
2405344 Jan 2012 EP
WO9016072 Dec 1990 WO
WO9102320 Feb 1991 WO
WO9205507 Apr 1992 WO
WO9642022 Dec 1996 WO
WO9810378 Mar 1998 WO
WO9812667 Mar 1998 WO
WO9833057 Jul 1998 WO
WO0120546 Mar 2001 WO
WO0134027 May 2001 WO
WO0163561 Aug 2001 WO
WO0174238 Oct 2001 WO
WO0185022 Nov 2001 WO
WO0241760 May 2002 WO
WO02067201 Aug 2002 WO
WO02082065 Oct 2002 WO
WO03061454 Jul 2003 WO
WO03088133 Oct 2003 WO
WO03090171 Oct 2003 WO
WO03098539 Nov 2003 WO
WO04019782 Mar 2004 WO
WO04020996 Mar 2004 WO
WO04020997 Mar 2004 WO
WO04034087 Apr 2004 WO
WO04044848 May 2004 WO
WO04066215 Aug 2004 WO
WO04072906 Aug 2004 WO
WO05071601 Aug 2005 WO
WO09029636 Mar 2009 WO
WO09067675 May 2009 WO
WO09067680 May 2009 WO
WO11065929 Jun 2011 WO
WO2015063188 May 2015 WO
Non-Patent Literature Citations (88)
Entry
ATI Website Index, http://www.ati.com/developer/index.html, Dec. 20, 2002, 2 pages.
Boone et al., Recognition of Chest Radiograph Orientation for Picture Archiving and Communications Systems Display Using Neural Networks, J. Digital Imaging, 1992, 5(3), 190-193.
Boone et al., Automated Recognition of Lateral from PA Chest Radiographs: Saving Seconds in a PACS Environment, J. Digital Imaging, 2003, 16(4), 345-349.
Luo et al., Automatic Image Hanging Protocol for Chest Radiographs in a PACS, IEEE Transactions on Information Technology in Biomedicine, 2006, 10(2), 302-311.
Cabral et al., Accelerated Volume Rendering and Tomographic Reconstruction Using Texture Mapping Hardware., Silicon Graphics Computer Systems, 1995 IEEE, DD. 91-97.
Carr, Nathan A., Jesse D. Hall, John C. Hart, The ray engine, Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware, Sep. 1-2, 2002, pp. 37-46.
Chidlow, et al, Rapid Emission Tomography Reconstruction, Proceedings of the 2003 Eurographics/IEEE TVCG Workshop on Volume Graphics, Tokyo, Japan, Jul. 7-8, 2003, 13 pages.
Cohen, Michael, et al., A Progressive Refinement Approach to Fast Radiosity Image Generation, Computer Graphics, vol. 22, No. 4, Aug. 1988, pp. 75-84.
Corner, B., University of Nebraska-Lincoln, MatLab.txt, 2003, 1 page.
Dachille, et al., High-Quality Volume Rendering Using Texture Mapping Hardware, Siggraph/Eurographics Hardware Workshop (1998) (8 pages).
Dempster, et al., Maximum Likelihood From Incomplete Data via the EM Algorithm, Harvard University and Educational Testing Service, Dec. 8, 1976, pp. 1-38.
Dennis, C, et al.,, Overview of X-Ray Computed Tomography, http://www.howstuffworks.com/framed.htm?parent=c...tm&url=http://www.ctlab.geo.utexas.edu/overview/, Dec. 26, 2002, 5 pages.
Dobbins, et al., Digital X-Ray Tomosynthesis: Current State of the Art and Clinical Potential, Physics in Medicine and Biology, vol. 48, pp. R65-R106 (2003).
Doggett, Michael, ATI, Programmability Features of Graphics Hardware, (paper) Apr. 23, 2002, pp. C1-C22.
Doggett, Michael, ATI, Programmability Features of Graphics Hardware, (slideshow) slides 1-62 31 pages.
Du, H., Sanchez-Elez, M., Tabrizi, N., Bagherzadeh, N., Anido, M. L., and Fernandez, M. 2003. Interactive ray tracing on reconfigurable SIMD MorphoSys. In Proceedings of the 2003 Conference on Asia South Pacific Design Automation (Kitakyushu, Japan, Jan. 21-24, 2003). ASPDAC. ACM, New York, NY, 471-476.
Eldridge Matthew, Homan lgehy, Pat Hanrahan, Pomegranate: a fully scalable graphics architecture, Proceedings of the 27th annual conference on Computer graphics and interactive techniques, p. 443-454, Jul. 2000.
Fang, L., et al., Fast Maximum Intensity Projection Algorithm Using Shear Warp Factorization and Reduced Resampling, Mangetic Resonance in Medicine 47:696-700 (2002).
Filtered Backprojection Reconstruction, http://www.physics.ubd.ca/-mirg/home/tutorial/fbDrecon.html, 216/2003, 5 pages.
Goddard et al., High-speed cone-beam reconstruction: an embedded systems approach, 2002, SPIE vol. 4681, pp. 483-491.
Grass et al., Three-dimensional reconstruction of high contrast objects using C-arm image intensifier projection data, 1999, Computerized Medical Imaging and Graphics, 23, pp. 311-321.
Hadwiger, Markus, et al., Hardware-Accelerated High-Quality Reconstruction of Volumetric Data on PC Graphics Hardware, VRVis Research Center, Vienna, Austria, and Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria, 9 pages.
Hastreiter et al. (Integrated registration and visualization of medical image data, Proc. Computer Graphics International, Jun. 22-26, 1998, pp. 78-85).
Hopf, M., Ertl, T., Accelerating 3d Convolution Using Graphics Hardware, Proc. IEEE Visualization, 1999, 5 pages.
Hudson, et al., Accelerated Image Reconstruction Using Ordered Subsets of Projection Data, IEEE Transactions on Medical Imaging, vol. 13, No. 4, Dec. 1994, pp. 601-609.
Image Registration Slideshow, 105 pages.
Iterative definition, Merriam-Webster on-line dictionary, printed Aug. 26, 2010, 3 pages.
Jain, Anju, A Programmable Graphics Chip, pcquest.com, Jun. 18, 2001.
Jones et al., Positron Emission Tomographic Images and Expectation Maximization: A VLSI Architecture for Multiple Iterations Per Second, Computer Technology and Imaging, Inc., 1988 IEEE, pp. 620-624.
Kajiya, J. T., Ray tracing vol. densities, Proc. Siggraph, Jul. 1984, Computer Graphics, vol. 18, No. 3, pp. 165-174.
Karlsson, Filip; Ljungstedt, Carl Johan; Ray tracing fully implemented on programmable graphics hardware, Master's Thesis, Chalmers University of Technology, Dept. of Computer Engineering, Goteborg, Sweden, copyright© 2004, 29 pages.
Kruger J. and R. Westermann, Acceleration Techniques for GPU-based Volume Rendering, Proceedings of IEEE Visualization, 2003, 6 pages.
Lange et al., EM Reconstruction Algorithms for Emission and Transmission Tomography, J Computer Assisted Tomography 8, DD. 306, et seq. (1984).
Lange et al., Globally Convergent Algorithms for Maximum a Posteriori Transmission Tomography, IEEE Transactions on Image Processing, Vo. 4, No. 10, Oct. 1995, pp. 1430-1438.
Li et al., Tomographic Optical Breast Imaging Guided by Three-Dimensional Mammography, Applied Optics, Sep. 1, 2003, vol. 42, No. 25, pp. 5181-5190.
Li, et al., A Brick Caching Scheme for 30 Medical Imaging, Apr. 15-18, 2004, IEEE International Symposium on Biomedical Imaging—Macro to Nano 2004, vol. 1, pp. 563-566.
Maes, et al. Multimodality Image Registration by Maximization of Mutual Information, IEEE Tran. on Medical Imaging, vol. 16, No. 2, Apr. 1997. pp. 187-198).
Max, N., Optical Models for Direct Volume Rendering, IEEE Transactions on Visualization and Computer Graphics, Jun. 1995, 1(2): pp. 99-108.
McCool, M. et al., Shader Algebra, 2004, pp. 787-795.
McCool, Michael J., Smash: A Next-Generation API for Programmable Graphics Accelerators, Technical Report CS-200-14, Computer Graphics Lab Dept. of Computer Science, University of Waterloo, Aug. 1, 2000.
Microsoft, Architectural Overview Direct for 3D, http://msdn.microsoft.com/library/default.asp?url=/library/en-us/dx8_c/directx_cpp/Graphics/ProgrammersGuide/GettingStarted/ Architecture, 12120/2002, 22 pages.
Mitchell, Jason L., RadeonTM 9700 Shading, SIGGRAPH 2002—State of the Art in Hardware Shading Course Notes, DD.3.1-1-3.1-39, 39 pages.
Mitschke et al., Recovering the X-ray projection geometry for three-dimensional tomographic reconstruction with additional sensors: Attached camera versus external navigation system, 2003, Medical Image Analysis, vol. 7, pp. 65-78.
Mueller, K., and R. Yagel, Rapid 3-D Cone Beam Reconstruction With the Simultaneous Algebraic Reconstruction Technique (SART) Using 2-D Texture Mapping Hardware, IEEE Transactions on Medical Imaging, Dec. 2000, 19(12): pp. 1227-1237.
Navab, N., et al., 3D Reconstruction from Projection Matrices in a C-Arm Based 3D-Angiography System, W.M. Wells e al., eds., MICCAI'98, LNCS 1496, pp. 119-129, 1998.
Parker, S., et al., Interactive Ray Tracing for Isosurface rendering, IEEE, 1998, pp. 233-258.
PCT/US2008/084282, Preliminary and International Search Reports, dated May 11, 2011, 7 pages.
PCT/US2005/000837, Preliminary and International Search Reports, dated May 11, 2005, 7 pages.
PCT/US2008/74397, Preliminary and International Search Reports, dated Dec. 3, 2008 , 7 pages.
PCT/US2008/84368, Preliminary and International Search Reports, dated Jan. 13, 2009, 7 pages.
PCT/EP2016/067886, Preliminary and International Search Reports, dated Jan. 17, 2017, 18 pages.
PCT/EP2018/075744, Preliminary and International Search Reports, dated Feb. 1, 2019, 17 pages.
PCT/US2008/84376, Preliminary and International Search Reports, dated Jan. 12, 2009, 6 pages.
JP2018-524544, Office Action, dated Jun. 2, 2020, 4 pages (& English translation).
EP3329405, Office Action, dated Apr. 6, 2020, 5 pages.
Pfister, H., et. al., The VolumePro real-time ray-casting System, Computer Graphics Proceedings of SIGGRAPH), Aug. 1999, No. 251-260.
Phong, B. T. Illumination for Computer Generated Pictures, Communications of the ACM, 18(6), Jun. 1975, pp. 311-317.
Porter, D. H. 2002. Volume Visualization of High Resolution Data using PC-Clusters. Tech. rep., University of Minnesota. Available at http://www.lcse.umn.edu/hvr/pc_vol_rend_L.pdf.
Potmesil, M. and Hoffert, E. M. 1989. The pixel machine: a parallel image computer. In Proceedings of the 16th Annual Conference on Computer Graphics and interactive Techniques SIGGRAPH '89. ACM, New York, NY, 69-78.
Purcell, T., et al., Real-time Ray Tracing on Programmable Graphics Hardware, Department of Computer Science, Stanford University, Stanford, CA, Submitted for review to SIGGRAPH 2002, 2002. http://graphics.stanford.edu/papers/rtongfx/rtongfx_submit.pdf.
Purcell, T., et. al., Ray tracings on Programmable Graphics Hardware, Computer Graphics (Proceedings of SIGGRAPH), 1998, pp. 703-712.
Purcell, Timothy J., Craig Donner, Mike Cammarano , Henrik Wann Jensen , Pat Hanrahan, Photon mapping on programmable graphics hardware, Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware, Jul. 26-27, 2003, 11 pages.
Ramirez et al. (Prototypes stability analysis in the design of a binning strategy for mutual information based medical image registration, IEEE Annual Meeting of the Fuzzy Information, Jun. 27-30, 2004, vol. 2, pp. 862-866.
Rib Cage Projection, downloaded from http://www.colorado.edu/physics/2000/tomography/final_rib_cage.html on Dec. 26, 2002, 3 pages.
Roettger, Stefan, et al., Smart Hardware-Accelerated Volume Rendering, Joint EUROGRAPHICS—IEEE TCVG Symposium on Visualization, 2003, pp. 231-238, 301.
Sandborg, Michael, Computed Tomography: Physical principles and biohazards, Department of Radiation Physics, Faculty of Health Sciences, Linkoping University, Sweden, Report 81 ISSN 1102-1799, Sep. 1995 ISRN ULI-RAD-R--81--SE, 18 pages.
Sarrut et al. (Fast 30 Image Transformations for Registration Procedures, Proc. Int. Conf. on Image Analysis and Processing, 27-29, Sep. 1999, pp. 446-451.
Selldin, Hakan, Design and Implementation of an Application Programming Interface for Volume Rendering, Linkopings Universitet.
Shekhar, R.; Zagrodsky, V., Cine MPR: interactive multiplanar reformatting of four-dimensional cardiac data using hardware-accelerated texture mapping, IEEE Transactions on Information Technology in Biomedicine, vol. 7, No. 4, pp. 384-393, Dec. 2003.
Silver, et al., Determination and correction of the wobble of a C-arm gantry, Medical Imaging 2000: Image Processing, Kenneth M. Hanson, ed., Proceedings of SPIE vol. 3970 (2000).
Stevens, Grant, et al., Alignment of a Volumetric Tomography System, Med. Phys., 28 (7), Jul. 2001.
Tao, W., Tomographic mammography using a limited number of low dose cone beam projection images, Medical Physics, AIP, Melville, NY vol. 30, pp. 365-380, Mar. 2003, ISSN: 0094-2405.
Tasdizen, T. , Ross Whitaker, Paul Burchard , Stanley Osher, Geometric surface processing via normal maps, ACM Transactions on Graphics (TOG), v.22 n. 4, p. 1012-1033, Oct. 2003.
Tasdizen, T.; Whitaker, R.; Burchard, P.; Osher, S.; Geometric surface smoothing via anisotropic diffusion of normals, IEEE Visualization, VIS 2002, Nov. 2002, pp. 125-132.
Technical Brief: NVIDIA nfiniteFX Engine: Programmable Pixel Shaders, NVIDIA Corporation, 5 pages.
Technical Brief: NVIDIA nfiniteFX Engine: Programmable Vertex Shaders, NVIDIA Corporation, 12 pages.
Viola, I, et al., Hardware Based Nonlinear Filtering and Segmentation Using High Level Shading Languages, Technical Report TR-186-2-03-07, May 2003, 8 pages.
Viola, P., Alignment by Maximization of Mutual Information, PhD Thesis MIT (Also Referred to As-Al Technical report No. 1548), MIT Artificial Intelligence Lab, Jun. 1, 1995, pp. 1-29.
Weiler, M, M. Kraus and T. Ertl, Hardware-Based View-Independent Cell Projection, Proceedings IEEE Symposium on Volume Visualization 2002, pp. 13-22.
Weiler, M. et al., Hardware-based ray casting for tetrahedral meshes, IEEE Visualization, VIS 2003, Oct. 24-24, 2003, pp. 333-340.
Weiler, M. et al., Hardware-Based view—Independent Cell Projection, IEEE, 2002, pp. 13-22.
Weiskopf, D., T. Schathitzel, T. Ertl, GPU-Based Nonlinear Ray Tracing, EUROGRAPHICS, vol. 23, No. 3, Aug. 2004.
Wen, Junhai; Zigang Wang; Bin Li; Zhengrong Liang; An investigation on the property and fast implementation of a ray-driven method for inversion of the attenuated Radon transform with variable focusing fan-beam collimators, 2003 IEEE Nuclear Science Symposium Conference Record, vol. 3, Oct. 19-25, 2003, pp. 2138-2142.
Wikipedia, Anonymous, ‘Volume Rendering’ May 30 2015, retrieved Nov. 4, 2016, https://en.wikipedia.org/w/index.php?title=Volume_rendering&oldid=664765767.
Wikipedia, Anonymous, ‘Tomographic Reconstruction’ Dec. 6, 2014, retrieved Nov. 4, 2016, https://en.wikipedia.org/w/index.php?title=Tomographic_Reconstruction&oldid=636925688.
Wu et al., Tomographic Mammography Using a Limited Number of Low-dose Conebeam Projection Images, Med. Phys., pp. 365-380 (2003).
Xu et al., Toward a Unified Framework for Rapid 30 Computed Tomography on Commodity GPUs, Oct. 19-25, 2003, IEEE Nuclear Science Symposium Conference 2003, vol. 4, pp. 2757-2759.
Xu et al., Ultra-fast 30 Filtered Backprojection on Commodity Graphics Hardware, Apr. 1-18, 2004, IEEE International symposium on Biomedical Imaging: Macro to Nano, vol. 1, pp. 571-574 and corresponding power point presentation.
Related Publications (1)
Number Date Country
20200228592 A1 Jul 2020 US
Continuations (7)
Number Date Country
Parent 16036438 Jul 2018 US
Child 16834936 US
Parent 15679581 Aug 2017 US
Child 16036438 US
Parent 15384822 Dec 2016 US
Child 15679581 US
Parent 14878708 Oct 2015 US
Child 15384822 US
Parent 14279755 May 2014 US
Child 14878708 US
Parent 13755366 Jan 2013 US
Child 14279755 US
Parent 11845511 Aug 2007 US
Child 13755366 US