Abstract book (pdf) - ICPR 2010
Abstract book (pdf) - ICPR 2010
Abstract book (pdf) - ICPR 2010
- TAGS
- abstract
- icpr
- icpr2010.org
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
cannot be convincingly synthesised using neither simple tiling nor using purely stochastic models. However these textures<br />
are ubiquitous in many man-made environments and also in some natural scenes. Thus they are required for their realistic<br />
appearance visualisation. The principle of the presented BTF-NR synthesis and editing method is to automatically separate<br />
periodic and random components from one or more input textures. Each of these components is subsequently independently<br />
modelled using its corresponding optimal method. The regular texture part is modelled using our roller method, while the<br />
random part is synthesised from its estimated exceptionally efficient Markov random field based representation. Both independently<br />
enlarged texture components from the original measured textures representing one (enlargement) or several<br />
(editing) materials are combined in the resulting synthetic near-regular texture.<br />
10:00-10:20, Paper WeAT3.4<br />
Detecting Vorticity in Optical Flows of Fluids<br />
Doshi, Ashish, Univ. of Surrey<br />
Bors, Adrian, Univ. of York<br />
In this paper we apply the diffusion framework to dense optical flow estimation. Local image information is represented<br />
by matrices of gradients between paired locations. Diffusion distances are modelled as sums of eigenvectors weighted by<br />
their eigenvalues extracted following the eigen decomposion of these matrices. Local optical flow is estimated by correlating<br />
diffusion distances characterizing features from different frames. A feature confidence factor is defined based on<br />
the local correlation efficiency when compared to that of its neighbourhood. High confidence optical flow estimates are<br />
propagated to areas of lower confidence.<br />
10:20-10:40, Paper WeAT3.5<br />
Modeling Facial Skin Motion Properties in Video and its Application to Matching Faces across Expressions<br />
Manohar, Vasant, Raytheon BBN Tech.<br />
Shreve, Matthew, Univ. of South Florida<br />
Goldgof, Dmitry, Univ. of South Florida<br />
Sarkar, Sudeep, Univ. of South Florida<br />
In this paper, we propose a method to model the material constants (Young’s modulus) of the skin in subregions of the<br />
face from the motion observed in multiple facial expressions and present its relevance to an image analysis task such as<br />
face verification. On a public database consisting of 40 subjects undergoing some set of facial motions associated with<br />
anger, disgust, fear, happy, sad, and surprise expressions, we present an expression invariant strategy to matching faces<br />
using the Young’s modulus of the skin. Results show that it is indeed possible to match faces across expressions using the<br />
material properties of their skin.<br />
WeAT4 Topkapı Hall A<br />
Kernel Methods Regular Session<br />
Session chair: Aksoy, Selim (Bilkent Univ.)<br />
09:00-09:20, Paper WeAT4.1<br />
AdaMKL: A Novel Biconvex Multiple Kernel Learning Approach<br />
Zhang, Ziming, Simon Fraser Univ.<br />
Li, Ze-Nian, Simon Fraser Univ.<br />
Drew, Mark S.<br />
In this paper, we propose a novel large-margin based approach for multiple kernel learning (MKL) using biconvex optimization,<br />
called Adaptive Multiple Kernel Learning (AdaMKL). To learn the weights for support vectors and the kernel<br />
coefficients, AdaMKL minimizes the objective function alternately by learning one component while fixing the other at a<br />
time, and in this way only one convex formulation needs to be solved. We also propose a family of biconvex objective<br />
functions with an arbitrary Lp-norm (p>=1) of kernel coefficients. As our experiments show, AdaMKL performs comparably<br />
with state-of-the-art convex optimization based MKL approaches, but its learning is much simpler and faster.<br />
- 162 -