Sébastien Fourey > Publications with abstracts

Français | English ]

     

 

     
 

International journals

[1] Sébastien Fourey and Rémy Malgouyres. A digital linking number for discrete curves. International Journal of Pattern Recognition and Artificial Intelligence 15(7), pages 1053—1074, 2001.
[2] Sébastien Fourey and Rémy Malgouyres. Intersection number and topology preservation within digital surfaces. Theoretical Computer Science, volume 283, issue 1, pages 109—150, June 2002. [doi]
[3] Sébastien Fourey and Rémy Malgouyres. A concise characterization of 3d simple points. Discrete Applied Mathematics, volume 125, No. 1, pages 59—80, 2003. [doi]
[4] Sébastien Fourey, T. Yung Kong, and Gabor T. Herman. Generic axiomatized digital surface-structures. Discrete Applied Mathematics, volume 139, No. 1-3, pages. 65—93, 2004. [doi]
[5] Sébastien Fourey and Rémy Malgouyres. Normals estimation for digital surfaces based on convolutions. Computers & Graphics, volume 33, pages 2—10, Feb. 2009. [doi]

Proceedings of international conferences

[6] Rémy Malgouyres and Sébastien Fourey. Strong surfaces, surface skelettons and image superimposition. In Proceedings of the SPIE, Vision Geometry VII, volume 3454, pages 16—27, San Diego, U.S.A., 1998.
[7] Sébastien Fourey and Rémy Malgouyres. Intersection number and topology preservation within digital surfaces. In Proceedings of the Sixth International Workshop on Parallel Image Processing and Analysis (IWPIPA'99), pages 138—158, Madras, India, January 1999.
[8] Sébastien Fourey and Rémy Malgouyres. Intersection number of paths lying on a digital surface and a new jordan theorem. In Proceedings of the 8th International Conference Discrete Geometry for Computer Imagery (DGCI'99), volume 1568 of Lecture Notes in Computer Science, pages 104—117. Springer, March 1999. Marne la Vallée, France.
[9] Sébastien Fourey and Rémy Malgouyres. A digital linking number for discrete curves. In Proceedings of the 7th International Workshop on Combinatorial Image Analysis (IWCIA'00), pages 59—77. Université de Caen, July 2000.
[10] Sébastien Fourey and Rémy Malgouyres. A concise characterization of 3d simple points. In Proceedings of the 9th International Conference Discrete Geometry for Computer Imagery (DGCI'00), volume 1953 of Lecture notes in Computer Sciences, pages 27—36, Uppsala, Sweden, 2000. Springer.
[11] Sébastien Fourey, T. Yung Kong, and Gabor T. Herman. Generic axiomatized digital surface-structures. volume 46 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, August 2001. [doi]
[12] Sébastien Fourey. Simple points and generic axiomatized digital surface-structures. In Proceedings of the 10th International Workshop on Combinatorial Image Analysis (IWCIA 2004), volume 3322 of Lecture notes in Computer Sciences, pages 307—317, Auckland, New Zealand, 2004. Springer.
[13] Sébastien Fourey and Rémy Malgouyres. Normals and curvature estimation for digital surfaces based on convolutions. In Discrete Geometry for Computer Imagery (DGCI 2008), volume 4992 of Lecture notes in Computer Sciences, pages 287—298, Lyon, France, 2008. Springer.
[14] Rémy Malgouyres, Florent Brunet, and Sébastien Fourey. Binomial convolutions and derivatives estimation from noisy discretizations. In Discrete Geometry for Computer Imagery (DGCI 2008), volume 4992 of Lecture notes in Computer Sciences, pages 370—379, Lyon, France, 2008. Springer.
[15] Sébastien Fourey and Luc Brun. A first step toward combinatorial pyramids in n-D spaces. In Graph-based Representations in Pattern Recognition, volume 5534 of Lecture notes in Computer Sciences, pages 304—313, Venice, Italy, 2009. Springer.
[16] Sébastien Fourey and Luc Brun. Connecting walks and connecting dart sequences for n-D combinatorial pyramids. In Progress in Combinatorial Image Analysis, Proceedings of the 13th International Workshop on Combinatorial Image Analysis (IWCIA'09), pages 109—122, Cancun, Mexico, 2009. Research Publishing Services.
[17] Sébastien Fourey et Luc Brun. Efficient encoding of n-D combinatorial pyramids. In Proceedings of the 20th International Conference on Pattern Recognition (ICPR'2010), pages 1036—1039, Istanbul, Turkey, 2010.

Proceedings of French conferences

[18] Sébastien Fourey, David Tschumperlé, and David Revoy. Un algorithme semi-guidé performant de colorisation en aplats pour le dessin au trait. In GRETSI 2017, September 2017, Juan-les-pins, France

Technical reports

[19] Sébastien Fourey and Rémy Malgouyres. Convolutions on digital surfaces: on the way iterated convolutions behave and preliminary results about curvature estimation. Cahiers du GREYC, GREYC-TR-2008-02, Nov. 2008. [hal-00338662].
[20] Sébastien Fourey and Luc Brun. A first step toward combinatorial pyramids in nD spaces. Cahiers du GREYC, GREYC-TR-2009-01, Jan. 2009. [hal-00353932].
[21] Sébastien Fourey et Luc Brun. Connecting walks and connecting dart sequences for n-D combinatorial pyramids. Cahiers du GREYC, GREYC-TR-2009-02, July 2009. [hal-00408202].
[22] Luc Brun, Benoit Gaüzère et Sébastien Fourey. Relationships between graph edit distance and maximal common unlabeled subgraph, 2012. [hal-00714879].
[23] Sébastien Fourey, David Tschumperlé, and David Revoy. Un algorithme semi-guidé performant de colorisation en aplats pour le dessin au trait, 2017. [hal-01490269v2]

Others

[24] Sébastien Fourey. Homotopie, surfaces discrètes et squelettisation dans Z^3 (Homotopy, digital surfaces and thinning in Z^3). Master degree thesis, Université de Caen.

Ph.D. thesis dissertation

Ph.D. dissertation

  • Title: Nombre d'intersection et d'entrelacement de courbes discrètes et application à la caractérisation de la préservation de la topologie en imagerie. (Intersection and linking numbers of digital curves and their application to the characterization of topology preservation in computer imagery.)

  • Achieved in the Image team of the GREYC research lab.

  • Manuscript (in French)

  • Manuscript (in English)