Joong Ho Won
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Joong Ho Won has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Geoffrey D. Rubin
University of Arizona College of Medicine
3 shared publications - Sandy Napel
Stanford University
3 shared publications - Jarrett Rosenberg
Department of Radiology, Stanford University, Stanford, CA, 94035, USA
1 shared publication - Seung-Jean Kim
Stanford University
1 shared publication
Latest Publications
- 15 October 2009
- Published by Wiley in Medical Physics
- Vol. 36 (11) , 5245-5260
Uncluttered single‐image visualization of the abdominal aortic vessel tree: Method and evaluation
Purpose: The authors develop a method to visualize the abdominal aorta and its branches, obtained by CT or MR angiography, in a single 2D stylistic image without overlap among branches.Methods: The abdominal aortic vasculature is modeled as an articulated object whose underlying topology is a rooted tree. The inputs to the algorithm are the 3D centerlines of the abdominal aorta, its branches, and their associated diameter information. The visualization problem is formulated as an optimization problem that finds a spatial configuration of the bounding boxes of the centerlines most similar to the projection of the input into a given viewing direction (e.g., anteroposterior), while not introducing intersections among the boxes. The optimization algorithm minimizes a score function regarding the overlap of the bounding boxes and the deviation from the input. The output of the algorithm is used to produce a stylistic visualization, made of the 2D centerlines modulated by the associated diameter information, on a plane. The authors performed a preliminary evaluation by asking three radiologists to label 366 arterial branches from the 30 visualizations of five cases produced by the method. Each of the five patients was presented in six different variant images, selected from ten variants with the three lowest and three highest scores. For each label, they assigned confidence and distortion ratings (low/medium/high). They studied the association between the quantitative metrics measured from the visualization and the subjective ratings by the radiologists.Results: All resulting visualizations were free from branch overlaps. Labeling accuracies of the three readers were 93.4%, 94.5%, and 95.4%, respectively. For the total of 1098 samples, the distortion ratings were low: 77.39%, medium: 10.48%, and high: 12.12%. The confidence ratings were low: 5.56%, medium: 16.50%, and high: 77.94%. The association study shows that the proposed quantitative metrics can predict a reader's subjective ratings and suggests that the visualization with the lowest score should be selected for readers.Conclusions: The method for eliminating misleading false intersections in 2D projections of the abdominal aortic tree conserves the overall shape and does not diminish accurate identifiability of the branches.
- 15 October 2009
- Published by Wiley in Medical Physics
- Vol. 36 (11) , 5245-5260
Uncluttered single‐image visualization of the abdominal aortic vessel tree: Method and evaluation
Purpose: The authors develop a method to visualize the abdominal aorta and its branches, obtained by CT or MR angiography, in a single 2D stylistic image without overlap among branches.Methods: The abdominal aortic vasculature is modeled as an articulated object whose underlying topology is a rooted tree. The inputs to the algorithm are the 3D centerlines of the abdominal aorta, its branches, and their associated diameter information. The visualization problem is formulated as an optimization problem that finds a spatial configuration of the bounding boxes of the centerlines most similar to the projection of the input into a given viewing direction (e.g., anteroposterior), while not introducing intersections among the boxes. The optimization algorithm minimizes a score function regarding the overlap of the bounding boxes and the deviation from the input. The output of the algorithm is used to produce a stylistic visualization, made of the 2D centerlines modulated by the associated diameter information, on a plane. The authors performed a preliminary evaluation by asking three radiologists to label 366 arterial branches from the 30 visualizations of five cases produced by the method. Each of the five patients was presented in six different variant images, selected from ten variants with the three lowest and three highest scores. For each label, they assigned confidence and distortion ratings (low/medium/high). They studied the association between the quantitative metrics measured from the visualization and the subjective ratings by the radiologists.Results: All resulting visualizations were free from branch overlaps. Labeling accuracies of the three readers were 93.4%, 94.5%, and 95.4%, respectively. For the total of 1098 samples, the distortion ratings were low: 77.39%, medium: 10.48%, and high: 12.12%. The confidence ratings were low: 5.56%, medium: 16.50%, and high: 77.94%. The association study shows that the proposed quantitative metrics can predict a reader's subjective ratings and suggests that the visualization with the lowest score should be selected for readers.Conclusions: The method for eliminating misleading false intersections in 2D projections of the abdominal aortic tree conserves the overall shape and does not diminish accurate identifiability of the branches.
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2006 (1557170X) , 3345-3348
Flattening the Abdominal Aortic Tree for Effective Visualization
We developed a novel visualization method for providing an uncluttered view of the abdominal aorta and its branches. The method abstracts the complex geometry of vessels using a convex primitive, and uses a sweep line algorithm to find a suboptimal placement of the primitive. The method was evaluated using 10 CT angiography datasets and resulted in a clear visualization with all cluttering intersections removed. The method can be used to convey clinical findings, including lumen patency and lesion locations, in a single two-dimensional image
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2006 (1557170X) , 3345-3348
Flattening the Abdominal Aortic Tree for Effective Visualization
We developed a novel visualization method for providing an uncluttered view of the abdominal aorta and its branches. The method abstracts the complex geometry of vessels using a convex primitive, and uses a sweep line algorithm to find a suboptimal placement of the primitive. The method was evaluated using 10 CT angiography datasets and resulted in a clear visualization with all cluttering intersections removed. The method can be used to convey clinical findings, including lumen patency and lesion locations, in a single two-dimensional image
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1557170X,p. 3345-3348
Flattening the Abdominal Aortic Tree for Effective Visualization
We developed a novel visualization method for providing an uncluttered view of the abdominal aorta and its branches. The method abstracts the complex geometry of vessels using a convex primitive, and uses a sweep line algorithm to find a suboptimal placement of the primitive. The method was evaluated using 10 CT angiography datasets and resulted in a clear visualization with all cluttering intersections removed. The method can be used to convey clinical findings, including lumen patency and lesion locations, in a single two-dimensional image
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1557170X,p. 3345-3348
Flattening the Abdominal Aortic Tree for Effective Visualization
We developed a novel visualization method for providing an uncluttered view of the abdominal aorta and its branches. The method abstracts the complex geometry of vessels using a convex primitive, and uses a sweep line algorithm to find a suboptimal placement of the primitive. The method was evaluated using 10 CT angiography datasets and resulted in a clear visualization with all cluttering intersections removed. The method can be used to convey clinical findings, including lumen patency and lesion locations, in a single two-dimensional image
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10586393,p. 1445-1449
Maximum Likelihood Covariance Estimation with a Condition Number Constraint
In many signal processing applications, we want to estimate the covariance matrix of a multivariate Gaussian distribution. We often require the estimate to be not only invertible but also well-conditioned. We consider the maximum likelihood estimation of the covariance matrix with a constraint on the condition number. We show that this estimation problem can be reformulated as a convex univariate minimization problem, which admits an analytic solution. This estimation method requires no special assumption on the structure of the true covariance matrix. We demonstrate its good performance in comparison with commonly used estimators, especially when the sample size is small.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10586393,p. 1445-1449
Maximum Likelihood Covariance Estimation with a Condition Number Constraint
In many signal processing applications, we want to estimate the covariance matrix of a multivariate Gaussian distribution. We often require the estimate to be not only invertible but also well-conditioned. We consider the maximum likelihood estimation of the covariance matrix with a constraint on the condition number. We show that this estimation problem can be reformulated as a convex univariate minimization problem, which admits an analytic solution. This estimation method requires no special assumption on the structure of the true covariance matrix. We demonstrate its good performance in comparison with commonly used estimators, especially when the sample size is small.