Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	76–90 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	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	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	Fahad Shahbaz Khan; Joost Van de Weijer; Sadiq Ali; Michael Felsberg
	Title	Evaluating the impact of color on texture recognition			Type	Conference Article
	Year	2013	Publication	15th International Conference on Computer Analysis of Images and Patterns	Abbreviated Journal
	Volume	8047	Issue		Pages	154-162
	Keywords	Color; Texture; image representation
	Abstract	State-of-the-art texture descriptors typically operate on grey scale images while ignoring color information. A common way to obtain a joint color-texture representation is to combine the two visual cues at the pixel level. However, such an approach provides sub-optimal results for texture categorisation task. In this paper we investigate how to optimally exploit color information for texture recognition. We evaluate a variety of color descriptors, popular in image classification, for texture categorisation. In addition we analyze different fusion approaches to combine color and texture cues. Experiments are conducted on the challenging scenes and 10 class texture datasets. Our experiments clearly suggest that in all cases color names provide the best performance. Late fusion is the best strategy to combine color and texture. By selecting the best color descriptor with optimal fusion strategy provides a gain of 5% to 8% compared to texture alone on scenes and texture datasets.
	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
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-40260-9	Medium
	Area		Expedition		Conference	CAIP
	Notes	CIC; 600.048			Approved	no
	Call Number	Admin @ si @ KWA2013			Serial	2263
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	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	Debora Gil; Agnes Borras; Sergio Vera; Miguel Angel Gonzalez Ballester
	Title	A Validation Benchmark for Assessment of Medial Surface Quality for Medical Applications			Type	Conference Article
	Year	2013	Publication	9th International Conference on Computer Vision Systems	Abbreviated Journal
	Volume	7963	Issue		Pages	334-343
	Keywords	Medial Surfaces; Shape Representation; Medical Applications; Performance Evaluation
	Abstract	Confident use of medial surfaces in medical decision support systems requires evaluating their quality for detecting pathological deformations and describing anatomical volumes. Validation in the medical imaging field is a challenging task mainly due to the difficulties for getting consensual ground truth. In this paper we propose a validation benchmark for assessing medial surfaces in the context of medical applications. Our benchmark includes a home-made database of synthetic medial surfaces and volumes and specific scores for evaluating surface accuracy, its stability against volume deformations and its capabilities for accurate reconstruction of anatomical volumes.
	Address	Sant Petersburg; Russia; July 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-39401-0	Medium
	Area		Expedition		Conference	ICVS
	Notes	IAM; 600.044; 600.060			Approved	no
	Call Number	Admin @ si @ GBV2013			Serial	2300
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	Francesco Ciompi; Rui Hua; Simone Balocco; Marina Alberti; Oriol Pujol; Carles Caus; J. Mauri; Petia Radeva
	Title	Learning to Detect Stent Struts in Intravascular Ultrasound			Type	Conference Article
	Year	2013	Publication	6th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	7887	Issue		Pages	575-583
	Keywords
	Abstract	In this paper we tackle the automatic detection of struts elements (metallic braces of a stent device) in Intravascular Ultrasound (IVUS) sequences. The proposed method is based on context-aware classification of IVUS images, where we use Multi-Class Multi-Scale Stacked Sequential Learning (M2SSL). Additionally, we introduce a novel technique to reduce the amount of required contextual features. The comparison with binary and multi-class learning is also performed, using a dataset of IVUS images with struts manually annotated by an expert. The best performing configuration reaches a F-measure F = 63.97% .
	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
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-38627-5	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	MILAB; HuPBA; 605.203; 600.046			Approved	no
	Call Number	Admin @ si @ CHB2013			Serial	2349
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	Adriana Romero; Carlo Gatta
	Title	Do We Really Need All These Neurons?			Type	Conference Article
	Year	2013	Publication	6th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	7887	Issue		Pages	460--467
	Keywords	Retricted Boltzmann Machine; hidden units; unsupervised learning; classification
	Abstract	Restricted Boltzmann Machines (RBMs) are generative neural networks that have received much attention recently. In particular, choosing the appropriate number of hidden units is important as it might hinder their representative power. According to the literature, RBM require numerous hidden units to approximate any distribution properly. In this paper, we present an experiment to determine whether such amount of hidden units is required in a classification context. We then propose an incremental algorithm that trains RBM reusing the previously trained parameters using a trade-off measure to determine the appropriate number of hidden units. Results on the MNIST and OCR letters databases show that using a number of hidden units, which is one order of magnitude smaller than the literature estimate, suffices to achieve similar performance. Moreover, the proposed algorithm allows to estimate the required number of hidden units without the need of training many RBM from scratch.
	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	MILAB; 600.046			Approved	no
	Call Number	Admin @ si @ RoG2013			Serial	2311
Permanent link to this record



	Author	Francisco Alvaro; Francisco Cruz; Joan Andreu Sanchez; Oriol Ramos Terrades; Jose Miguel Bemedi
	Title	Page Segmentation of Structured Documents Using 2D Stochastic Context-Free Grammars			Type	Conference Article
	Year	2013	Publication	6th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	7887	Issue		Pages	133-140
	Keywords
	Abstract	In this paper we define a bidimensional extension of Stochastic Context-Free Grammars for page segmentation of structured documents. Two sets of text classification features are used to perform an initial classification of each zone of the page. Then, the page segmentation is obtained as the most likely hypothesis according to a grammar. This approach is compared to Conditional Random Fields and results show significant improvements in several cases. Furthermore, grammars provide a detailed segmentation that allowed a semantic evaluation which also validates this model.
	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	DAG; 605.203			Approved	no
	Call Number	Admin @ si @ ACS2013			Serial	2328
Permanent link to this record



	Author	Nuria Cirera; Alicia Fornes; Volkmar Frinken; Josep Llados
	Title	Hybrid grammar language model for handwritten historical documents recognition			Type	Conference Article
	Year	2013	Publication	6th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	7887	Issue		Pages	117-124
	Keywords
	Abstract	In this paper we present a hybrid language model for the recognition of handwritten historical documents with a structured syntactical layout. Using a hidden Markov model-based recognition framework, a word-based grammar with a closed dictionary is enhanced by a character sequence recognition method. This allows to recognize out-of-dictionary words in controlled parts of the recognition, while keeping a closed vocabulary restriction for other parts. While the current status is work in progress, we can report an improvement in terms of character error rate.
	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	DAG; 602.006; 600.045; 600.061			Approved	no
	Call Number	Admin @ si @ CFF2013			Serial	2292
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	Andreas Fischer; Ching Y. Suen; Volkmar Frinken; Kaspar Riesen; Horst Bunke
	Title	A Fast Matching Algorithm for Graph-Based Handwriting Recognition			Type	Conference Article
	Year	2013	Publication	9th IAPR – TC15 Workshop on Graph-based Representation in Pattern Recognition	Abbreviated Journal
	Volume	7877	Issue		Pages	194-203
	Keywords
	Abstract	The recognition of unconstrained handwriting images is usually based on vectorial representation and statistical classification. Despite their high representational power, graphs are rarely used in this field due to a lack of efficient graph-based recognition methods. Recently, graph similarity features have been proposed to bridge the gap between structural representation and statistical classification by means of vector space embedding. This approach has shown a high performance in terms of accuracy but had shortcomings in terms of computational speed. The time complexity of the Hungarian algorithm that is used to approximate the edit distance between two handwriting graphs is demanding for a real-world scenario. In this paper, we propose a faster graph matching algorithm which is derived from the Hausdorff distance. On the historical Parzival database it is demonstrated that the proposed method achieves a speedup factor of 12.9 without significant loss in recognition accuracy.
	Address	Vienna; Austria; 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	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-38220-8	Medium
	Area		Expedition		Conference	GBR
	Notes	DAG; 600.045; 605.203			Approved	no
	Call Number	Admin @ si @ FSF2013			Serial	2294
Permanent link to this record



	Author	Lluis Pere de las Heras; Joan Mas; Gemma Sanchez; Ernest Valveny
	Title	Notation-invariant patch-based wall detector in architectural floor plans			Type	Book Chapter
	Year	2013	Publication	Graphics Recognition. New Trends and Challenges	Abbreviated Journal
	Volume	7423	Issue		Pages	79--88
	Keywords
	Abstract	Architectural floor plans exhibit a large variability in notation. Therefore, segmenting and identifying the elements of any kind of plan becomes a challenging task for approaches based on grouping structural primitives obtained by vectorization. Recently, a patch-based segmentation method working at pixel level and relying on the construction of a visual vocabulary has been proposed in [1], showing its adaptability to different notations by automatically learning the visual appearance of the elements in each different notation. This paper presents an evolution of that previous work, after analyzing and testing several alternatives for each of the different steps of the method: Firstly, an automatic plan-size normalization process is done. Secondly we evaluate different features to obtain the description of every patch. Thirdly, we train an SVM classifier to obtain the category of every patch instead of constructing a visual vocabulary. These variations of the method have been tested for wall detection on two datasets of architectural floor plans with different notations. After studying in deep each of the steps in the process pipeline, we are able to find the best system configuration, which highly outperforms the results on wall segmentation obtained by the original paper.
	Address
	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-36823-3	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.045; 600.056; 605.203			Approved	no
	Call Number	Admin @ si @ HMS2013			Serial	2322
Permanent link to this record