06.02.2013 Views

Abstract book (pdf) - ICPR 2010

Abstract book (pdf) - ICPR 2010

Abstract book (pdf) - ICPR 2010

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

09:00-11:10, Paper TuAT9.58<br />

Profile Lip Reading for Vowel and Word Recognition<br />

Saitoh, Takeshi, Kyushu Inst. of Tech.<br />

Konishi, Ryosuke, Tottori Univ.<br />

This paper focuses on the profile view, which is the second most typical angle after the frontal face, and proposes a profile<br />

view lip reading method. We applied the normalized cost method to detect profile contour. Five feature points, the tip of the<br />

nose, upper lip, lip corner, lower lip, and chin, were detected from the contour, and eight features obtained from the five<br />

feature points were defined. We gathered two types of utterance scenes, five Japanese vowels and 20 Japanese words. We<br />

selected 20 combinations based on the eight features and carried out recognition experiments. Recognition rates of 99% for<br />

vowel recognition and 86% for word recognition were obtained with five features: two lip heights, two protrusion lengths,<br />

and one lip angle.<br />

11:10-12:10, TuPL1 Anadolu Auditorium<br />

Computational Cameras: Redefining the Image<br />

Shree Nayar Plenary Session<br />

Columbia University, USA<br />

Shree K. Nayar received his PhD degree in Electrical and Computer Engineering from the Robotics Institute at Carnegie<br />

Mellon University in 1990. He is currently the T. C. Chang Professor of Computer Science at Columbia University. He<br />

co-directs the Columbia Vision and Graphics Center. He also heads the Columbia Computer Vision Laboratory (CAVE),<br />

which is dedicated to the development of advanced computer vision systems. His research is focused on three areas; the<br />

creation of novel cameras, the design of physics based models for vision, and the development of algorithms for scene<br />

understanding. His work is motivated by applications in the fields of digital imaging, computer graphics, and robotics.<br />

He has received best paper awards at ICCV 1990, <strong>ICPR</strong> 1994, CVPR 1994, ICCV 1995, CVPR 2000 and CVPR 2004.<br />

He is the recipient of the David Marr Prize (1990 and 1995), the David and Lucile Packard Fellowship (1992), the National<br />

Young Investigator Award (1993), the NTT Distinguished Scientific Achievement Award (1994), the Keck Foundation<br />

Award for Excellence in Teaching (1995) and the Columbia Great Teacher Award (2006). In February 2008, he was elected<br />

to the National Academy of Engineering.<br />

The computational camera embodies the convergence of the camera and the computer. It uses new optics to select rays<br />

from the scene in unusual ways, and an appropriate algorithm to process the selected rays. This as eline to manipulate<br />

images before they are recorded and process the recorded images before they are presented is a powerful one. It enables<br />

us to experience our visual world in rich and compelling ways.<br />

TuBT1 Anadolu Auditorium<br />

Image Analysis – IV Regular Session<br />

Session chair: Hlavac, Vaclav (Czech Technical Univ.)<br />

13:30-13:50, Paper TuBT1.1<br />

Joint Image GMM and Shading MAP Estimation<br />

Shekhovtsov, Alexander, Czech Tech. Univ. in Prague<br />

Hlavac, Vaclav, Czech Tech. Univ.<br />

We consider a simple statistical model of the image, in which the image is represented as a sum of two parts: one part is<br />

explained by an i.i.d. color Gaussian mixture and the other part by a (piecewise) smooth gray scale shading function. The<br />

smoothness is ensured by a quadratic (Tikhonov) or total variation regularization. We derive an EM algorithm to estimate<br />

simultaneously the parameters of the mixture model and the shading. Our algorithms for both kinds of the regularization<br />

solve for shading and mean parameters of the mixture model jointly.<br />

13:50-14:10, Paper TuBT1.2<br />

Continuous Markov Random Field Optimization using Fusion Move Driven Markov Chain Monte Carlo Technique<br />

Kim, Wonsik, Seoul National Univ.<br />

Lee, Kyoung Mu, Seoul National Univ.<br />

Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are<br />

discrete labeling problems, continuous formulation often achieves great improvement on the qualities of the solutions in<br />

- 110 -

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!