| Home | [111–120] << 121 122 123 124 125 126 127 128 129 130 >> [131–140] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados; Thierry Brouard | ||||
| Title | Subgraph Spotting Through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 870-874 | ||
| Keywords | |||||
| Abstract | We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a relational data structure is mandatory. Our proposed method accomplishes subgraph spotting through graph embedding. We achieve automatic indexation of a graph repository during off-line learning phase, where we (i) break the graphs into 2-node sub graphs (a.k.a. cliques of order 2), which are primitive building-blocks of a graph, (ii) embed the 2-node sub graphs into feature vectors by employing our recently proposed explicit graph embedding technique, (iii) cluster the feature vectors in classes by employing a classic agglomerative clustering technique, (iv) build an index for the graph repository and (v) learn a Bayesian network classifier. The subgraph spotting is achieved during the on-line querying phase, where we (i) break the query graph into 2-node sub graphs, (ii) embed them into feature vectors, (iii) employ the Bayesian network classifier for classifying the query 2-node sub graphs and (iv) retrieve the respective graphs by looking-up in the index of the graph repository. The graphs containing all query 2-node sub graphs form the set of result graphs for the query. Finally, we employ the adjacency matrix of each result graph along with a score function, for spotting the query graph in it. The proposed subgraph spotting method is equally applicable to a wide range of domains, offering ease of query by example (QBE) and granularity of focused retrieval. Experimental results are presented for graphs generated from two repositories of electronic and architectural document images. | ||||
Address  |
Beijing, China | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | 978-1-4577-1350-7 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ LRL2011 | Serial | 1790 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Josep Llados; Umapada Pal | ||||
| Title | Symbol Spotting in Line Drawings Through Graph Paths Hashing | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 982-986 | ||
| Keywords | |||||
| Abstract | In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can be efficiently represented by graphs, which ease the accurate localization of the model symbol. Graph paths are the factorized substructures of graphs which enable robust recognition even in the presence of noise and distortion. In our framework, the entire database of the graphical documents is indexed in hash tables by the locality sensitive hashing (LSH) of shape descriptors of the paths. The hashing data structure aims to execute an approximate k-NN search in a sub-linear time. The spotting method is formulated by a spatial voting scheme to the list of locations of the paths that are decided during the hash table lookup process. We perform detailed experiments with various dataset of line drawings and the results demonstrate the effectiveness and efficiency of the technique. | ||||
| Address |
Beijing, China | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | 978-1-4577-1350-7 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ DLP2011b | Serial | 1791 | ||
| Permanent link to this record | |||||
| Author | Dimosthenis Karatzas; Sergi Robles; Joan Mas; Farshad Nourbakhsh; Partha Pratim Roy | ||||
| Title | ICDAR 2011 Robust Reading Competition – Challege 1: Reading Text in Born-Digital Images (Web and Email) | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1485-1490 | ||
| Keywords | |||||
| Abstract | This paper presents the results of the first Challenge of ICDAR 2011 Robust Reading Competition. Challenge 1 is focused on the extraction of text from born-digital images, specifically from images found in Web pages and emails. The challenge was organized in terms of three tasks that look at different stages of the process: text localization, text segmentation and word recognition. In this paper we present the results of the challenge for all three tasks, and make an open call for continuous participation outside the context of ICDAR 2011. | ||||
| Address |
Beijing, China | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | 978-1-4577-1350-7 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ KRM2011 | Serial | 1793 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes; Anjan Dutta; Albert Gordo; Josep Llados | ||||
| Title | The ICDAR 2011 Music Scores Competition: Staff Removal and Writer Identification | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1511-1515 | ||
| Keywords | |||||
| Abstract | In the last years, there has been a growing interest in the analysis of handwritten music scores. In this sense, our goal has been to foster the interest in the analysis of handwritten music scores by the proposal of two different competitions: Staff removal and Writer Identification. Both competitions have been tested on the CVC-MUSCIMA database: a ground-truth of handwritten music score images. This paper describes the competition details, including the dataset and ground-truth, the evaluation metrics, and a short description of the participants, their methods, and the obtained results. | ||||
| Address |
Beijing, China | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-0-7695-4520-2 | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ FDG2011b | Serial | 1794 | ||
| Permanent link to this record | |||||
| Author | Lu Yu; Yongmei Cheng; Joost Van de Weijer | ||||
| Title | Weakly Supervised Domain-Specific Color Naming Based on Attention | Type | Conference Article | ||
| Year | 2018 | Publication | 24th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 3019 - 3024 | ||
| Keywords | |||||
| Abstract | The majority of existing color naming methods focuses on the eleven basic color terms of the English language. However, in many applications, different sets of color names are used for the accurate description of objects. Labeling data to learn these domain-specific color names is an expensive and laborious task. Therefore, in this article we aim to learn color names from weakly labeled data. For this purpose, we add an attention branch to the color naming network. The attention branch is used to modulate the pixel-wise color naming predictions of the network. In experiments, we illustrate that the attention branch correctly identifies the relevant regions. Furthermore, we show that our method obtains state-of-the-art results for pixel-wise and image-wise classification on the EBAY dataset and is able to learn color names for various domains. | ||||
| Address |
Beijing; August 2018 | ||||
| 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 | ICPR | ||
| Notes | LAMP; 600.109; 602.200; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ YCW2018 | Serial | 3243 | ||
| Permanent link to this record | |||||
| Author | Sounak Dey; Anjan Dutta; Suman Ghosh; Ernest Valveny; Josep Llados; Umapada Pal | ||||
| Title | Learning Cross-Modal Deep Embeddings for Multi-Object Image Retrieval using Text and Sketch | Type | Conference Article | ||
| Year | 2018 | Publication | 24th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 916 - 921 | ||
| Keywords | |||||
| Abstract | In this work we introduce a cross modal image retrieval system that allows both text and sketch as input modalities for the query. A cross-modal deep network architecture is formulated to jointly model the sketch and text input modalities as well as the the image output modality, learning a common embedding between text and images and between sketches and images. In addition, an attention model is used to selectively focus the attention on the different objects of the image, allowing for retrieval with multiple objects in the query. Experiments show that the proposed method performs the best in both single and multiple object image retrieval in standard datasets. | ||||
| Address |
Beijing; China; August 2018 | ||||
| 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 | ICPR | ||
| Notes | DAG; 602.167; 602.168; 600.097; 600.084; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ DDG2018b | Serial | 3152 | ||
| Permanent link to this record | |||||
| Author | Pau Riba; Andreas Fischer; Josep Llados; Alicia Fornes | ||||
| Title | Learning Graph Distances with Message Passing Neural Networks | Type | Conference Article | ||
| Year | 2018 | Publication | 24th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 2239-2244 | ||
| Keywords | ★Best Paper Award★ | ||||
| Abstract | Graph representations have been widely used in pattern recognition thanks to their powerful representation formalism and rich theoretical background. A number of error-tolerant graph matching algorithms such as graph edit distance have been proposed for computing a distance between two labelled graphs. However, they typically suffer from a high
computational complexity, which makes it difficult to apply these matching algorithms in a real scenario. In this paper, we propose an efficient graph distance based on the emerging field of geometric deep learning. Our method employs a message passing neural network to capture the graph structure and learns a metric with a siamese network approach. The performance of the proposed graph distance is validated in two application cases, graph classification and graph retrieval of handwritten words, and shows a promising performance when compared with (approximate) graph edit distance benchmarks. |
||||
| Address |
Beijing; China; August 2018 | ||||
| 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 | ICPR | ||
| Notes | DAG; 600.097; 603.057; 601.302; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RFL2018 | Serial | 3168 | ||
| Permanent link to this record | |||||
| Author | Gabriela Ramirez; Esau Villatoro; Bogdan Ionescu; Hugo Jair Escalante; Sergio Escalera; Martha Larson; Henning Muller; Isabelle Guyon | ||||
| Title | Overview of the Multimedia Information Processing for Personality & Social Networks Analysis Contes | Type | Conference Article | ||
| Year | 2018 | Publication | Multimedia Information Processing for Personality and Social Networks Analysis (MIPPSNA 2018) | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address |
Beijing; China; August 2018 | ||||
| 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 | ICPRW | ||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ RVI2018 | Serial | 3211 | ||
| Permanent link to this record | |||||
| Author | Pau Riba; Josep Llados; Alicia Fornes; Anjan Dutta | ||||
| Title | Large-scale Graph Indexing using Binary Embeddings of Node Contexts | Type | Conference Article | ||
| Year | 2015 | Publication | 10th IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition | Abbreviated Journal | |
| Volume | 9069 | Issue | Pages | 208-217 | |
| Keywords | Graph matching; Graph indexing; Application in document analysis; Word spotting; Binary embedding | ||||
| Abstract | Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations in terms of feature vectors. Retrieving a query graph from a large dataset of graphs has the drawback of the high computational complexity required to compare the query and the target graphs. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. In this paper we propose a fast indexation formalism for graph retrieval. A binary embedding is defined as hashing keys for graph nodes. Given a database of labeled graphs, graph nodes are complemented with vectors of attributes representing their local context. Hence, each attribute counts the length of a walk of order k originated in a vertex with label l. Each attribute vector is converted to a binary code applying a binary-valued hash function. Therefore, graph retrieval is formulated in terms of finding target graphs in the database whose nodes have a small Hamming distance from the query nodes, easily computed with bitwise logical operators. As an application example, we validate the performance of the proposed methods in a handwritten word spotting scenario in images of historical documents. | ||||
| Address |
Beijing; China; May 2015 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer International Publishing | Place of Publication | Editor | C.-L.Liu; B.Luo; W.G.Kropatsch; J.Cheng | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-319-18223-0 | Medium | |
| Area | Expedition | Conference | GbRPR | ||
| Notes | DAG; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ RLF2015a | Serial | 2618 | ||
| Permanent link to this record | |||||
| Author | Jon Almazan; Alicia Fornes; Ernest Valveny | ||||
| Title | A Non-Rigid Feature Extraction Method for Shape Recognition | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 987-991 | ||
| Keywords | |||||
| Abstract | This paper presents a methodology for shape recognition that focuses on dealing with the difficult problem of large deformations. The proposed methodology consists in a novel feature extraction technique, which uses a non-rigid representation adaptable to the shape. This technique employs a deformable grid based on the computation of geometrical centroids that follows a region partitioning algorithm. Then, a feature vector is extracted by computing pixel density measures around these geometrical centroids. The result is a shape descriptor that adapts its representation to the given shape and encodes the pixel density distribution. The validity of the method when dealing with large deformations has been experimentally shown over datasets composed of handwritten shapes. It has been applied to signature verification and shape recognition tasks demonstrating high accuracy and low computational cost. | ||||
| Address |
Beijing; China; September 2011 | ||||
| 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-0-7695-4520-2 | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ AFV2011 | Serial | 1763 | ||
| Permanent link to this record | |||||
| Author | Victor Vaquero; German Ros; Francesc Moreno-Noguer; Antonio Lopez; Alberto Sanfeliu | ||||
| Title | Joint coarse-and-fine reasoning for deep optical flow | Type | Conference Article | ||
| Year | 2017 | Publication | 24th International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 2558-2562 | ||
| Keywords | |||||
| Abstract | We propose a novel representation for dense pixel-wise estimation tasks using CNNs that boosts accuracy and reduces training time, by explicitly exploiting joint coarse-and-fine reasoning. The coarse reasoning is performed over a discrete classification space to obtain a general rough solution, while the fine details of the solution are obtained over a continuous regression space. In our approach both components are jointly estimated, which proved to be beneficial for improving estimation accuracy. Additionally, we propose a new network architecture, which combines coarse and fine components by treating the fine estimation as a refinement built on top of the coarse solution, and therefore adding details to the general prediction. We apply our approach to the challenging problem of optical flow estimation and empirically validate it against state-of-the-art CNN-based solutions trained from scratch and tested on large optical flow datasets. | ||||
| Address |
Beijing; China; September 2017 | ||||
| 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 | ICIP | ||
| Notes | ADAS; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ VRM2017 | Serial | 2898 | ||
| Permanent link to this record | |||||
| Author | Andrei Polzounov; Artsiom Ablavatski; Sergio Escalera; Shijian Lu; Jianfei Cai | ||||
| Title | WordFences: Text Localization and Recognition | Type | Conference Article | ||
| Year | 2017 | Publication | 24th International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address |
Beijing; China; September 2017 | ||||
| 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 | ICIP | ||
| Notes | HUPBA; no menciona | Approved | no | ||
| Call Number | Admin @ si @ PAE2017 | Serial | 3007 | ||
| Permanent link to this record | |||||
| Author | Maedeh Aghaei; Mariella Dimiccoli; Petia Radeva | ||||
| Title | All the people around me: face clustering in egocentric photo streams | Type | Conference Article | ||
| Year | 2017 | Publication | 24th International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | face discovery; face clustering; deepmatching; bag-of-tracklets; egocentric photo-streams | ||||
| Abstract | arxiv1703.01790
Given an unconstrained stream of images captured by a wearable photo-camera (2fpm), we propose an unsupervised bottom-up approach for automatic clustering appearing faces into the individual identities present in these data. The problem is challenging since images are acquired under real world conditions; hence the visible appearance of the people in the images undergoes intensive variations. Our proposed pipeline consists of first arranging the photo-stream into events, later, localizing the appearance of multiple people in them, and finally, grouping various appearances of the same person across different events. Experimental results performed on a dataset acquired by wearing a photo-camera during one month, demonstrate the effectiveness of the proposed approach for the considered purpose. |
||||
| Address |
Beijing; China; September 2017 | ||||
| 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 | ICIP | ||
| Notes | MILAB; no menciona | Approved | no | ||
| Call Number | Admin @ si @ EDR2017 | Serial | 3025 | ||
| Permanent link to this record | |||||
| Author | David Aldavert; Ricardo Toledo; Arnau Ramisa; Ramon Lopez de Mantaras | ||||
| Title | Visual Registration Method For A Low Cost Robot: Computer Vision Systems | Type | Conference Article | ||
| Year | 2009 | Publication | 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 | David Guillamet | ||||
| Title | Statistical Local Appearance Models for Object Recognition | Type | Book Whole | ||
| Year | 2004 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address |
Bellaterra | ||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Place of Publication | Editor | Jordi Vitria | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | Approved | no | |||
| Call Number | Admin @ si @ Gui2004 | Serial | 444 | ||
| Permanent link to this record | |||||