Hugo Carneiro

Hugo Carneiro

Auto-generated profile, based on publicly available information

Hugo Carneiro

Department of Informatics, Knowledge Technology, Universität Hamburg, Hamburg, Germany

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2015 in Neural Networks
Verified
Journal Article
Closed access
HCHugo C.C. Carneiro
Hugo C.C. Carneiro
FFFelipe M.G. França
Felipe M.G. França
PLPRISCILA Machado Vieira LIMA
PRISCILA Machado Vieira LIMA

1 March 2016 in Neurocomputing
Verified
Journal Article
Closed access
DCDouglas O. Cardoso
Douglas O. Cardoso
DCDanilo S. Carvalho
Danilo S. Carvalho
DADaniel S.F. Alves
Daniel S.F. Alves
DSDiego F.P. Souza
Diego F.P. Souza
HCHugo C.C. Carneiro
Hugo C.C. Carneiro
FFFelipe M.G. França
Felipe M.G. França

2 April 2023 in International Journal of Social Robotics
Verified
Journal Article
Open access
PDF file
DFDi Fu
Di Fu
FAFares Abawi
Fares Abawi
HCHugo Carneiro
Hugo Carneiro
MKMatthias Kerzel
Matthias Kerzel
ZCZiwei Chen
Ziwei Chen
SWStefan Wermter
Stefan Wermter
To enhance human-robot social interaction, it is essential for robots to process multiple social cues in a complex real-world environment. However, incongruency of input information across modalities is inevitable and could be challenging for robots to process. To tackle this challenge, our study adopted the neurorobotic paradigm of crossmodal conflict resolution to make a robot express human-like social attention. A behavioural experiment was conducted on 37 participants for the human study. We designed a round-table meeting scenario with three animated avatars to improve ecological validity. Each avatar wore a medical mask to obscure the facial cues of the nose, mouth, and jaw. The central avatar shifted its eye gaze while the peripheral avatars generated sound. Gaze direction and sound locations were either spatially congruent or incongruent. We observed that the central avatar’s dynamic gaze could trigger crossmodal social attention responses. In particular, human performance was better under the congruent audio-visual condition than the incongruent condition. Our saliency prediction model was trained to detect social cues, predict audio-visual saliency, and attend selectively for the robot study. After mounting the trained model on the iCub, the robot was exposed to laboratory conditions similar to the human experiment. While the human performance was overall superior, our trained model demonstrated that it could replicate attention responses similar to humans.

1 January 2019 in Neural Computation
Verified
Journal Article
Closed access
HCHugo C. C. Carneiro
Hugo C. C. Carneiro
CPCarlos Eduardo Pedreira
Carlos Eduardo Pedreira
FFFelipe M. G. França
Felipe M. G. França
PLPRISCILA Machado Vieira LIMA
PRISCILA Machado Vieira LIMA
The Wilkie, Stoneham, and Aleksander recognition device (WiSARD) n -tuple classifier is a multiclass weightless neural network capable of learning a given pattern in a single step. Its architecture is determined by the number of classes it should discriminate. A target class is represented by a structure called a discriminator, which is composed of N RAM nodes, each of them addressed by an n -tuple. Previous studies were carried out in order to mitigate an important problem of the WiSARD n -tuple classifier: having its RAM nodes saturated when trained by a large data set. Finding the VC dimension of the WiSARD n -tuple classifier was one of those studies. Although no exact value was found, tight bounds were discovered. Later, the bleaching technique was proposed as a means to avoid saturation. Recent empirical results with the bleaching extension showed that the WiSARD n -tuple classifier can achieve high accuracies with low variance in a great range of tasks. Theoretical studies had not been conducted with that extension previously. This work presents the exact VC dimension of the basic two-class WiSARD n -tuple classifier, which is linearly proportional to the number of RAM nodes belonging to a discriminator, and exponentially to their addressing tuple length, precisely N(2n-1)+1 . The exact VC dimension of the bleaching extension to the WiSARD n -tuple classifier, whose value is the same as that of the basic model, is also produced. Such a result confirms that the bleaching technique is indeed an enhancement to the basic WiSARD n -tuple classifier as it does no harm to the generalization capability of the original paradigm. The Wilkie, Stoneham, and Aleksander recognition device (WiSARD) n -tuple classifier is a multiclass weightless neural network capable of learning a given pattern in a single step. Its architecture is determined by the number of classes it should discriminate. A target class is represented by a structure called a discriminator, which is composed of N RAM nodes, each of them addressed by an n -tuple. Previous studies were carried out in order to mitigate an important problem of the WiSARD n -tuple classifier: having its RAM nodes saturated when trained by a large data set. Finding the VC dimension of the WiSARD n -tuple classifier was one of those studies. Although no exact value was found, tight bounds were discovered. Later, the bleaching technique was proposed as a means to avoid saturation. Recent empirical results with the bleaching extension showed that the WiSARD n -tuple classifier can achieve high accuracies with low variance in a great range of tasks. Theoretical studies had not been conducted with that extension previously. This work presents the exact VC dimension of the basic two-class WiSARD n -tuple classifier, which is linearly proportional to the number of RAM nodes belonging to a discriminator, and exponentially to their addressing tuple length, precisely N(2n-1)+1 . The exact VC dimension of the bleaching extension to the WiSARD n -tuple classifier, whose value is the same as that of the basic model, is also produced. Such a result confirms that the bleaching technique is indeed an enhancement to the basic WiSARD n -tuple classifier as it does no harm to the generalization capability of the original paradigm. The Wilkie, Stoneham, and Aleksander recognition device (WiSARD) n -tuple classifier is a multiclass weightless neural network capable of learning a given pattern in a single step. Its architecture is determined by the number of classes it should discriminate. A target class is represented by a structure called a discriminator, which is composed of N RAM nodes, each of them addressed by an n -tuple. Previous studies were carried out in order to mitigate an important problem of the WiSARD n -tuple classifier: having its RAM nodes saturated when trained by a large data set. Finding the VC dimension of the WiSARD n -tuple classifier was one of those studies. Although no exact value was found, tight bounds were discovered. Later, the bleaching technique was proposed as a means to avoid saturation. Recent empirical results with the bleaching extension showed that the WiSARD n -tuple classifier can achieve high accuracies with low variance in a great range of tasks. Theoretical studies had not been conducted with that extension previously. This work presents the exact VC dimension of the basic two-class WiSARD n -tuple classifier, which is linearly proportional to the number of RAM nodes belonging to a discriminator, and exponentially to their addressing tuple length, precisely N(2n-1)+1 . The exact VC dimension of the bleaching extension to the WiSARD n -tuple classifier, whose value is the same as that of the basic model, is also produced. Such a result confirms that the bleaching technique is indeed an enhancement to the basic WiSARD n -tuple classifier as it does no harm to the generalization capability of the original paradigm.

1 July 2017 in Neural Networks
Verified
Journal Article
Closed access
HCHugo C.C. Carneiro
Hugo C.C. Carneiro
CPCarlos Eduardo Pedreira
Carlos Eduardo Pedreira
FFFelipe M.G. França
Felipe M.G. França
PLPRISCILA Machado Vieira LIMA
PRISCILA Machado Vieira LIMA

7 September 2021
Verified
Book Chapter
Closed access
PDF file
HCHugo Carneiro
Hugo Carneiro
CWCornelius Weber
Cornelius Weber
SWStefan Wermter
Stefan Wermter