Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rémy Malgouyres

dblp:m/RemyMalgouyres · DBLP profile ↗
← Back
26ranked-venue papers
11as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 5 first-authorArtificial intelligence and machine learning · 9 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 7 · 1 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 50% Geometric modeling and processing · 50%
Artificial intelligence
1 paper
3D vision · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › point cloud registration › correspondence-based registration
feature-based registration
0.112011
Feature-Driven Direct Non-Rigid Image Registration · Int. J. Comput. Vis. 2011
Image and video processing
image registration
0.112011
Feature-Driven Direct Non-Rigid Image Registration · Int. J. Comput. Vis. 2011
Geometric modeling and processing › registration
non-rigid registration
0.112011
Feature-Driven Direct Non-Rigid Image Registration · Int. J. Comput. Vis. 2011

Methods — techniques the papers use, named apart from their topics

feature-driven registration · 0.2
YearPublicationVenuePosition
2016 Sparse convolution-based digital derivatives, fast estimation for noisy signals and approximation results
Henri-Alex Esbelin, Rémy Malgouyres
Theor. Comput. Sci.2
2012 Fast Level-Wise Convolution
Damien Gonzalez, Rémy Malgouyres, Henri-Alex Esbelin, Chafik Samir
IWCIA2
2011 A Simple and Flexible Mesh Parameterization Method
Colin Cartade, Rémy Malgouyres, Christian Mercat, Chafik Samir
IWCIA2
2011 Feature-Driven Direct Non-Rigid Image Registration
Florent Brunet, Vincent Gay-Bellile, Adrien Bartoli, Nassir Navab, Rémy Malgouyres
Int. J. Comput. Vis.5
2011 Convergence of binomial-based derivative estimation for C2 noisy discretized curves
Henri-Alex Esbelin, Rémy Malgouyres, Colin Cartade
Theor. Comput. Sci.2
2010 Monocular Template-Based Reconstruction of Smooth and Inextensible Surfaces
Florent Brunet, Richard I. Hartley, Adrien Bartoli, Nassir Navab, Rémy Malgouyres
ACCV (3)5
2009 NURBS Warps
Florent Brunet, Adrien Bartoli, Nassir Navab, Rémy Malgouyres
BMVC4
2009 Normals estimation for digital surfaces based on convolutions
Sébastien Fourey, Rémy Malgouyres
Comput. Graph.2
2006 Parallelization of a Discrete Radiosity Method
Rita Zrour, Pierre Y. Chatelier, Fabien Feschet, Rémy Malgouyres
Euro-Par4
2006 A low-complexity discrete radiosity method
Pierre Y. Chatelier, Rémy Malgouyres
Comput. Graph.2
2003 Strong thinning and polyhedric approximation of the surface of a voxel object
Jasmine Burguet, Rémy Malgouyres
Discret. Appl. Math.2
2003 A concise characterization of 3D simple points
Sébastien Fourey, Rémy Malgouyres
Discret. Appl. Math.2
2002 Discrete Geometry for Computer Imagery - Preface
Gilles Bertrand 0001, Rémy Malgouyres
Theor. Comput. Sci.2
2002 Intersection number and topology preservation within digital surfaces
Sébastien Fourey, Rémy Malgouyres
Theor. Comput. Sci.2
2002 On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
Rémy Malgouyres, Malika More
Theor. Comput. Sci.1
2001 A Digital Linking Number for Discrete Curves
abstract
A topological invariant, analogous to the linking number as defined in knot theory, is defined for pairs of digital closed paths of ℤ3. This kind of invariant is very useful for proofs which involve homotopy classes of digital paths. Indeed, it can be used, for example, in order to state the connection between the tunnels in an object and the ones in its complement. Even if its definition is not as immediate as in the continuous case it has the good property that it is immediately computable from the coordinates of the voxels of the paths with no need of a regular projection. The aim of this paper is to state and prove that the linking number has the same property as its continuous analogue: it is invariant under any homotopic deformation of one of the two paths in the complement of the other.
Sébastien Fourey, Rémy Malgouyres
Int. J. Pattern Recognit. Artif. Intell.2
2001 Editorial: Combinatorial Image Analysis
Rémy Malgouyres
Int. J. Pattern Recognit. Artif. Intell.1
2001 Computing the Fundamental Group in Digital Spaces
abstract
As its analogue in the continuous framework, the digital fundamental group represents major information on the topology of discrete objects. However, the fundamental group is abstract information and cannot directly be encoded in a computer by only using its definition. A classical mathematical way to encode a discrete group is to find a presentation of this group. In this paper, we construct a presentation for the fundamental group of an arbitrary graph, and a finite presentation (hence encodable in the memory of a computer) of any subset of ℤ3. This presentation can be computed by an efficient algorithm.
Rémy Malgouyres
Int. J. Pattern Recognit. Artif. Intell.1
2000 Topology Preservation Within Digital Surfaces
Rémy Malgouyres, Alexandre Lenoir
Graph. Model.1
2000 Homotopy in Two-Dimensional Digital Images
Rémy Malgouyres
Theor. Comput. Sci.1
1999 Complete Local Characterization of Strong 26-Surfaces: Continuous Analogs for Strong 26-Surfaces
abstract
In Ref. 6, two similar characterizations of discrete surfaces of ℤ3 are proposed which are called strong 18-surfaces and strong 26-surfaces. The proposed characterizations consist in some natural global properties of surfaces. In this paper, we first give local necessary conditions for an object to be a strong 26-surface. An object satisfying these local properties is called a near strong 26-surface. Then we construct continuous analogs for near strong 26-surfaces and, using the continuous Jordan Theorem, we prove that the necessary local conditions previously introduced in fact give a complete local characterization of strong 26-surfaces: the class of near strong 26-surfaces coincides with the class of strong 26-surfaces.
Rémy Malgouyres, Gilles Bertrand 0001
Int. J. Pattern Recognit. Artif. Intell.1
1999 A new local property of strong n-surfaces
Rémy Malgouyres, Gilles Bertrand 0001
Pattern Recognit. Lett.1
1998 Local characterization of strong surfaces within strongly separating objects
Rémy Malgouyres
Pattern Recognit. Lett.1
1997 A Definition of Surfaces of Z: A new 3D Discrete Jordan Theorem
Rémy Malgouyres
Theor. Comput. Sci.1
1996 There is no Local Characterization of Separating and Thin Objects in Z³
Rémy Malgouyres
Theor. Comput. Sci.1
1995 Graphs Generalizing Closed Curves with Linear Construction of the Hamiltonian Cycle - Parametrization of Discretized Curves
Rémy Malgouyres
Theor. Comput. Sci.1