Fabien Feschet

Orcid: 0000-0001-5178-0842

According to our database1, Fabien Feschet authored at least 48 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An Envelope Operator for Full Convexity to Define Polyhedral Models in Digital Spaces.
J. Math. Imaging Vis., October, 2023

2022
Full Convexity for Polyhedral Models in Digital Spaces.
Proceedings of the Discrete Geometry and Mathematical Morphology, 2022

2021
Robust reconstructions by multi-scale/irregular tangential covering.
CoRR, 2021

Segment- and Arc-Based Vectorizations by Multi-scale/Irregular Tangential Covering.
Proceedings of the Geometry and Vision - First International Symposium, 2021

2019
Implementation of a Denoising Algorithm Based on High-Order Singular Value Decomposition of Tensors.
Image Process. Line, 2019

2018
Super-resolution in Clinical Conditions: Deep Brain Stimulation Case Study.
Fundam. Informaticae, 2018

The Saturated Subpaths Decomposition in Z 2 : a short note on generalized Tangential Cover.
CoRR, 2018

2017
Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-scale/Irregular Geometric Representation and Generalized Linear Programming.
Proceedings of the Discrete Geometry for Computer Imagery, 2017

2015
Knot Detection from Accumulation Map by Polar Scan.
Proceedings of the Combinatorial Image Analysis - 17th International Workshop, 2015

2014
Digital Level Layers for Digital Curve Decomposition and Vectorization.
Image Process. Line, 2014

2012
Scheduling model for a tool evaluating new radiotherapies.
Proceedings of the 2012 Spring Simulation Multiconference, 2012

2011
Computing efficiently the lattice width in any dimension.
Theor. Comput. Sci., 2011

Tool for the Evaluation of Innovative Therapies - Multi-agent based System.
Proceedings of the SIMULTECH 2011 - Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Noordwijkerhout, The Netherlands, 29, 2011

Introduction to Digital Level Layers.
Proceedings of the Discrete Geometry for Computer Imagery, 2011

2010
Multiscale Analysis of Digital Segments by Intersection of 2D Digital Lines.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

Multiscale Analysis from 1D Parametric Geometric Decomposition of Shapes.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

Linear Decomposition of Planar Shapes.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

2009
Gift-wrapping based preimage computation algorithm.
Pattern Recognit., 2009

Tangential cover for thick digital curves.
Pattern Recognit., 2009

Multi-primitive Analysis of Digital Curves.
Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

Multiscale Discrete Geometry.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

Efficient Lattice Width Computation in Arbitrary Dimension.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008
Robust Decomposition of Thick Digital Shapes.
Proceedings of the Combinatorial Image Analysis, 12th International Workshop, 2008

The lattice width and quasi-straightness in digital spaces.
Proceedings of the 19th International Conference on Pattern Recognition (ICPR 2008), 2008

Tangential Cover for Thick Digital Curves.
Proceedings of the Discrete Geometry for Computer Imagery, 2008

2007
Convex Digital Polygons, Maximal Digital Straight Segments and Convergence of Discrete Geometric Estimators.
J. Math. Imaging Vis., 2007

2006
Optimal blurred segments decomposition of noisy shapes in linear time.
Comput. Graph., 2006

Parallelization of a Discrete Radiosity Method Using Scene Division.
Proceedings of the On the Move to Meaningful Internet Systems 2006: CoopIS, 2006

The Exact Lattice Width of Planar Sets and Minimal Arithmetical Thickness.
Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

Parallelization of a Discrete Radiosity Method.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

A Generic Approach for n-Dimensional Digital Lines.
Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

2005
Canonical representations of discrete curves.
Pattern Anal. Appl., 2005

Application of a discrete tomography algorithm to computerized tomography.
Electron. Notes Discret. Math., 2005

Maximal Digital Straight Segments and Convergence of Discrete Geometric Estimators.
Proceedings of the Image Analysis, 14th Scandinavian Conference, 2005

Fast Guaranteed Polygonal Approximations of Closed Digital Curves.
Proceedings of the Image Analysis, 14th Scandinavian Conference, 2005

Computerized Tomography with Digital Lines and Linear Programming.
Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

Optimal Blurred Segments Decomposition in Linear Time.
Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2003
On the min DSS problem of closed discrete curves.
Electron. Notes Discret. Math., 2003

Digital plane preimage structure.
Electron. Notes Discret. Math., 2003

2001
Generating Isotropic Discrete Waves on Cellular Automata.
Int. J. Pattern Recognit. Artif. Intell., 2001

An approach for the estimation of the precision of a real object from its digitization.
Proceedings of the 8th International Workshop on Combinatorial Image Analysis, 2001

Comparison of Three Objective Functions for Conceptual Clustering.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2001

Efficient Local Search in Conceptual Clustering.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

2000
An Experimental Study of Partition Quality Indices in Clustering.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2000

A New Methodology to Compare Clustering Algorithms.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2000

1999
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature.
Proceedings of the Discrete Geometry for Computer Imagery, 1999

1998
ParList: A Parallel Data Structure for Dynamic Load Balancing.
J. Parallel Distributed Comput., 1998

1997
Optimal Multiple Intervals Discretization of Continuous Attributes for Supervised Learning.
Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), 1997


  Loading...