default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabien Feschet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Fabien Feschet
, Jacques-Olivier Lachaud:
New Characterizations of Full Convexity. DGMM 2024: 41-53- 2023
- [j18]Fabien Feschet, Jacques-Olivier Lachaud:
An Envelope Operator for Full Convexity to Define Polyhedral Models in Digital Spaces. J. Math. Imaging Vis. 65(5): 754-769 (2023) - 2022
- [c32]Fabien Feschet, Jacques-Olivier Lachaud:
Full Convexity for Polyhedral Models in Digital Spaces. DGMM 2022: 98-109 - 2021
- [c31]Antoine Vacavant, Bertrand Kerautret, Fabien Feschet:
Segment- and Arc-Based Vectorizations by Multi-scale/Irregular Tangential Covering. ISGV 2021: 190-202 - [i3]Antoine Vacavant, Bertrand Kerautret, Fabien Feschet:
Robust reconstructions by multi-scale/irregular tangential covering. CoRR abs/2111.05688 (2021)
2010 – 2019
- 2019
- [j17]Fabien Feschet:
Implementation of a Denoising Algorithm Based on High-Order Singular Value Decomposition of Tensors. Image Process. Line 9: 158-182 (2019) - 2018
- [j16]Fabien Feschet, Jean-Jacques Lemaire:
Super-resolution in Clinical Conditions: Deep Brain Stimulation Case Study. Fundam. Informaticae 163(1): 41-62 (2018) - [i2]Fabien Feschet:
The Saturated Subpaths Decomposition in Z 2 : a short note on generalized Tangential Cover. CoRR abs/1806.03053 (2018) - 2017
- [c30]Antoine Vacavant, Bertrand Kerautret, Tristan Roussillon, Fabien Feschet:
Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-scale/Irregular Geometric Representation and Generalized Linear Programming. DGCI 2017: 291-303 - 2015
- [c29]Adrien Krähenbühl, Bertrand Kerautret, Fabien Feschet:
Knot Detection from Accumulation Map by Polar Scan. IWCIA 2015: 352-362 - 2014
- [j15]Laurent Provot, Yan Gérard, Fabien Feschet:
Digital Level Layers for Digital Curve Decomposition and Vectorization. Image Process. Line 4: 169-186 (2014) - 2012
- [c28]Anastasiya Shtiliyanova, Fabien Feschet, Pascal Pommier:
Scheduling model for a tool evaluating new radiotherapies. SpringSim (TMS-DEVS) 2012: 45 - 2011
- [j14]Emilie Charrier, Fabien Feschet, Lilian Buzer:
Computing efficiently the lattice width in any dimension. Theor. Comput. Sci. 412(36): 4814-4823 (2011) - [c27]Yan Gérard, Laurent Provot, Fabien Feschet:
Introduction to Digital Level Layers. DGCI 2011: 83-94 - [c26]Anastasiya Shtiliyanova, Fabien Feschet, Pascal Pommier:
Tool for the Evaluation of Innovative Therapies - Multi-agent based System. SIMULTECH 2011: 148-154 - 2010
- [c25]Alexandre Faure, Fabien Feschet:
Linear Decomposition of Planar Shapes. ICPR 2010: 1096-1099 - [c24]Fabien Feschet:
Multiscale Analysis from 1D Parametric Geometric Decomposition of Shapes. ICPR 2010: 2102-2105 - [c23]Mouhammad Said, Jacques-Olivier Lachaud, Fabien Feschet:
Multiscale Analysis of Digital Segments by Intersection of 2D Digital Lines. ICPR 2010: 4097-4100
2000 – 2009
- 2009
- [j13]Yan Gérard, David Coeurjolly, Fabien Feschet:
Gift-wrapping based preimage computation algorithm. Pattern Recognit. 42(10): 2255-2264 (2009) - [j12]Alexandre Faure, Lilian Buzer, Fabien Feschet:
Tangential cover for thick digital curves. Pattern Recognit. 42(10): 2279-2287 (2009) - [c22]Emilie Charrier, Lilian Buzer, Fabien Feschet:
Efficient Lattice Width Computation in Arbitrary Dimension. DGCI 2009: 46-56 - [c21]Mouhammad Said, Jacques-Olivier Lachaud, Fabien Feschet:
Multiscale Discrete Geometry. DGCI 2009: 118-131 - [c20]Alexandre Faure, Fabien Feschet:
Multi-primitive Analysis of Digital Curves. IWCIA 2009: 30-42 - [i1]François de Vieilleville, Jacques-Olivier Lachaud, Fabien Feschet:
Maximal digital straight segments and convergence of discrete geometric estimators. CoRR abs/0906.2716 (2009) - 2008
- [c19]Yan Gérard, Fabien Feschet, David Coeurjolly:
Gift-Wrapping Based Preimage Computation Algorithm. DGCI 2008: 310-321 - [c18]Alexandre Faure, Fabien Feschet:
Tangential Cover for Thick Digital Curves. DGCI 2008: 358-369 - [c17]Fabien Feschet:
The lattice width and quasi-straightness in digital spaces. ICPR 2008: 1-4 - [c16]Alexandre Faure, Fabien Feschet:
Robust Decomposition of Thick Digital Shapes. IWCIA 2008: 148-159 - 2007
- [j11]François de Vieilleville, Jacques-Olivier Lachaud, Fabien Feschet:
Convex Digital Polygons, Maximal Digital Straight Segments and Convergence of Discrete Geometric Estimators. J. Math. Imaging Vis. 27(2): 139-156 (2007) - 2006
- [j10]Isabelle Debled-Rennesson, Fabien Feschet, Jocelyne Rouyer-Degli:
Optimal blurred segments decomposition of noisy shapes in linear time. Comput. Graph. 30(1): 30-36 (2006) - [c15]Fabien Feschet, Jean-Pierre Reveillès:
A Generic Approach for n-Dimensional Digital Lines. DGCI 2006: 29-40 - [c14]Rita Zrour, Pierre Y. Chatelier, Fabien Feschet, Rémy Malgouyres:
Parallelization of a Discrete Radiosity Method. Euro-Par 2006: 740-750 - [c13]Fabien Feschet:
The Exact Lattice Width of Planar Sets and Minimal Arithmetical Thickness. IWCIA 2006: 25-33 - [c12]Rita Zrour, Fabien Feschet, Rémy Malgouyres:
Parallelization of a Discrete Radiosity Method Using Scene Division. OTM Conferences (2) 2006: 1213-1222 - 2005
- [j9]David Coeurjolly, Isabelle Sivignon, Florent Dupont, Fabien Feschet, Jean-Marc Chassery:
On digital plane preimage structure. Discret. Appl. Math. 151(1-3): 78-92 (2005) - [j8]Fabien Feschet, Laure Tougne:
On the min DSS problem of closed discrete curves. Discret. Appl. Math. 151(1-3): 138-153 (2005) - [j7]Yan Gérard, Fabien Feschet:
Application of a discrete tomography algorithm to computerized tomography. Electron. Notes Discret. Math. 20: 501-517 (2005) - [j6]Fabien Feschet:
Canonical representations of discrete curves. Pattern Anal. Appl. 8(1-2): 84-94 (2005) - [c11]Fabien Feschet, Yan Gérard:
Computerized Tomography with Digital Lines and Linear Programming. DGCI 2005: 126-135 - [c10]Isabelle Debled-Rennesson, Fabien Feschet, Jocelyne Rouyer-Degli:
Optimal Blurred Segments Decomposition in Linear Time. DGCI 2005: 371-382 - [c9]Fabien Feschet:
Fast Guaranteed Polygonal Approximations of Closed Digital Curves. SCIA 2005: 910-919 - [c8]François de Vieilleville, Jacques-Olivier Lachaud, Fabien Feschet:
Maximal Digital Straight Segments and Convergence of Discrete Geometric Estimators. SCIA 2005: 988-997 - 2004
- [j5]Fabien Feschet, Laure Tougne:
An approach for the estimation of the precision of a real object from its digitization. Discret. Appl. Math. 139(1-3): 51-63 (2004) - 2003
- [j4]David Coeurjolly, Isabelle Sivignon, Florent Dupont, Fabien Feschet, Jean-Marc Chassery:
Digital plane preimage structure. Electron. Notes Discret. Math. 12: 220-231 (2003) - [j3]Fabien Feschet, Laure Tougne:
On the min DSS problem of closed discrete curves. Electron. Notes Discret. Math. 12: 325-336 (2003) - 2001
- [j2]Fabien Feschet, Laure Tougne:
Generating Isotropic Discrete Waves on Cellular Automata. Int. J. Pattern Recognit. Artif. Intell. 15(7): 1007-1021 (2001) - [c7]Céline Robardet, Fabien Feschet:
Efficient Local Search in Conceptual Clustering. Discovery Science 2001: 323-335 - [c6]Céline Robardet, Fabien Feschet:
Comparison of Three Objective Functions for Conceptual Clustering. PKDD 2001: 399-410 - [c5]Fabien Feschet, Laure Tougne:
An approach for the estimation of the precision of a real object from its digitization. IWCIA 2001: 203-213 - 2000
- [c4]Céline Robardet, Fabien Feschet:
A New Methodology to Compare Clustering Algorithms. IDEAL 2000: 565-570 - [c3]Céline Robardet, Fabien Feschet, Nicolas Nicoloyannis:
An Experimental Study of Partition Quality Indices in Clustering. PKDD 2000: 599-604
1990 – 1999
- 1999
- [c2]Fabien Feschet, Laure Tougne:
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature. DGCI 1999: 31-40 - 1998
- [j1]Fabien Feschet, Serge Miguet, Laurent Perroton:
ParList: A Parallel Data Structure for Dynamic Load Balancing. J. Parallel Distributed Comput. 51(2): 114-135 (1998) - 1997
- [c1]Djamel A. Zighed, Ricco Rakotomalala, Fabien Feschet:
Optimal Multiple Intervals Discretization of Continuous Attributes for Supervised Learning. KDD 1997: 295-298
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-06 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
