Critical kernels

Higher Edu - Research dev card
Development from the higher education and research community
  • Creation or important update: 12/03/10
  • Minor correction: 12/09/13
Keywords

Critical kernels : parallel thinning and skeletons in any dimension

This software was developed (or is under development) within the higher education and research community. Its stability can vary (see fields below) and its working state is not guaranteed.
  • Web site
  • System: UNIX-like
  • Current version: 1.0 (stable) - juillet 2007
  • License(s): CeCILL
  • Status: stable release
  • Support: maintained, ongoing development
  • Designer(s): Gilles Bertrand, Michel Couprie
  • Contact designer(s): coupriem @ esiee.fr
  • Laboratory, service: LIGM

 

General software features

Critical kernels provide a sound basis for the study of operators which remove a whole subset of an object (and not only a simple point) while preserving its topology.

Using this notion we have study several parallel thinning algorithms in 2D and 3D, they are programmed in C and described in articles [BC06a,BC06b,BC06c] (see below).

We also have shown that critical kernels are a non-trivial generalization of all previous related notions, in particular the notions of minimal non-simple sets and P-simple points.

Context in which the software is used

Used for the research of the team, and also in several research projects, see http://www.esiee.fr/~info/a2si/projets.html.

Publications related to the software
  • [BC06b] G. Bertrand and M. Couprie: "New 2D parallel thinning algorithms based on critical kernels", Combinatorial Image Analysis, Lecture Notes in Computer Science, Vol. 4040, pp. 45-59, Springer, 2006.
  • [BC06c] G. Bertrand and M. Couprie: "New 3D parallel thinning scheme based on critical kernels", Discrete geometry for computer imagery, Lecture Notes in Computer Science, Vol. 4245, pp. 580-591, Springer, 2006.
  • [CSB06] M. Couprie and A. Vital Sa√ļde and G. Bertrand: "Euclidean homotopic skeleton based on critical kernels", Procs. SIBGRAPI, IEEE CS Press, pp. 307-314, 2006.
  • [CB08b] M. Couprie and G. Bertrand: "New characterizations of simple points, minimal non-simple sets and P-simple points in 2D, 3D and 4D discrete spaces", Discrete geometry for computer imagery, Lecture Notes in Computer Science, Vol. 4992, pp. 105-116, Springer, 2008.
  • More references at: http://www.esiee.fr/~info/ck/CK_biblio.html