Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	61–75 of 172 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–12]

List View

Citations

Details

	Records
	Author	Francesco Ciompi; Simone Balocco; Carles Caus; J. Mauri; Petia Radeva
	Title	Stent shape estimation through a comprehensive interpretation of intravascular ultrasound images			Type	Conference Article
	Year	2013	Publication	16th International Conference on Medical Image Computing and Computer Assisted Intervention	Abbreviated Journal
	Volume	8150	Issue	2	Pages	345-352
	Keywords
	Abstract	We present a method for automatic struts detection and stent shape estimation in cross-sectional intravascular ultrasound images. A stent shape is first estimated through a comprehensive interpretation of the vessel morphology, performed using a supervised context-aware multi-class classification scheme. Then, the successive strut identification exploits both local appearance and the defined stent shape. The method is tested on 589 images obtained from 80 patients, achieving a F-measure of 74.1% and an averaged distance between manual and automatic struts of 0.10 mm.
	Address	Nagoya; Japan; September 2013
	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-40762-8	Medium
	Area		Expedition		Conference	MICCAI
	Notes	MILAB			Approved	no
	Call Number	Admin @ si @ CBC2013			Serial	2258
Permanent link to this record



	Author	Daniel Sanchez; J.C.Ortega; Miguel Angel Bautista
	Title	Human Body Segmentation with Multi-limb Error-Correcting Output Codes Detection and Graph Cuts Optimization			Type	Conference Article
	Year	2013	Publication	6th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	7887	Issue		Pages	50-58
	Keywords	Human Body Segmentation; Error-Correcting Output Codes; Cascade of Classifiers; Graph Cuts
	Abstract	Human body segmentation is a hard task because of the high variability in appearance produced by changes in the point of view, lighting conditions, and number of articulations of the human body. In this paper, we propose a two-stage approach for the segmentation of the human body. In a first step, a set of human limbs are described, normalized to be rotation invariant, and trained using cascade of classifiers to be split in a tree structure way. Once the tree structure is trained, it is included in a ternary Error-Correcting Output Codes (ECOC) framework. This first classification step is applied in a windowing way on a new test image, defining a body-like probability map, which is used as an initialization of a GMM color modelling and binary Graph Cuts optimization procedure. The proposed methodology is tested in a novel limb-labelled data set. Results show performance improvements of the novel approach in comparison to classical cascade of classifiers and human detector-based Graph Cuts segmentation approaches.
	Address	Madeira; Portugal; June 2013
	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-38627-5	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	HUPBA			Approved	no
	Call Number	SOB2013			Serial	2250
Permanent link to this record



	Author	Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera
	Title	Logo recognition Based on the Dempster-Shafer Fusion of Multiple Classifiers			Type	Conference Article
	Year	2013	Publication	26th Canadian Conference on Artificial Intelligence	Abbreviated Journal
	Volume	7884	Issue		Pages	1-12
	Keywords	Logo recognition; ensemble classification; Dempster-Shafer fusion; Zernike moments; generic Fourier descriptor; shape signature
	Abstract	Best paper award The performance of different feature extraction and shape description methods in trademark image recognition systems have been studied by several researchers. However, the potential improvement in classification through feature fusion by ensemble-based methods has remained unattended. In this work, we evaluate the performance of an ensemble of three classifiers, each trained on different feature sets. Three promising shape description techniques, including Zernike moments, generic Fourier descriptors, and shape signature are used to extract informative features from logo images, and each set of features is fed into an individual classifier. In order to reduce recognition error, a powerful combination strategy based on the Dempster-Shafer theory is utilized to fuse the three classifiers trained on different sources of information. This combination strategy can effectively make use of diversity of base learners generated with different set of features. The recognition results of the individual classifiers are compared with those obtained from fusing the classifiers’ output, showing significant performance improvements of the proposed methodology.
	Address	Canada; May 2013
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-38456-1	Medium
	Area		Expedition		Conference	AI
	Notes	HuPBA;MILAB			Approved	no
	Call Number	Admin @ si @ BGE2013b			Serial	2249
Permanent link to this record



	Author	Naveen Onkarappa; Angel Sappa
	Title	Laplacian Derivative based Regularization for Optical Flow Estimation in Driving Scenario			Type	Conference Article
	Year	2013	Publication	15th International Conference on Computer Analysis of Images and Patterns	Abbreviated Journal
	Volume	8048	Issue		Pages	483-490
	Keywords	Optical flow; regularization; Driver Assistance Systems; Performance Evaluation
	Abstract	Existing state of the art optical flow approaches, which are evaluated on standard datasets such as Middlebury, not necessarily have a similar performance when evaluated on driving scenarios. This drop on performance is due to several challenges arising on real scenarios during driving. Towards this direction, in this paper, we propose a modification to the regularization term in a variational optical flow formulation, that notably improves the results, specially in driving scenarios. The proposed modification consists on using the Laplacian derivatives of flow components in the regularization term instead of gradients of flow components. We show the improvements in results on a standard real image sequences dataset (KITTI).
	Address	York; UK; August 2013
	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-40245-6	Medium
	Area		Expedition		Conference	CAIP
	Notes	ADAS; 600.055; 601.215			Approved	no
	Call Number	Admin @ si @ OnS2013b			Serial	2244
Permanent link to this record



	Author	Patricia Marquez; Debora Gil; Aura Hernandez-Sabate; Daniel Kondermann
	Title	When Is A Confidence Measure Good Enough?			Type	Conference Article
	Year	2013	Publication	9th International Conference on Computer Vision Systems	Abbreviated Journal
	Volume	7963	Issue		Pages	344-353
	Keywords	Optical flow, confidence measure, performance evaluation
	Abstract	Confidence estimation has recently become a hot topic in image processing and computer vision.Yet, several definitions exist of the term “confidence” which are sometimes used interchangeably. This is a position paper, in which we aim to give an overview on existing definitions, thereby clarifying the meaning of the used terms to facilitate further research in this field. Based on these clarifications, we develop a theory to compare confidence measures with respect to their quality.
	Address	St Petersburg; Russia; July 2013
	Corporate Author				Thesis
	Publisher	Springer Link	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-39401-0	Medium
	Area		Expedition		Conference	ICVS
	Notes	IAM;ADAS; 600.044; 600.057; 600.060; 601.145			Approved	no
	Call Number	IAM @ iam @ MGH2013a			Serial	2218
Permanent link to this record



	Author	Katerine Diaz; Francesc J. Ferri; W. Diaz
	Title	Fast Approximated Discriminative Common Vectors using rank-one SVD updates			Type	Conference Article
	Year	2013	Publication	20th International Conference On Neural Information Processing	Abbreviated Journal
	Volume	8228	Issue	III	Pages	368-375
	Keywords
	Abstract	An efficient incremental approach to the discriminative common vector (DCV) method for dimensionality reduction and classification is presented. The proposal consists of a rank-one update along with an adaptive restriction on the rank of the null space which leads to an approximate but convenient solution. The algorithm can be implemented very efficiently in terms of matrix operations and space complexity, which enables its use in large-scale dynamic application domains. Deep comparative experimentation using publicly available high dimensional image datasets has been carried out in order to properly assess the proposed algorithm against several recent incremental formulations. K. Diaz-Chito, F.J. Ferri, W. Diaz
	Address	Daegu; Korea; November 2013
	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-42050-4	Medium
	Area		Expedition		Conference	ICONIP
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ DFD2013			Serial	2439
Permanent link to this record



	Author	Marcelo D. Pistarelli; Angel Sappa; Ricardo Toledo
	Title	Multispectral Stereo Image Correspondence			Type	Conference Article
	Year	2013	Publication	15th International Conference on Computer Analysis of Images and Patterns	Abbreviated Journal
	Volume	8048	Issue		Pages	217-224
	Keywords
	Abstract	This paper presents a novel multispectral stereo image correspondence approach. It is evaluated using a stereo rig constructed with a visible spectrum camera and a long wave infrared spectrum camera. The novelty of the proposed approach lies on the usage of Hough space as a correspondence search domain. In this way it avoids searching for correspondence in the original multispectral image domains, where information is low correlated, and a common domain is used. The proposed approach is intended to be used in outdoor urban scenarios, where images contain large amount of edges. These edges are used as distinctive characteristics for the matching in the Hough space. Experimental results are provided showing the validity of the proposed approach.
	Address	York; uk; August 2013
	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-40245-6	Medium
	Area		Expedition		Conference	CAIP
	Notes	ADAS; 600.055			Approved	no
	Call Number	Admin @ si @ PST2013			Serial	2561
Permanent link to this record



	Author	Gioacchino Vino; Angel Sappa
	Title	Revisiting Harris Corner Detector Algorithm: a Gradual Thresholding Approach			Type	Conference Article
	Year	2013	Publication	10th International Conference on Image Analysis and Recognition	Abbreviated Journal
	Volume	7950	Issue		Pages	354-363
	Keywords
	Abstract	This paper presents an adaptive thresholding approach intended to increase the number of detected corners, while reducing the amount of those ones corresponding to noisy data. The proposed approach works by using the classical Harris corner detector algorithm and overcome the difficulty in finding a general threshold that work well for all the images in a given data set by proposing a novel adaptive thresholding scheme. Initially, two thresholds are used to discern between strong corners and flat regions. Then, a region based criteria is used to discriminate between weak corners and noisy points in the midway interval. Experimental results show that the proposed approach has a better capability to reject false corners and, at the same time, to detect weak ones. Comparisons with the state of the art are provided showing the validity of the proposed approach.
	Address	Póvoa de Varzim; Portugal; June 2013
	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-39093-7	Medium
	Area		Expedition		Conference	ICIAR
	Notes	ADAS; 600.055			Approved	no
	Call Number	Admin @ si @ ViS2013			Serial	2562
Permanent link to this record



	Author	Naila Murray; Maria Vanrell; Xavier Otazu; C. Alejandro Parraga
	Title	Low-level SpatioChromatic Grouping for Saliency Estimation			Type	Journal Article
	Year	2013	Publication	IEEE Transactions on Pattern Analysis and Machine Intelligence	Abbreviated Journal	TPAMI
	Volume	35	Issue	11	Pages	2810-2816
	Keywords
	Abstract	We propose a saliency model termed SIM (saliency by induction mechanisms), which is based on a low-level spatiochromatic model that has successfully predicted chromatic induction phenomena. In so doing, we hypothesize that the low-level visual mechanisms that enhance or suppress image detail are also responsible for making some image regions more salient. Moreover, SIM adds geometrical grouplets to enhance complex low-level features such as corners, and suppress relatively simpler features such as edges. Since our model has been fitted on psychophysical chromatic induction data, it is largely nonparametric. SIM outperforms state-of-the-art methods in predicting eye fixations on two datasets and using two metrics.
	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	0162-8828	ISBN		Medium
	Area		Expedition		Conference
	Notes	CIC; 600.051; 600.052; 605.203			Approved	no
	Call Number	Admin @ si @ MVO2013			Serial	2289
Permanent link to this record



	Author	Albert Gordo; Florent Perronnin; Ernest Valveny
	Title	Large-scale document image retrieval and classification with runlength histograms and binary embeddings			Type	Journal Article
	Year	2013	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	46	Issue	7	Pages	1898-1905
	Keywords	visual document descriptor; compression; large-scale; retrieval; classification
	Abstract	We present a new document image descriptor based on multi-scale runlength histograms. This descriptor does not rely on layout analysis and can be computed efficiently. We show how this descriptor can achieve state-of-theart results on two very different public datasets in classification and retrieval tasks. Moreover, we show how we can compress and binarize these descriptors to make them suitable for large-scale applications. We can achieve state-ofthe- art results in classification using binary descriptors of as few as 16 to 64 bits.
	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	0031-3203	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; 600.042; 600.045; 605.203			Approved	no
	Call Number	Admin @ si @ GPV2013			Serial	2306
Permanent link to this record



	Author	Albert Gordo; Alicia Fornes; Ernest Valveny
	Title	Writer identification in handwritten musical scores with bags of notes			Type	Journal Article
	Year	2013	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	46	Issue	5	Pages	1337-1345
	Keywords
	Abstract	Writer Identification is an important task for the automatic processing of documents. However, the identification of the writer in graphical documents is still challenging. In this work, we adapt the Bag of Visual Words framework to the task of writer identification in handwritten musical scores. A vanilla implementation of this method already performs comparably to the state-of-the-art. Furthermore, we analyze the effect of two improvements of the representation: a Bhattacharyya embedding, which improves the results at virtually no extra cost, and a Fisher Vector representation that very significantly improves the results at the cost of a more complex and costly representation. Experimental evaluation shows results more than 20 points above the state-of-the-art in a new, challenging dataset.
	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	0031-3203	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GFV2013			Serial	2307
Permanent link to this record



	Author	Veronica Romero; Alicia Fornes; Nicolas Serrano; Joan Andreu Sanchez; A.H. Toselli; Volkmar Frinken; E. Vidal; Josep Llados
	Title	The ESPOSALLES database: An ancient marriage license corpus for off-line handwriting recognition			Type	Journal Article
	Year	2013	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	46	Issue	6	Pages	1658-1669
	Keywords
	Abstract	Historical records of daily activities provide intriguing insights into the life of our ancestors, useful for demography studies and genealogical research. Automatic processing of historical documents, however, has mostly been focused on single works of literature and less on social records, which tend to have a distinct layout, structure, and vocabulary. Such information is usually collected by expert demographers that devote a lot of time to manually transcribe them. This paper presents a new database, compiled from a marriage license books collection, to support research in automatic handwriting recognition for historical documents containing social records. Marriage license books are documents that were used for centuries by ecclesiastical institutions to register marriage licenses. Books from this collection are handwritten and span nearly half a millennium until the beginning of the 20th century. In addition, a study is presented about the capability of state-of-the-art handwritten text recognition systems, when applied to the presented database. Baseline results are reported for reference in future studies.
	Address
	Corporate Author				Thesis
	Publisher	Elsevier Science Inc. New York, NY, USA	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0031-3203	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; 600.045; 602.006; 605.203			Approved	no
	Call Number	Admin @ si @ RFS2013			Serial	2298
Permanent link to this record



	Author	Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera
	Title	A Genetic-based Subspace Analysis Method for Improving Error-Correcting Output Coding			Type	Journal Article
	Year	2013	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	46	Issue	10	Pages	2830-2839
	Keywords	Error Correcting Output Codes; Evolutionary computation; Multiclass classification; Feature subspace; Ensemble classification
	Abstract	Two key factors affecting the performance of Error Correcting Output Codes (ECOC) in multiclass classification problems are the independence of binary classifiers and the problem-dependent coding design. In this paper, we propose an evolutionary algorithm-based approach to the design of an application-dependent codematrix in the ECOC framework. The central idea of this work is to design a three-dimensional codematrix, where the third dimension is the feature space of the problem domain. In order to do that, we consider the feature space in the design process of the codematrix with the aim of improving the independence and accuracy of binary classifiers. The proposed method takes advantage of some basic concepts of ensemble classification, such as diversity of classifiers, and also benefits from the evolutionary approach for optimizing the three-dimensional codematrix, taking into account the problem domain. We provide a set of experimental results using a set of benchmark datasets from the UCI Machine Learning Repository, as well as two real multiclass Computer Vision problems. Both sets of experiments are conducted using two different base learners: Neural Networks and Decision Trees. The results show that the proposed method increases the classification accuracy in comparison with the state-of-the-art ECOC coding techniques.
	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	0031-3203	ISBN		Medium
	Area		Expedition		Conference
	Notes	HuPBA;MILAB			Approved	no
	Call Number	Admin @ si @ BGE2013a			Serial	2247
Permanent link to this record



	Author	Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados; Thierry Brouard
	Title	Fuzzy Multilevel Graph Embedding			Type	Journal Article
	Year	2013	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	46	Issue	2	Pages	551-565
	Keywords	Pattern recognition; Graphics recognition; Graph clustering; Graph classification; Explicit graph embedding; Fuzzy logic
	Abstract	Structural pattern recognition approaches offer the most expressive, convenient, powerful but computational expensive representations of underlying relational information. To benefit from mature, less expensive and efficient state-of-the-art machine learning models of statistical pattern recognition they must be mapped to a low-dimensional vector space. Our method of explicit graph embedding bridges the gap between structural and statistical pattern recognition. We extract the topological, structural and attribute information from a graph and encode numeric details by fuzzy histograms and symbolic details by crisp histograms. The histograms are concatenated to achieve a simple and straightforward embedding of graph into a low-dimensional numeric feature vector. Experimentation on standard public graph datasets shows that our method outperforms the state-of-the-art methods of graph embedding for richly attributed graphs.
	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	0031-3203	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; 600.042; 600.045; 605.203			Approved	no
	Call Number	Admin @ si @ LRL2013a			Serial	2270
Permanent link to this record



	Author	Anjan Dutta; Josep Llados; Umapada Pal
	Title	A symbol spotting approach in graphical documents by hashing serialized graphs			Type	Journal Article
	Year	2013	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	46	Issue	3	Pages	752-768
	Keywords	Symbol spotting; Graphics recognition; Graph matching; Graph serialization; Graph factorization; Graph paths; Hashing
	Abstract	In this paper we propose a symbol spotting technique in graphical documents. Graphs are used to represent the documents and a (sub)graph matching technique is used to detect the symbols in them. We propose a graph serialization to reduce the usual computational complexity of graph matching. Serialization of graphs is performed by computing acyclic graph paths between each pair of connected nodes. Graph paths are one-dimensional structures of graphs which are less expensive in terms of computation. At the same time they enable robust localization even in the presence of noise and distortion. Indexing in large graph databases involves a computational burden as well. We propose a graph factorization approach to tackle this problem. Factorization is intended to create a unified indexed structure over the database of graphical documents. Once graph paths are extracted, the entire database of graphical documents is indexed in hash tables by 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. We have performed detailed experiments with various datasets of line drawings and compared our method with the state-of-the-art works. The results demonstrate the effectiveness and efficiency of our technique.
	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	0031-3203	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; 600.042; 600.045; 605.203; 601.152			Approved	no
	Call Number	Admin @ si @ DLP2012			Serial	2127
Permanent link to this record