Frédéric Gibou
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
Frédéric Gibou has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
Chohong Min
Ewha Womans University
3 shared publications- Chohong Min
UCSB
2 shared publications Han Chen
University of California
2 shared publications- Luca Bertelli
Center for BioImage Informatics, Dept. of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106
2 shared publications Antoine du Chéné
University of California
1 shared publicationArthur Boyer
Department of Computer Science and Department of Mechanical Engineering, University of California at Santa Barbara, CA 93106-5070
1 shared publication
Latest Publications
- 1 January 2013
- Published by Global Science Press in Communications in Computational Physics
- Vol. 13 (1) , 150-173
An Adaptive, Finite Difference Solver for the Nonlinear Poisson-Boltzmann Equation with Applications to Biomolecular Computations
An Adaptive, Finite Difference Solver for the Nonlinear Poisson-Boltzmann Equation with Applications to Biomolecular Computations - Volume 13 Issue 1 - Mohammad Mirzadeh, Maxime Theillard, Asdís Helgadöttir, David Boy, Frédéric Gibou
- 1 January 2013
- Published by Global Science Press in Communications in Computational Physics
- Vol. 13 (1) , 150-173
An Adaptive, Finite Difference Solver for the Nonlinear Poisson-Boltzmann Equation with Applications to Biomolecular Computations
An Adaptive, Finite Difference Solver for the Nonlinear Poisson-Boltzmann Equation with Applications to Biomolecular Computations - Volume 13 Issue 1 - Mohammad Mirzadeh, Maxime Theillard, Asdís Helgadöttir, David Boy, Frédéric Gibou
- 7 November 2012
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 54 (2-3) , 369-413
High Resolution Sharp Computational Methods for Elliptic and Parabolic Problems in Complex Geometries
- 7 November 2012
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 54 (2-3) , 369-413
High Resolution Sharp Computational Methods for Elliptic and Parabolic Problems in Complex Geometries
- 26 June 2012
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 55 (1) , 1-15
A Multigrid Method on Non-Graded Adaptive Octree and Quadtree Cartesian Grids
- 26 June 2012
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 55 (1) , 1-15
A Multigrid Method on Non-Graded Adaptive Octree and Quadtree Cartesian Grids
- 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
- 20 December 2007
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 35 (2-3) , 114-131
Second-Order Accurate Computation of Curvatures in a Level Set Framework Using Novel High-Order Reinitialization Schemes
- 20 December 2007
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 35 (2-3) , 114-131
Second-Order Accurate Computation of Curvatures in a Level Set Framework Using Novel High-Order Reinitialization Schemes
- 31 March 2007
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 31 (1-2) , 19-60
A Supra-Convergent Finite Difference Scheme for the Poisson and Heat Equations on Irregular Domains and Non-Graded Adaptive Cartesian Grids
- 31 March 2007
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 31 (1-2) , 19-60
A Supra-Convergent Finite Difference Scheme for the Poisson and Heat Equations on Irregular Domains and Non-Graded Adaptive Cartesian Grids
- 1 January 2006
- Published by Springer Nature in MRS Proceedings
- Vol. 910
A Second Order Accurate Finite Difference Scheme for the Heat Equation on Irregular Domains and Adaptive Grids
- 1 January 2006
- Published by Springer Nature in MRS Proceedings
- Vol. 910
A Second Order Accurate Finite Difference Scheme for the Heat Equation on Irregular Domains and Adaptive Grids
- 1 January 2006
- Published by Springer Nature
- p. 199-208
Finite Difference Schemes for Incompressible Flows on Fully Adaptive Grids
- 1 January 2006
- Published by Springer Nature
- p. 199-208
Finite Difference Schemes for Incompressible Flows on Fully Adaptive Grids
- Open Access
- 1 January 2005
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 2 (2) , 209-226
Partial Differential Equations-Based Segmentation for Radiotherapy Treatment Planning
The purpose of this study is to develop automatic algorithms for the segmentation phase of radiotherapy treatment planning. We develop new image processing techniques that are based on solving a partial differential equation for the evolution of the curve that identifies the segmented organ. The velocity function is based on the piecewise Mumford-Shah functional. Our method incorporates information about the target organ into classical segmentation algorithms. This information, which is given in terms of a three-dimensional wireframe representation of the organ, serves as an initial guess for the segmentation algorithm. We check the performance of the new algorithm on eight data sets of three different organs: rectum, bladder, and kidney. The results of the automatic segmentation were compared with a manual segmentation of each data set by radiation oncology faculty and residents. The quality of the automatic segmentation was measured with the ''$\kappa$-statistics'', and with a count of over- and undersegmented frames, and was shown in most cases to be very close to the manual segmentation of the same data. A typical segmentation of an organ with sixty slices takes less than ten seconds on a Pentium IV laptop.
- 1 January 2005
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 2 (2) , 209-226
Open AccessPartial Differential Equations-Based Segmentation for Radiotherapy Treatment Planning
The purpose of this study is to develop automatic algorithms for the segmentation phase of radiotherapy treatment planning. We develop new image processing techniques that are based on solving a partial differential equation for the evolution of the curve that identifies the segmented organ. The velocity function is based on the piecewise Mumford-Shah functional. Our method incorporates information about the target organ into classical segmentation algorithms. This information, which is given in terms of a three-dimensional wireframe representation of the organ, serves as an initial guess for the segmentation algorithm. We check the performance of the new algorithm on eight data sets of three different organs: rectum, bladder, and kidney. The results of the automatic segmentation were compared with a manual segmentation of each data set by radiation oncology faculty and residents. The quality of the automatic segmentation was measured with the ''$\kappa$-statistics'', and with a count of over- and undersegmented frames, and was shown in most cases to be very close to the manual segmentation of the same data. A typical segmentation of an organ with sixty slices takes less than ten seconds on a Pentium IV laptop.