Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	106–120 of 3396 records found matching your query (RSS):

Search & Display Options

Select All Deselect All

<< 1 2 3 4 5 6 7 8 9 10 >> [11–20]

List View

Citations

Details

	Records
	Author	Juan Ramon Terven Salinas; Joaquin Salas; Bogdan Raducanu
	Title	Robust Head Gestures Recognition for Assistive Technology			Type	Book Chapter
	Year	2014	Publication	Pattern Recognition	Abbreviated Journal
	Volume	8495	Issue		Pages	152-161
	Keywords
	Abstract	This paper presents a system capable of recognizing six head gestures: nodding, shaking, turning right, turning left, looking up, and looking down. The main difference of our system compared to other methods is that the Hidden Markov Models presented in this paper, are fully connected and consider all possible states in any given order, providing the following advantages to the system: (1) allows unconstrained movement of the head and (2) it can be easily integrated into a wearable device (e.g. glasses, neck-hung devices), in which case it can robustly recognize gestures in the presence of ego-motion. Experimental results show that this approach outperforms common methods that use restricted HMMs for each gesture.
	Address
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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-319-07490-0	Medium
	Area		Expedition		Conference
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ TSR2014b			Serial	2505
Permanent link to this record



	Author	Francesco Brughi; Debora Gil; Llorenç Badiella; Eva Jove Casabella; Oriol Ramos Terrades
	Title	Exploring the impact of inter-query variability on the performance of retrieval systems			Type	Conference Article
	Year	2014	Publication	11th International Conference on Image Analysis and Recognition	Abbreviated Journal
	Volume	8814	Issue		Pages	413–420
	Keywords
	Abstract	This paper introduces a framework for evaluating the performance of information retrieval systems. Current evaluation metrics provide an average score that does not consider performance variability across the query set. In this manner, conclusions lack of any statistical significance, yielding poor inference to cases outside the query set and possibly unfair comparisons. We propose to apply statistical methods in order to obtain a more informative measure for problems in which different query classes can be identified. In this context, we assess the performance variability on two levels: overall variability across the whole query set and specific query class-related variability. To this end, we estimate confidence bands for precision-recall curves, and we apply ANOVA in order to assess the significance of the performance across different query classes.
	Address	Algarve; Portugal; October 2014
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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-319-11757-7	Medium
	Area		Expedition		Conference	ICIAR
	Notes	IAM; DAG; 600.060; 600.061; 600.077; 600.075			Approved	no
	Call Number	Admin @ si @ BGB2014			Serial	2559
Permanent link to this record



	Author	Estefania Talavera; Mariella Dimiccoli; Marc Bolaños; Maedeh Aghaei; Petia Radeva
	Title	R-clustering for egocentric video segmentation			Type	Conference Article
	Year	2015	Publication	Pattern Recognition and Image Analysis, Proceedings of 7th Iberian Conference , ibPRIA 2015	Abbreviated Journal
	Volume	9117	Issue		Pages	327-336
	Keywords	Temporal video segmentation; Egocentric videos; Clustering
	Abstract	In this paper, we present a new method for egocentric video temporal segmentation based on integrating a statistical mean change detector and agglomerative clustering(AC) within an energy-minimization framework. Given the tendency of most AC methods to oversegment video sequences when clustering their frames, we combine the clustering with a concept drift detection technique (ADWIN) that has rigorous guarantee of performances. ADWIN serves as a statistical upper bound for the clustering-based video segmentation. We integrate both techniques in an energy-minimization framework that serves to disambiguate the decision of both techniques and to complete the segmentation taking into account the temporal continuity of video frames descriptors. We present experiments over egocentric sets of more than 13.000 images acquired with different wearable cameras, showing that our method outperforms state-of-the-art clustering methods.
	Address	Santiago de Compostela; España; June 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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-319-19389-2	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	MILAB			Approved	no
	Call Number	Admin @ si @ TDB2015			Serial	2597
Permanent link to this record



	Author	Firat Ismailoglu; Ida G. Sprinkhuizen-Kuyper; Evgueni Smirnov; Sergio Escalera; Ralf Peeters
	Title	Fractional Programming Weighted Decoding for Error-Correcting Output Codes			Type	Conference Article
	Year	2015	Publication	Multiple Classifier Systems, Proceedings of 12th International Workshop , MCS 2015	Abbreviated Journal
	Volume		Issue		Pages	38-50
	Keywords
	Abstract	In order to increase the classification performance obtained using Error-Correcting Output Codes designs (ECOC), introducing weights in the decoding phase of the ECOC has attracted a lot of interest. In this work, we present a method for ECOC designs that focuses on increasing hypothesis margin on the data samples given a base classifier. While achieving this, we implicitly reward the base classifiers with high performance, whereas punish those with low performance. The resulting objective function is of the fractional programming type and we deal with this problem through the Dinkelbach’s Algorithm. The conducted tests over well known UCI datasets show that the presented method is superior to the unweighted decoding and that it outperforms the results of the state-of-the-art weighted decoding methods in most of the performed experiments.
	Address	Gunzburg; Germany; June 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-319-20247-1	Medium
	Area		Expedition		Conference	MCS
	Notes	HuPBA;MILAB			Approved	no
	Call Number	Admin @ si @ ISS2015			Serial	2601
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	Onur Ferhat; Arcadi Llanza; Fernando Vilariño
	Title	A Feature-Based Gaze Estimation Algorithm for Natural Light Scenarios			Type	Conference Article
	Year	2015	Publication	Pattern Recognition and Image Analysis, Proceedings of 7th Iberian Conference , ibPRIA 2015	Abbreviated Journal
	Volume	9117	Issue		Pages	569-576
	Keywords	Eye tracking; Gaze estimation; Natural light; Webcam
	Abstract	We present an eye tracking system that works with regular webcams. We base our work on open source CVC Eye Tracker [7] and we propose a number of improvements and a novel gaze estimation method. The new method uses features extracted from iris segmentation and it does not fall into the traditional categorization of appearance–based/model–based methods. Our experiments show that our approach reduces the gaze estimation errors by 34 % in the horizontal direction and by 12 % in the vertical direction compared to the baseline system.
	Address	Santiago de Compostela; June 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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-319-19389-2	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	MV;SIAI			Approved	no
	Call Number	Admin @ si @ FLV2015a			Serial	2646
Permanent link to this record



	Author	Dennis G.Romero; Anselmo Frizera; Angel Sappa; Boris X. Vintimilla; Teodiano F.Bastos
	Title	A predictive model for human activity recognition by observing actions and context			Type	Conference Article
	Year	2015	Publication	Advanced Concepts for Intelligent Vision Systems, Proceedings of 16th International Conference, ACIVS 2015	Abbreviated Journal
	Volume	9386	Issue		Pages	323-333
	Keywords
	Abstract	This paper presents a novel model to estimate human activities — a human activity is defined by a set of human actions. The proposed approach is based on the usage of Recurrent Neural Networks (RNN) and Bayesian inference through the continuous monitoring of human actions and its surrounding environment. In the current work human activities are inferred considering not only visual analysis but also additional resources; external sources of information, such as context information, are incorporated to contribute to the activity estimation. The novelty of the proposed approach lies in the way the information is encoded, so that it can be later associated according to a predefined semantic structure. Hence, a pattern representing a given activity can be defined by a set of actions, plus contextual information or other kind of information that could be relevant to describe the activity. Experimental results with real data are provided showing the validity of the proposed approach.
	Address	Catania; Italy; October 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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-319-25902-4	Medium
	Area		Expedition		Conference	ACIVS
	Notes	ADAS; 600.076			Approved	no
	Call Number	Admin @ si @ RFS2015			Serial	2661
Permanent link to this record



	Author	J.Poujol; Cristhian A. Aguilera-Carrasco; E.Danos; Boris X. Vintimilla; Ricardo Toledo; Angel Sappa
	Title	Visible-Thermal Fusion based Monocular Visual Odometry			Type	Conference Article
	Year	2015	Publication	2nd Iberian Robotics Conference ROBOT2015	Abbreviated Journal
	Volume	417	Issue		Pages	517-528
	Keywords	Monocular Visual Odometry; LWIR-RGB cross-spectral Imaging; Image Fusion.
	Abstract	The manuscript evaluates the performance of a monocular visual odometry approach when images from different spectra are considered, both independently and fused. The objective behind this evaluation is to analyze if classical approaches can be improved when the given images, which are from different spectra, are fused and represented in new domains. The images in these new domains should have some of the following properties: i) more robust to noisy data; ii) less sensitive to changes (e.g., lighting); iii) more rich in descriptive information, among other. In particular in the current work two different image fusion strategies are considered. Firstly, images from the visible and thermal spectrum are fused using a Discrete Wavelet Transform (DWT) approach. Secondly, a monochrome threshold strategy is considered. The obtained representations are evaluated under a visual odometry framework, highlighting their advantages and disadvantages, using different urban and semi-urban scenarios. Comparisons with both monocular-visible spectrum and monocular-infrared spectrum, are also provided showing the validity of the proposed approach.
	Address	Lisboa; Portugal; November 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	2194-5357	ISBN	978-3-319-27145-3	Medium
	Area		Expedition		Conference	ROBOT
	Notes	ADAS; 600.076; 600.086			Approved	no
	Call Number	Admin @ si @ PAD2015			Serial	2663
Permanent link to this record



	Author	Fahad Shahbaz Khan; Muhammad Anwer Rao; Joost Van de Weijer; Michael Felsberg; J.Laaksonen
	Title	Deep semantic pyramids for human attributes and action recognition			Type	Conference Article
	Year	2015	Publication	Image Analysis, Proceedings of 19th Scandinavian Conference , SCIA 2015	Abbreviated Journal
	Volume	9127	Issue		Pages	341-353
	Keywords	Action recognition; Human attributes; Semantic pyramids
	Abstract	Describing persons and their actions is a challenging problem due to variations in pose, scale and viewpoint in real-world images. Recently, semantic pyramids approach [1] for pose normalization has shown to provide excellent results for gender and action recognition. The performance of semantic pyramids approach relies on robust image description and is therefore limited due to the use of shallow local features. In the context of object recognition [2] and object detection [3], convolutional neural networks (CNNs) or deep features have shown to improve the performance over the conventional shallow features. We propose deep semantic pyramids for human attributes and action recognition. The method works by constructing spatial pyramids based on CNNs of different part locations. These pyramids are then combined to obtain a single semantic representation. We validate our approach on the Berkeley and 27 Human Attributes datasets for attributes classification. For action recognition, we perform experiments on two challenging datasets: Willow and PASCAL VOC 2010. The proposed deep semantic pyramids provide a significant gain of 17.2%, 13.9%, 24.3% and 22.6% compared to the standard shallow semantic pyramids on Berkeley, 27 Human Attributes, Willow and PASCAL VOC 2010 datasets respectively. Our results also show that deep semantic pyramids outperform conventional CNNs based on the full bounding box of the person. Finally, we compare our approach with state-of-the-art methods and show a gain in performance compared to best methods in literature.
	Address	Denmark; Copenhagen; June 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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-319-19664-0	Medium
	Area		Expedition		Conference	SCIA
	Notes	LAMP; 600.068; 600.079;ADAS			Approved	no
	Call Number	Admin @ si @ KRW2015b			Serial	2672
Permanent link to this record



	Author	Suman Ghosh; Ernest Valveny
	Title	A Sliding Window Framework for Word Spotting Based on Word Attributes			Type	Conference Article
	Year	2015	Publication	Pattern Recognition and Image Analysis, Proceedings of 7th Iberian Conference , ibPRIA 2015	Abbreviated Journal
	Volume	9117	Issue		Pages	652-661
	Keywords	Word spotting; Sliding window; Word attributes
	Abstract	In this paper we propose a segmentation-free approach to word spotting. Word images are first encoded into feature vectors using Fisher Vector. Then, these feature vectors are used together with pyramidal histogram of characters labels (PHOC) to learn SVM-based attribute models. Documents are represented by these PHOC based word attributes. To efficiently compute the word attributes over a sliding window, we propose to use an integral image representation of the document using a simplified version of the attribute model. Finally we re-rank the top word candidates using the more discriminative full version of the word attributes. We show state-of-the-art results for segmentation-free query-by-example word spotting in single-writer and multi-writer standard datasets.
	Address	Santiago de Compostela; June 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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-319-19389-2	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	DAG; 600.077			Approved	no
	Call Number	Admin @ si @ GhV2015b			Serial	2716
Permanent link to this record



	Author	Hanne Kause; Aura Hernandez-Sabate; Patricia Marquez; Andrea Fuster; Luc Florack; Hans van Assen; Debora Gil
	Title	Confidence Measures for Assessing the HARP Algorithm in Tagged Magnetic Resonance Imaging			Type	Book Chapter
	Year	2015	Publication	Statistical Atlases and Computational Models of the Heart. Revised selected papers of Imaging and Modelling Challenges 6th International Workshop, STACOM 2015, Held in Conjunction with MICCAI 2015	Abbreviated Journal
	Volume	9534	Issue		Pages	69-79
	Keywords
	Abstract	Cardiac deformation and changes therein have been linked to pathologies. Both can be extracted in detail from tagged Magnetic Resonance Imaging (tMRI) using harmonic phase (HARP) images. Although point tracking algorithms have shown to have high accuracies on HARP images, these vary with position. Detecting and discarding areas with unreliable results is crucial for use in clinical support systems. This paper assesses the capability of two confidence measures (CMs), based on energy and image structure, for detecting locations with reduced accuracy in motion tracking results. These CMs were tested on a database of simulated tMRI images containing the most common artifacts that may affect tracking accuracy. CM performance is assessed based on its capability for HARP tracking error bounding and compared in terms of significant differences detected using a multi comparison analysis of variance that takes into account the most influential factors on HARP tracking performance. Results showed that the CM based on image structure was better suited to detect unreliable optical flow vectors. In addition, it was shown that CMs can be used to detect optical flow vectors with large errors in order to improve the optical flow obtained with the HARP tracking algorithm.
	Address	Munich; Germany; January 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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-319-28711-9	Medium
	Area		Expedition		Conference	STACOM
	Notes	ADAS; IAM; 600.075; 600.076; 600.060; 601.145			Approved	no
	Call Number	Admin @ si @ KHM2015			Serial	2734
Permanent link to this record



	Author	Aleksandr Setkov; Fabio Martinez Carillo; Michele Gouiffes; Christian Jacquemin; Maria Vanrell; Ramon Baldrich
	Title	DAcImPro: A Novel Database of Acquired Image Projections and Its Application to Object Recognition			Type	Conference Article
	Year	2015	Publication	Advances in Visual Computing. Proceedings of 11th International Symposium, ISVC 2015 Part II	Abbreviated Journal
	Volume	9475	Issue		Pages	463-473
	Keywords	Projector-camera systems; Feature descriptors; Object recognition
	Abstract	Projector-camera systems are designed to improve the projection quality by comparing original images with their captured projections, which is usually complicated due to high photometric and geometric variations. Many research works address this problem using their own test data which makes it extremely difficult to compare different proposals. This paper has two main contributions. Firstly, we introduce a new database of acquired image projections (DAcImPro) that, covering photometric and geometric conditions and providing data for ground-truth computation, can serve to evaluate different algorithms in projector-camera systems. Secondly, a new object recognition scenario from acquired projections is presented, which could be of a great interest in such domains, as home video projections and public presentations. We show that the task is more challenging than the classical recognition problem and thus requires additional pre-processing, such as color compensation or projection area selection.
	Address
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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-319-27862-9	Medium
	Area		Expedition		Conference	ISVC
	Notes	CIC			Approved	no
	Call Number	Admin @ si @ SMG2015			Serial	2736
Permanent link to this record



	Author	Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera
	Title	Action Recognition by Pairwise Proximity Function Support Vector Machines with Dynamic Time Warping Kernels			Type	Conference Article
	Year	2016	Publication	29th Canadian Conference on Artificial Intelligence	Abbreviated Journal
	Volume	9673	Issue		Pages	3-14
	Keywords
	Abstract	In the context of human action recognition using skeleton data, the 3D trajectories of joint points may be considered as multi-dimensional time series. The traditional recognition technique in the literature is based on time series dis(similarity) measures (such as Dynamic Time Warping). For these general dis(similarity) measures, k-nearest neighbor algorithms are a natural choice. However, k-NN classifiers are known to be sensitive to noise and outliers. In this paper, a new class of Support Vector Machine that is applicable to trajectory classification, such as action recognition, is developed by incorporating an efficient time-series distances measure into the kernel function. More specifically, the derivative of Dynamic Time Warping (DTW) distance measure is employed as the SVM kernel. In addition, the pairwise proximity learning strategy is utilized in order to make use of non-positive semi-definite (PSD) kernels in the SVM formulation. The recognition results of the proposed technique on two action recognition datasets demonstrates the ourperformance of our methodology compared to the state-of-the-art methods. Remarkably, we obtained 89 % accuracy on the well-known MSRAction3D dataset using only 3D trajectories of body joints obtained by Kinect
	Address	Victoria; Canada; May 2016
	Corporate Author				Thesis
	Publisher	Springer International Publishing	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	AI
	Notes	HuPBA;MILAB;			Approved	no
	Call Number	Admin @ si @ BGE2016b			Serial	2770
Permanent link to this record



	Author	E. Tavalera; Mariella Dimiccoli; Marc Bolaños; Maedeh Aghaei; Petia Radeva
	Title	Regularized Clustering for Egocentric Video Segmentation			Type	Book Chapter
	Year	2015	Publication	Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume		Issue		Pages	327-336
	Keywords	Temporal video segmentation ; Egocentric videos ; Clustering
	Abstract	In this paper, we present a new method for egocentric video temporal segmentation based on integrating a statistical mean change detector and agglomerative clustering(AC) within an energyminimization framework. Given the tendency of most AC methods to oversegment video sequences when clustering their frames, we combine the clustering with a concept drift detection technique (ADWIN) that has rigorous guarantee of performances. ADWIN serves as a statistical upper bound for the clustering-based video segmentation. We integrate techniques in an energy-minimization framework that serves disambiguate the decision of both techniques and to complete the segmentation taking into account the temporal continuity of video frames We present experiments over egocentric sets of more than 13.000 images acquired with different wearable cameras, showing that our method outperforms state-of-the-art clustering methods.
	Address
	Corporate Author				Thesis
	Publisher	Springer International Publishing	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-319-19390-8	Medium
	Area		Expedition		Conference
	Notes	MILAB			Approved	no
	Call Number	Admin @ si @TDB2015a			Serial	2781
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