Henri Sanson

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Patrick Lechat

> Home > Persons > Henri Sanson

Publications

1998
[c9]
- view
  - electronic edition @ ieee.org
  - no references & citations available
- export record
  dblp key:
  - conf/eusipco/LechatRS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eusipco/LechatRS98
Patrick Lechat, Michaël Ropert, Henri Sanson:
Hierarchical mesh-based motion estimation using a differential approach and application to video coding. EUSIPCO 1998: 1-4
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/icip/LaurentLS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icip/LaurentLS98
Nathalie Laurent, Patrick Lechat, Henri Sanson:
Limitation of Triangles Overlapping in Mesh-based Motion Estimation using Augmented Lagrangian. ICIP (2) 1998: 223-227
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/icip/LechatS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icip/LechatS98
Patrick Lechat, Henri Sanson:
Combined Mesh based Image Representation and Motion Estimation Application to Video Coding. ICIP (2) 1998: 909-913
1997
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/icip/LechatSL97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icip/LechatSL97
Patrick Lechat, Henri Sanson, Lilian Labelle:
Image Approximation by Minimization of a Geometric Distance Applied to a 3D Finite Elements Based Model. ICIP (2) 1997: 724-727

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.