Skip to main content

INTERACCION, APRENDIZAJE Y COOPERACION ROBOT – HUMANO EN AREAS URBANAS

DPI2013-42458-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2013
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 38
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Continuous real time POMCP to find-and-follow people by a humanoid service robot

  • Goldhoorn, Alex
  • Garrell, Anaís
  • Alquézar Mancho, Renato
  • Sanfeliu, Alberto
Trabajo presentado al 14th IEEE-RAS International Conference on Humanoid Robots: Humanoids 2014 "Humans and Robots Face-to-Face", celebrado en Madrid (España) del 18 al 20 de noviembre de 2014., This study describes and evaluates two new methods for finding and following people in urban settings using a humanoid service robot: the Continuous Real-time POMCP method, and its improved extension called Adaptive Highest Belief Continuous Real-time POMCP follower. They are able to run in real-time, in large continuous environments. These methods make use of the online search algorithm Partially Observable Monte-Carlo Planning (POMCP), which in contrast to other previous approaches, can plan under uncertainty on large state spaces. We compare our new methods with a heuristic person follower and demonstrate that they obtain better results by testing them extensively in both simulated and real-life experiments. More than two hours, over 3 km, of autonomous navigation during real-life experiments have been done with a mobile humanoid robot in urban environments., This work has been partially funded by the DPI2013-42458-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Combining where and what in change detection for unsupervised foreground learning in surveillance

  • Huerta, Iván
  • Pedersoli, Marco
  • Gonzàlez, Jordi
  • Sanfeliu, Alberto
Change detection is the most important task for video surveillance analytics such as foreground and anomaly detection. Current foreground detectors learn models from annotated images since the goal is to generate a robust foreground model able to detect changes in all possible scenarios. Unfortunately, manual labelling is very expensive. Most advanced supervised learning techniques based on generic object detection datasets currently exhibit very poor performance when applied to surveillance datasets because of the unconstrained nature of such environments in terms of types and appearances of objects. In this paper, we take advantage of change detection for training multiple foreground detectors in an unsupervised manner. We use statistical learning techniques which exploit the use of latent parameters for selecting the best foreground model parameters for a given scenario. In essence, the main novelty of our proposed approach is to combine the where (motion segmentation) and what (learning procedure) in change detection in an unsupervised way for improving the specificity and generalization power of foreground detectors at the same time. We propose a framework based on latent support vector machines that, given a noisy initialization based on motion cues, learns the correct position, aspect ratio, and appearance of all moving objects in a particular scene. Specificity is achieved by learning the particular change detections of a given scenario, and generalization is guaranteed since our method can be applied to any possible scene and foreground object, as demonstrated in the experimental results outperforming the state-of-the-art., This work was partially funded by the DPI2013-42458-P and TIN2012-39051., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Chromatic shadow detection and tracking for moving foreground segmentation

  • Huerta, Iván
  • Holte, Michael B.
  • Moeslund, Thomas B.
  • Gonzàlez, Jordi
Advanced segmentation techniques in the surveillance domain deal with shadows to avoid distortions when detecting moving objects. Most approaches for shadow detection are still typically restricted to penumbra shadows and cannot cope well with umbra shadows. Consequently, umbra shadow regions are usually detected as part of moving objects, thus affecting the performance of the final detection. In this paper we address the detection of both penumbra and umbra shadow regions. First, a novel bottom-up approach is presented based on gradient and colour models, which successfully discriminates between chromatic moving cast shadow regions and those regions detected as moving objects. In essence, those regions corresponding to potential shadows are detected based on edge partitioning and colour statistics. Subsequently (i) temporal similarities between textures and (ii) spatial similarities between chrominance angle and brightness distortions are analysed for each potential shadow region for detecting the umbra shadow regions. Our second contribution refines even further the segmentation results: a tracking-based top-down approach increases the performance of our bottom-up chromatic shadow detection algorithm by properly correcting non-detected shadows. To do so, a combination of motion filters in a data association framework exploits the temporal consistency between objects and shadows to increase the shadow detection rate. Experimental results exceed current state-of-the-art in shadow accuracy for multiple well-known surveillance image databases which contain different shadowed materials and illumination conditions., This work has been partially funded by the European project CargoANTs (FP7-SST-2013-605598), by the Spanish CICYT project DPI2013-42458-P and by the CICYT TIN2012-39051., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Filtering graphs to check isomorphism and extracting mapping by using the Conductance Electrical Model

  • Igelmo, Manuel
  • Sanfeliu, Alberto
  • Sanfeliu, Alberto
This paper presents a new method of filtering graphs to check exact graph isomorphism and extracting their mapping. Each graph is modeled by a resistive electrical circuit using the Conductance Electrical Model (CEM). By using this model, a necessary condition to check the isomorphism of two graphs is that their equivalent resistances have the same values, but this is not enough, and we have to look for their mapping to find the sufficient condition. We can compute the isomorphism between two graphs in O(N3), where N is the order of the graph, if their star resistance values are different, otherwise the computational time is exponential, but only with respect to the number of repeated star resistance values, which usually is very small. We can use this technique to filter graphs that are not isomorphic and in case that they are, we can obtain their node mapping. A distinguishing feature over other methods is that, even if there exists repeated star resistance values, we can extract a partial node mapping (of all the nodes except the repeated ones and their neighbors) in O(N3). The paper presents the method and its application to detect isomorphic graphs in two well know graph databases, where some graphs have more than 600 nodes., This work was partially funded by CICYT DPI2013-42458-P., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Efficient monocular pose estimation for complex 3D models

  • Rubio Romano, Antonio
  • Villamizar, Michael
  • Ferraz, Luis
  • Peñate-Sánchez, Adrián
  • Ramisa, Arnau
  • Simo-Serra, Edgar
  • Sanfeliu, Alberto
  • Moreno-Noguer, Francesc
Trabajo presentado al ICRA celebrado en Seattle (US) del 26 al 30 de mayo de 2015., We propose a robust and efficient method to estimate the pose of a camera with respect to complex 3D textured models of the environment that can potentially contain more than 100, 000 points. To tackle this problem we follow a top down approach where we combine high-level deep network classifiers with low level geometric approaches to come up with a solution that is fast, robust and accurate. Given an input image, we initially use a pre-trained deep network to compute a rough estimation of the camera pose. This initial estimate constrains the number of 3D model points that can be seen from the camera viewpoint. We then establish 3D-to-2D correspondences between these potentially visible points of the model and the 2D detected image features. Accurate pose estimation is finally obtained from the 2D-to-3D correspondences using a novel PnP algorithm that rejects outliers without the need to use a RANSAC strategy, and which is between 10 and 100 times faster than other methods that use it. Two real experimentsdealing with very large and complex 3D models demonstrate the effectiveness of the approach., This work has been partially funded by the Spanish Ministry of Economy and Competitiveness under projects ERANet Chistera project ViSen PCIN-2013-047, PAU+ DPI2011-27510 and ROBOT-INT-COOP DPI2013-42458-P, and by the EU project ARCAS FP7-ICT-2011-28761., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Modeling robot's world with minimal effort

  • Villamizar, Michael
  • Garrell, Anaís
  • Sanfeliu, Alberto
  • Sanfeliu, Alberto
  • Moreno-Noguer, Francesc
Trabajo presentado al ICRA celebrado en Seattle (US) del 26 al 30 de mayo de 2015., We propose an efficient Human Robot Interaction approach to efficiently model the appearance of all relevant objects in robot's environment. Given an input video stream recorded while the robot is navigating, the user just needs to annotate a very small number of frames to build specific classifiers for each of the objects of interest. At the core of the method, there are several random ferns classifiers that share the same features and are updated online. The resulting methodology is fast (runs at 8 fps), versatile (it can be applied to unconstrained scenarios), scalable (real experiments show we can model up to 30 different object classes), and minimizes the amount of human intervention by leveraging the uncertainty measures associated to each classifier. We thoroughly validate the approach on synthetic data and on real sequences acquired with a mobile platform in outdoor and challenging scenarios containing a multitude of different objects. We show that the human can, with minimal effort, provide the robot with a detailed model of the objects in the scene., Work partially supported by the Spanish Ministry of Science and Innovation under project DPI2013-42458-P, ERA-Net Chistera project ViSen PCIN-2013-047, and by the EU project ARCAS FP7-ICT-2011-28761., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Multimodal object recognition using random clustering trees

  • Villamizar, Michael
  • Garrell, Anaís
  • Sanfeliu, Alberto
  • Moreno-Noguer, Francesc
Trabajo presentado a la 7th Iberian Conference (IbPRIA) celebrada en Santiago de Compostela (España) del 17 al 19 de junio de 2015., In this paper, we present an object recognition approach that in addition allows to discover intra-class modalities exhibiting highcorrelated visual information. Unlike to more conventional approaches based on computing multiple specialized classifiers, the proposed approach combines a single classifier, Boosted Random Ferns (BRFs), with probabilistic Latent Semantic Analysis (pLSA) in order to recognize an object class and to find automatically the most prominent intra-class appearance modalities (clusters) through tree-structured visual words. The proposed approach has been validated in synthetic and real experiments where we show that the method is able to recognize objects with multiple appearances., Work partially supported by the Spanish ministry of Science and Innovation under project DPI2013-42458-P, ERA-Net Chistera project ViSen PCIN-2013-047, and by the EU project ARCAS FP7-ICT-2011-28761., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Multi-objective cost-to-go functions on robot navigation in dynamic environments

  • Ferrer, Gonzalo
  • Sanfeliu, Alberto
Trabajo presentado a la International Conference on Intelligent Robots and Systems, celebrada en Hamburgo (Alemania) del 28 de septiembre al 2 de octubre de 2015., In our previous work we introduced the Anticipative Kinodynamic Planning (AKP): a robot navigation algorithm in dynamic urban environments that seeks to minimize its disruption to nearby pedestrians. In the present paper, we maintain all the advantages of the AKP, and we overcome the previous limitations by presenting novel contributions to our approach. Firstly, we present a multi-objective cost function to consider different and independent criteria and a well-posed procedure to build a joint cost function in order to select the best path. Then, we improve the construction of the planner tree by introducing a cost-to-go function that will be shown to outperform a classical Euclidean distance approach. In order to achieve real time calculations, we have used a steering heuristic that dramatically speeds up the process. Plenty of simulations and real experiments have been carried out to demonstrate the success of the AKP., This work was supported by the Spanish Ministry of Science and Innovation project DPI2013-42458-P, Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Real time people detection combining appearance and depth image spaces using boosted random ferns

  • Vaquero, Victor
  • Villamizar, Michael
  • Sanfeliu, Alberto
Trabajo presentado a la 2nd Iberian Robotics Conference (ROBOT-2015)., This paper presents a robust and real-time method for people detection in urban and crowed environments. Unlike other conventional methods which either focus on single features or compute multiple and independent classifiers specialized in a particular feature space, the proposed approach creates a synergic combination of appearance and depth cues in a unique classifier. The core of our method is a Boosted Random Ferns classifier that selects automatically the most discriminative local binary features for both the appearance and depth image spaces. Based on this classifier, a fast and robust people detector which maintains high detection rates in spite of environmental changes is created. The proposed method has been validated in a challenging RGB-D database of people in urban scenarios and has shown that outperforms state-of-the-art approaches in spite of the difficult environment conditions. As a result, this method is of special interest for real-time robotic applications where people detection is a key matter, such as human-robot interaction or safe navigation of mobile robots for example., This work has been partially funded by the EU project CargoANTs FP7-SST-2013-605598 and the Spanish CICYT project DPI2013-42458-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Low cost, robust and real time system for detecting and tracking moving objects to automate cargo handling in port terminals

  • Vaquero, Victor
  • Repiso, Ely
  • Sanfeliu, Alberto
  • Vissers, John
  • Kwakkernaat, Maurice
Trabajo presentado a la 2nd Iberian Robotics Conference (ROBOT-2015)., The presented paper addresses the problem of detecting and tracking moving objects for autonomous cargo handling in port terminals using a perception system which input data is a single layer laser scanner. A computationally low cost and robust Detection and Tracking Moving Objects (DATMO) algorithm is presented to be used in autonomous guided vehicles and autonomous trucks for efficient transportation of cargo in ports. The method first detects moving objects and then tracks them, taking into account that in port terminals the structure of the environment is formed by containers and that the moving objects can be trucks, AGV, cars, straddle carriers and people among others. Two approaches of the DATMO system have been tested, the first one is oriented to detect moving obstacles and focused on tracking and filtering those detections; and the second one is focused on keepking targets when no detections are provided. The system has been evaluated with real data obtained in the CTT port terminal in Hengelo, the Netherlands. Both methods have been tested in the dataset with good results in tracking moving objects., This work has been partially funded by the EU project CargoANTs FP7-SST-2013-605598 and the Spanish CICYT project DPI2013-42458-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Distance-based kernels for dynamical movement primitives

  • Escudero-Rodrigo, Diego
  • Alquézar Mancho, Renato
Trabajo presentado a la 18th Catalan Conference on Artificial Intelligence (CCIA-2015)., In the Anchoring Problem actions and objects must be anchored to symbols; and movement primitives as DMPs seems a good option to describe actions. In the bottom-up approach to anchoring, the recognition of an action is done applying learning techniques as clustering. Although most work done about movement recognition with DMPs is focus on weights, we propose to use the shape-attractor function as feature vector. As several DMPs formulations exist, we have analyzed the two most known to check if using the shape-attractor instead of weights is feasible for both formulations. In addition, we propose to use distance-based kernels, as RBF and TrE, to classify DMPs in some predefined actions. Our experiments based on an existing dataset and using 1-NN and SVM techniques confirm that shape-attractor function is a better choice for movement recognition with DMPs., This work was partially funded by Spanish research project DPI2013-42458-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

From research to teaching: Integrating social robotics in engineering degrees

  • Bolea, Yolanda
  • Grau Saldes, Antoni
  • Sanfeliu, Alberto
When industrial robotics subject is taught in a degree in robotics, social and humanoid robotics concepts are rarely mentioned because this field of robotics is not used in industry. In this paper, an educational project related with industrial robotics is presented which includes social and humanoid robotics. The main motivations to realize this research are: i) humanoid robotics will be appearing soon in industry, the experience, based on research projects, indicates their deployment sooner than expected; ii) its educational interest, technology is shared with industrial robotics; iii) it is very attractive, students are interested in this part of the subject and thus they are interested in the whole subject. As a pedagogical methodology, the use of the problem-based learning is considered. Those concepts are introduced in a seminar during the last part of the subject and developed as a set of practices in the laboratory., This work has been supported by the Spanish Ministry of Economy and Competitiveness by project DPI2013-42458-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Learning the hidden human knowledge of UAV pilots when navigating in a cluttered environament for improving Path Plannig

  • Alzugaray, Ignacio
  • Sanfeliu, Alberto
  • Sanfeliu, Alberto
Trabajo presentado a la IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), celebrada en Daejeon (Korea) del 9 al 14 de octubre de 2016., We propose in this work a new model of how the hidden human knowledge (HHK) of UAV pilots can be incorporated in the UAVs path planning generation. We intuitively know that human's pilots barely manage or even attempt to drive the UAV through a path that is optimal attending to some criteria as an optimal planner would suggest. Although human pilots might get close but not reach the optimal path proposed by some planner that optimizes over time or distance, the final effect of this differentiation could be not only surprisingly better, but also desirable. In the best scenario for optimality, the path that human pilots generate would deviate from the optimal path as much as the hidden knowledge that its perceives is injected into the path. The aim of our work is to use real human pilot paths to learn the hidden knowledge using repulsion fields and to incorporate this knowledge afterwards in the environment obstacles as cause of the deviation from optimality. We present a strategy of learning this knowledge based on attractor and repulsors, the learning method and a modified RRT* that can use this knowledge for path planning. Finally we do real-life tests and we compare the resulting paths with and without this knowledge., This work was supported by the Spanish Ministry of Science and Innovation, project Rob-Int-Coop DPI2013-42458-P and AEROARMS European project H2020-ICT-2014-1-644271., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Interactive multiple object learning with scanty human supervision

  • Villamizar, Michael
  • Garrell, Anaís
  • Sanfeliu, Alberto
  • Moreno-Noguer, Francesc
We present a fast and online human-robot interaction approach that progressively learns multiple object classifiers using scanty human supervision. Given an input video stream recorded during the human-robot interaction, the user just needs to annotate a small fraction of frames to compute object specific classifiers based on random ferns which share the same features. The resulting methodology is fast (in a few seconds, complex object appearances can be learned), versatile (it can be applied to unconstrained scenarios), scalable (real experiments show we can model up to 30 different object classes), and minimizes the amount of human intervention by leveraging the uncertainty measures associated to each classifier. We thoroughly validate the approach on synthetic data and on real sequences acquired with a mobile platform in indoor and outdoor scenarios containing a multitude of different objects. We show that with little human assistance, we are able to build object classifiers robust to viewpoint changes, partial occlusions, varying lighting and cluttered backgrounds., This work has been partially funded by the Spanish Ministry of Economy and Competitiveness under projects ERA-Net Chistera project ViSen PCIN-2013-047, RobInstruct TIN2014-58178-R, ROBOT-INT-COOP DPI2013-42458-P, and by the EU project AEROARMS H2020-ICT-2014-1-644271., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Searching and tracking people in urban environments with static and dynamic obstacles

  • Goldhoorn, Alex
  • Garrell, Anaís
  • Alquézar Mancho, Renato
  • Sanfeliu, Alberto
Searching and tracking people in crowded urban areas where they can be occluded by static or dynamic obstacles is an important behavior for social robots which assist humans in urban outdoor environments. In this work, we propose a method that can handle in real-time searching and tracking people using a Highest Belief Particle Filter Searcher and Tracker. It makes use of a modified Particle Filter (PF), which, in contrast to other methods, can do both searching and tracking of a person under uncertainty, with false negative detections, lack of a person detection, in continuous space and real-time. Moreover, this method uses dynamic obstacles to improve the predicted possible location of the person. Comparisons have been made with our previous method, the Adaptive Highest Belief Continuous Real-time POMCP Follower, in different conditions and with dynamic obstacles. Real-life experiments have been done during two weeks with a mobile service robot in two urban environments of Barcelona with other people walking around., This work has been partially funded by the EU project AEROARMS European projectH2020-ICT-2014-1-644271 and the CICYT project DPI2013-42458-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Teaching robot’s proactive behavior using human assistance

  • Garrell, Anaís
  • Villamizar, Michael
  • Moreno-Noguer, Francesc
  • Sanfeliu, Alberto
In recent years, there has been a growing interest in enabling autonomous social robots to interact with people. However, many questions remain unresolved regarding the social capabilities robots should have in order to perform this interaction in an ever more natural manner. In this paper, we tackle this problem through a comprehensive study of various topics involved in the interaction between a mobile robot and untrained human volunteers for a variety of tasks. In particular, this work presents a framework that enables the robot to proactively approach people and establish friendly interaction. To this end, we provided the robot with several perception and action skills, such as that of detecting people, planning an approach and communicating the intention to initiate a conversation while expressing an emotional status. We also introduce an interactive learning system that uses the person’s volunteered assistance to incrementally improve the robot’s perception skills. As a proof of concept, we focus on the particular task of online face learning and recognition. We conducted real-life experiments with our Tibi robot to validate the framework during the interaction process. Within this study, several surveys and user studies have been realized to reveal the social acceptability of the robot within the context of different tasks., This work was supported by the Spanish Ministry of Science and Innovation, project Rob-Int-Coop DPI2013-42458-P and AEROARMS European project H2020-ICT-2014-1-644271., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

PL-SLAM: Real-time monocular visual SLAM with points and lines

  • Pumarola, Albert
  • Vakhitov, Alexander
  • Agudo Martínez, Antonio
  • Sanfeliu, Alberto
  • Moreno-Noguer, Francesc
Trabajo presentado a la IEEE International Conference on Robotics and Automation (ICRA), celebrada en Singapur del 29 de mayo al 3 de junio de 2017., Low textured scenes are well known to be one of the main Achilles heels of geometric computer vision algorithms relying on point correspondences, and in particular for visual SLAM. Yet, there are many environments in which, despite being low textured, one can still reliably estimate line-based geometric primitives, for instance in city and indoor scenes, or in the so-called ``Manhattan worlds'', where structured edges are predominant. In this paper we propose a solution to handle these situations. Specifically, we build upon ORB-SLAM, presumably the current state-of-the-art solution both in terms of accuracy as efficiency, and extend its formulation to simultaneously handle both point and line correspondences. We propose a solution that can even work when most of the points are vanished out from the input images, and, interestingly it can be initialized from solely the detection of line correspondences in three consecutive frames. We thoroughly evaluate our approach and the new initialization strategy on the TUM RGB-D benchmark and demonstrate that the use of lines does not only improve the performance of the original ORB-SLAM solution in poorly textured frames, but also systematically improves it in sequence frames combining points and lines, without compromising the efficiency., This work has been partially supported by the EU project AEROARMS H2020-ICT-2014-1-644271, by the MINECO projects RobInstruct TIN2014-58178-R and Rob-Int-Coop DPI2013-42458-P, by the ERA-Net Chistera project IDRESS PCIN-2015-147 and by the Russian MES grant RFMEFI61516X0003., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

On-line adaptive side-by-side human robot companion in dynamic urban environments

  • Repiso, Ely
  • Ferrer, Gonzalo
  • Sanfeliu, Alberto
Trabajo presentado a la IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), celebrada en Vancouver (Canada) del 24 al 28 de septiembre de 2017., This paper presents an adaptive side-by-side human-robot companion approach for navigation in urban dynamic environments, based on the anticipative kinodynamic planning. The adaptive means that the robot is capable of adjusting its motion to the behavior of the person being accompanied. Our main objective is to optimize in real time the path performed by the pair human-robot, by modifying dynamically the angle and distance between both throughout different locations of the path. We have defined a new cost function for finding the best planned path that takes into account the cost of the geometrical configuration between the human and the robot. Moreover, we have modified the Extended Social Force Model (SFM) to include the required forces to maintain the angle and distance between the robot and human while the human-robot pair is moving towards the shared goal. The method has been validated throughout a large set of simulations and real-live experiments., Work supported by the Spanish Ministry of Science and Innovation under project ROBOT-INT-COOP(DPI2013-42458-P)., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Random clustering ferns for multimodal object recognition

  • Villamizar, Michael
  • Garrell, Anaís
  • Sanfeliu, Alberto
  • Moreno-Noguer, Francesc
We propose an efficient and robust method for the recognition of objects exhibiting multiple intra-class modes, where each one is associated with a particular object appearance. The proposed method, called random clustering ferns, combines synergically a single and real-time classifier, based on the boosted assembling of extremely randomized trees (ferns), with an unsupervised and probabilistic approach in order to recognize efficiently object instances in images and discover simultaneously the most prominent appearance modes of the object through tree-structured visual words. In particular, we use boosted random ferns and probabilistic latent semantic analysis to obtain a discriminative and multimodal classifier that automatically clusters the response of its randomized trees in function of the visual object appearance. The proposed method is validated extensively in synthetic and real experiments, showing that the method is capable of detecting objects with diverse and complex appearance distributions in real-time performance., This work has been partially funded by the Spanish Ministry of Economy and Competitiveness under projects ERA-Net Chistera project ViSen PCIN-2013-047, RobInstruct TIN2014-58178-R, ROBOT-INT-COOP DPI2013-42458-P, and by the EU project AEROARMS H2020-ICT-2014-1-644271., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Searching and tracking people with cooperative mobile robots

  • Goldhoorn, Alex
  • Garrell, Anaís
  • Alquézar Mancho, Renato
  • Sanfeliu, Alberto
Social robots should be able to search and track people in order to help them. In this paper we present two different techniques for coordinated multi-robot teams for searching and tracking people. A probability map (belief) of a target person location is maintained, and to initialize and update it, two methods were implemented and tested: one based on a reinforcement learning algorithm and the other based on a particle filter. The person is tracked if visible, otherwise an exploration is done by making a balance, for each candidate location, between the belief, the distance, and whether close locations are explored by other robots of the team. The validation of the approach was accomplished throughout an extensive set of simulations using up to five agents and a large amount of dynamic obstacles; furthermore, over three hours of real-life experiments with two robots searching and tracking were recorded and analysed., Work partially supported by the Spanish Ministry of Science and Innovation under project Rob-In-Coop (DPI2013-42458-P) and EU FP7 project ARCAS (INFSO-ICT-287617)., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Planar PØP: Feature-less pose estimation with applications in UAV localization

  • Amor-Martinez, Adrian
  • Santamaria-Navarro, Àngel
  • Herrero, Fernando
  • Ruiz Moreno, Alberto
  • Sanfeliu, Alberto
Trabajo presentado al IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR), celebrado en Lausanne (Suiza) del 23 al 27 de octubre de 2016., We present a featureless pose estimation method that, in contrast to current Perspective-n-Point (PnP) approaches, it does not require n point correspondences to obtain the camera pose, allowing for pose estimation from natural shapes that do not necessarily have distinguished features like corners or intersecting edges. Instead of using n correspondences (e.g. extracted with a feature detector) we will use the raw polygonal representation of the observed shape and directly estimate the pose in the pose-space of the camera. This method compared with a general PnP method, does not require n point correspondences neither a priori knowledge of the object model (except the scale), which is registered with a picture taken from a known robot pose. Moreover, we achieve higher precision because all the information of the shape contour is used to minimize the area between the projected and the observed shape contours. To emphasize the non-use of n point correspondences between the projected template and observed contour shape, we call the method Planar PØP. The method is shown both in simulation and in a real application consisting on a UAV localization where comparisons with a precise ground-truth are provided., This work has been partially funded by the AEROARMS EU project H2020-ICT-2014-1-644271, the CICYT project DPI2013-42458-P, and by Spanish MINECO and EU FEDER grant TIN2015-66972-C5-3-R., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Study of the anchoring problem in generalist robots based on ROSPlan

  • Escudero-Rodrigo, Diego
  • Alquézar Mancho, Renato
Trabajo presentado a la 19th International Conference of the Catalan Association for Artificial Intelligence (CCIA), celebrada en Barcelona (España) del 19 al 21 de octubre de 2016., In real life environments where robots must deal with complex situations and humans, generalist robots that adapt to novel situations are needed. They are composed by two sub-systems: perception/actuation and knowledge representation, and they need that symbols in the high-level area are coupled to objects and actions of the low-level area. This is the so-called Anchoring Problem. In this paper we present the system we are using to study this problem. It is based on ROSPlan, a framework that provides a generic method for task planning in a ROS system. The high-level area is composed by a planner that uses PDDL files and a knowledge representation system, while the low-level area is defined as a set of robot services exported using ROS actions, services and topics. We plan to contribute to this problem by applying human-robot interaction and learning techniques, and our main objectives are: (1) link an existing symbol with a learned action by interaction, and (2) automated code generation of ad-hoc ROS nodes that connect symbols to specific perceptions/actions., This work was partially funded by Spanish research project DPI2013-42458-P, Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Solutions to reduce CO2 emissions for autonomous robotics

  • Grau Saldes, Antoni
  • Bolea, Yolanda
  • Sanfeliu, Alberto
Trabajo presentado a la 18th International Conference on Computer and Automation Technology (ICCAT), celebrada en Zurich (Suiza) del 15 al 16 de septiembre de 2016., Sewer inspections require many people to work in risky and unhealthy conditions. A European ECHORD++ project introduces a robotic solution in this process aiming to reduce the labour risks, improving the precision of sewer inspections and optimizing sewer cleaning resources of cities. This system should be able to determine the state of the sewer in order to identify sewer segments where its functionality has been reduced either by sediments or by structural defects. Other functionalities required are sewer monitoring and water, air and sediment sampling. To well carry out these tasks, some general functions are required like remote operation, video and images capture, scanning and map building, among others. The ECHORD++ innovative proposed solution is carried out in Barcelona as pilot city. The current need of the City of Barcelona is to mechanize sewer inspections in order to objectify sewer inspections and optimize sewer cleaning expenses of the city. The sewer network of Barcelona is 1,532 km long, from which approximately 50% is accessible, which means that the pipe is at least 1.5 m high and workers are allowed to go inside it. In order to determine the state of the network, visual inspections are done with different frequencies depending on the slope and other characteristics of the sewer. Workers walk all along the pipe, in some sections even four times a year, and decide where it is necessary to clean. Moreover, sewers are classified as confined spaces which require special health and safety measures, in addition to other risks like slippery sections, obstacles or biological risks from the eventual contact with wastewater. These features made the process of sewer inspection a risky and expensive process that requires improvements urgently. Sewer inspection is a service included in the public management of the sewers of Barcelona. Nowadays, sewer inspections are done by people performing visual inspections and collecting information about the state of the sewage like sediment level and type, pipe obstructions, etc. In this paper the technological proposed solution (a semi-autonomous green robotic solution) is explained. The requirements for the new technology are given by the inherent sewer characteristics, that is, different ranges of pipe sizes, possible high concentration of, not explosive, but toxic gases as hydrogen sulphide, slippery areas, obstacles, atmosphere with 100% humidity, water temperature at 16 °C, and no telecommunication coverage in the sewer. The ECHORD++ project seeks to facilitate real-time decision making, innovation that makes inspection devices more autonomous, to have more degrees of freedom to move around the network, and the possibility to intensify the checking of a zone where impairment has been detected. This technological solution will fulfill environmental legislation and policies., This research was funded by Spanish Science ministry project CICYT DPI2013-42458-P (Robot-Int-Coop)., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Tesis doctoral (DoctoralThesis)

Searching and tracking of humans in urban environments with humanoid robots

  • Goldhoorn, Alex
Doctoral Programme: Automatic Control, Robotics and Computer Vision. This thesis has been completed at: Institut de Robòtica i Informàtica Industrial, CSIC-UPC., [EN]: Searching and tracking are important behaviours for a mobile service robot to assist people, to search-and-rescue and, in general, to locate mobile objects, animals or humans. Even though searching might be evident for humans, for robots it is not, since it requires exploring, handling noisy sensors, coping with dynamic obstacles, and coordination in the case of multiple agents. In this thesis, we present several methods to search and track a person in an urban environment. All methods were fist tested extensively in simulation and then in real-life, using one or two mobile service robots, called Tibi and Dabo. The robots have laser range finders, which are used to navigate, to detect obstacles and to detect people's legs. Since we focus on search-and-track methods, we use existing methods for robot navigation, for people detection and person recognition. First tests are done with the hide-and-seek problem, in which the robot learns to catch the hider. Concretely, a Mixed Observable Markov Decision Process (MOMDP) model is used, in which the seeker's location is fully observable and the hider's location partially observable. Since the computational complexity depends on the number of states, we propose a hierarchical on-line method that reduces the state space by grouping them together. Although the method worked properly in simulation, in the real-life experiments the results were not satisfying and the on-line policy calculation was not fast enough to work in real-time. To handle larger environments, work in continuous state space and run in real-time, we propose to use an approach, the Continuous Real-time POMCP (CR-POMCP), that does Monte-Carlo simulations to learn a policy. The method performed correctly in simulation, but on the real robot it resulted in slow zigzag movements. Therefore, a new method is proposed, which uses the highest probable locations, according to its probability map (belief). Since the belief propagation of the POMCP resembles how a Particle Filter (PF) works, we also propose a method that uses a PF to maintain the belief. The PF method has to handle lack of observations, therefore, we introduce a special weight function. Both belief update methods take into account sensor and actuator noise, false negative detections, false positive detections (for a short time) and dynamic obstacles. Finally, a cooperative distributed multi-agent method is presented, it makes use of the previous belief update functions, but it uses all the agents' observations. Next, the search locations are assigned by exploring the working environment, taking into account: the belief, the distance to the search location and if another agent already will search close to it. Summarizing, the main contributions of this thesis are several methods to search and track a person in an urban environment with one or more mobile service robots. All these methods have been shown to work through a set of simulations and real-life experiments., [CA]: La cerca i el seguiment de persones són comportaments importants per un robot mòbil de servei per poder assistir, trobar i ajudar als humans, i en general, per localitzar objectes, animals o vianants. Tot i que la cerca és fàcil per als humans, no ho és per a un robot, ja que requereix exploració, maneig de soroll de sensors, fer front als obstacles dinàmics, i la coordinació en el cas de múltiples agents. En aquesta tesi presentem diferents mètodes per a buscar i seguir a una persona en un entorn urbà. Tots els mètodes han estat provats extensivament en simulació i després en el món real, utilitzant dos robots mòbils de servei, la Tibi i en Dabo. Els robots utilitzen sensors làser per a navegar, detectar obstacles i detectar les cames de les persones. Atès que aquest treball es centra en mètodes de cerca i seguiment, s’han usat els mètodes existents per a la navegació del robot, la detecció i el reconeixement de persones. Primerament, s’han fet proves amb el conegut joc del fet i amagar, on el robot aprèn a trobar l’amagador. S’ha fet servir el model Mixed Observable Markov Decision Process (MOMDP), on la posició del trobador és completament visible i la posició de l’amagador és parcialment visible. Degut a que la complexitat computacional depèn del nombre d’estats, es proposa un mètode jeràrquic en línia que redueix l’espai d’estats, tot agrupant-los. Tot i que el mètode va funcionar correctament en simulació, en els experiments reals els resultats no van ser satisfactoris, i el càlcul de la política no va ser prou ràpid com per treballar en temps real. Per tal de fer front a entorns de més superfície, treballar en l’espai continu i executar en temps real, proposem un nou enfocament, el Continuous Real-time POMCP (CRPOMCP), que fa simulacions de Monte-Carlo per aprendre una política. El mètode va funcionar correctament en l’entorn simulat, però a l’entorn real el robot realitzava lents moviments en zig-zag. Per tant, es proposa un mètode nou, que utilitza els llocs amb més alta probabilitat, d’acord amb el seu mapa de probabilitats (belief). Atès que la propagació de les probabilitats en el POMCP és similar al funcionament d’un filtre de partícules (PF), proposem, a més, un mètode que utilitza un PF per mantenir el belief. El mètode de PF ha de manejar la manca d’observacions. Per tant, introduïm una funció del pes especial. Tots dos mètodes de creences tenen en compte el soroll dels sensors i actuadors, la detecció de falsos negatius i positius (per a un curt període de temps) i els obstacles dinàmics. Finalment, es presenta un mètode multi-agent distribuït cooperatiu, que fa ús de les anteriors funcions d’actualització de la creença (belief), i a més utilitza totes les observacions dels agents. En el proper pas, les ubicacions de cerca s’assignen mitjançant l’exploració de l’entorn de treball, tenint en compte la creença, la distància a la ubicació de cerca i si un altre agent ja buscarà a prop d’ella. En resum, les principals contribucions d’aquesta tesi són diversos mètodes per a la cerca i seguiment d’una persona en un entorn urbà amb un o més robots de serveis mòbils. Tots aquests mètodes han demostrat que funcionen a través d’un conjunt de simulacions i experiments en la entorn real dinàmics., [ES]: La búsqueda y el seguimiento de personas son comportamientos importantes para un robot móvil de servicio para poder asistir, buscar y ayudar a la gente, y en general, para localizar un objeto, animal o humano. Aunque la búsqueda puede parecer muy fácil para los humanos, para los robots no lo es, ya que requiere explorar, manejar ruido de sensores, enfrentarse con obstáculos dinámicos y la coordinación en el caso de haber más agentes. En esta tesis, presentamos diferentes métodos para buscar y seguir a una persona en un entorno urbano. Todos los métodos han sido probados excesivamente en simulación y en experimentos reales, usando uno o dos robots móviles de servicio, Tibi y Dabo. Los robots tienen localizadores láser, los cuales se usan para navegar, detectar obstáculos y detectar piernas. Ya que el principal enfoque en este trabajo son los métodes de buscar-y-seguir, utilizamos métodos existentes para la navigación del robot, la detección de personas y el reconecimiento del humano. Las primeras pruebas se hicieron con el juego de escondite, en el cual el robot aprende a buscar el ocultador. Concretamente, usamos un modelo MOMDP, donde la posición del buscador es completamente observable y la posición del ocultador lo es parcialmente. Como la complejidad computacional depende del número de estados, proponemos un método en línea jerárquica, que reduce el espacio de los estados agrupándolos. Aunque el método funcionó correctamente en simulación, en los experimentos reales los resultados no fueron satisfechos y el cálculo de la política en línea no fue suficientemente rápido. Para poder trabajar en áreas largas, espacio continuo y en línea, proponemos un enfoque, el Continuous Real-time POMCP (CR-POMCP), que hace simulaciones de Monte-Carlo para aprender la política. El método funcionó correctamente en simulación, pero con el robot real resultaba en movimientos lentos en forma zigzag. Por eso, otro método fue propuesto, el cual usa las posiciones con la probabilidad más alta según el mapa de probabilidades (belief). Como la propagación del belief se parece mucho a como funciona un PF, proponemos un método que usa un PF para mantener el belief. El método PF tiene que manejar la falta de observaciones y por eso introducimos una función del peso especial. Los dos métodos para actualizar el belief tienen en cuenta el ruido de los sensores y actuadores, falsos negativos y positivos (durante un periodo corto de tiempo) y obstáculos dinámicos. Finalmente, se presenta un método cooperativo y distribuido para multi agentes, que usa el mapa de probabilidades (belief), y éste usa todas las observaciones. Después, se asigna las posiciones de búsqueda a los agentes, explorando el entorno, y teniendo en cuenta: la probabilidad de la posición, la distancia a la posición y si otro agente ya buscará cerca del lugar. En resumen, la contribución más importante de esta tesis son diferentes métodos de búsqueda y seguimiento de una persona en un entorno urbano con uno o más robots de servicio móviles. Todos estos métodos fueron comprobados en simulación y en experimentación real., [NL]: Zoeken en traceren zijn belangrijke manieren om een mobiele servicerobot te helpen mensen, om te zoeken en te redden en, in het algemeen, om mobiele objecten, dieren of mensen te lokaliseren. En hoewel zoeken evident is voor de mens, is dit niet het geval voor robots. Het vereist namelijk verschillende vaardigeheden zoals verkennen, omgaan met ruis in de sensoren en dynamische obstakels en coördinatie in het geval van meerdere agenten. In deze thesis presenteren we verschillende methoden om een persoon te zoeken en te volgen (search-and-track) in een stedelijke omgeving. De methoden zijn eerst getest met simulaties en daarna met twee echte mobiele servicerobots, genaamd Tibi en Dabo. De robots hebben laser rangefinders om te navigeren en om obstakels en benen van mensen te detecteren. Omdat we ons richten op het zoeken en volgen van mensen gebruiken we bestaande methoden voor de robotnavigatie, detectie van personen en het herkennen van de gezochte persoon. De eerste testen gedaan met het spel hide-and-seek, waar de robot leert om de persoon te vinden. Een Mixed Observable Markov Decision Process (MOMDP) is gebruikt, waar de positie van de robot (zoeker) volledig waarneembaar is en die van de persoon (verstopper) gedeeltelijk. Omdat de berekeningscomplexiteit van het aantal staten afhangt, stellen we een hiërarchische online methode voor die de staatruimte verkleind door het groeperen van staten. Hoewel de methode goed werkt in simulatie, waren de resultaten van de experimenten met de robots minder goed. Verder was het online genereren van de politiek niet snel genoeg. Om in grote omgevingen te kunnen werken en continue staatruimte te gebruiken in real-time, hebben we de Continuous Real-time POMCP (CR-POMCP) voorgesteld. Dit algoritme gebruikt Monte-Carlo simulaties om de politiek (beste actie voor een bepaalde staat) te leren. De methode werkte goed in de simulaties, maar de robot maakte in de experimenten zigzaggende bewegingen. Om deze reden hebben we een nieuwe methode voorgesteld die gebruik maakt van een waarschijnlijkheidskaart (belief) over de lokatie van de persoon. Omdat de propagatie van de POMCP lijkt op hoe een Particle Filter (PF) werkt, stellen we ook een methode voor die een PF gebruikt om de belief bij te houden. De PF methode moet om kunnen gaan met missende observaties en we introduceren daarom een speciale gewichtsfunctie. Beide belief update methoden houden rekening met sensor en actuator ruis, incorrecte negatieve detecties, incorrecte positieve detecties (gedurende een korte tijd) en dynamische obstakels. Als laatst presenteren we een coöperatieve multi-agent methode die gebruik maakt van de genoemde belief update methoden, maar tevens gebruik maakt van de observaties van alle agenten. Vervolgens worden de zoeklocaties toegekend om de hele omgeving te verkennen waarbij rekening gehouden wordt met: de belief, de afstand tot de zoeklocatie en of een andere agent al dichtbij de lokatie gaat zoeken. Samenvattend zijn de belangrijkste bijdragen van deze thesis de verschillende methoden om personen te zoeken en te volgen in een stedelijke omgeving met één of meer mobiele servicerobots. Alle methoden zijn getest met simulaties en met experimenten met echte robots., This work has been supported by the Institut de Robòtica i Informàtica Industrial (IRI), Universitat Politècnica de Catalunya (UPC) and the following research projects: • The Collective Experience of Empathic Systems (CEEDs) [FP7-ICT-2009-5] (funded by the European Union). • RobTaskCoop: Cooperación robots humanos en áreas urbanas [DPI2010-17112] (funded by MINECO). • Rob-In-Coop: Interacción, aprendizaje y cooperación robot-humano en áreas urbanas [DPI2013-42458-P] (funded by MINECO)., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

People's adaptive side-by-side model evolved to accompany groups of people by social robots

  • Repiso, Ely
  • Garrell, Anaís
  • Sanfeliu, Alberto
The presented method implements a robot accompaniment in an adaptive side-by-side formation of a single person or a group of people. The method enhances our previous robot adaptive side-by-side behavior allowing the robot to accompany a group of people, not only one person. Adaptive means that the robot is capable to adjust its position and velocity to the behavior of the group being accompanied, without bothering other pedestrians in the environment, as well as facilitating the group navigation to avoid static and dynamic obstacles. Furthermore, the robot can deal with the random factor of human behavior in several situations. Firstly, if other people interfere in the path of the companions, the robot leaves space for the person of the group that has to avoid those other people, by approaching the other companion. Also, without invading any personal space. Secondly, if the people of the group changes their physical position inside the group formation, then the robot adapts to them dynamically by changing from the lateral position to the central position of the formation or otherwise. Thirdly, the robot adapts to changes in the velocity of people in the group and other people that interfere in the path of the group, in magnitude and orientation. Fourthly, the robot can deal with occlusions of one accompanied person by the other. The method has been validated using synthetic experiments and real-life experiments with our robot. Finally, we developed an user study comparing the method with a Wizard of Oz., Work supported by the Spanish Ministry of Science and Innovation under project ColRobTransp (DPI2016-78957-RAEI/FEDER EU), TERRINet (H2020-INFRAIA-2017-1-two-stage-730994), by the Spanish State Research Agency through the Mar´ıa de Maeztu Seal of Excellence to IRI (MDM-2016-0656). Ely Repiso is also suported by Spanish Ministry of Science and Innovation under a FPI-grant, BES-2014-067713
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Collaborative-AI: Social robots accompanying and approaching people

  • Sanfeliu, Alberto
  • Repiso, Ely
  • Garrell, Anaís
Trabajo presentado en el International First International Workshop on New Foundations for Human-Centered AI (NeHuAI), celebrado en Santiago de Compostela (España), el 4 de septiembre de 2020, Collaborative AI to approach or to accompany people using social robots will be a fundamental robotics field in the near future. If we desire to share and to collaborate with social robots during the development of our daily task, social robots should be able to develop Collaborative AI task, such us accompanying or approaching people. In this article, we will present the robot-people accompaniment and approaching missions through the four levels of abstractions of Collaborative AI systems and describe the main Collaborative AI functionalities that are needed for these missions. We will also show the system that we have developed for accompany one or two pedestrians and approaching on person by a robot in an urban space, Work supported by the Spanish Ministry of Science project ROCOTRANSP (PID2019-106702RB-C21-RAEI/FEDER EU) by Ministerio de Ciencia e Innovacion , the EU AI4EU project (H2020-ICT-2018-2-825619), by the Spanish State Research Agency through the María de Maeztu Seal of Excellence to IRI (MDM-2016-0656). Ely Repiso is suported by the FPI-grant, BES-2014-067713.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

MSClique: Multiple structure discovery through the maximum weighted clique problem

  • Sanromà Güell, Gerard
  • Peñate Sánchez, Adrián
  • Alquézar Mancho, René|||0000-0002-6420-0517
  • Serratosa Casanelles, Francesc|||0000-0001-6112-5913
  • Moreno-Noguer, Francesc
  • Andrade-Cetto, Juan|||0000-0002-6354-8941
  • González Ballester, Miguel Ángel
We present a novel approach for feature correspondence and multiple structure discovery in computer vision. In contrast to existing methods, we exploit the fact that point-sets on the same structure usually lie close to each other, thus forming clusters in the image. Given a pair of input images, we initially extract points of interest and extract hierarchical representations by agglomerative clustering. We use the maximum weighted clique problem to find the set of corresponding clusters with maximum number of inliers representing the multiple structures at the correct scales. Our method is parameter-free and only needs two sets of points along with their tentative correspondences, thus being extremely easy to use. We demonstrate the effectiveness of our method in multiple-structure fitting experiments in both publicly available and in-house datasets. As shown in the experiments, our approach finds a higher number of structures containing fewer outliers compared to state-of-the-art methods., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Efficient monocular pose estimation for complex 3D models

  • Rubio Romano, Antonio
  • Villamizar Vergel, Michael Alejandro
  • Ferraz Colomina, Luis
  • Peñate Sánchez, Adrián
  • Ramisa Ayats, Arnau
  • Simó Serra, Edgar
  • Sanfeliu Cortés, Alberto|||0000-0003-3868-9678
  • Moreno-Noguer, Francesc
We propose a robust and efficient method to estimate the pose of a camera with respect to complex 3D textured models of the environment that can potentially contain more than 100, 000 points. To tackle this problem we follow a top down approach where we combine high-level deep network classifiers with low level geometric approaches to come up with a solution that is fast, robust and accurate. Given an input image, we initially use a pre-trained deep network to compute a rough estimation of the camera pose. This initial estimate constrains the number of 3D model points that can be seen from the camera viewpoint. We then establish 3D-to-2D correspondences between these potentially visible points of the model and the 2D detected image features. Accurate pose estimation is finally obtained from the 2D-to-3D correspondences using a novel PnP algorithm that rejects outliers without the need to use a RANSAC strategy, and which is between 10 and 100 times faster than other methods that use it. Two real experimentsdealing with very large and complex 3D models demonstrate the effectiveness of the approach., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

From research to teaching: Integrating social robotics in engineering degrees

  • Bolea Monte, Yolanda|||0000-0002-7075-9878
  • Grau Saldes, Antoni|||0000-0003-4112-3325
  • Sanfeliu Cortés, Alberto|||0000-0003-3868-9678
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Filtering graphs to check isomorphism and extracting mapping by using the Conductance Electrical Model

  • Igelmo Ganzo, Manuel
  • Sanfeliu Cortés, Alberto|||0000-0003-3868-9678
© 2016. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, This paper presents a new method of filtering graphs to check exact graph isomorphism and extracting their mapping. Each graph is modeled by a resistive electrical circuit using the Conductance Electrical Model (CEM). By using this model, a necessary condition to check the isomorphism of two graphs is that their equivalent resistances have the same values, but this is not enough, and we have to look for their mapping to find the sufficient condition. We can compute the isomorphism between two graphs in O(N-3), where N is the order of the graph, if their star resistance values are different, otherwise the computational time is exponential, but only with respect to the number of repeated star resistance values, which usually is very small. We can use this technique to filter graphs that are not isomorphic and in case that they are, we can obtain their node mapping. A distinguishing feature over other methods is that, even if there exists repeated star resistance values, we can extract a partial node mapping (of all the nodes except the repeated ones and their neighbors) in O(N-3). The paper presents the method and its application to detect isomorphic graphs in two well know graph databases, where some graphs have more than 600 nodes. (C) 2016 Elsevier Ltd. All rights reserved.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Interactive multiple object learning with scanty human supervision

  • Villamizar Vergel, Michael Alejandro
  • Garrell Zulueta, Anais|||0000-0002-4629-0723
  • Sanfeliu Cortés, Alberto|||0000-0003-3868-9678
  • Moreno-Noguer, Francesc
© 2016. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, We present a fast and online human-robot interaction approach that progressively learns multiple object classifiers using scanty human supervision. Given an input video stream recorded during the human robot interaction, the user just needs to annotate a small fraction of frames to compute object specific classifiers based on random ferns which share the same features. The resulting methodology is fast (in a few seconds, complex object appearances can be learned), versatile (it can be applied to unconstrained scenarios), scalable (real experiments show we can model up to 30 different object classes), and minimizes the amount of human intervention by leveraging the uncertainty measures associated to each classifier.; We thoroughly validate the approach on synthetic data and on real sequences acquired with a mobile platform in indoor and outdoor scenarios containing a multitude of different objects. We show that with little human assistance, we are able to build object classifiers robust to viewpoint changes, partial occlusions, varying lighting and cluttered backgrounds. (C) 2016 Elsevier Inc. All rights reserved., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Teaching robot’s proactive behavior using human assistance

  • Garrell Zulueta, Anais|||0000-0002-4629-0723
  • Villamizar Vergel, Michael Alejandro
  • Moreno-Noguer, Francesc
  • Sanfeliu Cortés, Alberto|||0000-0003-3868-9678
The final publication is available at link.springer.com, In recent years, there has been a growing interest in enabling autonomous social robots to interact with people. However, many questions remain unresolved regarding the social capabilities robots should have in order to perform this interaction in an ever more natural manner. In this paper, we tackle this problem through a comprehensive study of various topics involved in the interaction between a mobile robot and untrained human volunteers for a variety of tasks. In particular, this work presents a framework that enables the robot to proactively approach people and establish friendly interaction. To this end, we provided the robot with several perception and action skills, such as that of detecting people, planning an approach and communicating the intention to initiate a conversation while expressing an emotional status.We also introduce an interactive learning system that uses the person’s volunteered assistance to incrementally improve the robot’s perception skills. As a proof of concept, we focus on the particular task of online face learning and recognition. We conducted real-life experiments with our Tibi robot to validate the framework during the interaction process. Within this study, several surveys and user studies have been realized to reveal the social acceptability of the robot within the context of different tasks., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Interactive multiple object learning with scanty human supervision

  • Villamizar Vergel, Michael Alejandro
  • Garrell Zulueta, Anais
  • Sanfeliu Cortés, Alberto
  • Moreno-Noguer, Francesc
© 2016. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, We present a fast and online human-robot interaction approach that progressively learns multiple object classifiers using scanty human supervision. Given an input video stream recorded during the human robot interaction, the user just needs to annotate a small fraction of frames to compute object specific classifiers based on random ferns which share the same features. The resulting methodology is fast (in a few seconds, complex object appearances can be learned), versatile (it can be applied to unconstrained scenarios), scalable (real experiments show we can model up to 30 different object classes), and minimizes the amount of human intervention by leveraging the uncertainty measures associated to each classifier.; We thoroughly validate the approach on synthetic data and on real sequences acquired with a mobile platform in indoor and outdoor scenarios containing a multitude of different objects. We show that with little human assistance, we are able to build object classifiers robust to viewpoint changes, partial occlusions, varying lighting and cluttered backgrounds. (C) 2016 Elsevier Inc. All rights reserved., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Filtering graphs to check isomorphism and extracting mapping by using the Conductance Electrical Model

  • Igelmo Ganzo, Manuel
  • Sanfeliu Cortés, Alberto
© 2016. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, This paper presents a new method of filtering graphs to check exact graph isomorphism and extracting their mapping. Each graph is modeled by a resistive electrical circuit using the Conductance Electrical Model (CEM). By using this model, a necessary condition to check the isomorphism of two graphs is that their equivalent resistances have the same values, but this is not enough, and we have to look for their mapping to find the sufficient condition. We can compute the isomorphism between two graphs in O(N-3), where N is the order of the graph, if their star resistance values are different, otherwise the computational time is exponential, but only with respect to the number of repeated star resistance values, which usually is very small. We can use this technique to filter graphs that are not isomorphic and in case that they are, we can obtain their node mapping. A distinguishing feature over other methods is that, even if there exists repeated star resistance values, we can extract a partial node mapping (of all the nodes except the repeated ones and their neighbors) in O(N-3). The paper presents the method and its application to detect isomorphic graphs in two well know graph databases, where some graphs have more than 600 nodes. (C) 2016 Elsevier Ltd. All rights reserved., Postprint (author's draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Teaching robot’s proactive behavior using human assistance

  • Garrell Zulueta, Anais
  • Villamizar Vergel, Michael Alejandro
  • Moreno-Noguer, Francesc
  • Sanfeliu Cortés, Alberto
The final publication is available at link.springer.com, In recent years, there has been a growing interest in enabling autonomous social robots to interact with people. However, many questions remain unresolved regarding the social capabilities robots should have in order to perform this interaction in an ever more natural manner. In this paper, we tackle this problem through a comprehensive study of various topics involved in the interaction between a mobile robot and untrained human volunteers for a variety of tasks. In particular, this work presents a framework that enables the robot to proactively approach people and establish friendly interaction. To this end, we provided the robot with several perception and action skills, such as that of detecting people, planning an approach and communicating the intention to initiate a conversation while expressing an emotional status.We also introduce an interactive learning system that uses the person’s volunteered assistance to incrementally improve the robot’s perception skills. As a proof of concept, we focus on the particular task of online face learning and recognition. We conducted real-life experiments with our Tibi robot to validate the framework during the interaction process. Within this study, several surveys and user studies have been realized to reveal the social acceptability of the robot within the context of different tasks., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

From research to teaching: Integrating social robotics in engineering degrees

Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Efficient monocular pose estimation for complex 3D models

  • Rubio Romano, Antonio
  • Villamizar Vergel, Michael Alejandro
  • Ferraz Colomina, Luis
  • Peñate Sánchez, Adrián
  • Ramisa Ayats, Arnau
  • Simó Serra, Edgar
  • Sanfeliu Cortés, Alberto
  • Moreno-Noguer, Francesc
We propose a robust and efficient method to estimate the pose of a camera with respect to complex 3D textured models of the environment that can potentially contain more than 100, 000 points. To tackle this problem we follow a top down approach where we combine high-level deep network classifiers with low level geometric approaches to come up with a solution that is fast, robust and accurate. Given an input image, we initially use a pre-trained deep network to compute a rough estimation of the camera pose. This initial estimate constrains the number of 3D model points that can be seen from the camera viewpoint. We then establish 3D-to-2D correspondences between these potentially visible points of the model and the 2D detected image features. Accurate pose estimation is finally obtained from the 2D-to-3D correspondences using a novel PnP algorithm that rejects outliers without the need to use a RANSAC strategy, and which is between 10 and 100 times faster than other methods that use it. Two real experimentsdealing with very large and complex 3D models demonstrate the effectiveness of the approach., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

MSClique: Multiple structure discovery through the maximum weighted clique problem

  • Sanromà Güell, Gerard
  • Peñate Sánchez, Adrián
  • Alquézar Mancho, René
  • Serratosa Casanelles, Francesc
  • Moreno-Noguer, Francesc
  • Andrade-Cetto, Juan
  • González Ballester, Miguel Ángel
We present a novel approach for feature correspondence and multiple structure discovery in computer vision. In contrast to existing methods, we exploit the fact that point-sets on the same structure usually lie close to each other, thus forming clusters in the image. Given a pair of input images, we initially extract points of interest and extract hierarchical representations by agglomerative clustering. We use the maximum weighted clique problem to find the set of corresponding clusters with maximum number of inliers representing the multiple structures at the correct scales. Our method is parameter-free and only needs two sets of points along with their tentative correspondences, thus being extremely easy to use. We demonstrate the effectiveness of our method in multiple-structure fitting experiments in both publicly available and in-house datasets. As shown in the experiments, our approach finds a higher number of structures containing fewer outliers compared to state-of-the-art methods., Peer Reviewed, Postprint (published version)