| Home | [211–220] << 221 222 223 224 225 226 227 228 >> |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Alejandro Gonzalez Alzate; Sebastian Ramos; David Vazquez; Antonio Lopez; Jaume Amores | ||||
| Title | Spatiotemporal Stacked Sequential Learning for Pedestrian Detection | Type | Conference Article | ||
| Year | 2015 | Publication | Pattern Recognition and Image Analysis, Proceedings of 7th Iberian Conference , ibPRIA 2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 3-12 | ||
Keywords  |
SSL; Pedestrian Detection | ||||
| Abstract | Pedestrian classifiers decide which image windows contain a pedestrian. In practice, such classifiers provide a relatively high response at neighbor windows overlapping a pedestrian, while the responses around potential false positives are expected to be lower. An analogous reasoning applies for image sequences. If there is a pedestrian located within a frame, the same pedestrian is expected to appear close to the same location in neighbor frames. Therefore, such a location has chances of receiving high classification scores during several frames, while false positives are expected to be more spurious. In this paper we propose to exploit such correlations for improving the accuracy of base pedestrian classifiers. In particular, we propose to use two-stage classifiers which not only rely on the image descriptors required by the base classifiers but also on the response of such base classifiers in a given spatiotemporal neighborhood. More specifically, we train pedestrian classifiers using a stacked sequential learning (SSL) paradigm. We use a new pedestrian dataset we have acquired from a car to evaluate our proposal at different frame rates. We also test on a well known dataset: Caltech. The obtained results show that our SSL proposal boosts detection accuracy significantly with a minimal impact on the computational cost. Interestingly, SSL improves more the accuracy at the most dangerous situations, i.e. when a pedestrian is close to the camera. | ||||
| Address | Santiago de Compostela; España; June 2015 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | ACDC | Expedition | Conference | IbPRIA | |
| Notes | ADAS; 600.057; 600.054; 600.076 | Approved | no | ||
| Call Number | GRV2015; ADAS @ adas @ GRV2015 | Serial | 2454 | ||
| Permanent link to this record | |||||
| Author | Eloi Puertas; Sergio Escalera; Oriol Pujol | ||||
| Title | Generalized Multi-scale Stacked Sequential Learning for Multi-class Classification | Type | Journal Article | ||
| Year | 2015 | Publication | Pattern Analysis and Applications | Abbreviated Journal | PAA |
| Volume | 18 | Issue | 2 | Pages | 247-261 |
| Keywords |
Stacked sequential learning; Multi-scale; Error-correct output codes (ECOC); Contextual classification | ||||
| Abstract | In many classification problems, neighbor data labels have inherent sequential relationships. Sequential learning algorithms take benefit of these relationships in order to improve generalization. In this paper, we revise the multi-scale sequential learning approach (MSSL) for applying it in the multi-class case (MMSSL). We introduce the error-correcting output codesframework in the MSSL classifiers and propose a formulation for calculating confidence maps from the margins of the base classifiers. In addition, we propose a MMSSL compression approach which reduces the number of features in the extended data set without a loss in performance. The proposed methods are tested on several databases, showing significant performance improvement compared to classical approaches. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1433-7541 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | HuPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ PEP2013 | Serial | 2251 | ||
| Permanent link to this record | |||||
| Author | Carlo Gatta; Eloi Puertas; Oriol Pujol | ||||
| Title | Multi-Scale Stacked Sequential Learning | Type | Journal Article | ||
| Year | 2011 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 44 | Issue | 10-11 | Pages | 2414-2416 |
| Keywords |
Stacked sequential learning; Multiscale; Multiresolution; Contextual classification | ||||
| Abstract | One of the most widely used assumptions in supervised learning is that data is independent and identically distributed. This assumption does not hold true in many real cases. Sequential learning is the discipline of machine learning that deals with dependent data such that neighboring examples exhibit some kind of relationship. In the literature, there are different approaches that try to capture and exploit this correlation, by means of different methodologies. In this paper we focus on meta-learning strategies and, in particular, the stacked sequential learning approach. The main contribution of this work is two-fold: first, we generalize the stacked sequential learning. This generalization reflects the key role of neighboring interactions modeling. Second, we propose an effective and efficient way of capturing and exploiting sequential correlations that takes into account long-range interactions by means of a multi-scale pyramidal decomposition of the predicted labels. Additionally, this new method subsumes the standard stacked sequential learning approach. We tested the proposed method on two different classification tasks: text lines classification in a FAQ data set and image classification. Results on these tasks clearly show that our approach outperforms the standard stacked sequential learning. Moreover, we show that the proposed method allows to control the trade-off between the detail and the desired range of the interactions. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MILAB;HuPBA | Approved | no | ||
| Call Number | Admin @ si @ GPP2011 | Serial | 1802 | ||
| Permanent link to this record | |||||
| Author | Aura Hernandez-Sabate; Lluis Albarracin; F. Javier Sanchez | ||||
| Title | Graph-Based Problem Explorer: A Software Tool to Support Algorithm Design Learning While Solving the Salesperson Problem | Type | Journal | ||
| Year | 2020 | Publication | Mathematics | Abbreviated Journal | MATH |
| Volume | 20 | Issue | 8(9) | Pages | 1595 |
| Keywords |
STEM education; Project-based learning; Coding; software tool | ||||
| Abstract | In this article, we present a sequence of activities in the form of a project in order to promote
learning on design and analysis of algorithms. The project is based on the resolution of a real problem, the salesperson problem, and it is theoretically grounded on the fundamentals of mathematical modelling. In order to support the students’ work, a multimedia tool, called Graph-based Problem Explorer (GbPExplorer), has been designed and refined to promote the development of computer literacy in engineering and science university students. This tool incorporates several modules to allow coding different algorithmic techniques solving the salesman problem. Based on an educational design research along five years, we observe that working with GbPExplorer during the project provides students with the possibility of representing the situation to be studied in the form of graphs and analyze them from a computational point of view. |
||||
| Address | September 2020 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | IAM; ISE | Approved | no | ||
| Call Number | Admin @ si @ | Serial | 3722 | ||
| Permanent link to this record | |||||
| Author | Cristhian A. Aguilera-Carrasco; Cristhian Aguilera; Cristobal A. Navarro; Angel Sappa | ||||
| Title | Fast CNN Stereo Depth Estimation through Embedded GPU Devices | Type | Journal Article | ||
| Year | 2020 | Publication | Sensors | Abbreviated Journal | SENS |
| Volume | 20 | Issue | 11 | Pages | 3249 |
| Keywords |
stereo matching; deep learning; embedded GPU | ||||
| Abstract | Current CNN-based stereo depth estimation models can barely run under real-time constraints on embedded graphic processing unit (GPU) devices. Moreover, state-of-the-art evaluations usually do not consider model optimization techniques, being that it is unknown what is the current potential on embedded GPU devices. In this work, we evaluate two state-of-the-art models on three different embedded GPU devices, with and without optimization methods, presenting performance results that illustrate the actual capabilities of embedded GPU devices for stereo depth estimation. More importantly, based on our evaluation, we propose the use of a U-Net like architecture for postprocessing the cost-volume, instead of a typical sequence of 3D convolutions, drastically augmenting the runtime speed of current models. In our experiments, we achieve real-time inference speed, in the range of 5–32 ms, for 1216 × 368 input stereo images on the Jetson TX2, Jetson Xavier, and Jetson Nano embedded devices. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MSIAU; 600.122 | Approved | no | ||
| Call Number | Admin @ si @ AAN2020 | Serial | 3428 | ||
| Permanent link to this record | |||||
| Author | Mikhail Mozerov; Joost Van de Weijer | ||||
| Title | One-view occlusion detection for stereo matching with a fully connected CRF model | Type | Journal Article | ||
| Year | 2019 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 28 | Issue | 6 | Pages | 2936-2947 |
| Keywords |
Stereo matching; energy minimization; fully connected MRF model; geodesic distance filter | ||||
| Abstract | In this paper, we extend the standard belief propagation (BP) sequential technique proposed in the tree-reweighted sequential method [15] to the fully connected CRF models with the geodesic distance affinity. The proposed method has been applied to the stereo matching problem. Also a new approach to the BP marginal solution is proposed that we call one-view occlusion detection (OVOD). In contrast to the standard winner takes all (WTA) estimation, the proposed OVOD solution allows to find occluded regions in the disparity map and simultaneously improve the matching result. As a result we can perform only
one energy minimization process and avoid the cost calculation for the second view and the left-right check procedure. We show that the OVOD approach considerably improves results for cost augmentation and energy minimization techniques in comparison with the standard one-view affinity space implementation. We apply our method to the Middlebury data set and reach state-ofthe-art especially for median, average and mean squared error metrics. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | LAMP; 600.098; 600.109; 602.133; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ MoW2019 | Serial | 3221 | ||
| Permanent link to this record | |||||
| Author | Daniel Hernandez; Juan Carlos Moure; Toni Espinosa; Alejandro Chacon; David Vazquez; Antonio Lopez | ||||
| Title | Real-time 3D Reconstruction for Autonomous Driving via Semi-Global Matching | Type | Conference Article | ||
| Year | 2016 | Publication | GPU Technology Conference | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords |
Stereo; Autonomous Driving; GPU; 3d reconstruction | ||||
| Abstract | Robust and dense computation of depth information from stereo-camera systems is a computationally demanding requirement for real-time autonomous driving. Semi-Global Matching (SGM) [1] approximates heavy-computation global algorithms results but with lower computational complexity, therefore it is a good candidate for a real-time implementation. SGM minimizes energy along several 1D paths across the image. The aim of this work is to provide a real-time system producing reliable results on energy-efficient hardware. Our design runs on a NVIDIA Titan X GPU at 104.62 FPS and on a NVIDIA Drive PX at 6.7 FPS, promising for real-time platforms | ||||
| Address | Silicon Valley; San Francisco; USA; April 2016 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | GTC | ||
| Notes | ADAS; 600.085; 600.082; 600.076 | Approved | no | ||
| Call Number | ADAS @ adas @ HME2016 | Serial | 2738 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Hichem Sahbi | ||||
| Title | Stochastic Graphlet Embedding | Type | Journal Article | ||
| Year | 2018 | Publication | IEEE Transactions on Neural Networks and Learning Systems | Abbreviated Journal | TNNLS |
| Volume | Issue | Pages | 1-14 | ||
| Keywords |
Stochastic graphlets; Graph embedding; Graph classification; Graph hashing; Betweenness centrality | ||||
| Abstract | Graph-based methods are known to be successful in many machine learning and pattern classification tasks. These methods consider semi-structured data as graphs where nodes correspond to primitives (parts, interest points, segments,
etc.) and edges characterize the relationships between these primitives. However, these non-vectorial graph data cannot be straightforwardly plugged into off-the-shelf machine learning algorithms without a preliminary step of – explicit/implicit –graph vectorization and embedding. This embedding process should be resilient to intra-class graph variations while being highly discriminant. In this paper, we propose a novel high-order stochastic graphlet embedding (SGE) that maps graphs into vector spaces. Our main contribution includes a new stochastic search procedure that efficiently parses a given graph and extracts/samples unlimitedly high-order graphlets. We consider these graphlets, with increasing orders, to model local primitives as well as their increasingly complex interactions. In order to build our graph representation, we measure the distribution of these graphlets into a given graph, using particular hash functions that efficiently assign sampled graphlets into isomorphic sets with a very low probability of collision. When combined with maximum margin classifiers, these graphlet-based representations have positive impact on the performance of pattern comparison and recognition as corroborated through extensive experiments using standard benchmark databases. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG; 602.167; 602.168; 600.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ DuS2018 | Serial | 3225 | ||
| Permanent link to this record | |||||
| Author | Jaume Gibert; Ernest Valveny; Horst Bunke | ||||
| Title | Graph Embedding in Vector Spaces by Node Attribute Statistics | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 9 | Pages | 3072-3083 |
| Keywords |
Structural pattern recognition; Graph embedding; Data clustering; Graph classification | ||||
| Abstract | Graph-based representations are of broad use and applicability in pattern recognition. They exhibit, however, a major drawback with regards to the processing tools that are available in their domain. Graphembedding into vectorspaces is a growing field among the structural pattern recognition community which aims at providing a feature vector representation for every graph, and thus enables classical statistical learning machinery to be used on graph-based input patterns. In this work, we propose a novel embedding methodology for graphs with continuous nodeattributes and unattributed edges. The approach presented in this paper is based on statistics of the node labels and the edges between them, based on their similarity to a set of representatives. We specifically deal with an important issue of this methodology, namely, the selection of a suitable set of representatives. In an experimental evaluation, we empirically show the advantages of this novel approach in the context of different classification problems using several databases of graphs. | ||||
| 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 | 0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GVB2012a | Serial | 1992 | ||
| Permanent link to this record | |||||
| Author | Jaume Gibert; Ernest Valveny; Horst Bunke | ||||
| Title | Feature Selection on Node Statistics Based Embedding of Graphs | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 33 | Issue | 15 | Pages | 1980–1990 |
| Keywords |
Structural pattern recognition; Graph embedding; Feature ranking; PCA; Graph classification | ||||
| Abstract | Representing a graph with a feature vector is a common way of making statistical machine learning algorithms applicable to the domain of graphs. Such a transition from graphs to vectors is known as graphembedding. A key issue in graphembedding is to select a proper set of features in order to make the vectorial representation of graphs as strong and discriminative as possible. In this article, we propose features that are constructed out of frequencies of node label representatives. We first build a large set of features and then select the most discriminative ones according to different ranking criteria and feature transformation algorithms. On different classification tasks, we experimentally show that only a small significant subset of these features is needed to achieve the same classification rates as competing to state-of-the-art methods. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GVB2012b | Serial | 1993 | ||
| Permanent link to this record | |||||
| Author | Gemma Sanchez; Josep Llados; Enric Marti | ||||
| Title | Segmentation and analysis of linial texture in plans | Type | Conference Article | ||
| Year | 1997 | Publication | Intelligence Artificielle et Complexité. | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords |
Structural Texture, Voronoi, Hierarchical Clustering, String Matching. | ||||
| Abstract | The problem of texture segmentation and interpretation is one of the main concerns in the field of document analysis. Graphical documents often contain areas characterized by a structural texture whose recognition allows both the document understanding, and its storage in a more compact way. In this work, we focus on structural linial textures of regular repetition contained in plan documents. Starting from an atributed graph which represents the vectorized input image, we develop a method to segment textured areas and recognize their placement rules. We wish to emphasize that the searched textures do not follow a predefined pattern. Minimal closed loops of the input graph are computed, and then hierarchically clustered. In this hierarchical clustering, a distance function between two closed loops is defined in terms of their areas difference and boundary resemblance computed by a string matching procedure. Finally it is noted that, when the texture consists of isolated primitive elements, the same method can be used after computing a Voronoi Tesselation of the input graph. | ||||
| Address | Paris, France | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Paris | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | AERFAI | ||
| Notes | DAG;IAM; | Approved | no | ||
| Call Number | IAM @ iam @ SLM1997 | Serial | 1649 | ||
| Permanent link to this record | |||||
| Author | Fernando Vilariño; Debora Gil; Petia Radeva | ||||
| Title | A Novel FLDA Formulation for Numerical Stability Analysis | Type | Book Chapter | ||
| Year | 2004 | Publication | Recent Advances in Artificial Intelligence Research and Development | Abbreviated Journal | |
| Volume | 113 | Issue | Pages | 77-84 | |
| Keywords |
Supervised Learning; Linear Discriminant Analysis; Numerical Stability; Computer Vision | ||||
| Abstract | Fisher Linear Discriminant Analysis (FLDA) is one of the most popular techniques used in classification applying dimensional reduction. The numerical scheme involves the inversion of the within-class scatter matrix, which makes FLDA potentially ill-conditioned when it becomes singular. In this paper we present a novel explicit formulation of FLDA in terms of the eccentricity ratio and eigenvector orientations of the within-class scatter matrix. An analysis of this function will characterize those situations where FLDA response is not reliable because of numerical instability. This can solve common situations of poor classification performance in computer vision. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | IOS Press | Place of Publication | Editor | J. Vitrià, P. Radeva and I. Aguiló | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-58603-466-5 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MV;IAM;MILAB;SIAI | Approved | no | ||
| Call Number | IAM @ iam @ VGR2004 | Serial | 1663 | ||
| Permanent link to this record | |||||
| Author | Partha Pratim Roy; Umapada Pal; Josep Llados | ||||
| Title | Touching Text Character Localization in Graphical Documents using SIFT | Type | Book Chapter | ||
| Year | 2010 | Publication | Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers | Abbreviated Journal | |
| Volume | 6020 | Issue | Pages | 199-211 | |
| Keywords |
Support Vector Machine; Text Component; Graphical Line; Document Image; Scale Invariant Feature Transform | ||||
| Abstract | Interpretation of graphical document images is a challenging task as it requires proper understanding of text/graphics symbols present in such documents. Difficulties arise in graphical document recognition when text and symbol overlapped/touched. Intersection of text and symbols with graphical lines and curves occur frequently in graphical documents and hence separation of such symbols is very difficult.
Several pattern recognition and classification techniques exist to recognize isolated text/symbol. But, the touching/overlapping text and symbol recognition has not yet been dealt successfully. An interesting technique, Scale Invariant Feature Transform (SIFT), originally devised for object recognition can take care of overlapping problems. Even if SIFT features have emerged as a very powerful object descriptors, their employment in graphical documents context has not been investigated much. In this paper we present the adaptation of the SIFT approach in the context of text character localization (spotting) in graphical documents. We evaluate the applicability of this technique in such documents and discuss the scope of improvement by combining some state-of-the-art approaches. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-13727-3 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ RPL2010c | Serial | 2408 | ||
| Permanent link to this record | |||||
| Author | Enrique Cabello; Cristina Conde; Angel Serrano; Licesio Rodriguez; David Vazquez | ||||
| Title | Empleo de sistemas biométricos para el reconocimiento de personas en aeropuertos | Type | Journal Article | ||
| Year | 2006 | Publication | Instituto Universitario de Investigación sobre Seguridad Interior (IUSI 2006) | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords |
Surveillance; Face detection; Face recognition | ||||
| Abstract | El presente proyecto se desarrolló a lo largo del año 2005, probando un prototipo de un sistema de verificación facial con imágenes extraídas de las cámaras de video vigilancia del aeropuerto de Barajas. Se diseñaron varios experimentos, agrupados en dos clases. En el primer tipo, el sistema es entrenado con imágenes obtenidas en condiciones de laboratorio y luego probado con imágenes extraídas de las cámaras de video vigilancia del aeropuerto de Barajas. En el segundo caso, tanto las imágenes de entrenamiento como las de prueba corresponden a imágenes extraídas de Barajas. Se ha desarrollado un sistema completo, que incluye adquisición y digitalización de las imágenes, localización y recorte de las caras en escena, verificación de sujetos y obtención de resultados. Los resultados muestran, que, en general, un sistema de verificación facial basado en imágenes puede ser una ayuda a un operario que deba estar vigilando amplias zonas. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | invisible;ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ CCS2006a | Serial | 1672 | ||
| Permanent link to this record | |||||
| Author | David Vazquez; Enrique Cabello | ||||
| Title | Empleo de sistemas biométricos faciales aplicados al reconocimiento de personas en aeropuertos | Type | Report | ||
| Year | 2007 | Publication | Ingeniería Técnica en Informática de Sistemas | Abbreviated Journal | URJC |
| Volume | Issue | Pages | |||
| Keywords |
Surveillance; Face detection; Face recognition | ||||
| Abstract | El presente proyecto se desarrolló a lo largo del año 2005 y 2006, probando un prototipo de un sistema de verificación facial con imágenes extraídas de las cámaras de video-vigilancia del aeropuerto de Barajas. Se diseñaron varios experimentos, agrupados en dos clases. En el primer tipo, el sistema es entre- nado con imágenes obtenidas en condiciones de laboratorio y luego probado con imágenes extraídas de las cámaras de video-vigilancia del aeropuerto de Barajas. En el segundo caso, tanto las imágenes de entrenamiento como las de prueba corresponden a imágenes extraídas de Barajas.
Se ha desarrollado un sistema completo, que incluye adquisición y digitalización de las imágenes, localización y recorte de las caras en escena, verificación de sujetos y obtención de resultados. Los resultados muestran que, en general, un sistema de verificación facial basado en imágenes puede ser una valiosa ayuda a un operario que deba estar vigilando amplias zonas. |
||||
| Address | |||||
| Corporate Author | Thesis | Bachelor's thesis | |||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | invisible;ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ VC2007a | Serial | 1671 | ||
| Permanent link to this record | |||||