Publicacions CVC -- Query Results

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

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	Fahad Shahbaz Khan; Muhammad Anwer Rao; Joost Van de Weijer; Andrew Bagdanov; Antonio Lopez; Michael Felsberg
	Title	Coloring Action Recognition in Still Images			Type	Journal Article
	Year	2013	Publication	International Journal of Computer Vision	Abbreviated Journal	IJCV
	Volume	105	Issue	3	Pages	205-221
	Keywords
	Abstract	In this article we investigate the problem of human action recognition in static images. By action recognition we intend a class of problems which includes both action classification and action detection (i.e. simultaneous localization and classification). Bag-of-words image representations yield promising results for action classification, and deformable part models perform very well object detection. The representations for action recognition typically use only shape cues and ignore color information. Inspired by the recent success of color in image classification and object detection, we investigate the potential of color for action classification and detection in static images. We perform a comprehensive evaluation of color descriptors and fusion approaches for action recognition. Experiments were conducted on the three datasets most used for benchmarking action recognition in still images: Willow, PASCAL VOC 2010 and Stanford-40. Our experiments demonstrate that incorporating color information considerably improves recognition performance, and that a descriptor based on color names outperforms pure color descriptors. Our experiments demonstrate that late fusion of color and shape information outperforms other approaches on action recognition. Finally, we show that the different color–shape fusion approaches result in complementary information and combining them yields state-of-the-art performance for action classification.
	Address
	Corporate Author				Thesis
	Publisher	Springer US	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0920-5691	ISBN		Medium
	Area		Expedition		Conference
	Notes	CIC; ADAS; 600.057; 600.048			Approved	no
	Call Number	Admin @ si @ KRW2013			Serial	2285
Permanent link to this record



	Author	Jiaolong Xu; Sebastian Ramos; David Vazquez; Antonio Lopez
	Title	Hierarchical Adaptive Structural SVM for Domain Adaptation			Type	Journal Article
	Year	2016	Publication	International Journal of Computer Vision	Abbreviated Journal	IJCV
	Volume	119	Issue	2	Pages	159-178
	Keywords	Domain Adaptation; Pedestrian Detection
	Abstract	A key topic in classification is the accuracy loss produced when the data distribution in the training (source) domain differs from that in the testing (target) domain. This is being recognized as a very relevant problem for many computer vision tasks such as image classification, object detection, and object category recognition. In this paper, we present a novel domain adaptation method that leverages multiple target domains (or sub-domains) in a hierarchical adaptation tree. The core idea is to exploit the commonalities and differences of the jointly considered target domains. Given the relevance of structural SVM (SSVM) classifiers, we apply our idea to the adaptive SSVM (A-SSVM), which only requires the target domain samples together with the existing source-domain classifier for performing the desired adaptation. Altogether, we term our proposal as hierarchical A-SSVM (HA-SSVM). As proof of concept we use HA-SSVM for pedestrian detection, object category recognition and face recognition. In the former we apply HA-SSVM to the deformable partbased model (DPM) while in the rest HA-SSVM is applied to multi-category classifiers. We will show how HA-SSVM is effective in increasing the detection/recognition accuracy with respect to adaptation strategies that ignore the structure of the target data. Since, the sub-domains of the target data are not always known a priori, we shown how HA-SSVM can incorporate sub-domain discovery for object category recognition.
	Address
	Corporate Author				Thesis
	Publisher	Springer US	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0920-5691	ISBN		Medium
	Area		Expedition		Conference
	Notes	ADAS; 600.085; 600.082; 600.076			Approved	no
	Call Number	Admin @ si @ XRV2016			Serial	2669
Permanent link to this record



	Author	Antonio Hernandez; Sergio Escalera; Stan Sclaroff
	Title	Poselet-basedContextual Rescoring for Human Pose Estimation via Pictorial Structures			Type	Journal Article
	Year	2016	Publication	International Journal of Computer Vision	Abbreviated Journal	IJCV
	Volume	118	Issue	1	Pages	49–64
	Keywords	Contextual rescoring; Poselets; Human pose estimation
	Abstract	In this paper we propose a contextual rescoring method for predicting the position of body parts in a human pose estimation framework. A set of poselets is incorporated in the model, and their detections are used to extract spatial and score-related features relative to other body part hypotheses. A method is proposed for the automatic discovery of a compact subset of poselets that covers the different poses in a set of validation images while maximizing precision. A rescoring mechanism is defined as a set-based boosting classifier that computes a new score for each body joint detection, given its relationship to detections of other body joints and mid-level parts in the image. This new score is incorporated in the pictorial structure model as an additional unary potential, following the recent work of Pishchulin et al. Experiments on two benchmarks show comparable results to Pishchulin et al. while reducing the size of the mid-level representation by an order of magnitude, reducing the execution time by 68 % accordingly.
	Address
	Corporate Author				Thesis
	Publisher	Springer US	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0920-5691	ISBN		Medium
	Area		Expedition		Conference
	Notes	HuPBA;MILAB;			Approved	no
	Call Number	Admin @ si @ HES2016			Serial	2719
Permanent link to this record



	Author	Jorge Bernal; F. Javier Sanchez; Gloria Fernandez Esparrach; Debora Gil; Cristina Rodriguez de Miguel; Fernando Vilariño
	Title	WM-DOVA Maps for Accurate Polyp Highlighting in Colonoscopy: Validation vs. Saliency Maps from Physicians			Type	Journal Article
	Year	2015	Publication	Computerized Medical Imaging and Graphics	Abbreviated Journal	CMIG
	Volume	43	Issue		Pages	99-111
	Keywords	Polyp localization; Energy Maps; Colonoscopy; Saliency; Valley detection
	Abstract	We introduce in this paper a novel polyp localization method for colonoscopy videos. Our method is based on a model of appearance for polyps which defines polyp boundaries in terms of valley information. We propose the integration of valley information in a robust way fostering complete, concave and continuous boundaries typically associated to polyps. This integration is done by using a window of radial sectors which accumulate valley information to create WMDOVA1 energy maps related with the likelihood of polyp presence. We perform a double validation of our maps, which include the introduction of two new databases, including the first, up to our knowledge, fully annotated database with clinical metadata associated. First we assess that the highest value corresponds with the location of the polyp in the image. Second, we show that WM-DOVA energy maps can be comparable with saliency maps obtained from physicians' fixations obtained via an eye-tracker. Finally, we prove that our method outperforms state-of-the-art computational saliency results. Our method shows good performance, particularly for small polyps which are reported to be the main sources of polyp miss-rate, which indicates the potential applicability of our method in clinical practice.
	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	0895-6111	ISBN		Medium
	Area		Expedition		Conference
	Notes	MV; IAM; 600.047; 600.060; 600.075;SIAI			Approved	no
	Call Number	Admin @ si @ BSF2015			Serial	2609
Permanent link to this record



	Author	Aura Hernandez-Sabate; Debora Gil; Jaume Garcia; Enric Marti
	Title	Image-based Cardiac Phase Retrieval in Intravascular Ultrasound Sequences			Type	Journal Article
	Year	2011	Publication	IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control	Abbreviated Journal	T-UFFC
	Volume	58	Issue	1	Pages	60-72
	Keywords	3-D exploring; ECG; band-pass filter; cardiac motion; cardiac phase retrieval; coronary arteries; electrocardiogram signal; image intensity local mean evolution; image-based cardiac phase retrieval; in vivo pullbacks acquisition; intravascular ultrasound sequences; longitudinal motion; signal extrema; time 36 ms; band-pass filters; biomedical ultrasonics; cardiovascular system; electrocardiography; image motion analysis; image retrieval; image sequences; medical image processing; ultrasonic imaging
	Abstract	Longitudinal motion during in vivo pullbacks acquisition of intravascular ultrasound (IVUS) sequences is a major artifact for 3-D exploring of coronary arteries. Most current techniques are based on the electrocardiogram (ECG) signal to obtain a gated pullback without longitudinal motion by using specific hardware or the ECG signal itself. We present an image-based approach for cardiac phase retrieval from coronary IVUS sequences without an ECG signal. A signal reflecting cardiac motion is computed by exploring the image intensity local mean evolution. The signal is filtered by a band-pass filter centered at the main cardiac frequency. Phase is retrieved by computing signal extrema. The average frame processing time using our setup is 36 ms. Comparison to manually sampled sequences encourages a deeper study comparing them to ECG signals.
	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	0885-3010	ISBN		Medium
	Area		Expedition		Conference
	Notes	IAM;ADAS			Approved	no
	Call Number	IAM @ iam @ HGG2011			Serial	1546
Permanent link to this record



	Author	L. Calvet; A. Ferrer; M. Gomes; A. Juan; David Masip
	Title	Combining Statistical Learning with Metaheuristics for the Multi-Depot Vehicle Routing Problem with Market Segmentation			Type	Journal Article
	Year	2016	Publication	Computers & Industrial Engineering	Abbreviated Journal	CIE
	Volume	94	Issue		Pages	93-104
	Keywords	Multi-Depot Vehicle Routing Problem; market segmentation applications; hybrid algorithms; statistical learning
	Abstract	In real-life logistics and distribution activities it is usual to face situations in which the distribution of goods has to be made from multiple warehouses or depots to the nal customers. This problem is known as the Multi-Depot Vehicle Routing Problem (MDVRP), and it typically includes two sequential and correlated stages: (a) the assignment map of customers to depots, and (b) the corresponding design of the distribution routes. Most of the existing work in the literature has focused on minimizing distance-based distribution costs while satisfying a number of capacity constraints. However, no attention has been given so far to potential variations in demands due to the tness of the customerdepot mapping in the case of heterogeneous depots. In this paper, we consider this realistic version of the problem in which the depots are heterogeneous in terms of their commercial oer and customers show dierent willingness to consume depending on how well the assigned depot ts their preferences. Thus, we assume that dierent customer-depot assignment maps will lead to dierent customer-expenditure levels. As a consequence, market-segmentation strategiesneed to be considered in order to increase sales and total income while accounting for the distribution costs. To solve this extension of the MDVRP, we propose a hybrid approach that combines statistical learning techniques with a metaheuristic framework. First, a set of predictive models is generated from historical data. These statistical models allow estimating the demand of any customer depending on the assigned depot. Then, the estimated expenditure of each customer is included as part of an enriched objective function as a way to better guide the stochastic local search inside the metaheuristic framework. A set of computational experiments contribute to illustrate our approach and how the extended MDVRP considered here diers in terms of the proposed solutions from the traditional one.
	Address
	Corporate Author				Thesis
	Publisher	PERGAMON-ELSEVIER SCIENCE LTD	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	CIE
	Series Volume		Series Issue		Edition
	ISSN	0360-8352	ISBN		Medium
	Area		Expedition		Conference
	Notes	OR;MV;			Approved	no
	Call Number	Admin @ si @ CFG2016			Serial	2749
Permanent link to this record



	Author	Fernando Vilariño; Panagiota Spyridonos; Fosca De Iorio; Jordi Vitria; Fernando Azpiroz; Petia Radeva
	Title	Intestinal Motility Assessment With Video Capsule Endoscopy: Automatic Annotation of Phasic Intestinal Contractions			Type	Journal Article
	Year	2010	Publication	IEEE Transactions on Medical Imaging	Abbreviated Journal	TMI
	Volume	29	Issue	2	Pages	246-259
	Keywords
	Abstract	Intestinal motility assessment with video capsule endoscopy arises as a novel and challenging clinical fieldwork. This technique is based on the analysis of the patterns of intestinal contractions shown in a video provided by an ingestible capsule with a wireless micro-camera. The manual labeling of all the motility events requires large amount of time for offline screening in search of findings with low prevalence, which turns this procedure currently unpractical. In this paper, we propose a machine learning system to automatically detect the phasic intestinal contractions in video capsule endoscopy, driving a useful but not feasible clinical routine into a feasible clinical procedure. Our proposal is based on a sequential design which involves the analysis of textural, color, and blob features together with SVM classifiers. Our approach tackles the reduction of the imbalance rate of data and allows the inclusion of domain knowledge as new stages in the cascade. We present a detailed analysis, both in a quantitative and a qualitative way, by providing several measures of performance and the assessment study of interobserver variability. Our system performs at 70% of sensitivity for individual detection, whilst obtaining equivalent patterns to those of the experts for density of contractions.
	Address
	Corporate Author	IEEE			Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0278-0062	ISBN		Medium
	Area	800	Expedition		Conference
	Notes	MILAB;MV;OR;SIAI			Approved	no
	Call Number	BCNPCL @ bcnpcl @ VSD2010; IAM @ iam @ VSI2010			Serial	1281
Permanent link to this record



	Author	Jaume Garcia; Debora Gil; Luis Badiella; Aura Hernandez-Sabate; Francesc Carreras; Sandra Pujades; Enric Marti
	Title	A Normalized Framework for the Design of Feature Spaces Assessing the Left Ventricular Function			Type	Journal Article
	Year	2010	Publication	IEEE Transactions on Medical Imaging	Abbreviated Journal	TMI
	Volume	29	Issue	3	Pages	733-745
	Keywords
	Abstract	A through description of the left ventricle functionality requires combining complementary regional scores. A main limitation is the lack of multiparametric normality models oriented to the assessment of regional wall motion abnormalities (RWMA). This paper covers two main topics involved in RWMA assessment. We propose a general framework allowing the fusion and comparison across subjects of different regional scores. Our framework is used to explore which combination of regional scores (including 2-D motion and strains) is better suited for RWMA detection. Our statistical analysis indicates that for a proper (within interobserver variability) identification of RWMA, models should consider motion and extreme strains.
	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	0278-0062	ISBN		Medium
	Area		Expedition		Conference
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ GGH2010b			Serial	1507
Permanent link to this record



	Author	Aura Hernandez-Sabate; Debora Gil;Eduard Fernandez-Nofrerias;Petia Radeva; Enric Marti
	Title	Approaching Artery Rigid Dynamics in IVUS			Type	Journal Article
	Year	2009	Publication	IEEE Transactions on Medical Imaging	Abbreviated Journal	TMI
	Volume	28	Issue	11	Pages	1670-1680
	Keywords	Fourier analysis; intravascular ultrasound (IVUS) dynamics; longitudinal motion; quality measures; tissue deformation.
	Abstract	Tissue biomechanical properties (like strain and stress) are playing an increasing role in diagnosis and long-term treatment of intravascular coronary diseases. Their assessment strongly relies on estimation of vessel wall deformation. Since intravascular ultrasound (IVUS) sequences allow visualizing vessel morphology and reflect its dynamics, this technique represents a useful tool for evaluation of tissue mechanical properties. Image misalignment introduced by vessel-catheter motion is a major artifact for a proper tracking of tissue deformation. In this work, we focus on compensating and assessing IVUS rigid in-plane motion due to heart beating. Motion parameters are computed by considering both the vessel geometry and its appearance in the image. Continuum mechanics laws serve to introduce a novel score measuring motion reduction in in vivo sequences. Synthetic experiments validate the proposed score as measure of motion parameters accuracy; whereas results in in vivo pullbacks show the reliability of the presented methodologies in clinical cases.
	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	0278-0062	ISBN		Medium
	Area		Expedition		Conference
	Notes	IAM; MILAB			Approved	no
	Call Number	IAM @ iam @ HGF2009			Serial	1545
Permanent link to this record



	Author	Carme Julia; Angel Sappa; Felipe Lumbreras; Joan Serrat; Antonio Lopez
	Title	An Iterative Multiresolution Scheme for SFM with Missing Data: single and multiple object scenes			Type	Journal Article
	Year	2010	Publication	Image and Vision Computing	Abbreviated Journal	IMAVIS
	Volume	28	Issue	1	Pages	164-176
	Keywords
	Abstract	Most of the techniques proposed for tackling the Structure from Motion problem (SFM) cannot deal with high percentages of missing data in the matrix of trajectories. Furthermore, an additional problem should be faced up when working with multiple object scenes: the rank of the matrix of trajectories should be estimated. This paper presents an iterative multiresolution scheme for SFM with missing data to be used in both the single and multiple object cases. The proposed scheme aims at recovering missing entries in the original input matrix. The objective is to improve the results by applying a factorization technique to the partially or totally filled in matrix instead of to the original input one. Experimental results obtained with synthetic and real data sequences, containing single and multiple objects, are presented to show the viability of the proposed approach.
	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	0262-8856	ISBN		Medium
	Area		Expedition		Conference
	Notes	ADAS			Approved	no
	Call Number	ADAS @ adas @ JSL2010			Serial	1278
Permanent link to this record



	Author	Bogdan Raducanu; Jordi Vitria; Ales Leonardis
	Title	Online pattern recognition and machine learning techniques for computer-vision: Theory and applications			Type	Journal Article
	Year	2010	Publication	Image and Vision Computing	Abbreviated Journal	IMAVIS
	Volume	28	Issue	7	Pages	1063–1064
	Keywords
	Abstract	(Editorial for the Special Issue on Online pattern recognition and machine learning techniques) In real life, visual learning is supposed to be a continuous process. This paradigm has found its way also in artificial vision systems. There is an increasing trend in pattern recognition represented by online learning approaches, which aims at continuously updating the data representation when new information arrives. Starting with a minimal dataset, the initial knowledge is expanded by incorporating incoming instances, which may have not been previously available or foreseen at the system’s design stage. An interesting characteristic of this strategy is that the train and test phases take place simultaneously. Given the increasing interest in this subject, the aim of this special issue is to be a landmark event in the development of online learning techniques and their applications with the hope that it will capture the interest of a wider audience and will attract even more researchers. We received 19 contributions, of which 9 have been accepted for publication, after having been subjected to usual peer review process.
	Address
	Corporate Author				Thesis
	Publisher	Elsevier	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0262-8856	ISBN		Medium
	Area		Expedition		Conference
	Notes	OR;MV			Approved	no
	Call Number	BCNPCL @ bcnpcl @ RVL2010			Serial	1280
Permanent link to this record



	Author	Oriol Pujol; Debora Gil; Petia Radeva
	Title	Fundamentals of Stop and Go active models			Type	Journal Article
	Year	2005	Publication	Image and Vision Computing	Abbreviated Journal
	Volume	23	Issue	8	Pages	681-691
	Keywords	Deformable models; Geodesic snakes; Region-based segmentation
	Abstract	An efficient snake formulation should conform to the idea of picking the smoothest curve among all the shapes approximating an object of interest. In current geodesic snakes, the regularizing curvature also affects the convergence stage, hindering the latter at concave regions. In the present work, we make use of characteristic functions to define a novel geodesic formulation that decouples regularity and convergence. This term decoupling endows the snake with higher adaptability to non-convex shapes. Convergence is ensured by splitting the definition of the external force into an attractive vector field and a repulsive one. In our paper, we propose to use likelihood maps as approximation of characteristic functions of object appearance. The better efficiency and accuracy of our decoupled scheme are illustrated in the particular case of feature space-based segmentation.
	Address
	Corporate Author				Thesis
	Publisher	Butterworth-Heinemann	Place of Publication	Newton, MA, USA	Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0262-8856	ISBN		Medium
	Area		Expedition		Conference
	Notes	IAM;MILAB;HuPBA			Approved	no
	Call Number	IAM @ iam @ PGR2005			Serial	1629
Permanent link to this record



	Author	Jaume Amores
	Title	MILDE: multiple instance learning by discriminative embedding			Type	Journal Article
	Year	2015	Publication	Knowledge and Information Systems	Abbreviated Journal	KAIS
	Volume	42	Issue	2	Pages	381-407
	Keywords	Multi-instance learning; Codebook; Bag of words
	Abstract	While the objective of the standard supervised learning problem is to classify feature vectors, in the multiple instance learning problem, the objective is to classify bags, where each bag contains multiple feature vectors. This represents a generalization of the standard problem, and this generalization becomes necessary in many real applications such as drug activity prediction, content-based image retrieval, and others. While the existing paradigms are based on learning the discriminant information either at the instance level or at the bag level, we propose to incorporate both levels of information. This is done by defining a discriminative embedding of the original space based on the responses of cluster-adapted instance classifiers. Results clearly show the advantage of the proposed method over the state of the art, where we tested the performance through a variety of well-known databases that come from real problems, and we also included an analysis of the performance using synthetically generated data.
	Address
	Corporate Author				Thesis
	Publisher	Springer London	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0219-1377	ISBN		Medium
	Area		Expedition		Conference
	Notes	ADAS; 601.042; 600.057; 600.076			Approved	no
	Call Number	Admin @ si @ Amo2015			Serial	2383
Permanent link to this record



	Author	Adriana Romero; Carlo Gatta; Gustavo Camps-Valls
	Title	Unsupervised Deep Feature Extraction for Remote Sensing Image Classification			Type	Journal Article
	Year	2016	Publication	IEEE Transaction on Geoscience and Remote Sensing	Abbreviated Journal	TGRS
	Volume	54	Issue	3	Pages	1349 - 1362
	Keywords
	Abstract	This paper introduces the use of single-layer and deep convolutional networks for remote sensing data analysis. Direct application to multi- and hyperspectral imagery of supervised (shallow or deep) convolutional networks is very challenging given the high input data dimensionality and the relatively small amount of available labeled data. Therefore, we propose the use of greedy layerwise unsupervised pretraining coupled with a highly efficient algorithm for unsupervised learning of sparse features. The algorithm is rooted on sparse representations and enforces both population and lifetime sparsity of the extracted features, simultaneously. We successfully illustrate the expressive power of the extracted representations in several scenarios: classification of aerial scenes, as well as land-use classification in very high resolution or land-cover classification from multi- and hyperspectral images. The proposed algorithm clearly outperforms standard principal component analysis (PCA) and its kernel counterpart (kPCA), as well as current state-of-the-art algorithms of aerial classification, while being extremely computationally efficient at learning representations of data. Results show that single-layer convolutional networks can extract powerful discriminative features only when the receptive field accounts for neighboring pixels and are preferred when the classification requires high resolution and detailed results. However, deep architectures significantly outperform single-layer variants, capturing increasing levels of abstraction and complexity throughout the feature hierarchy.
	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	0196-2892	ISBN		Medium
	Area		Expedition		Conference
	Notes	LAMP; 600.079;MILAB			Approved	no
	Call Number	Admin @ si @ RGC2016			Serial	2723
Permanent link to this record



	Author	Miquel Ferrer; Ernest Valveny; F. Serratosa
	Title	Median graph: A new exact algorithm using a distance based on the maximum common subgraph			Type	Journal Article
	Year	2009	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	30	Issue	5	Pages	579–588
	Keywords
	Abstract	Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems.
	Address
	Corporate Author				Thesis
	Publisher	Elsevier Science Inc.	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0167-8655	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ FVS2009a			Serial	1114
Permanent link to this record