Jump to ContentJump to Main Navigation
Pattern TheoryFrom representation to inference$
Users without a subscription are not able to see the full content.

Ulf Grenander and Michael I. Miller

Print publication date: 2006

Print ISBN-13: 9780198505709

Published to Oxford Scholarship Online: November 2020

DOI: 10.1093/oso/9780198505709.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2022. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use.date: 06 July 2022

Estimation On Metric Spaces With Photometric Variation

Estimation On Metric Spaces With Photometric Variation

Chapter:
(p.414) 14 Estimation On Metric Spaces With Photometric Variation
Source:
Pattern Theory
Author(s):

Ulf Grenander

Michael I. Miller

Publisher:
Oxford University Press
DOI:10.1093/oso/9780198505709.003.0015

Model uncertainty comes in many forms. In this chapterweshall examine extensively the variable photometric model in which the underlying image field I(·) is modelled as an element of a Hilbert space I(·) ∈ H(φ) constructed via basis expansion {φi }. Inference involves both the pose and identity of the objects as well as the photometric intensity itself. This corresponds to making the template random, expanding the deformable template to include both the photometric variations and geometric variations.

Keywords:   Blahut algorithm, Hilbert-Schmidt distortion, codebook construction, openGL software, perspective projection, rate-distortion theory, source-channel view

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .