Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kirk L. Duffin

dblp:59/11 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Computational photography and imaging · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational photography and imaging
camera calibration
0.012001
Fast Focal Length Solution in Partial Panoramic Image Stitching · CVPR (2) 2001
Computational photography and imaging › camera calibration › intrinsic parameter estimation
focal length estimation
0.012001
Fast Focal Length Solution in Partial Panoramic Image Stitching · CVPR (2) 2001
Computational photography and imaging › image stitching
panoramic image stitching
0.012001
Fast Focal Length Solution in Partial Panoramic Image Stitching · CVPR (2) 2001

Methods — techniques the papers use, named apart from their topics

spherical arc length parameterization · 0.0numerical optimization · 0.0
YearPublicationVenuePosition
2018 Scalable pCT Image Reconstruction Delivered as a Cloud Service
abstract
We describe a cloud-based medical image reconstruction service designed to meet a real-time and daily demand to reconstruct thousands of images from proton cancer treatment facilities worldwide. Rapid reconstruction of a three-dimensional Proton Computed Tomography (pCT) image can require the transfer of 100 GB of data and use of approximately 120 GPU-enabled compute nodes. The nature of proton therapy means that demand for such a service is sporadic and comes from potentially hundreds of clients worldwide. We thus explore the use of a commercial cloud as a scalable and cost-efficient platform for pCT reconstruction. To address the high performance requirements of this application we leverage Amazon Web Services' GPU-enabled cluster resources that are provisioned with high performance networks between nodes. To support episodic demand, we develop an on-demand multi-user provisioning service that can dynamically provision and resize clusters based on image reconstruction requirements, priorities, and wait times. We compare the performance of our pCT reconstruction service running on commercial cloud resources with that of the same application on dedicated local high performance computing resources. We show that we can achieve scalable and on-demand reconstruction of large scale pCT images for simultaneous multi-client requests, processing images in less than 10 minutes for less than $10 per image.
Ryan Chard, Ravi K. Madduri, Nicholas T. Karonis, Kyle Chard, Kirk L. Duffin, Caesar E. Ordoñez, Thomas D. Uram, Justin Fleischauer, Ian T. Foster, Michael E. Papka, John Winans
IEEE Trans. Cloud Comput.5
2013 Distributed and hardware accelerated computing for clinical medical imaging using proton computed tomography (pCT)
Nicholas T. Karonis, Kirk L. Duffin, Caesar E. Ordoñez, Béla Erdélyi, Thomas D. Uram, Eric C. Olson, George Coutrakon, Michael E. Papka
J. Parallel Distributed Comput.2
2001 Fast Focal Length Solution in Partial Panoramic Image Stitching
abstract
Accurate estimation of effective camera focal length is crucial to the success of panoramic image stitching. Fast techniques for estimating the focal length exist, but are dependent upon a close initial approximation or the existence of a full circle panoramic image sequence. Numerical solutions of the focal length demonstrate strong coupling between the focal length and the angles used to position each component image about the common spherical center. This paper demonstrates that parameterizing panoramic image positions using spherical arc length instead of angles effectively decouples the focal length from the image position. This new parameterization does not require an initial focal length estimate for quick convergence, nor does it require a full circle panorama in order to refine the focal length. Experiments with synthetic and real image sets demonstrate the robustness of the method and a speedup of 5 to 20 times over angle based positioning.
Kirk L. Duffin, Bill Barrett
CVPR (2)1
1998 Globally Optimal Image Mosaics
Kirk L. Duffin, Bill Barrett
Graphics Interface1
1994 Spiders: A New User Interface for Rotation and Visualization of N-dimensional Point Sets
abstract
We present a new method for creating n-dimensional rotation matrices from manipulating the projections of n-dimensional data coordinate axes onto a viewing plane. A user interface for n-dimensional rotation is implemented. The interface is shown to have no rotational hysteresis.>
Kirk L. Duffin, Bill Barrett
IEEE Visualization1