| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–11] |
|
| Records | |||||
|---|---|---|---|---|---|
Author  |
Patricia Suarez; Angel Sappa; Boris X. Vintimilla | ||||
| Title | Cross-Spectral Image Patch Similarity using Convolutional Neural Network | Type | Conference Article | ||
| Year | 2017 | Publication | IEEE International Workshop of Electronics, Control, Measurement, Signals and their application to Mechatronics | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | The ability to compare image regions (patches) has been the basis of many approaches to core computer vision problems, including object, texture and scene categorization. Hence, developing representations for image patches have been of interest in several works. The current work focuses on learning similarity between cross-spectral image patches with a 2 channel convolutional neural network (CNN) model. The proposed approach is an adaptation of a previous work, trying to obtain similar results than the state of the art but with a lowcost hardware. Hence, obtained results are compared with both
classical approaches, showing improvements, and a state of the art CNN based approach. |
||||
| Address | San Sebastian; Spain; May 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 | ECMSM | ||
| Notes | ADAS; 600.086; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ SSV2017a | Serial | 2916 | ||
| Permanent link to this record | |||||
| Author |
Pau Riba; Alicia Fornes; Josep Llados | ||||
| Title | Towards the Alignment of Handwritten Music Scores | Type | Book Chapter | ||
| Year | 2017 | Publication | International Workshop on Graphics Recognition. GREC 2015.Graphic Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume | 9657 | Issue | Pages | 103-116 | |
| Keywords | Optical Music Recognition; Handwritten Music Scores; Dynamic Time Warping alignment | ||||
| Abstract | It is very common to nd di erent versions of the same music work in archives of Opera Theaters. These di erences correspond to modi cations and annotations from the musicians. From the musicologist point of view, these variations are very interesting and deserve study.
This paper explores the alignment of music scores as a tool for automatically detecting the passages that contain such di erences. Given the diculties in the recognition of handwritten music scores, our goal is to align the music scores and at the same time, avoid the recognition of music elements as much as possible. After removing the sta lines, braces and ties, the bar lines are detected. Then, the bar units are described as a whole using the Blurred Shape Model. The bar units alignment is performed by using Dynamic Time Warping. The analysis of the alignment path is used to detect the variations in the music scores. The method has been evaluated on a subset of the CVC-MUSCIMA dataset, showing encouraging results. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | Bart Lamiroy; R Dueire Lins | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-3-319-52158-9 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.097; 602.006; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RFL2017 | Serial | 2955 | ||
| Permanent link to this record | |||||
| Author |
Pau Riba; Anjan Dutta; Josep Llados; Alicia Fornes | ||||
| Title | Graph-based deep learning for graphics classification | Type | Conference Article | ||
| Year | 2017 | Publication | 14th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 29-30 | ||
| Keywords | |||||
| Abstract | Graph-based representations are a common way to deal with graphics recognition problems. However, previous works were mainly focused on developing learning-free techniques. The success of deep learning frameworks have proved that learning is a powerful tool to solve many problems, however it is not straightforward to extend these methodologies to non euclidean data such as graphs. On the other hand, graphs are a good representational structure for graphical entities. In this work, we present some deep learning techniques that have been proposed in the literature for graph-based representations and
we show how they can be used in graphics recognition problems |
||||
| 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 | ICDAR | ||
| Notes | DAG; 600.097; 601.302; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RDL2017b | Serial | 3058 | ||
| Permanent link to this record | |||||
| Author |
Pau Riba; Anjan Dutta; Josep Llados; Alicia Fornes; Sounak Dey | ||||
| Title | Improving Information Retrieval in Multiwriter Scenario by Exploiting the Similarity Graph of Document Terms | Type | Conference Article | ||
| Year | 2017 | Publication | 14th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 475-480 | ||
| Keywords | document terms; information retrieval; affinity graph; graph of document terms; multiwriter; graph diffusion | ||||
| Abstract | Information Retrieval (IR) is the activity of obtaining information resources relevant to a questioned information. It usually retrieves a set of objects ranked according to the relevancy to the needed fact. In document analysis, information retrieval receives a lot of attention in terms of symbol and word spotting. However, through decades the community mostly focused either on printed or on single writer scenario, where the
state-of-the-art results have achieved reasonable performance on the available datasets. Nevertheless, the existing algorithms do not perform accordingly on multiwriter scenario. A graph representing relations between a set of objects is a structure where each node delineates an individual element and the similarity between them is represented as a weight on the connecting edge. In this paper, we explore different analytics of graphs constructed from words or graphical symbols, such as diffusion, shortest path, etc. to improve the performance of information retrieval methods in multiwriter scenario |
||||
| 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 | ICDAR | ||
| Notes | DAG; 600.097; 601.302; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RDL2017a | Serial | 3053 | ||
| Permanent link to this record | |||||
| Author |
Pau Riba; Josep Llados; Alicia Fornes | ||||
| Title | Error-tolerant coarse-to-fine matching model for hierarchical graphs | Type | Conference Article | ||
| Year | 2017 | Publication | 11th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition | Abbreviated Journal | |
| Volume | 10310 | Issue | Pages | 107-117 | |
| Keywords | Graph matching; Hierarchical graph; Graph-based representation; Coarse-to-fine matching | ||||
| Abstract | Graph-based representations are effective tools to capture structural information from visual elements. However, retrieving a query graph from a large database of graphs implies a high computational complexity. Moreover, these representations are very sensitive to noise or small changes. In this work, a novel hierarchical graph representation is designed. Using graph clustering techniques adapted from graph-based social media analysis, we propose to generate a hierarchy able to deal with different levels of abstraction while keeping information about the topology. For the proposed representations, a coarse-to-fine matching method is defined. These approaches are validated using real scenarios such as classification of colour images and handwritten word spotting. | ||||
| Address | Anacapri; Italy; May 2017 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer International Publishing | Place of Publication | Editor | Pasquale Foggia; Cheng-Lin Liu; Mario Vento | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | GbRPR | ||
| Notes | DAG; 600.097; 601.302; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RLF2017a | Serial | 2951 | ||
| 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 for information spotting in document image databases | Type | Journal Article | ||
| Year | 2017 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 87 | Issue | Pages | 203-211 | |
| Keywords | |||||
| 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. However, retrieving a query graph from a large dataset of graphs implies a high computational complexity. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. With this aim, in this paper we propose a graph indexation formalism applied to visual 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. Then, 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 different real scenarios such as handwritten word spotting in images of historical documents or symbol spotting in architectural floor plans. | ||||
| 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; 600.097; 602.006; 603.053; 600.121 | Approved | no | ||
| Call Number | RLF2017b | Serial | 2873 | ||
| Permanent link to this record | |||||
| Author |
Pau Rodriguez; Guillem Cucurull; Jordi Gonzalez; Josep M. Gonfaus; Kamal Nasrollahi; Thomas B. Moeslund; Xavier Roca | ||||
| Title | Deep Pain: Exploiting Long Short-Term Memory Networks for Facial Expression Classification | Type | Journal Article | ||
| Year | 2017 | Publication | IEEE Transactions on cybernetics | Abbreviated Journal | Cyber |
| Volume | Issue | Pages | 1-11 | ||
| Keywords | |||||
| Abstract | Pain is an unpleasant feeling that has been shown to be an important factor for the recovery of patients. Since this is costly in human resources and difficult to do objectively, there is the need for automatic systems to measure it. In this paper, contrary to current state-of-the-art techniques in pain assessment, which are based on facial features only, we suggest that the performance can be enhanced by feeding the raw frames to deep learning models, outperforming the latest state-of-the-art results while also directly facing the problem of imbalanced data. As a baseline, our approach first uses convolutional neural networks (CNNs) to learn facial features from VGG_Faces, which are then linked to a long short-term memory to exploit the temporal relation between video frames. We further compare the performances of using the so popular schema based on the canonically normalized appearance versus taking into account the whole image. As a result, we outperform current state-of-the-art area under the curve performance in the UNBC-McMaster Shoulder Pain Expression Archive Database. In addition, to evaluate the generalization properties of our proposed methodology on facial motion recognition, we also report competitive results in the Cohn Kanade+ facial expression database. | ||||
| 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 | ISE; 600.119; 600.098 | Approved | no | ||
| Call Number | Admin @ si @ RCG2017a | Serial | 2926 | ||
| Permanent link to this record | |||||
| Author |
Pau Rodriguez; Guillem Cucurull; Josep M. Gonfaus; Xavier Roca; Jordi Gonzalez | ||||
| Title | Age and gender recognition in the wild with deep attention | Type | Journal Article | ||
| Year | 2017 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 72 | Issue | Pages | 563-571 | |
| Keywords | Age recognition; Gender recognition; Deep neural networks; Attention mechanisms | ||||
| Abstract | Face analysis in images in the wild still pose a challenge for automatic age and gender recognition tasks, mainly due to their high variability in resolution, deformation, and occlusion. Although the performance has highly increased thanks to Convolutional Neural Networks (CNNs), it is still far from optimal when compared to other image recognition tasks, mainly because of the high sensitiveness of CNNs to facial variations. In this paper, inspired by biology and the recent success of attention mechanisms on visual question answering and fine-grained recognition, we propose a novel feedforward attention mechanism that is able to discover the most informative and reliable parts of a given face for improving age and gender classification. In particular, given a downsampled facial image, the proposed model is trained based on a novel end-to-end learning framework to extract the most discriminative patches from the original high-resolution image. Experimental validation on the standard Adience, Images of Groups, and MORPH II benchmarks show that including attention mechanisms enhances the performance of CNNs in terms of robustness and accuracy. | ||||
| 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 | ISE; 600.098; 602.133; 600.119 | Approved | no | ||
| Call Number | Admin @ si @ RCG2017b | Serial | 2962 | ||
| Permanent link to this record | |||||
| Author |
Pau Rodriguez; Jordi Gonzalez; Jordi Cucurull; Josep M. Gonfaus; Xavier Roca | ||||
| Title | Regularizing CNNs with Locally Constrained Decorrelations | Type | Conference Article | ||
| Year | 2017 | Publication | 5th International Conference on Learning Representations | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Toulon; France; April 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 | ICLR | ||
| Notes | ISE; 602.143; 600.119; 600.098 | Approved | no | ||
| Call Number | Admin @ si @ RGC2017 | Serial | 2927 | ||
| Permanent link to this record | |||||
| Author |
Pierdomenico Fiadino; Victor Ponce; Juan Antonio Torrero-Gonzalez; Marc Torrent-Moreno | ||||
| Title | Call Detail Records for Human Mobility Studies: Taking Stock of the Situation in the “Always Connected Era" | Type | Conference Article | ||
| Year | 2017 | Publication | Workshop on Big Data Analytics and Machine Learning for Data Communication Networks | Abbreviated Journal | |
| Volume | Issue | Pages | 43-48 | ||
| Keywords | mobile networks; call detail records; human mobility | ||||
| Abstract | The exploitation of cellular network data for studying human mobility has been a popular research topic in the last decade. Indeed, mobile terminals could be considered ubiquitous sensors that allow the observation of human movements on large scale without the need of relying on non-scalable techniques, such as surveys, or dedicated and expensive monitoring infrastructures. In particular, Call Detail Records (CDRs), collected by operators for billing purposes,
have been extensively employed due to their rather large availability, compared to other types of cellular data (e.g., signaling). Despite the interest aroused around this topic, the research community has generally agreed about the scarcity of information provided by CDRs: the position of mobile terminals is logged when some kind of activity (calls, SMS, data connections) occurs, which translates in a picture of mobility somehow biased by the activity degree of users. By studying two datasets collected by a Nation-wide operator in 2014 and 2016, we show that the situation has drastically changed in terms of data volume and quality. The increase of flat data plans and the higher penetration of “ always connected” terminals have driven up the number of recorded CDRs, providing higher temporal accuracy for users’ locations. |
||||
| Address | UCLA; USA; August 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 | 978-1-4503-5054-9 | Medium | ||
| Area | Expedition | Conference | ACMW (SIGCOMM) | ||
| Notes | HuPBA; no menciona | Approved | no | ||
| Call Number | Admin @ si @ FPT2017 | Serial | 2980 | ||
| Permanent link to this record | |||||
| Author |
Quentin Angermann; Jorge Bernal; Cristina Sanchez Montes; Gloria Fernandez Esparrach; Xavier Gray; Olivier Romain; F. Javier Sanchez; Aymeric Histace | ||||
| Title | Towards Real-Time Polyp Detection in Colonoscopy Videos: Adapting Still Frame-Based Methodologies for Video Sequences Analysis | Type | Conference Article | ||
| Year | 2017 | Publication | 4th International Workshop on Computer Assisted and Robotic Endoscopy | Abbreviated Journal | |
| Volume | Issue | Pages | 29-41 | ||
| Keywords | Polyp detection; colonoscopy; real time; spatio temporal coherence | ||||
| Abstract | Colorectal cancer is the second cause of cancer death in United States: precursor lesions (polyps) detection is key for patient survival. Though colonoscopy is the gold standard screening tool, some polyps are still missed. Several computational systems have been proposed but none of them are used in the clinical room mainly due to computational constraints. Besides, most of them are built over still frame databases, decreasing their performance on video analysis due to the lack of output stability and not coping with associated variability on image quality and polyp appearance. We propose a strategy to adapt these methods to video analysis by adding a spatio-temporal stability module and studying a combination of features to capture polyp appearance variability. We validate our strategy, incorporated on a real-time detection method, on a public video database. Resulting method detects all
polyps under real time constraints, increasing its performance due to our adaptation strategy. |
||||
| Address | Quebec; Canada; 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 | CARE | ||
| Notes | MV; 600.096; 600.075 | Approved | no | ||
| Call Number | Admin @ si @ ABS2017b | Serial | 2977 | ||
| Permanent link to this record | |||||
| Author |
Quentin Angermann; Jorge Bernal; Cristina Sanchez Montes; Maroua Hammami; Gloria Fernandez Esparrach; Xavier Dray; Olivier Romain; F. Javier Sanchez; Aymeric Histace | ||||
| Title | Clinical Usability Quantification Of a Real-Time Polyp Detection Method In Videocolonoscopy | Type | Conference Article | ||
| Year | 2017 | Publication | 25th United European Gastroenterology Week | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Barcelona, October 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 | ESGE | ||
| Notes | MV; no menciona | Approved | no | ||
| Call Number | Admin @ si @ ABS2017c | Serial | 2978 | ||
| Permanent link to this record | |||||
| Author |
Quentin Angermann; Jorge Bernal; Cristina Sanchez Montes; Maroua Hammami; Gloria Fernandez Esparrach; Xavier Dray; Olivier Romain; F. Javier Sanchez; Aymeric Histace | ||||
| Title | Real-Time Polyp Detection in Colonoscopy Videos: A Preliminary Study For Adapting Still Frame-based Methodology To Video Sequences Analysis | Type | Conference Article | ||
| Year | 2017 | Publication | 31st International Congress and Exhibition on Computer Assisted Radiology and Surgery | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Barcelona; Spain; June 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 | CARS | ||
| Notes | MV; no menciona | Approved | no | ||
| Call Number | Admin @ si @ ABS2017 | Serial | 2947 | ||
| Permanent link to this record | |||||
| Author |
Rada Deeb; Damien Muselet; Mathieu Hebert; Alain Tremeau; Joost Van de Weijer | ||||
| Title | 3D color charts for camera spectral sensitivity estimation | Type | Conference Article | ||
| Year | 2017 | Publication | 28th British Machine Vision Conference | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Estimating spectral data such as camera sensor responses or illuminant spectral power distribution from raw RGB camera outputs is crucial in many computer vision applications.
Usually, 2D color charts with various patches of known spectral reflectance are used as reference for such purpose. Deducing n-D spectral data (n»3) from 3D RGB inputs is an ill-posed problem that requires a high number of inputs. Unfortunately, most of the natural color surfaces have spectral reflectances that are well described by low-dimensional linear models, i.e. each spectral reflectance can be approximated by a weighted sum of the others. It has been shown that adding patches to color charts does not help in practice, because the information they add is redundant with the information provided by the first set of patches. In this paper, we propose to use spectral data of higher dimensionality by using 3D color charts that create inter-reflections between the surfaces. These inter-reflections produce multiplications between natural spectral curves and so provide non-linear spectral curves. We show that such data provide enough information for accurate spectral data estimation. |
||||
| Address | London; 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 | BMVC | ||
| Notes | LAMP; 600.109; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ DMH2017b | Serial | 3037 | ||
| Permanent link to this record | |||||
| Author |
Raul Gomez; Baoguang Shi; Lluis Gomez; Lukas Numann; Andreas Veit; Jiri Matas; Serge Belongie; Dimosthenis Karatzas | ||||
| Title | ICDAR2017 Robust Reading Challenge on COCO-Text | Type | Conference Article | ||
| Year | 2017 | Publication | 14th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Kyoto; Japan; November 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 | ICDAR | ||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ GSG2017 | Serial | 3076 | ||
| Permanent link to this record | |||||