liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Model-based head tracking and coding
Linköping University, Department of Electrical Engineering. Linköping University, The Institute of Technology.
2002 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

This thesis treats two topics in model-based coding; coding of facial textures (Part 1) and real-time head tracking (Part 2).

In Part 1, it is shown that a face image can be efficiently coded using a parameterization based on geometrical normalization followed by Karhunen-Loeve transformation (KLT). The resulting parameterization is shown to be convex, and can be used for coding: It improves both the measured and perceived quality of face images compared to only using eye matching normalization followed by KLT. A block based version of the coder improves the performance dramatically both in terms of quality and complexity. By distributing the bits unevenly over the face, quality can be further improved. Comparisons with JPEG show an improvement of 8 dB.

In Part 2, a real-time head tracker that is robust to large rotations is described. The system uses a large number of automatically selected feature points, constrained by dynamically estimated structure. The structure from motion (SfM) algorithm described by Azarbayejani and Pentland in 1995 is used. The algorithm is first examined for planar objects, and then extended to manage points not visible in the first frame. The extended SfM method is the basis for the head tracker: A texture mapped three-dimensional head model is created, and 24 feature points on the surface of this model are automatically selected and tracked. The trajectories of the tracked feature points are forwarded to the SfM algorithm, which in turn provides estimates of the location of the feature points in the next frame. By adaptively updating the texture, the extended SfM algorithm can be used to track points on, e.g., the side of the head, which improves the range of the tracker. A reinitialization procedure that uses data from the original initialization is also presented. The complete system runs at full frame rate (25/30 Hz) and is evaluated on both real and synthetic data.

Place, publisher, year, edition, pages
Linköping: Linköpings universitet , 2002. , p. 160
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 733
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-143545ISBN: 9173732605 (print)OAI: oai:DiVA.org:liu-143545DiVA: diva2:1164806
Public defence
2002-02-14, Visionen, hus B, Campus Valla, Linköping, 13:15 (English)
Opponent
Available from: 2017-12-12 Created: 2017-12-12 Last updated: 2018-01-09Bibliographically approved

Open Access in DiVA

No full text in DiVA

By organisation
Department of Electrical EngineeringThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 4 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf