Dominique Michelucci

Orcid: 0000-0002-1256-9080

Affiliations:
  • Université de Dijon


According to our database1, Dominique Michelucci authored at least 71 papers between 1986 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
QPert: Query Perturbation to improve shape retrieval algorithms.
Multim. Tools Appl., March, 2024

2023
Quantized random projections of SIFT features for cancelable fingerprints.
Multim. Tools Appl., February, 2023

Segmentation of 3D pore space from CT images using curvilinear skeleton: application to numerical simulation of microbial decomposition.
CoRR, 2023

2022
PUNet: Novel and efficient deep neural network architecture for handwritten documents word spotting.
Pattern Recognit. Lett., 2022

2021
An Efficient Cooperative Smearing Technique for Degraded Historical Document Image Segmentation.
Int. J. Image Graph., 2021

2020
Using skeleton and Hough transform variant to correct skew in historical documents.
Math. Comput. Simul., 2020

hidden markov random fields and cuckoo search method for medical image segmentation.
CoRR, 2020

2019
Degraded Historical Documents Images Binarization Using a Combination of Enhanced Techniques.
CoRR, 2019

Towards a better integration of modelers and black box constraint solvers within the product design process.
Ann. Math. Artif. Intell., 2019

Optimizing Query Perturbations to Enhance Shape Retrieval.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2018
Hidden Markov random field model and Broyden-Fletcher-Goldfarb-Shanno algorithm for brain image segmentation.
J. Exp. Theor. Artif. Intell., 2018

Approximation of Pore Space with Ellipsoids: A Comparison of a Geometrical Method with a Statistical one.
Proceedings of the 14th International Conference on Signal-Image Technology & Internet-Based Systems, 2018

Conjugate Gradient Method for Brain Magnetic Resonance Images Segmentation.
Proceedings of the Computational Intelligence and Its Applications, 2018

2017
Unsupervised geodesic convex combination of shape dissimilarity measures.
Pattern Recognit. Lett., 2017

A 3D shape matching and retrieval approach based on fusion of curvature and geometric diffusion features.
Int. J. Comput. Appl. Technol., 2017

On the reducibility of geometric constraint graphs.
CoRR, 2017

Combination of Hidden Markov Random Field and Conjugate Gradient for Brain Image Segmentation.
CoRR, 2017

2016
Variational geometric modeling with black box constraints and DAGs.
Comput. Aided Des., 2016

An improved star test for implicit polynomial objects.
Comput. Aided Des., 2016

Re-parameterization reduces irreducible geometric constraint systems.
Comput. Aided Des., 2016

Hidden Markov Random Field model and BFGS algorithm for Brain Image Segmentation.
Proceedings of the Mediterranean Conference on Pattern Recognition and Artificial Intelligence, 2016

Segmentation By Tangent Filter.
Proceedings of the Mediterranean Conference on Pattern Recognition and Artificial Intelligence, 2016

Hidden Markov Random Fields and Direct Search Methods for Medical Image Segmentation.
Proceedings of the 5th International Conference on Pattern Recognition Applications and Methods, 2016

2015
Extending CSG with projections: Towards formally certified geometric modeling.
Comput. Aided Des., 2015

Solving the pentahedron problem.
Comput. Aided Des., 2015

2014
Reduction of constraint systems.
CoRR, 2014

New Geometric Constraint Solving Formulation: Application to the 3D Pentahedron.
Proceedings of the Image and Signal Processing - 6th International Conference, 2014

2012
On the Complexity of the Bernstein Combinatorial Problem.
Reliab. Comput., 2012

The Bernstein Basis and its Applications in Solving Geometric Constraint Systems.
Reliab. Comput., 2012

Interrogating witnesses for geometric constraint solving.
Inf. Comput., 2012

Special issue on geometric constraints and reasoning.
Comput. Geom., 2012

Polytope-based computation of polynomial ranges.
Comput. Aided Geom. Des., 2012

2011
Extensions of the witness method to characterize under-, over- and well-constrained geometric constraint systems.
Comput. Aided Des., 2011

2010
Optimizations for Tensorial Bernstein-Based Solvers by Using Polyhedral Bounds.
Int. J. Shape Model., 2010

Using the witness method to detect rigid subsystems of geometric constraints in CAD.
Proceedings of the ACM Symposium on Solid and Physical Modeling, 2010

What Is a Line ?
Proceedings of the Automated Deduction in Geometry - 8th International Workshop, 2010

Some Lemmas to Hopefully Enable Search Methods to Find Short and Human Readable Proofs for Incidence Theorems of Projective Geometry.
Proceedings of the Automated Deduction in Geometry - 8th International Workshop, 2010

2009
Nonlinear systems solver in floating-point arithmetic using LP reduction.
Proceedings of the 2009 ACM Symposium on Solid and Physical Modeling, 2009

2008
Isometry group, words and proofs of geometric theorems.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Special track on Geometric Constraints and Reasoning: editorial message.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Robustness and Randomness.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 2008

Linear Programming for Bernstein Based Solvers.
Proceedings of the Automated Deduction in Geometry - 7th International Workshop, 2008

2007
A New Robust Algorithm to Trace Curves.
Reliab. Comput., 2007

2006
Incidence Constraints: a Combinatorial Approach.
Int. J. Comput. Geom. Appl., 2006

Interval-based Tracing of Strange Attractors.
Int. J. Comput. Geom. Appl., 2006

Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 2006

Geometric constraint solving: The witness configuration method.
Comput. Aided Des., 2006

Geometric constraints solving: some tracks.
Proceedings of the ACM Symposium on Solid and Physical Modeling 2006, 2006

Editorial message: technical track on geometric computing and reasoning.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Another Paradigm for Geometric Constraints Solving.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method.
Proceedings of the Automated Deduction in Geometry, 2006

2005
Numerical decomposition of geometric constraints.
Proceedings of the Tenth ACM Symposium on Solid and Physical Modeling 2005, 2005

Bernstein based arithmetic featuring de Casteljau.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Shortest circuits with given homotopy in a constellation.
Proceedings of the Ninth ACM Symposium on Solid Modeling and Applications, 2004

Using Cayley-Menger determinants for geometric constraint solving.
Proceedings of the Ninth ACM Symposium on Solid Modeling and Applications, 2004

2001
The ellipsoidal skeleton in medical applications.
Proceedings of the Sixth ACM Symposium on Solid Modeling and Applications, 2001

2000
ZEA - A zero-free exact arithmetic .
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Hierarchical automated clustering of cloud point set by ellipsoidal skeleton: application to organ geometric modeling from CT-scan images.
Proceedings of the Medical Imaging 1999: Image Processing, 1999

Convex Hull of Grid Points below a Line or a Convex Curve.
Proceedings of the Discrete Geometry for Computer Imagery, 1999

The periodicity of integral convex hulls for conics in r<sup>2</sup>.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1997
Lazy Arithmetic.
IEEE Trans. Computers, 1997

Bridging the Gap Between CSG and Brep via a Triple Ray Representation.
Proceedings of the Fourth Symposium on Solid Modeling and Applications, 1997

A quadratic non-standard arthmetic.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996
Solving Geometric Constraints By Homotopy.
IEEE Trans. Vis. Comput. Graph., 1996

1995
Introduction to the Special Issue: "Real Numbers and Computers".
J. Univers. Comput. Sci., 1995

An epsilon-Arithmetic for Removing Degeneracies.
Proceedings of the 12th Symposium on Computer Arithmetic (ARITH-12 '95), 1995

1994
Hashing lazy numbers.
Computing, 1994

Error-free boundary evaluation based on a lazy rational arithmetic: a detailed implementation.
Comput. Aided Des., 1994

1993
Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation.
Proceedings of the ACM Symposium on Solid Modeling Foundations and CAD/CAM Applications, 1993

A lazy exact arithmetic.
Proceedings of the 11th Symposium on Computer Arithmetic, 29 June, 1993

1986
Les représentations par les frontières: quelques constructions ; difficultés rencontrées.
PhD thesis, 1986


  Loading...