Luca Bertelli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Luca Bertelli has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Bangalore S. Manjunath
University of California, Santa Barbara, California, United States of America
5 shared publications - Frédéric Gibou
University of California
2 shared publications - Andrea Prati
Department of Architecture and Engineering, University of Parma, Parma, Italy
1 shared publication - Baris Sumengen
Center for BioImage Informatics, Dept. of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106
1 shared publication - Giovanni Paternostro
The Burnham Institute
1 shared publication - Jiyun Byun
Center for BioImage Informatics, Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106
1 shared publication
Latest Publications
- Open Access
- 1 January 2012
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 9 (3) , 527-537
Fast two dimensional to three dimensional registration of fluoroscopy and CT-scans using Octrees on segmentation maps
We introduce a computationally efficient approach to the generation of Digital Reconstructed Radiographs (DRRs) needed to perform three dimensional to two dimensional medical image registration and apply this algorithm to virtual surgery. The DRR generation process is the bottleneck of any three dimensional to two dimensional registration system, since its computational complexity scales with the number of voxels in the Computed Tomography Data, which can be of the order of tens to hundreds of millions. Our approach originates from the segmentation of the volumetric data into multiple regions, which allows a compact representation via Octree Data Structures. This, in turn, yields efficient storage and access of the attenuation indexes of the volumetric cells, required in the projection procedure that generates the DRR. A functional based on Mutual Information is then maximized to obtain the alignment of the DRR with the two dimensional X-ray fluoroscopy scans acquired during the operation. Promising experimental results on real data are presented.
- 1 January 2012
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 9 (3) , 527-537
Open AccessFast two dimensional to three dimensional registration of fluoroscopy and CT-scans using Octrees on segmentation maps
We introduce a computationally efficient approach to the generation of Digital Reconstructed Radiographs (DRRs) needed to perform three dimensional to two dimensional medical image registration and apply this algorithm to virtual surgery. The DRR generation process is the bottleneck of any three dimensional to two dimensional registration system, since its computational complexity scales with the number of voxels in the Computed Tomography Data, which can be of the order of tens to hundreds of millions. Our approach originates from the segmentation of the volumetric data into multiple regions, which allows a compact representation via Octree Data Structures. This, in turn, yields efficient storage and access of the attenuation indexes of the volumetric cells, required in the projection procedure that generates the DRR. A functional based on Mutual Information is then maximized to obtain the alignment of the DRR with the two dimensional X-ray fluoroscopy scans acquired during the operation. Promising experimental results on real data are presented.
- 23 June 2010
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 90 (3) , 267-282
On the Length and Area Regularization for Multiphase Level Set Segmentation
- 23 June 2010
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 90 (3) , 267-282
On the Length and Area Regularization for Multiphase Level Set Segmentation
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE International Conference on Image Processing (ICIP)
- Vol. 1 (15224880) , I - 321-I - 324
Edge Preserving Filters using Geodesic Distances on Weighted Orthogonal Domains
We introduce a framework for image enhancement, which smooths images while preserving edge information. Domain (spatial) and range (feature) information are combined in one single measure in a principled way. This measure turns out to be the geodesic distance between pixels, calculated on weighted orthogonal domains. The weight function is computed to capture the underlying structure of the image manifold, but allowing at the same time to efficiently solve, using the Fast Marching algorithm on orthogonal domains, the eikonal equation to obtain the geodesic distances. We show promising results in edge-preserving denoising of gray scale, color and texture images.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE International Conference on Image Processing (ICIP)
- Vol. 1 (15224880) , I - 321-I - 324
Edge Preserving Filters using Geodesic Distances on Weighted Orthogonal Domains
We introduce a framework for image enhancement, which smooths images while preserving edge information. Domain (spatial) and range (feature) information are combined in one single measure in a principled way. This measure turns out to be the geodesic distance between pixels, calculated on weighted orthogonal domains. The weight function is computed to capture the underlying structure of the image manifold, but allowing at the same time to efficiently solve, using the Fast Marching algorithm on orthogonal domains, the eikonal equation to obtain the geodesic distances. We show promising results in edge-preserving denoising of gray scale, color and texture images.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15505499,p. 1-8
Pairwise Similarities across Images for Multiple View Rigid/Non-Rigid Segmentation and Registration
A variational approach for the background/foreground segmentation of multiple views of the same scene is presented. The main novelty is the introduction of cost functions based on pairwise similarity between pixels across different images. These cost functions are minimized within a level set framework. In addition, a warping model (rigid or non-rigid) between the emerging foregrounds in the different views is imposed, thus avoiding the introduction of a specific shape term in the cost function to handle occlusions. The thin plate spline (TPS) warping is for the first time employed within the level set framework to model non- rigid deformations. The minimization of these cost functions leads to simultaneous segmentation and registration of the different views. Examples of segmentations of a variety of objects are shown and possible applications are proposed.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15505499,p. 1-8
Pairwise Similarities across Images for Multiple View Rigid/Non-Rigid Segmentation and Registration
A variational approach for the background/foreground segmentation of multiple views of the same scene is presented. The main novelty is the introduction of cost functions based on pairwise similarity between pixels across different images. These cost functions are minimized within a level set framework. In addition, a warping model (rigid or non-rigid) between the emerging foregrounds in the different views is imposed, thus avoiding the introduction of a specific shape term in the cost function to handle occlusions. The thin plate spline (TPS) warping is for the first time employed within the level set framework to model non- rigid deformations. The minimization of these cost functions leads to simultaneous segmentation and registration of the different views. Examples of segmentations of a variety of objects are shown and possible applications are proposed.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6 (15224880) , VI - 61-61
A Variational Approach to Exploit Prior Information in Object-Background Segregation: Application to Retinal Images
One of the main challenges in image segmentation is to adapt prior knowledge about the objects/regions that are likely to be present in an image, in order to obtain more precise detection and recognition. Typical applications of such knowledge-based segmentation include partitioning satellite images and microscopy images, where the context is generally well defined. In particular, we present an approach that exploits the knowledge about foreground and background information given in a reference image, in segmenting images containing similar objects or regions. This problem is presented within a variational framework, where cost functions based on pair-wise pixel similarities are minimized. This is perhaps one of the first attempts in using non-shape based prior information within a segmentation framework. We validate the proposed method to segment the outer nuclear layer (ONL) in retinal images. This approach successfully segments the ONL within an image and enables further quantitative analysis.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6 (15224880) , VI - 61-61
A Variational Approach to Exploit Prior Information in Object-Background Segregation: Application to Retinal Images
One of the main challenges in image segmentation is to adapt prior knowledge about the objects/regions that are likely to be present in an image, in order to obtain more precise detection and recognition. Typical applications of such knowledge-based segmentation include partitioning satellite images and microscopy images, where the context is generally well defined. In particular, we present an approach that exploits the knowledge about foreground and background information given in a reference image, in segmenting images containing similar objects or regions. This problem is presented within a variational framework, where cost functions based on pair-wise pixel similarities are minimized. This is perhaps one of the first attempts in using non-shape based prior information within a segmentation framework. We validate the proposed method to segment the outer nuclear layer (ONL) in retinal images. This approach successfully segments the ONL within an image and enables further quantitative analysis.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3033-3036
Redundancy in All Pairs Fast Marching Method
In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic distances from a point. But when calculated for all the points on the grid, this introduces certain redundancy. Our analysis shows that over 90% of the distances are actually recalculated. We propose a novel solution which exploits this redundancy to reduce the number of distances evaluated using the fast marching method and enforces the symmetry of the distance matrix. Experimental results show the improved accuracy obtained with our implementation.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3033-3036
Redundancy in All Pairs Fast Marching Method
In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic distances from a point. But when calculated for all the points on the grid, this introduces certain redundancy. Our analysis shows that over 90% of the distances are actually recalculated. We propose a novel solution which exploits this redundancy to reduce the number of distances evaluated using the fast marching method and enforces the symmetry of the distance matrix. Experimental results show the improved accuracy obtained with our implementation.
- 16 September 2006
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 9 (4) , 293-306
A semi-automatic system for segmentation of cardiac M-mode images
- 16 September 2006
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 9 (4) , 293-306
A semi-automatic system for segmentation of cardiac M-mode images