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

Geoffrey D. Rubin

dblp:83/6419 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-3820-2500ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 4 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1

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
2 papers
Visualization and visual analytics · 54% Image and video processing · 46%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
medical visualization
0.322013
Uncluttered Single-Image Visualization of Vascular Structures Using GPU and Integer Programming · IEEE Trans. Vis. Comput. Graph. 2013
Shape "Break-and-Repair" Strategy and Its Application to Automated Medical Image Segmentation · IEEE Trans. Vis. Comput. Graph. 2011
Image and video processing › image segmentation
medical image segmentation
0.112011
Shape "Break-and-Repair" Strategy and Its Application to Automated Medical Image Segmentation · IEEE Trans. Vis. Comput. Graph. 2011
Image and video processing › image segmentation
shape segmentation
0.112011
Shape "Break-and-Repair" Strategy and Its Application to Automated Medical Image Segmentation · IEEE Trans. Vis. Comput. Graph. 2011
Mathematical optimization
integer programming
0.012013
Uncluttered Single-Image Visualization of Vascular Structures Using GPU and Integer Programming · IEEE Trans. Vis. Comput. Graph. 2013

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

integer linear programming · 0.3GPGPU · 0.3radial basis functions · 0.1principal curvature analysis · 0.1implicit surface fitting · 0.1
YearPublicationVenuePosition
2021 Machine-learning-based multiple abnormality prediction with large-scale chest computed tomography volumes
Rachel Lea Draelos, David Dov, Maciej A. Mazurowski, Joseph Y. Lo, Ricardo Henao, Geoffrey D. Rubin, Lawrence Carin
Medical Image Anal.6
2013 Uncluttered Single-Image Visualization of Vascular Structures Using GPU and Integer Programming
abstract
Direct projection of 3D branching structures, such as networks of cables, blood vessels, or neurons onto a 2D image creates the illusion of intersecting structural parts and creates challenges for understanding and communication. We present a method for visualizing such structures, and demonstrate its utility in visualizing the abdominal aorta and its branches, whose tomographic images might be obtained by computed tomography or magnetic resonance angiography, in a single 2D stylistic image, without overlaps among branches. The visualization method, termed uncluttered single-image visualization (USIV), involves optimization of geometry. This paper proposes a novel optimization technique that utilizes an interesting connection of the optimization problem regarding USIV to the protein structure prediction problem. Adopting the integer linear programming-based formulation for the protein structure prediction problem, we tested the proposed technique using 30 visualizations produced from five patient scans with representative anatomical variants in the abdominal aortic vessel tree. The novel technique can exploit commodity-level parallelism, enabling use of general-purpose graphics processing unit (GPGPU) technology that yields a significant speedup. Comparison of the results with the other optimization technique previously reported elsewhere suggests that, in most aspects, the quality of the visualization is comparable to that of the previous one, with a significant gain in the computation time of the algorithm.
Joong-Ho Won, Yongkweon Jeon, Jarrett Rosenberg, Sungroh Yoon, Geoffrey D. Rubin, Sandy Napel
IEEE Trans. Vis. Comput. Graph.5
2011 Shape "Break-and-Repair" Strategy and Its Application to Automated Medical Image Segmentation
abstract
In three-dimensional medical imaging, segmentation of specific anatomy structure is often a preprocessing step for computer-aided detection/diagnosis (CAD) purposes, and its performance has a significant impact on diagnosis of diseases as well as objective quantitative assessment of therapeutic efficacy. However, the existence of various diseases, image noise or artifacts, and individual anatomical variety generally impose a challenge for accurate segmentation of specific structures. To address these problems, a shape analysis strategy termed "break-and-repair" is presented in this study to facilitate automated medical image segmentation. Similar to surface approximation using a limited number of control points, the basic idea is to remove problematic regions and then estimate a smooth and complete surface shape by representing the remaining regions with high fidelity as an implicit function. The innovation of this shape analysis strategy is the capability of solving challenging medical image segmentation problems in a unified framework, regardless of the variability of anatomical structures in question. In our implementation, principal curvature analysis is used to identify and remove the problematic regions and radial basis function (RBF) based implicit surface fitting is used to achieve a closed (or complete) surface boundary. The feasibility and performance of this strategy are demonstrated by applying it to automated segmentation of two completely different anatomical structures depicted on CT examinations, namely human lungs and pulmonary nodules. Our quantitative experiments on a large number of clinical CT examinations collected from different sources demonstrate the accuracy, robustness, and generality of the shape "break-and-repair" strategy in medical image segmentation.
Jiantao Pu, David S. Paik, Justus E. Roos, Geoffrey D. Rubin
IEEE Trans. Vis. Comput. Graph.5
2008 Learning-enhanced simulated annealing: method, evaluation, and application to lung nodule registration
Shaohua Sun, Feng Zhuge, Jarrett Rosenberg, Robert M. Steiner, Geoffrey D. Rubin, Sandy Napel
Appl. Intell.5
2004 Surface normal overlap: a computer-aided detection algorithm with application to colonic polyps and lung nodules in helical CT
abstract
We developed a novel computer-aided detection (CAD) algorithm called the surface normal overlap method that we applied to colonic polyp detection and lung nodule detection in helical computed tomography (CT) images. We demonstrate some of the theoretical aspects of this algorithm using a statistical shape model. The algorithm was then optimized on simulated CT data and evaluated using a per-lesion cross-validation on 8 CT colonography datasets and on 8 chest CT datasets. It is able to achieve 100% sensitivity for colonic polyps 10 mm and larger at 7.0 false positives (FPs)/dataset and 90% sensitivity for solid lung nodules 6 mm and larger at 5.6 FP/dataset.
David S. Paik, Christopher F. Beaulieu, Geoffrey D. Rubin, Burak Acar, R. Brooke Jeffrey Jr., Judy Yee, Joyoni Dey, Sandy Napel
IEEE Trans. Medical Imaging3
2000 Medical Image Segmentation Using Analysis of Isolabel-Contour Maps
abstract
A common challenge for automated segmentation techniques is differentiation between images of close objects that have similar intensities, whose boundaries are often blurred due to partial-volume effects. We propose a novel approach to segmentation of two-dimensional images, which addresses this challenge. Our method, which we call intrinsic shape for segmentation (ISeg), analyzes isolabel-contour maps to identify coherent regions that correspond to major objects. ISeg generates an isolabel-contour map for an image by multilevel thresholding with a fine partition of the intensity range. ISeg detects object boundaries by comparing the shape of neighboring isolabel contours from the map. ISeg requires only little effort from users; it does not require construction of shape models of target objects. In a formal validation with computed-tomography angiography data, we showed that ISeg was more robust than conventional thresholding, and that ISeg's results were comparable to results of manual tracing.
Smadar Shiffman, Geoffrey D. Rubin, Sandy Napel
IEEE Trans. Medical Imaging2
1999 Longitudinal Sampling and Aliasing in Spiral CT
abstract
Although analyses of in-plane aliasing have been done for conventional computed tomography (CT) images, longitudinal aliasing in spiral CT has not been properly investigated. We propose a mathematical model of the three-dimensional (3-D) sampling scheme in spiral CT and analyze its effects on longitudinal aliasing. We investigated longitudinal aliasing as a function of the helical-interpolation algorithm, pitch, and reconstruction interval using CT simulations and actual phantom scans. Our model predicts, and we verified, that for a radially uniform object at the isocenter, the spiral sampling scheme results in spatially varying cancellation of the aliased spectral islands which, in turn, results in spatially varying longitudinal aliasing. The aliasing is minimal at the scanner isocenter, but worsens with distance from it and rapidly becomes significant. Our results agree with published results observed at the isocenter of the scanner and further provide new insight into the aliasing conditions at off-isocenter locations with respect to the pitch, interpolation algorithm, and reconstruction interval. We conclude that longitudinal aliasing at off-isocenter locations can be significant, and that its magnitude and effects cannot be predicted by measurements made only at the scanner isocenter.
Shin Yi Yen, Chye Hwang Yan, Geoffrey D. Rubin, Sandy Napel
IEEE Trans. Medical Imaging3