| |
Records |
Links |
|
Author |
Manuel Graña; Bogdan Raducanu |
|
| |
Title |
Special Issue on Bioinspired and knowledge based techniques and applications |
Type |
Journal Article |
| |
Year |
2015 |
Publication  |
Neurocomputing |
Abbreviated Journal |
NEUCOM |
|
| |
Volume |
|
Issue |
|
Pages |
1-3 |
|
| |
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 |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
LAMP; |
Approved |
no |
|
| |
Call Number |
Admin @ si @ GrR2015 |
Serial |
2598 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Juan Ramon Terven Salinas; Bogdan Raducanu; Maria Elena Meza-de-Luna; Joaquin Salas |
|
| |
Title |
Head-gestures mirroring detection in dyadic social linteractions with computer vision-based wearable devices |
Type |
Journal Article |
| |
Year |
2016 |
Publication |
Neurocomputing |
Abbreviated Journal |
NEUCOM |
|
| |
Volume |
175 |
Issue |
B |
Pages |
866–876 |
|
| |
Keywords |
Head gestures recognition; Mirroring detection; Dyadic social interaction analysis; Wearable devices |
|
| |
Abstract |
During face-to-face human interaction, nonverbal communication plays a fundamental role. A relevant aspect that takes part during social interactions is represented by mirroring, in which a person tends to mimic the non-verbal behavior (head and body gestures, vocal prosody, etc.) of the counterpart. In this paper, we introduce a computer vision-based system to detect mirroring in dyadic social interactions with the use of a wearable platform. In our context, mirroring is inferred as simultaneous head noddings displayed by the interlocutors. Our approach consists of the following steps: (1) facial features extraction; (2) facial features stabilization; (3) head nodding recognition; and (4) mirroring detection. Our system achieves a mirroring detection accuracy of 72% on a custom mirroring dataset. |
|
| |
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 |
LAMP; 600.072; 600.068; |
Approved |
no |
|
| |
Call Number |
Admin @ si @ TRM2016 |
Serial |
2721 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Bogdan Raducanu; Fadi Dornaika |
|
| |
Title |
Embedding new observations via sparse-coding for non-linear manifold learning |
Type |
Journal Article |
| |
Year |
2014 |
Publication |
Pattern Recognition |
Abbreviated Journal |
PR |
|
| |
Volume |
47 |
Issue |
1 |
Pages |
480-492 |
|
| |
Keywords |
|
|
| |
Abstract |
Non-linear dimensionality reduction techniques are affected by two critical aspects: (i) the design of the adjacency graphs, and (ii) the embedding of new test data-the out-of-sample problem. For the first aspect, the proposed solutions, in general, were heuristically driven. For the second aspect, the difficulty resides in finding an accurate mapping that transfers unseen data samples into an existing manifold. Past works addressing these two aspects were heavily parametric in the sense that the optimal performance is only achieved for a suitable parameter choice that should be known in advance. In this paper, we demonstrate that the sparse representation theory not only serves for automatic graph construction as shown in recent works, but also represents an accurate alternative for out-of-sample embedding. Considering for a case study the Laplacian Eigenmaps, we applied our method to the face recognition problem. To evaluate the effectiveness of the proposed out-of-sample embedding, experiments are conducted using the K-nearest neighbor (KNN) and Kernel Support Vector Machines (KSVM) classifiers on six public face datasets. The experimental results show that the proposed model is able to achieve high categorization effectiveness as well as high consistency with non-linear embeddings/manifolds obtained in batch modes. |
|
| |
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 |
LAMP; |
Approved |
no |
|
| |
Call Number |
Admin @ si @ RaD2013b |
Serial |
2316 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Juan Ramon Terven Salinas; Joaquin Salas; Bogdan Raducanu |
|
| |
Title |
Robust Head Gestures Recognition for Assistive Technology |
Type |
Book Chapter |
| |
Year |
2014 |
Publication |
Pattern Recognition |
Abbreviated Journal |
|
|
| |
Volume |
8495 |
Issue |
|
Pages |
152-161 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper presents a system capable of recognizing six head gestures: nodding, shaking, turning right, turning left, looking up, and looking down. The main difference of our system compared to other methods is that the Hidden Markov Models presented in this paper, are fully connected and consider all possible states in any given order, providing the following advantages to the system: (1) allows unconstrained movement of the head and (2) it can be easily integrated into a wearable device (e.g. glasses, neck-hung devices), in which case it can robustly recognize gestures in the presence of ego-motion. Experimental results show that this approach outperforms common methods that use restricted HMMs for each gesture. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer International Publishing |
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
0302-9743 |
ISBN |
978-3-319-07490-0 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
LAMP; |
Approved |
no |
|
| |
Call Number |
Admin @ si @ TSR2014b |
Serial |
2505 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Carola Figueroa Flores; Abel Gonzalez-Garcia; Joost Van de Weijer; Bogdan Raducanu |
|
| |
Title |
Saliency for fine-grained object recognition in domains with scarce training data |
Type |
Journal Article |
| |
Year |
2019 |
Publication |
Pattern Recognition |
Abbreviated Journal |
PR |
|
| |
Volume |
94 |
Issue |
|
Pages |
62-73 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper investigates the role of saliency to improve the classification accuracy of a Convolutional Neural Network (CNN) for the case when scarce training data is available. Our approach consists in adding a saliency branch to an existing CNN architecture which is used to modulate the standard bottom-up visual features from the original image input, acting as an attentional mechanism that guides the feature extraction process. The main aim of the proposed approach is to enable the effective training of a fine-grained recognition model with limited training samples and to improve the performance on the task, thereby alleviating the need to annotate a large dataset. The vast majority of saliency methods are evaluated on their ability to generate saliency maps, and not on their functionality in a complete vision pipeline. Our proposed pipeline allows to evaluate saliency methods for the high-level task of object recognition. We perform extensive experiments on various fine-grained datasets (Flowers, Birds, Cars, and Dogs) under different conditions and show that saliency can considerably improve the network’s performance, especially for the case of scarce training data. Furthermore, our experiments show that saliency methods that obtain improved saliency maps (as measured by traditional saliency benchmarks) also translate to saliency methods that yield improved performance gains when applied in an object recognition pipeline. |
|
| |
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 |
LAMP; 600.109; 600.141; 600.120 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ FGW2019 |
Serial |
3264 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Xim Cerda-Company; C. Alejandro Parraga; Xavier Otazu |
|
| |
Title |
Which tone-mapping is the best? A comparative study of tone-mapping perceived quality |
Type |
Abstract |
| |
Year |
2014 |
Publication |
Perception |
Abbreviated Journal |
|
|
| |
Volume |
43 |
Issue |
|
Pages |
106 |
|
| |
Keywords |
|
|
| |
Abstract |
Perception 43 ECVP Abstract Supplement
High-dynamic-range (HDR) imaging refers to the methods designed to increase the brightness dynamic range present in standard digital imaging techniques. This increase is achieved by taking the same picture under di erent exposure values and mapping the intensity levels into a single image by way of a tone-mapping operator (TMO). Currently, there is no agreement on how to evaluate the quality
of di erent TMOs. In this work we psychophysically evaluate 15 di erent TMOs obtaining rankings based on the perceived properties of the resulting tone-mapped images. We performed two di erent experiments on a CRT calibrated display using 10 subjects: (1) a study of the internal relationships between grey-levels and (2) a pairwise comparison of the resulting 15 tone-mapped images. In (1) observers internally matched the grey-levels to a reference inside the tone-mapped images and in the real scene. In (2) observers performed a pairwise comparison of the tone-mapped images alongside the real scene. We obtained two rankings of the TMOs according their performance. In (1) the best algorithm
was ICAM by J.Kuang et al (2007) and in (2) the best algorithm was a TMO by Krawczyk et al (2005). Our results also show no correlation between these two rankings. |
|
| |
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 |
ECVP |
|
| |
Notes |
NEUROBIT; 600.074 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ CPO2014 |
Serial |
2527 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Chenshen Wu; Joost Van de Weijer |
|
| |
Title |
Density Map Distillation for Incremental Object Counting |
Type |
Conference Article |
| |
Year |
2023 |
Publication |
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
2505-2514 |
|
| |
Keywords |
|
|
| |
Abstract |
We investigate the problem of incremental learning for object counting, where a method must learn to count a variety of object classes from a sequence of datasets. A naïve approach to incremental object counting would suffer from catastrophic forgetting, where it would suffer from a dramatic performance drop on previous tasks. In this paper, we propose a new exemplar-free functional regularization method, called Density Map Distillation (DMD). During training, we introduce a new counter head for each task and introduce a distillation loss to prevent forgetting of previous tasks. Additionally, we introduce a cross-task adaptor that projects the features of the current backbone to the previous backbone. This projector allows for the learning of new features while the backbone retains the relevant features for previous tasks. Finally, we set up experiments of incremental learning for counting new objects. Results confirm that our method greatly reduces catastrophic forgetting and outperforms existing methods. |
|
| |
Address |
Vancouver; Canada; June 2023 |
|
| |
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 |
CVPRW |
|
| |
Notes |
LAMP |
Approved |
no |
|
| |
Call Number |
Admin @ si @ WuW2023 |
Serial |
3916 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Hao Fang; Ajian Liu; Jun Wan; Sergio Escalera; Hugo Jair Escalante; Zhen Lei |
|
| |
Title |
Surveillance Face Presentation Attack Detection Challenge |
Type |
Conference Article |
| |
Year |
2023 |
Publication |
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
6360-6370 |
|
| |
Keywords |
|
|
| |
Abstract |
Face Anti-spoofing (FAS) is essential to secure face recognition systems from various physical attacks. However, most of the studies lacked consideration of long-distance scenarios. Specifically, compared with FAS in traditional scenes such as phone unlocking, face payment, and self-service security inspection, FAS in long-distance such as station squares, parks, and self-service supermarkets are equally important, but it has not been sufficiently explored yet. In order to fill this gap in the FAS community, we collect a large-scale Surveillance High-Fidelity Mask (SuHiFiMask). SuHiFiMask contains 10,195 videos from 101 subjects of different age groups, which are collected by 7 mainstream surveillance cameras. Based on this dataset and protocol-3 for evaluating the robustness of the algorithm under quality changes, we organized a face presentation attack detection challenge in surveillance scenarios. It attracted 180 teams for the development phase with a total of 37 teams qualifying for the final round. The organization team re-verified and re-ran the submitted code and used the results as the final ranking. In this paper, we present an overview of the challenge, including an introduction to the dataset used, the definition of the protocol, the evaluation metrics, and the announcement of the competition results. Finally, we present the top-ranked algorithms and the research ideas provided by the competition for attack detection in long-range surveillance scenarios. |
|
| |
Address |
Vancouver; Canada; June 2023 |
|
| |
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 |
CVPRW |
|
| |
Notes |
HuPBA |
Approved |
no |
|
| |
Call Number |
Admin @ si @ FLW2023 |
Serial |
3917 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Xavier Otazu; Olivier Penacchio; Xim Cerda-Company |
|
| |
Title |
Brightness and colour induction through contextual influences in V1 |
Type |
Conference Article |
| |
Year |
2015 |
Publication |
Scottish Vision Group 2015 SGV2015 |
Abbreviated Journal |
|
|
| |
Volume |
12 |
Issue |
9 |
Pages |
1208-2012 |
|
| |
Keywords |
|
|
| |
Abstract |
|
|
| |
Address |
Carnoustie; Scotland; March 2015 |
|
| |
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 |
SGV |
|
| |
Notes |
NEUROBIT; |
Approved |
no |
|
| |
Call Number |
Admin @ si @ OPC2015a |
Serial |
2632 |
|
| Permanent link to this record |
