toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Author Marco Pedersoli; Jordi Gonzalez; Juan J. Villanueva edit  doi
isbn  openurl
  Title High-Speed Human Detection Using a Multiresolution Cascade of Histograms of Oriented Gradients Type Conference Article
  Year 2009 Publication (up) 4th Iberian Conference on Pattern Recognition and Image Analysis Abbreviated Journal  
  Volume 5524 Issue Pages  
  Keywords  
  Abstract This paper presents a new method for human detection based on a multiresolution cascade of Histograms of Oriented Gradients (HOG) that can highly reduce the computational cost of the detection search without affecting accuracy. The method consists of a cascade of sliding window detectors. Each detector is a Support Vector Machine (SVM) composed by features at different resolution, from coarse for the first level to fine for the last one.
Considering that the spatial stride of the sliding window search is affected by the HOG features size, unlike previous methods based on Adaboost cascades, we can adopt a spatial stride inversely proportional to the features resolution. This produces that the speed-up of the cascade is not only due to the low number of features that need to be computed in the first levels, but also to the lower number of detection windows that needs to be evaluated.
Experimental results shows that our method permits a detection rate comparable with the state of the art, but at the same time a gain in the speed of the detection search of 10-20 times depending on the cascade configuration.
 
  Address Póvoa de Varzim, Portugal  
  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-02171-8 Medium  
  Area Expedition Conference IbPRIA  
  Notes ISE Approved no  
  Call Number ISE @ ise @ PGV2009 Serial 1214  
Permanent link to this record
 

 
Author Bhaskar Chakraborty; Andrew Bagdanov; Jordi Gonzalez edit  doi
isbn  openurl
  Title Towards Real-Time Human Action Recognition Type Conference Article
  Year 2009 Publication (up) 4th Iberian Conference on Pattern Recognition and Image Analysis Abbreviated Journal  
  Volume 5524 Issue Pages  
  Keywords  
  Abstract This work presents a novel approach to human detection based action-recognition in real-time. To realize this goal our method first detects humans in different poses using a correlation-based approach. Recognition of actions is done afterward based on the change of the angular values subtended by various body parts. Real-time human detection and action recognition are very challenging, and most state-of-the-art approaches employ complex feature extraction and classification techniques, which ultimately becomes a handicap for real-time recognition. Our correlation-based method, on the other hand, is computationally efficient and uses very simple gradient-based features. For action recognition angular features of body parts are extracted using a skeleton technique. Results for action recognition are comparable with the present state-of-the-art.  
  Address Póvoa de Varzim, Portugal  
  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-02171-8 Medium  
  Area Expedition Conference IbPRIA  
  Notes ISE Approved no  
  Call Number DAG @ dag @ CBG2009 Serial 1215  
Permanent link to this record
 

 
Author Murad Al Haj; Andrew Bagdanov; Jordi Gonzalez; Xavier Roca edit  doi
isbn  openurl
  Title Robust and Efficient Multipose Face Detection Using Skin Color Segmentation Type Conference Article
  Year 2009 Publication (up) 4th Iberian Conference on Pattern Recognition and Image Analysis Abbreviated Journal  
  Volume 5524 Issue Pages  
  Keywords  
  Abstract In this paper we describe an efficient technique for detecting faces in arbitrary images and video sequences. The approach is based on segmentation of images or video frames into skin-colored blobs using a pixel-based heuristic. Scale and translation invariant features are then computed from these segmented blobs which are used to perform statistical discrimination between face and non-face classes. We train and evaluate our method on a standard, publicly available database of face images and analyze its performance over a range of statistical pattern classifiers. The generalization of our approach is illustrated by testing on an independent sequence of frames containing many faces and non-faces. These experiments indicate that our proposed approach obtains false positive rates comparable to more complex, state-of-the-art techniques, and that it generalizes better to new data. Furthermore, the use of skin blobs and invariant features requires fewer training samples since significantly fewer non-face candidate regions must be considered when compared to AdaBoost-based approaches.  
  Address Springer Berlin Heidelberg  
  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-02171-8 Medium  
  Area Expedition Conference IbPRIA  
  Notes ISE Approved no  
  Call Number DAG @ dag @ ABG2009 Serial 1216  
Permanent link to this record
 

 
Author Agnes Borras; Josep Llados edit  isbn
openurl 
  Title Corest: A measure of color and space stability to detect salient regions according to human criteria Type Conference Article
  Year 2009 Publication (up) 5th International Conference on Computer Vision Theory and Applications Abbreviated Journal  
  Volume Issue Pages 204-209  
  Keywords  
  Abstract  
  Address Lisboa, Portugal  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN 978-989-8111-69-2 Medium  
  Area Expedition Conference VISAPP  
  Notes DAG Approved no  
  Call Number DAG @ dag @ BoL2009 Serial 1225  
Permanent link to this record
 

 
Author Partha Pratim Roy; Josep Llados; Umapada Pal edit  isbn
openurl 
  Title A Complete System for Detection and Recognition of Text in Graphical Documents using Background Information Type Conference Article
  Year 2009 Publication (up) 5th International Conference on Computer Vision Theory and Applications Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address Lisboa, Portugal  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN 978-989-8111-69-2 Medium  
  Area Expedition Conference VISAPP  
  Notes DAG Approved no  
  Call Number DAG @ dag @ RLP2009 Serial 1238  
Permanent link to this record
 

 
Author Oscar Camara; Estanislao Oubel; Gemma Piella; Simone Balocco; Mathieu De Craene; Alejandro F. Frangi edit  doi
isbn  openurl
  Title Multi-sequence Registration of Cine, Tagged and Delay-Enhancement MRI with Shift Correction and Steerable Pyramid-Based Detagging Type Conference Article
  Year 2009 Publication (up) 5th International Conference on Functional Imaging and Modeling of the Heart Abbreviated Journal  
  Volume 5528 Issue Pages 330–338  
  Keywords  
  Abstract In this work, we present a registration framework for cardiac cine MRI (cMRI), tagged (tMRI) and delay-enhancement MRI (deMRI), where the two main issues to find an accurate alignment between these images have been taking into account: the presence of tags in tMRI and respiration artifacts in all sequences. A steerable pyramid image decomposition has been used for detagging purposes since it is suitable to extract high-order oriented structures by directional adaptive filtering. Shift correction of cMRI is achieved by firstly maximizing the similarity between the Long Axis and Short Axis cMRI. Subsequently, these shift-corrected images are used as target images in a rigid registration procedure with their corresponding tMRI/deMRI in order to correct their shift. The proposed registration framework has been evaluated by 840 registration tests, considerably improving the alignment of the MR images (mean RMS error of 2.04mm vs. 5.44mm).  
  Address Nice, France  
  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-01931-9 Medium  
  Area Expedition Conference FIMH  
  Notes MILAB Approved no  
  Call Number BCNPCL @ bcnpcl @ COP2009 Serial 1255  
Permanent link to this record
 

 
Author David Aldavert; Ricardo Toledo; Arnau Ramisa; Ramon Lopez de Mantaras edit  url
doi  isbn
openurl 
  Title Efficient Object Pixel-Level Categorization using Bag of Features: Advances in Visual Computing Type Conference Article
  Year 2009 Publication (up) 5th International Symposium on Visual Computing Abbreviated Journal  
  Volume 5875 Issue Pages 44–55  
  Keywords  
  Abstract In this paper we present a pixel-level object categorization method suitable to be applied under real-time constraints. Since pixels are categorized using a bag of features scheme, the major bottleneck of such an approach would be the feature pooling in local histograms of visual words. Therefore, we propose to bypass this time-consuming step and directly obtain the score from a linear Support Vector Machine classifier. This is achieved by creating an integral image of the components of the SVM which can readily obtain the classification score for any image sub-window with only 10 additions and 2 products, regardless of its size. Besides, we evaluated the performance of two efficient feature quantization methods: the Hierarchical K-Means and the Extremely Randomized Forest. All experiments have been done in the Graz02 database, showing comparable, or even better results to related work with a lower computational cost.  
  Address Las Vegas, USA  
  Corporate Author Thesis  
  Publisher Springer Berlin Heidelberg Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0302-9743 ISBN 978-3-642-10330-8 Medium  
  Area Expedition Conference ISVC  
  Notes ADAS Approved no  
  Call Number Admin @ si @ ATR2009a Serial 1246  
Permanent link to this record
 

 
Author Bogdan Raducanu; Fadi Dornaika edit  doi
isbn  openurl
  Title Natural Facial Expression Recognition Using Dynamic and Static Schemes Type Conference Article
  Year 2009 Publication (up) 5th International Symposium on Visual Computing Abbreviated Journal  
  Volume 5875 Issue Pages 730–739  
  Keywords  
  Abstract Affective computing is at the core of a new paradigm in HCI and AI represented by human-centered computing. Within this paradigm, it is expected that machines will be enabled with perceiving capabilities, making them aware about users’ affective state. The current paper addresses the problem of facial expression recognition from monocular videos sequences. We propose a dynamic facial expression recognition scheme, which is proven to be very efficient. Furthermore, it is conveniently compared with several static-based systems adopting different magnitude of facial expression. We provide evaluations of performance using Linear Discriminant Analysis (LDA), Non parametric Discriminant Analysis (NDA), and Support Vector Machines (SVM). We also provide performance evaluations using arbitrary test video sequences.  
  Address Las Vegas, USA  
  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-10330-8 Medium  
  Area Expedition Conference ISVC  
  Notes OR;MV Approved no  
  Call Number BCNPCL @ bcnpcl @ RaD2009 Serial 1257  
Permanent link to this record
 

 
Author Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; Horst Bunke edit  doi
isbn  openurl
  Title A Recursive Embedding Approach to Median Graph Computation Type Conference Article
  Year 2009 Publication (up) 7th IAPR – TC–15 Workshop on Graph–Based Representations in Pattern Recognition Abbreviated Journal  
  Volume 5534 Issue Pages 113–123  
  Keywords  
  Abstract 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.  
  Address Venice, Italy  
  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-02123-7 Medium  
  Area Expedition Conference GBR  
  Notes DAG Approved no  
  Call Number DAG @ dag @ FKV2009 Serial 1173  
Permanent link to this record
 

 
Author David Aldavert; Ricardo Toledo; Arnau Ramisa; Ramon Lopez de Mantaras edit  doi
isbn  openurl
  Title Visual Registration Method For A Low Cost Robot: Computer Vision Systems Type Conference Article
  Year 2009 Publication (up) 7th International Conference on Computer Vision Systems Abbreviated Journal  
  Volume 5815 Issue Pages 204–214  
  Keywords  
  Abstract An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. In order to put into correspondence two maps, most methods estimate the transformation relating the maps from matches established between low level feature extracted from sensor data. However, finding explicit matches between features is a challenging and computationally expensive task. In this paper, we propose a new method to align obstacle maps without searching explicit matches between features. The maps are obtained from a stereo pair. Then, we use a vocabulary tree approach to identify putative corresponding maps followed by the Newton minimization algorithm to find the transformation that relates both maps. The proposed method is evaluated in a typical office environment showing good performance.  
  Address Belgica  
  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-04666-7 Medium  
  Area Expedition Conference ICVS  
  Notes ADAS Approved no  
  Call Number Admin @ si @ ATR2009b Serial 1247  
Permanent link to this record
 

 
Author Joan Mas; Gemma Sanchez; Josep Llados edit  openurl
  Title SSP: Sketching slide Presentations, a Syntactic Approach Type Conference Article
  Year 2009 Publication (up) 8th IAPR International Workshop on Graphics Recognition Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract The design of a slide presentation is a creative process. In this process first, humans visualize in their minds what they want to explain. Then, they have to be able to represent this knowledge in an understandable way. There exists a lot of commercial software that allows to create our own slide presentations but the creativity of the user is rather limited. In this article we present an application that allows the user to create and visualize a slide presentation from a sketch. A slide may be seen as a graphical document or a diagram where its elements are placed in a particular spatial arrangement. To describe and recognize slides a syntactic approach is proposed. This approach is based on an Adjacency Grammar and a parsing methodology to cope with this kind of grammars. The experimental evaluation shows the performance of our methodology from a qualitative and a quantitative point of view. Six different slides containing different number of symbols, from 4 to 7, have been given to the users and they have drawn them without restrictions in the order of the elements. The quantitative results give an idea on how suitable is our methodology to describe and recognize the different elements in a slide.  
  Address La Rochelle; France; July 2009  
  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 GREC  
  Notes DAG Approved no  
  Call Number DAG @ dag @ MSL2009a Serial 1441  
Permanent link to this record
 

 
Author Salim Jouili; Salvatore Tabbone; Ernest Valveny edit  openurl
  Title Comparing Graph Similarity Measures for Graphical Recognition. Type Conference Article
  Year 2009 Publication (up) 8th IAPR International Workshop on Graphics Recognition Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract In this paper we evaluate four graph distance measures. The analysis is performed for document retrieval tasks. For this aim, different kind of documents are used including line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each graph distance measure depends on the kind of data and the graph representation technique.  
  Address La Rochelle; France; July 2009  
  Corporate Author Thesis  
  Publisher Springer 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 GREC  
  Notes DAG Approved no  
  Call Number DAG @ dag @ JTV2009 Serial 1442  
Permanent link to this record
 

 
Author Mathieu Nicolas Delalandre; Jean-Yves Ramel; Ernest Valveny; Muhammad Muzzamil Luqman edit  openurl
  Title A Performance Characterization Algorithm for Symbol Localization Type Conference Article
  Year 2009 Publication (up) 8th IAPR International Workshop on Graphics Recognition Abbreviated Journal  
  Volume Issue Pages 3-11  
  Keywords  
  Abstract In this paper we present an algorithm for performance characterization of symbol localization systems. This algorithm is aimed to be a more “reliable” and “open” solution to characterize the performance. To achieve that, it exploits only single points as the result of localization and offers the possibility to reconsider the localization results provided by a system. We use the information about context in groundtruth, and overall localization results, to detect the ambiguous localization results. A probability score is computed for each matching between a localization point and a groundtruth region, depending on the spatial distribution of the other regions in the groundtruth. Final characterization is given with detection rate/probability score plots, describing the sets of possible interpretations of the localization results, according to a given confidence rate. We present experimentation details along with the results for the symbol localization system of [1], exploiting a synthetic dataset of architectural floorplans and electrical diagrams (composed of 200 images and 3861 symbols).  
  Address La Rochelle; July 2009  
  Corporate Author Thesis  
  Publisher Springer 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 GREC  
  Notes DAG Approved no  
  Call Number DAG @ dag @ DRV2009 Serial 1443  
Permanent link to this record
 

 
Author Marçal Rusiñol; K. Bertet; Jean-Marc Ogier; Josep Llados edit  openurl
  Title Symbol Recognition Using a Concept Lattice of Graphical Patterns Type Conference Article
  Year 2009 Publication (up) 8th IAPR International Workshop on Graphics Recognition Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract In this paper we propose a new approach to recognize symbols by the use of a concept lattice. We propose to build a concept lattice in terms of graphical patterns. Each model symbol is decomposed in a set of composing graphical patterns taken as primitives. Each one of these primitives is described by boundary moment invariants. The obtained concept lattice relates which symbolic patterns compose a given graphical symbol. A Hasse diagram is derived from the context and is used to recognize symbols affected by noise. We present some preliminary results over a variation of the dataset of symbols from the GREC 2005 symbol recognition contest.  
  Address La Rochelle; July 2009  
  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 GREC  
  Notes DAG Approved no  
  Call Number DAG @ dag @ RBO2009 Serial 1444  
Permanent link to this record
 

 
Author Mohammad Rouhani; Angel Sappa edit  doi
isbn  openurl
  Title A Novel Approach to Geometric Fitting of Implicit Quadrics Type Conference Article
  Year 2009 Publication (up) 8th International Conference on Advanced Concepts for Intelligent Vision Systems Abbreviated Journal  
  Volume 5807 Issue Pages 121–132  
  Keywords  
  Abstract This paper presents a novel approach for estimating the geometric distance from a given point to the corresponding implicit quadric curve/surface. The proposed estimation is based on the height of a tetrahedron, which is used as a coarse but reliable estimation of the real distance. The estimated distance is then used for finding the best set of quadric parameters, by means of the Levenberg-Marquardt algorithm, which is a common framework in other geometric fitting approaches. Comparisons of the proposed approach with previous ones are provided to show both improvements in CPU time as well as in the accuracy of the obtained results.  
  Address Bordeaux, France  
  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-04696-4 Medium  
  Area Expedition Conference ACIVS  
  Notes ADAS Approved no  
  Call Number ADAS @ adas @ RoS2009 Serial 1194  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: