| |
Records |
Links |
|
Author |
Laura Igual; Xavier Perez Sala; Sergio Escalera; Cecilio Angulo; Fernando De la Torre |
|
| |
Title |
Continuous Generalized Procrustes Analysis |
Type |
Journal Article |
| |
Year  |
2014 |
Publication |
Pattern Recognition |
Abbreviated Journal |
PR |
|
| |
Volume |
47 |
Issue |
2 |
Pages |
659–671 |
|
| |
Keywords |
Procrustes analysis; 2D shape model; Continuous approach |
|
| |
Abstract |
PR4883, PII: S0031-3203(13)00327-0
Two-dimensional shape models have been successfully applied to solve many problems in computer vision, such as object tracking, recognition, and segmentation. Typically, 2D shape models are learned from a discrete set of image landmarks (corresponding to projection of 3D points of an object), after applying Generalized Procustes Analysis (GPA) to remove 2D rigid transformations. However, the
standard GPA process suffers from three main limitations. Firstly, the 2D training samples do not necessarily cover a uniform sampling of all the 3D transformations of an object. This can bias the estimate of the shape model. Secondly, it can be computationally expensive to learn the shape model by sampling 3D transformations. Thirdly, standard GPA methods use only one reference shape, which can might be insufficient to capture large structural variability of some objects.
To address these drawbacks, this paper proposes continuous generalized Procrustes analysis (CGPA).
CGPA uses a continuous formulation that avoids the need to generate 2D projections from all the rigid 3D transformations. It builds an efficient (in space and time) non-biased 2D shape model from a set of 3D model of objects. A major challenge in CGPA is the need to integrate over the space of 3D rotations, especially when the rotations are parameterized with Euler angles. To address this problem, we introduce the use of the Haar measure. Finally, we extended CGPA to incorporate several reference shapes. Experimental results on synthetic and real experiments show the benefits of CGPA over GPA. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
OR; HuPBA; 605.203; 600.046;MILAB |
Approved |
no |
|
| |
Call Number |
Admin @ si @ IPE2014 |
Serial |
2352 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
David Masip; Michael S. North ; Alexander Todorov; Daniel N. Osherson |
|
| |
Title |
Automated Prediction of Preferences Using Facial Expressions |
Type |
Journal Article |
| |
Year |
2014 |
Publication |
PloS one |
Abbreviated Journal |
Plos |
|
| |
Volume |
9 |
Issue |
2 |
Pages |
e87434 |
|
| |
Keywords |
|
|
| |
Abstract |
We introduce a computer vision problem from social cognition, namely, the automated detection of attitudes from a person's spontaneous facial expressions. To illustrate the challenges, we introduce two simple algorithms designed to predict observers’ preferences between images (e.g., of celebrities) based on covert videos of the observers’ faces. The two algorithms are almost as accurate as human judges performing the same task but nonetheless far from perfect. Our approach is to locate facial landmarks, then predict preference on the basis of their temporal dynamics. The database contains 768 videos involving four different kinds of preferences. We make it publically available. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
OR;MV |
Approved |
no |
|
| |
Call Number |
Admin @ si @ MNT2014 |
Serial |
2453 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
R. Clariso; David Masip; A. Rius |
|
| |
Title |
Student projects empowering mobile learning in higher education |
Type |
Journal |
| |
Year |
2014 |
Publication |
Revista de Universidad y Sociedad del Conocimiento |
Abbreviated Journal |
RUSC |
|
| |
Volume |
11 |
Issue |
|
Pages |
192-207 |
|
| |
Keywords |
|
|
| |
Abstract |
|
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
1698-580X |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
OR;MV |
Approved |
no |
|
| |
Call Number |
Admin @ si @ CMR2014 |
Serial |
2619 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Santiago Segui; Laura Igual; Jordi Vitria |
|
| |
Title |
Bagged One Class Classifiers in the Presence of Outliers |
Type |
Journal Article |
| |
Year |
2013 |
Publication |
International Journal of Pattern Recognition and Artificial Intelligence |
Abbreviated Journal |
IJPRAI |
|
| |
Volume |
27 |
Issue |
5 |
Pages |
1350014-1350035 |
|
| |
Keywords |
One-class Classifier; Ensemble Methods; Bagging and Outliers |
|
| |
Abstract |
The problem of training classifiers only with target data arises in many applications where non-target data are too costly, difficult to obtain, or not available at all. Several one-class classification methods have been presented to solve this problem, but most of the methods are highly sensitive to the presence of outliers in the target class. Ensemble methods have therefore been proposed as a powerful way to improve the classification performance of binary/multi-class learning algorithms by introducing diversity into classifiers.
However, their application to one-class classification has been rather limited. In
this paper, we present a new ensemble method based on a non-parametric weighted bagging strategy for one-class classification, to improve accuracy in the presence of outliers. While the standard bagging strategy assumes a uniform data distribution, the method we propose here estimates a probability density based on a forest structure of the data. This assumption allows the estimation of data distribution from the computation of simple univariate and bivariate kernel densities. Experiments using original and noisy versions of 20 different datasets show that bagging ensemble methods applied to different one-class classifiers outperform base one-class classification methods. Moreover, we show that, in noisy versions of the datasets, the non-parametric weighted bagging strategy we propose outperforms the classical bagging strategy in a statistically significant way. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
OR; 600.046;MV |
Approved |
no |
|
| |
Call Number |
Admin @ si @ SIV2013 |
Serial |
2256 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Bogdan Raducanu; Fadi Dornaika |
|
| |
Title |
Texture-independent recognition of facial expressions in image snapshots and videos |
Type |
Journal Article |
| |
Year |
2013 |
Publication |
Machine Vision and Applications |
Abbreviated Journal |
MVA |
|
| |
Volume |
24 |
Issue |
4 |
Pages |
811-820 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper addresses the static and dynamic recognition of basic facial expressions. It has two main contributions. First, we introduce a view- and texture-independent scheme that exploits facial action parameters estimated by an appearance-based 3D face tracker. We represent the learned facial actions associated with different facial expressions by time series. Second, we compare this dynamic scheme with a static one based on analyzing individual snapshots and show that the former performs better than the latter. We provide evaluations of performance using three subspace learning techniques: linear discriminant analysis, non-parametric discriminant analysis and support vector machines. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer-Verlag |
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
0932-8092 |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
OR; 600.046; 605.203;MV |
Approved |
no |
|
| |
Call Number |
Admin @ si @ RaD2013 |
Serial |
2230 |
|
| Permanent link to this record |
