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

Petru M. Dinu

dblp:31/6918 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%
Theoretical computer science
1 paper
Approximation and online algorithms · 100%

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

TopicWeightPapersLastEvidence papers
Medical and health informatics › medical imaging › tomographic reconstruction
sparse-view CT reconstruction
0.112007
Limited view CT reconstruction via constrained metric labeling · ICCV 2007
Medical and health informatics › medical imaging
tomographic reconstruction
0.112007
Limited view CT reconstruction via constrained metric labeling · ICCV 2007
Approximation and online algorithms › approximation algorithms
metric labeling
0.112007
Limited view CT reconstruction via constrained metric labeling · ICCV 2007

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

linear programming · 0.1algebraic reconstruction technique · 0.1
YearPublicationVenuePosition
2008 Limited view CT reconstruction and segmentation via constrained metric labeling
Lopamudra Mukherjee, Petru M. Dinu, Jinhui Xu 0001, Kenneth R. Hoffmann
Comput. Vis. Image Underst.3
2007 Limited view CT reconstruction via constrained metric labeling
abstract
This paper proposes an new optimization framework for tomographic reconstruction of 3D volumes when only a limited number of projection views are available. The problem has several important clinical applications spanning coronary angiographic imaging, breast tomosynthesis and dental imaging. We first show that the limited view reconstruction problem can be formulated as a "constrained" version of the metric labeling problem. This lays the groundwork for a linear programming framework that brings together metric labeling classification and classical algebraic tomographic reconstruction (ART) in a unified model. If the imaged volume is known to be comprised of a finite set of attenuation coefficients, given a regular limited view reconstruction as an input, we can view it as a "denoising" task - where voxels must be reassigned subject to maximally maintaining consistency with the input reconstruction and the objective of ART simultaneously. The approach can reliably reconstruct volumes with several multiple contrast objects as well as the simpler binary contrast case which can be solved near-optimally in practice. We present evaluations on cone bean computed tomography, it can also be readily extended to other tomographic modalities as a viable approach for limited-view tomographic reconstruction.
Petru M. Dinu, Lopamudra Mukherjee, Jinhui Xu 0001, Kenneth R. Hoffmann
ICCV2
2007 Brachytherapy Seed Localization Using Geometric and Linear Programming Techniques
abstract
We propose an optimization algorithm to solve the brachytherapy seed localization problem in prostate brachytherapy. Our algorithm is based on novel geometric approaches to exploit the special structure of the problem and relies on a number of key observations which help us formulate the optimization problem as a minimization integer program (IP). Our IP model precisely defines the feasibility polyhedron for this problem using a polynomial number of half-spaces; the solution to its corresponding linear program is rounded to yield an integral solution to our task of determining correspondences between seeds in multiple projection images. The algorithm is efficient in theory as well as in practice and performs well on simulation data (approximately 98% accuracy) and real X-ray images (approximately 95% accuracy). We present in detail the underlying ideas and an extensive set of performance evaluations based on our implementation.
Lopamudra Mukherjee, Jinhui Xu 0001, Kenneth R. Hoffmann, Petru M. Dinu, M. Podgorsak
IEEE Trans. Medical Imaging5