most citedMaximal digital straight segments and convergence of discrete geometric estimators

20 citations · 40 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CV2009

Deformable Model with a Complexity Independent from Image Resolution

Jacques-Olivier Lachaud, Benjamin Taton

We present a parametric deformable model which recovers image components with a complexity independent from the resolution of input images. The proposed model also automatically ch…

cs.CV2009

Combinatorial pyramids and discrete geometry for energy-minimizing segmentation

Martin Braure De Calignon, Luc Brun, Jacques-Olivier Lachaud

This paper defines the basis of a new hierarchical framework for segmentation algorithms based on energy minimization schemes. This new framework is based on two formal tools. Firs…

cs.DM20098 cited

Coding cells of digital spaces: a framework to write generic digital topology algorithms

Jacques-Olivier Lachaud

This paper proposes a concise coding of the cells of n-dimensional finite regular grids. It induces a simple, generic and efficient framework for implementing classical digital top…

cs.CV200920 cited

Maximal digital straight segments and convergence of discrete geometric estimators

F. De Vieilleville, Jacques-Olivier Lachaud, F. Feschet

Discrete geometric estimators approach geometric quantities on digitized shapes without any knowledge of the continuous shape. A classical yet difficult problem is to show that an…

cs.DM200912 cited

Revisiting Digital Straight Segment Recognition

F. De Vieilleville, Jacques-Olivier Lachaud

This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognition algorith…