Capítols de llibre
http://hdl.handle.net/2117/2251
2015-07-31T01:26:37ZEffects of human-machine integration on the construction of identity
http://hdl.handle.net/2117/26380
Effects of human-machine integration on the construction of identity
Ballesté, Francesc; Torras, Carme
Recent developments in social robotics, intelligent prosthetics, brain-computer interfaces, and implants pose new questions as to the effects of technology on identity, society, and the future of humankind. The authors’ standpoint is that such effects cannot be studied separately from their social/cultural context, and thus, this chapter begins by reviewing the existing approaches to the social construction of reality, placing special emphasis on language and its limitations to describe the future. Then, it focuses on the body as the place where the human-machine integration occurs, and describes four levels at which the notion of cyborg has been analyzed in anthropological studies: symbolic, physical, as a permeable layer between nature and culture, and as an intermediate step towards a higher-order existence. The chapter ends up with a word of caution in relation to technological determinism stemming from STS (Science and Technology Studies), as well as the need to establish Relevant Social Groups (RSG) with well-founded criteria that join scientific and sociological academics under a multidisciplinary approach.
2013-01-01T00:00:00ZRobot interactive learning through human assistance
http://hdl.handle.net/2117/23219
Robot interactive learning through human assistance
Ferrer Mínguez, Gonzalo; Garrell Zulueta, Anais; Villamizar Vergel, Michael Alejandro; Huerta Casado, Iván; Sanfeliu Cortés, Alberto
2013-01-01T00:00:00ZAforismo 74: no te pongas intratable con quienes fuiste agradable
http://hdl.handle.net/2117/15545
Aforismo 74: no te pongas intratable con quienes fuiste agradable
Torras, Carme
Las necedades siempre sorprenden a todos, pues el necio es audaz en atrevimiento. Su torpeza le impide advertir que desentonará con su conducta, y eso mismo le quita la vergüenza de hacer el ridículo.
En cambio, el hombre de cordura entra con gran cuidado. Su escudo es la advertencia y el recato, y va observando y descubriendo lo que hay en el ambiente, para actuar con el mínimo de riesgo. Todo atrevimiento que carezca de reflexión está condenado al despeño, aunque tal vez lo salve el azar venturoso. Conviene nadar con cuidado en aguas que se temen hondas: ve probando poco a poco con sagacidad y ganando terreno con prudencia. Hay grandes confusiones hoy en el trato humano: conviene ir siempre tirando sondas que vayan orientándote.
2011-01-01T00:00:00ZLocal boosted features for pedestrian detection
http://hdl.handle.net/2117/9181
Local boosted features for pedestrian detection
Villamizar Vergel, Michael Alejandro; Sanfeliu Cortés, Alberto; Andrade-Cetto, Juan
The present paper addresses pedestrian detection using local boosted features that are learned from a small set of training images. Our contribution is to use two boosting steps. The first one learns discriminant local features corresponding to pedestrian parts and the second one selects and combines these boosted features into a robust class classifier. In contrast of other works, our features are based on local differences over Histograms of Oriented Gradients (HoGs). Experiments carried out to a public dataset of pedestrian images show good performance with high classification rates
2009-06-12T00:00:00ZA recursive embedding approach to median graph computation
http://hdl.handle.net/2117/7811
A recursive embedding approach to median graph computation
Ferrer Sumsi, Miquel; Valveny, Ernest; Bunke, Horst
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.
2009-06-12T00:00:00ZGraph-based k-means clustering: A comparison of the set versus the generalized median graph
http://hdl.handle.net/2117/7485
Graph-based k-means clustering: A comparison of the set versus the generalized median graph
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Bardaji Goikoetxea, Itziar; Bunke, Horst
In this paper we propose the application of the generalized median graph in a graph-based k-means clustering algorithm. In the graph-based k-means algorithm, the centers of the clusters have been traditionally represented using the set median graph. We propose an approximate method for the generalized median graph computation that allows to use it to represent the centers of the clusters. Experiments on three databases show that using the generalized median graph as the clusters representative yields better results than the set median graph.
2009-01-01T00:00:00Z3D object reconstruction from Swissranger sensor data using a spring-mass model
http://hdl.handle.net/2117/7110
3D object reconstruction from Swissranger sensor data using a spring-mass model
Dellen, Babette; Alenyà Ribas, Guillem; Foix Salmerón, Sergi; Torras, Carme
We register close-range depth images of objects using a Swissranger sensor and apply a spring-mass model for 3D object reconstruction. The Swissranger sensor delivers depth images in real time which have, compared with other types of sensors, such as laser scanners, a lower resolution and are afflicted with larger uncertainties.
To reduce noise and remove outliers in the data, we treat the point cloud as a system of interacting masses connected via elastic forces. We investigate two models, one with and one without a surface-topology preserving interaction strength. The algorithm is applied to synthetic and real Swissranger sensor data, demonstrating
the feasibility of the approach. This method represents a preliminary step before fitting higher-level surface descriptors to the data, which will be required to define object-action complexes (OACS) for robot
applications.
2009-01-01T00:00:00ZSimulating dynamical systems for early vision
http://hdl.handle.net/2117/7108
Simulating dynamical systems for early vision
Dellen, Babette; Wörgötter, Florentin
We propose a novel algorithm for stereo matching using a dynamical systems approach. The stereo correspondence problem is first formulated as an energy minimization problem. From the energy function, we derive a system of differential equations describing the corresponding dynamical system of interacting elements, which
we solve using numerical integration. Optimization is introduced by means of a damping term and a noise term, an idea similar to simulated annealing. The algorithm is tested on the Middlebury stereo benchmark.
2009-01-01T00:00:00ZMedian graph computation by means of a genetic approach based on minimum common supergraph and maximum common subraph
http://hdl.handle.net/2117/7107
Median graph computation by means of a genetic approach based on minimum common supergraph and maximum common subraph
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc
Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set.
However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present a new genetic algorithm for the median graph computation.
A set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity, show that we obtain good
approximations of the median graph. Finally, we use the median graph in a real nearest neighbour classification showing that it leaves the box of the only-theoretical concepts and demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs.
2009-01-01T00:00:00ZImproving background subtraction based on a casuistry of colour-motion segmentation problems
http://hdl.handle.net/2117/2689
Improving background subtraction based on a casuistry of colour-motion segmentation problems
Huerta Casado, Iván; Rowe, Daniel; Mozerov, Mikhail; Gonzàlez, Jordi
The basis for the high-level interpretation of observed patterns of human motion still relies on motion segmentation. Popular approaches based on background subtraction use colour information to model each pixel during a training period. Nevertheless, a deep analysis on colour segmentation problems demonstrates that colour segmentation is not enough to detect all foreground objects in the image, for instance when there is a lack of colour necessary to build the background model. In this paper, our segmentation procedure is based not only on colour, but also on intensity information. Consequently, the intensity model enhances segmentation when the use of colour is not feasible. Experimental results demonstrate the feasibility of our approach.
2007-01-01T00:00:00Z