| Records |
| Author |
Dimosthenis Karatzas; Sergi Robles; Joan Mas; Farshad Nourbakhsh; Partha Pratim Roy |
| Title |
ICDAR 2011 Robust Reading Competition – Challege 1: Reading Text in Born-Digital Images (Web and Email) |
Type |
Conference Article |
| Year |
2011 |
Publication |
11th International Conference on Document Analysis and Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1485-1490 |
| Keywords |
|
| Abstract |
This paper presents the results of the first Challenge of ICDAR 2011 Robust Reading Competition. Challenge 1 is focused on the extraction of text from born-digital images, specifically from images found in Web pages and emails. The challenge was organized in terms of three tasks that look at different stages of the process: text localization, text segmentation and word recognition. In this paper we present the results of the challenge for all three tasks, and make an open call for continuous participation outside the context of ICDAR 2011. |
| Address |
Beijing, China |
| 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 |
1520-5363 |
ISBN  |
978-1-4577-1350-7 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICDAR |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ KRM2011 |
Serial |
1793 |
| Permanent link to this record |
| |
|
| |
| Author |
Koen E.A. van de Sande; Jasper Uilings; Theo Gevers; Arnold Smeulders |
| Title |
Segmentation as Selective Search for Object Recognition |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1879-1886 |
| Keywords |
|
| Abstract |
For object recognition, the current state-of-the-art is based on exhaustive search. However, to enable the use of more expensive features and classifiers and thereby progress beyond the state-of-the-art, a selective search strategy is needed. Therefore, we adapt segmentation as a selective search by reconsidering segmentation: We propose to generate many approximate locations over few and precise object delineations because (1) an object whose location is never generated can not be recognised and (2) appearance and immediate nearby context are most effective for object recognition. Our method is class-independent and is shown to cover 96.7% of all objects in the Pascal VOC 2007 test set using only 1,536 locations per image. Our selective search enables the use of the more expensive bag-of-words method which we use to substantially improve the state-of-the-art by up to 8.5% for 8 out of 20 classes on the Pascal VOC 2010 detection challenge. |
| Address |
Barcelona |
| 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 |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
ISE |
Approved |
no |
| Call Number |
Admin @ si @ SUG2011 |
Serial |
1780 |
| Permanent link to this record |
| |
|
| |
| Author |
Shida Beigpour; Joost Van de Weijer |
| Title |
Object Recoloring Based on Intrinsic Image Estimation |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th IEEE International Conference in Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
327 - 334 |
| Keywords |
|
| Abstract |
Object recoloring is one of the most popular photo-editing tasks. The problem of object recoloring is highly under-constrained, and existing recoloring methods limit their application to objects lit by a white illuminant. Application of these methods to real-world scenes lit by colored illuminants, multiple illuminants, or interreflections, results in unrealistic recoloring of objects. In this paper, we focus on the recoloring of single-colored objects presegmented from their background. The single-color constraint allows us to fit a more comprehensive physical model to the object. We demonstrate that this permits us to perform realistic recoloring of objects lit by non-white illuminants, and multiple illuminants. Moreover, the model allows for more realistic handling of illuminant alteration of the scene. Recoloring results captured by uncalibrated cameras demonstrate that the proposed framework obtains realistic recoloring for complex natural images. Furthermore we use the model to transfer color between objects and show that the results are more realistic than existing color transfer methods. |
| Address |
Barcelona |
| 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 |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
CIC |
Approved |
no |
| Call Number |
Admin @ si @ BeW2011 |
Serial |
1781 |
| Permanent link to this record |
| |
|
| |
| Author |
Bhaskar Chakraborty; Michael Holte; Thomas B. Moeslund; Jordi Gonzalez; Xavier Roca |
| Title |
A Selective Spatio-Temporal Interest Point Detector for Human Action Recognition in Complex Scenes |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1776-1783 |
| Keywords |
|
| Abstract |
Recent progress in the field of human action recognition points towards the use of Spatio-Temporal Interest Points (STIPs) for local descriptor-based recognition strategies. In this paper we present a new approach for STIP detection by applying surround suppression combined with local and temporal constraints. Our method is significantly different from existing STIP detectors and improves the performance by detecting more repeatable, stable and distinctive STIPs for human actors, while suppressing unwanted background STIPs. For action representation we use a bag-of-visual words (BoV) model of local N-jet features to build a vocabulary of visual-words. To this end, we introduce a novel vocabulary building strategy by combining spatial pyramid and vocabulary compression techniques, resulting in improved performance and efficiency. Action class specific Support Vector Machine (SVM) classifiers are trained for categorization of human actions. A comprehensive set of experiments on existing benchmark datasets, and more challenging datasets of complex scenes, validate our approach and show state-of-the-art performance. |
| Address |
Barcelona |
| 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 |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
ISE |
Approved |
no |
| Call Number |
Admin @ si @ CHM2011 |
Serial |
1811 |
| Permanent link to this record |
| |
|
| |
| Author |
Mohammad Rouhani; Angel Sappa |
| Title |
Correspondence Free Registration through a Point-to-Model Distance Minimization |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
2150-2157 |
| Keywords |
|
| Abstract |
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of the existing works, which are based on minimizing a point-wise correspondence term, we propose to describe the model set by means of an implicit representation. It allows a new definition of the registration error, which works beyond the point level representation. Moreover, it could be used in a gradient-based optimization framework. The proposed approach consists of two stages. Firstly, a novel formulation is proposed that relates the registration parameters with the distance between the model and data set. Secondly, the registration parameters are obtained by means of the Levengberg-Marquardt algorithm. Experimental results and comparisons with state of the art show the validity of the proposed framework. |
| Address |
Barcelona |
| 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 |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
ADAS |
Approved |
no |
| Call Number |
Admin @ si @ RoS2011b; ADAS @ adas @ |
Serial |
1832 |
| Permanent link to this record |
| |
|
| |
| Author |
Naila Murray; Maria Vanrell; Xavier Otazu; C. Alejandro Parraga |
| Title |
Saliency Estimation Using a Non-Parametric Low-Level Vision Model |
Type |
Conference Article |
| Year |
2011 |
Publication |
IEEE conference on Computer Vision and Pattern Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
433-440 |
| Keywords |
Gaussian mixture model;ad hoc parameter selection;center-surround inhibition windows;center-surround mechanism;color appearance model;convolution;eye-fixation data;human vision;innate spatial pooling mechanism;inverse wavelet transform;low-level visual front-end;nonparametric low-level vision model;saliency estimation;saliency map;scale integration;scale-weighted center-surround response;scale-weighting function;visual task;Gaussian processes;biology;biology computing;colour vision;computer vision;visual perception;wavelet transforms |
| Abstract |
Many successful models for predicting attention in a scene involve three main steps: convolution with a set of filters, a center-surround mechanism and spatial pooling to construct a saliency map. However, integrating spatial information and justifying the choice of various parameter values remain open problems. In this paper we show that an efficient model of color appearance in human vision, which contains a principled selection of parameters as well as an innate spatial pooling mechanism, can be generalized to obtain a saliency model that outperforms state-of-the-art models. Scale integration is achieved by an inverse wavelet transform over the set of scale-weighted center-surround responses. The scale-weighting function (termed ECSF) has been optimized to better replicate psychophysical data on color appearance, and the appropriate sizes of the center-surround inhibition windows have been determined by training a Gaussian Mixture Model on eye-fixation data, thus avoiding ad-hoc parameter selection. Additionally, we conclude that the extension of a color appearance model to saliency estimation adds to the evidence for a common low-level visual front-end for different visual tasks. |
| Address |
Colorado Springs |
| 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 |
1063-6919 |
ISBN |
978-1-4577-0394-2 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
CVPR |
| Notes |
CIC |
Approved |
no |
| Call Number |
Admin @ si @ MVO2011 |
Serial |
1757 |
| Permanent link to this record |
| |
|
| |
| Author |
Miguel Oliveira; Angel Sappa; V.Santos |
| Title |
Unsupervised Local Color Correction for Coarsely Registered Images |
Type |
Conference Article |
| Year |
2011 |
Publication |
IEEE conference on Computer Vision and Pattern Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
201-208 |
| Keywords |
|
| Abstract |
The current paper proposes a new parametric local color correction technique. Initially, several color transfer functions are computed from the output of the mean shift color segmentation algorithm. Secondly, color influence maps are calculated. Finally, the contribution of every color transfer function is merged using the weights from the color influence maps. The proposed approach is compared with both global and local color correction approaches. Results show that our method outperforms the technique ranked first in a recent performance evaluation on this topic. Moreover, the proposed approach is computed in about one tenth of the time. |
| Address |
Colorado Springs |
| 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 |
1063-6919 |
ISBN |
978-1-4577-0394-2 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
CVPR |
| Notes |
ADAS |
Approved |
no |
| Call Number |
Admin @ si @ OSS2011; ADAS @ adas @ |
Serial |
1766 |
| Permanent link to this record |
| |
|
| |
| Author |
Albert Gordo; Florent Perronnin |
| Title |
Asymmetric Distances for Binary Embeddings |
Type |
Conference Article |
| Year |
2011 |
Publication |
IEEE Conference on Computer Vision and Pattern Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
729 - 736 |
| Keywords |
|
| Abstract |
In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database signatures, it has been noted that this is not strictly a requirement. Indeed, asymmetric schemes which binarize the database signatures but not the query still enjoy the same two benefits but may provide superior accuracy. In this work, we propose two general asymmetric distances which are applicable to a wide variety of embedding techniques including Locality Sensitive Hashing (LSH), Locality Sensitive Binary Codes (LSBC), Spectral Hashing (SH) and Semi-Supervised Hashing (SSH). We experiment on four public benchmarks containing up to 1M images and show that the proposed asymmetric distances consistently lead to large improvements over the symmetric Hamming distance for all binary embedding techniques. We also propose a novel simple binary embedding technique – PCA Embedding (PCAE) – which is shown to yield competitive results with respect to more complex algorithms such as SH and SSH. |
| Address |
Providence, RI |
| 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 |
978-1-4577-0394-2 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
CVPR |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ GoP2011; IAM @ iam @ GoP2011 |
Serial |
1817 |
| Permanent link to this record |
| |
|
| |
| Author |
Alicia Fornes; Volkmar Frinken; Andreas Fischer; Jon Almazan; G. Jackson; Horst Bunke |
| Title |
A Keyword Spotting Approach Using Blurred Shape Model-Based Descriptors |
Type |
Conference Article |
| Year |
2011 |
Publication |
Proceedings of the 2011 Workshop on Historical Document Imaging and Processing |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
83-90 |
| Keywords |
|
| Abstract |
The automatic processing of handwritten historical documents is considered a hard problem in pattern recognition. In addition to the challenges given by modern handwritten data, a lack of training data as well as effects caused by the degradation of documents can be observed. In this scenario, keyword spotting arises to be a viable solution to make documents amenable for searching and browsing. For this task we propose the adaptation of shape descriptors used in symbol recognition. By treating each word image as a shape, it can be represented using the Blurred Shape Model and the De-formable Blurred Shape Model. Experiments on the George Washington database demonstrate that this approach is able to outperform the commonly used Dynamic Time Warping approach. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
ACM |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4503-0916-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
HIP |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ FFF2011a |
Serial |
1823 |
| Permanent link to this record |
| |
|
| |
| Author |
Debora Gil; Agnes Borras; Manuel Ballester; Francesc Carreras; Ruth Aris; Manuel Vazquez; Enric Marti; Ferran Poveda |
| Title |
MIOCARDIA: Integrating cardiac function and muscular architecture for a better diagnosis |
Type |
Conference Article |
| Year |
2011 |
Publication |
14th International Symposium on Applied Sciences in Biomedical and Communication Technologies |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
Deep understanding of myocardial structure of the heart would unravel crucial knowledge for clinical and medical procedures. The MIOCARDIA project is a multidisciplinary project in cooperation with l'Hospital de la Santa Creu i de Sant Pau, Clinica la Creu Blanca and Barcelona Supercomputing Center. The ultimate goal of this project is defining a computational model of the myocardium. The model takes into account the deep interrelation between the anatomy and the mechanics of the heart. The paper explains the workflow of the MIOCARDIA project. It also introduces a multiresolution reconstruction technique based on DT-MRI streamlining for simplified global myocardial model generation. Our reconstructions can restore the most complex myocardial structures and provides evidences of a global helical organization. |
| Address |
Barcelona; Spain |
| Corporate Author |
Association for Computing Machinery |
Thesis |
|
| Publisher |
|
Place of Publication |
Barcelona, Spain |
Editor |
Association for Computing Machinery |
| Language |
english |
Summary Language |
english |
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4503-0913-4 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ISABEL |
| Notes |
IAM |
Approved |
no |
| Call Number |
IAM @ iam @ GGB2011 |
Serial |
1691 |
| Permanent link to this record |
| |
|
| |
| Author |
Simone Balocco; Carlo Gatta; Xavier Carrillo; J. Mauri; Petia Radeva |
| Title |
Plaque Type, Plaque Burden and Wall Shear Stress Relation in Coronary Arteries Assessed by X-ray Angiography and Intravascular Ultrasound: a Qualitative Study |
Type |
Conference Article |
| Year |
2011 |
Publication |
14th International Symposium on Applied Sciences in Biomedical and Communication Technologies |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
In this paper, we present a complete framework that automatically provides fluid-dynamic and plaque analysis from IVUS and Angiographic sequences. Such framework is used to analyze, in three coronary arteries, the relation between wall shear stress with type and amount of plaque. Preliminary qualitative results show an inverse relation between the wall shear stress and the plaque burden, which is confirmed by the fact that the plaque growth is higher on the wall having concave curvature. Regarding the plaque type it was observed that regions having low shear stress are predominantly fibro-lipidic while the heavy calcifications are in general located in areas of the vessel having high WSS. |
| 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 |
978-1-4503-0913-4 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ISABEL |
| Notes |
MILAB |
Approved |
no |
| Call Number |
Admin @ si @ BGC2011b |
Serial |
1799 |
| Permanent link to this record |
| |
|
| |
| Author |
Naila Murray; Sandra Skaff; Luca Marchesotti; Florent Perronnin |
| Title |
Towards Automatic Concept Transfer |
Type |
Conference Article |
| Year |
2011 |
Publication |
Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
167.176 |
| Keywords |
chromatic modeling, color concepts, color transfer, concept transfer |
| Abstract |
This paper introduces a novel approach to automatic concept transfer; examples of concepts are “romantic”, “earthy”, and “luscious”. The approach modifies the color content of an input image given only a concept specified by a user in natural language, thereby requiring minimal user input. This approach is particularly useful for users who are aware of the message they wish to convey in the transferred image while being unsure of the color combination needed to achieve the corresponding transfer. The user may adjust the intensity level of the concept transfer to his/her liking with a single parameter. The proposed approach uses a convex clustering algorithm, with a novel pruning mechanism, to automatically set the complexity of models of chromatic content. It also uses the Earth-Mover's Distance to compute a mapping between the models of the input image and the target chromatic concept. Results show that our approach yields transferred images which effectively represent concepts, as confirmed by a user study. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
ACM Press |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4503-0907-3 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
NPAR |
| Notes |
CIC |
Approved |
no |
| Call Number |
Admin @ si @ MSM2011 |
Serial |
1866 |
| Permanent link to this record |
| |
|
| |
| Author |
David Vazquez; Antonio Lopez; Daniel Ponsa; Javier Marin |
| Title |
Virtual Worlds and Active Learning for Human Detection |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th International Conference on Multimodal Interaction |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
393-400 |
| Keywords |
Pedestrian Detection; Human detection; Virtual; Domain Adaptation; Active Learning |
| Abstract |
Image based human detection is of paramount interest due to its potential applications in fields such as advanced driving assistance, surveillance and media analysis. However, even detecting non-occluded standing humans remains a challenge of intensive research. The most promising human detectors rely on classifiers developed in the discriminative paradigm, i.e., trained with labelled samples. However, labeling is a manual intensive step, especially in cases like human detection where it is necessary to provide at least bounding boxes framing the humans for training. To overcome such problem, some authors have proposed the use of a virtual world where the labels of the different objects are obtained automatically. This means that the human models (classifiers) are learnt using the appearance of rendered images, i.e., using realistic computer graphics. Later, these models are used for human detection in images of the real world. The results of this technique are surprisingly good. However, these are not always as good as the classical approach of training and testing with data coming from the same camera, or similar ones. Accordingly, in this paper we address the challenge of using a virtual world for gathering (while playing a videogame) a large amount of automatically labelled samples (virtual humans and background) and then training a classifier that performs equal, in real-world images, than the one obtained by equally training from manually labelled real-world samples. For doing that, we cast the problem as one of domain adaptation. In doing so, we assume that a small amount of manually labelled samples from real-world images is required. To collect these labelled samples we propose a non-standard active learning technique. Therefore, ultimately our human model is learnt by the combination of virtual and real world labelled samples (Fig. 1), which has not been done before. We present quantitative results showing that this approach is valid. |
| Address |
Alicante, Spain |
| Corporate Author |
|
Thesis |
|
| Publisher |
ACM DL |
Place of Publication |
New York, NY, USA, USA |
Editor |
|
| Language |
English |
Summary Language |
English |
Original Title |
Virtual Worlds and Active Learning for Human Detection |
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4503-0641-6 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICMI |
| Notes |
ADAS |
Approved |
yes |
| Call Number |
ADAS @ adas @ VLP2011a |
Serial |
1683 |
| Permanent link to this record |
| |
|
| |
| Author |
Ruth Aylett; Ginevra Castellano; Bogdan Raducanu; Ana Paiva; Marc Hanheide |
| Title |
Long-term socially perceptive and interactive robot companions: challenges and future perspectives |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th International Conference on Multimodal Interaction |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
323-326 |
| Keywords |
human-robot interaction, multimodal interaction, social robotics |
| Abstract |
This paper gives a brief overview of the challenges for multi-model perception and generation applied to robot companions located in human social environments. It reviews the current position in both perception and generation and the immediate technical challenges and goes on to consider the extra issues raised by embodiment and social context. Finally, it briefly discusses the impact of systems that must function continually over months rather than just for a few hours. |
| Address |
Alicante |
| Corporate Author |
|
Thesis |
|
| Publisher |
ACM |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4503-0641-6 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICMI |
| Notes |
OR;MV |
Approved |
no |
| Call Number |
Admin @ si @ ACR2011 |
Serial |
1888 |
| Permanent link to this record |
| |
|
| |
| Author |
Sergio Escalera; Xavier Baro; Oriol Pujol; Jordi Vitria; Petia Radeva |
| Title |
Traffic-Sign Recognition Systems |
Type |
Book Whole |
| Year |
2011 |
Publication |
SpringerBriefs in Computer Science |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
5-13 |
| Keywords |
|
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer London |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4471-2244-9 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
MILAB; OR;HuPBA;MV |
Approved |
no |
| Call Number |
Admin @ si @ EBP2011 |
Serial |
1801 |
| Permanent link to this record |
