Sebastien Horna
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
Sebastien Horna has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
C. Bennis
2 shared publications- Carole Guillevin
Department of Imaging University Hospital Center of Poitiers Poitiers France
2 shared publications - Daniel Meneveaux
University of Poitiers
2 shared publications - Guillaume Damiand
CNRS, UCBL, INSA Lyon, LIRIS, UMR5205, Villeurbanne, France
2 shared publications - Hakim Belhaouari
UPMC Paris Universitas
2 shared publications J.F. Rainaud
2 shared publications
Latest Publications
- Open Access
- 8 August 2025
- Published by Elsevier in Computers & Graphics
- Vol. 132
Clock mechanism generation using interaction graphs
- 8 August 2025
- Published by Elsevier in Computers & Graphics
- Vol. 132
Open AccessClock mechanism generation using interaction graphs
- 8 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 31 (2) , 1422-1434
Visibility Evaluation in Microfacet Theory
Reflectance models capture many types of visual appearances. The most plausible reflectance models follow the Microfacet theory, which is specifically based on statistical representations, with an analytic visibility term. This visibility term has a significant impact on appearance. Visibility computed with the masking term proposed by Smith (1967), and revisited by Ashikhmin et al. (2000), is nowadays considered as the most plausible in the literature. It is simple and efficient to evaluate for statistical distributions, but it relies on assumptions that are not necessarily respected by real surfaces. This article proposes an in-depth study of masking for meshed height-field surfaces, generated either from measured real-world materials or from functions derived from distributions of surface normals. We experimentally estimate the masking (and shadowing) of surfaces using a ray-casting technique, and compare their measurements with the theoretical model from Smith and Ashikhmin et al. We show that their assumptions are too restrictive for a majority of real-world surfaces. We propose a model capable of predicting how close the theoretical masking term can be from the masking term estimated by a ray-casting approach. Although most surfaces break their assumptions, our results show that the term from Smith and Ashikhmin et al. can still be reasonably employed for a fraction in a set of more than 400 measured surfaces, with low errors compared to a ray-casting masking estimation, much lower computation times, and very similar visual appearances. Our model can be used to predict the incurred error on a physically-based rendering simulation with a microfacet-based BRDF created from real-world surfaces, instead of explicitly calculating the masking term from its height field.
- 8 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 31 (2) , 1422-1434
Visibility Evaluation in Microfacet Theory
Reflectance models capture many types of visual appearances. The most plausible reflectance models follow the Microfacet theory, which is specifically based on statistical representations, with an analytic visibility term. This visibility term has a significant impact on appearance. Visibility computed with the masking term proposed by Smith (1967), and revisited by Ashikhmin et al. (2000), is nowadays considered as the most plausible in the literature. It is simple and efficient to evaluate for statistical distributions, but it relies on assumptions that are not necessarily respected by real surfaces. This article proposes an in-depth study of masking for meshed height-field surfaces, generated either from measured real-world materials or from functions derived from distributions of surface normals. We experimentally estimate the masking (and shadowing) of surfaces using a ray-casting technique, and compare their measurements with the theoretical model from Smith and Ashikhmin et al. We show that their assumptions are too restrictive for a majority of real-world surfaces. We propose a model capable of predicting how close the theoretical masking term can be from the masking term estimated by a ray-casting approach. Although most surfaces break their assumptions, our results show that the term from Smith and Ashikhmin et al. can still be reasonably employed for a fraction in a set of more than 400 measured surfaces, with low errors compared to a ray-casting masking estimation, much lower computation times, and very similar visual appearances. Our model can be used to predict the incurred error on a physically-based rendering simulation with a microfacet-based BRDF created from real-world surfaces, instead of explicitly calculating the masking term from its height field.
- Open Access
- 7 April 2022
- Published by MDPI AG in Journal of Imaging
- Vol. 8 (4) , 103
A Hybrid Method for 3D Reconstruction of MR Images
Three-dimensional surface reconstruction is a well-known task in medical imaging. In procedures for intervention or radiation treatment planning, the generated models should be accurate and reflect the natural appearance. Traditional methods for this task, such as Marching Cubes, use smoothing post processing to reduce staircase artifacts from mesh generation and exhibit the natural look. However, smoothing algorithms often reduce the quality and degrade the accuracy. Other methods, such as MPU implicits, based on adaptive implicit functions, inherently produce smooth 3D models. However, the integration in the implicit functions of both smoothness and accuracy of the shape approximation may impact the precision of the reconstruction. Having these limitations in mind, we propose a hybrid method for 3D reconstruction of MR images. This method is based on a parallel Marching Cubes algorithm called Flying Edges (FE) and Multi-level Partition of Unity (MPU) implicits. We aim to combine the robustness of the Marching Cubes algorithm with the smooth implicit curve tracking enabled by the use of implicit models in order to provide higher geometry precision. Towards this end, the regions that closely fit to the segmentation data, and thus regions that are not impacted by reconstruction issues, are first extracted from both methods. These regions are then merged and used to reconstruct the final model. Experimental studies were performed on a number of MRI datasets, providing images and error statistics generated from our results. The results obtained show that our method reduces the geometric errors of the reconstructed surfaces when compared to the MPU and FE approaches, producing a more accurate 3D reconstruction.
- 7 April 2022
- Published by MDPI AG in Journal of Imaging
- Vol. 8 (4) , 103
Open AccessA Hybrid Method for 3D Reconstruction of MR Images
Three-dimensional surface reconstruction is a well-known task in medical imaging. In procedures for intervention or radiation treatment planning, the generated models should be accurate and reflect the natural appearance. Traditional methods for this task, such as Marching Cubes, use smoothing post processing to reduce staircase artifacts from mesh generation and exhibit the natural look. However, smoothing algorithms often reduce the quality and degrade the accuracy. Other methods, such as MPU implicits, based on adaptive implicit functions, inherently produce smooth 3D models. However, the integration in the implicit functions of both smoothness and accuracy of the shape approximation may impact the precision of the reconstruction. Having these limitations in mind, we propose a hybrid method for 3D reconstruction of MR images. This method is based on a parallel Marching Cubes algorithm called Flying Edges (FE) and Multi-level Partition of Unity (MPU) implicits. We aim to combine the robustness of the Marching Cubes algorithm with the smooth implicit curve tracking enabled by the use of implicit models in order to provide higher geometry precision. Towards this end, the regions that closely fit to the segmentation data, and thus regions that are not impacted by reconstruction issues, are first extracted from both methods. These regions are then merged and used to reconstruct the final model. Experimental studies were performed on a number of MRI datasets, providing images and error statistics generated from our results. The results obtained show that our method reduces the geometric errors of the reconstructed surfaces when compared to the MPU and FE approaches, producing a more accurate 3D reconstruction.
- 21 January 2022
- Published by U-turn Press LLC in Computer-Aided Design and Applications
- Vol. 19 (5)
Comparative Study of 3D Reconstruction Methods for Medical Imaging
- 21 January 2022
- Published by U-turn Press LLC in Computer-Aided Design and Applications
- Vol. 19 (5)
Comparative Study of 3D Reconstruction Methods for Medical Imaging
- 18 April 2021
- Published by Wiley in Computer Graphics Forum
- Vol. 40 (6) , 200-214
SREC‐RT: A Structure for Ray Tracing Rounded Edges and Corners
- 18 April 2021
- Published by Wiley in Computer Graphics Forum
- Vol. 40 (6) , 200-214
SREC‐RT: A Structure for Ray Tracing Rounded Edges and Corners
- 21 January 2019
- Published by U-turn Press LLC in Computer-Aided Design and Applications
- Vol. 16 (5)
Reconstruction of Volumes from Soup of Faces with a Formal Topological Approach
Computer-Aided Design and Applications is an international journal on the applications of CAD and CAM. It publishes papers in the general domain of CAD plus in emerging fields like bio-CAD, nano-CAD, soft-CAD, garment-CAD, PLM, PDM, CAD data mining, CAD and the internet, CAD education, genetic algorithms and CAD engines. The journal is aimed at all developers and users of CAD technology to ptovide CAD solutions for various stages of design and manufacturing. The journal publishes all about Computer-Aided Design and Computer-Aided technologies.
- 21 January 2019
- Published by U-turn Press LLC in Computer-Aided Design and Applications
- Vol. 16 (5)
Reconstruction of Volumes from Soup of Faces with a Formal Topological Approach
Computer-Aided Design and Applications is an international journal on the applications of CAD and CAM. It publishes papers in the general domain of CAD plus in emerging fields like bio-CAD, nano-CAD, soft-CAD, garment-CAD, PLM, PDM, CAD data mining, CAD and the internet, CAD education, genetic algorithms and CAD engines. The journal is aimed at all developers and users of CAD technology to ptovide CAD solutions for various stages of design and manufacturing. The journal publishes all about Computer-Aided Design and Computer-Aided technologies.
- 9 July 2018
- Published by U-turn Press LLC
Reconstruction of Volumes from Soup of Faces with a Formal Topological Approach
- 9 July 2018
- Published by U-turn Press LLC
Reconstruction of Volumes from Soup of Faces with a Formal Topological Approach
- Open Access
- 1 January 2017
- Published by INSTICC
- p. 236-243
Efficient Ray Traversal of Constrained Delaunay Tetrahedralization
- 1 January 2017
- Published by INSTICC
- p. 236-243
Open AccessEfficient Ray Traversal of Constrained Delaunay Tetrahedralization
- 29 August 2016
- Published by EAGE Publications bv
A Topological Approach for Automated Unstructured Meshing of Complex Reservoir
- 29 August 2016
- Published by EAGE Publications bv
A Topological Approach for Automated Unstructured Meshing of Complex Reservoir
- 3 March 2016
- Published by Wiley in Computer Graphics Forum
- Vol. 36 (1) , 288-300
Constrained Convex Space Partition for Ray Tracing in Architectural Environments
This paper explores constrained convex space partition (CCSP) as a new acceleration structure for ray tracing. A CCSP is a graph, representing a space partition made up of empty convex volumes. The scene geometry is located on the boundary of the convex volumes. Therefore, each empty volume is bounded with two kinds of faces: occlusive ones (belonging to the scene geometry), and non‐occlusive ones. Given a ray, ray casting is performed by traversing the CCSP one volume at a time, until it hits the scene geometry. In this paper, this idea is applied to architectural scenes. We show that CCSP allows to cast several hundreds of millions of rays per second, even if they are not spatially coherent. Experiments are performed for large furnished buildings made up of hundreds of millions of polygons and containing thousands of light sources.
- 3 March 2016
- Published by Wiley in Computer Graphics Forum
- Vol. 36 (1) , 288-300
Constrained Convex Space Partition for Ray Tracing in Architectural Environments
This paper explores constrained convex space partition (CCSP) as a new acceleration structure for ray tracing. A CCSP is a graph, representing a space partition made up of empty convex volumes. The scene geometry is located on the boundary of the convex volumes. Therefore, each empty volume is bounded with two kinds of faces: occlusive ones (belonging to the scene geometry), and non‐occlusive ones. Given a ray, ray casting is performed by traversing the CCSP one volume at a time, until it hits the scene geometry. In this paper, this idea is applied to architectural scenes. We show that CCSP allows to cast several hundreds of millions of rays per second, even if they are not spatially coherent. Experiments are performed for large furnished buildings made up of hundreds of millions of polygons and containing thousands of light sources.