Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

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

List View

Citations

Details

	Records
	Author	Murad Al Haj; Jordi Gonzalez; Larry S. Davis
	Title	On Partial Least Squares in Head Pose Estimation: How to simultaneously deal with misalignment			Type	Conference Article
	Year	2012	Publication	25th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	2602-2609
	Keywords
	Abstract	Head pose estimation is a critical problem in many computer vision applications. These include human computer interaction, video surveillance, face and expression recognition. In most prior work on heads pose estimation, the positions of the faces on which the pose is to be estimated are specified manually. Therefore, the results are reported without studying the effect of misalignment. We propose a method based on partial least squares (PLS) regression to estimate pose and solve the alignment problem simultaneously. The contributions of this paper are two-fold: 1) we show that the kernel version of PLS (kPLS) achieves better than state-of-the-art results on the estimation problem and 2) we develop a technique to reduce misalignment based on the learned PLS factors.
	Address	Providence, Rhode Island
	Corporate Author				Thesis
	Publisher	IEEE Xplore	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4673-1226-4	Medium
	Area		Expedition		Conference	CVPR
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ HGD2012			Serial	2029
Permanent link to this record



	Author	Jose Carlos Rubio; Joan Serrat; Antonio Lopez
	Title	Unsupervised co-segmentation through region matching			Type	Conference Article
	Year	2012	Publication	25th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	749-756
	Keywords
	Abstract	Co-segmentation is defined as jointly partitioning multiple images depicting the same or similar object, into foreground and background. Our method consists of a multiple-scale multiple-image generative model, which jointly estimates the foreground and background appearance distributions from several images, in a non-supervised manner. In contrast to other co-segmentation methods, our approach does not require the images to have similar foregrounds and different backgrounds to function properly. Region matching is applied to exploit inter-image information by establishing correspondences between the common objects that appear in the scene. Moreover, computing many-to-many associations of regions allow further applications, like recognition of object parts across images. We report results on iCoseg, a challenging dataset that presents extreme variability in camera viewpoint, illumination and object deformations and poses. We also show that our method is robust against large intra-class variability in the MSRC database.
	Address	Providence, Rhode Island
	Corporate Author				Thesis
	Publisher	IEEE Xplore	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4673-1226-4	Medium
	Area		Expedition		Conference	CVPR
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RSL2012b; ADAS @ adas @			Serial	2033
Permanent link to this record



	Author	Antonio Hernandez; Nadezhda Zlateva; Alexander Marinov; Miguel Reyes; Petia Radeva; Dimo Dimov; Sergio Escalera
	Title	Graph Cuts Optimization for Multi-Limb Human Segmentation in Depth Maps			Type	Conference Article
	Year	2012	Publication	25th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	726-732
	Keywords
	Abstract	We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps. First, from a set of random depth features, Random Forest is used to infer a set of label probabilities for each data sample. This vector of probabilities is used as unary term in α-β swap Graph-cuts algorithm. Moreover, depth of spatio-temporal neighboring data points are used as boundary potentials. Results on a new multi-label human depth data set show high performance in terms of segmentation overlapping of the novel methodology compared to classical approaches.
	Address	Portland; Oregon; June 2013
	Corporate Author				Thesis
	Publisher	IEEE Xplore	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4673-1226-4	Medium
	Area		Expedition		Conference	CVPR
	Notes	MILAB;HuPBA			Approved	no
	Call Number	Admin @ si @ HZM2012b			Serial	2046
Permanent link to this record



	Author	Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera
	Title	Error Correcting Output Codes for multiclass classification: Application to two image vision problems			Type	Conference Article
	Year	2012	Publication	16th symposium on Artificial Intelligence & Signal Processing	Abbreviated Journal
	Volume		Issue		Pages	508-513
	Keywords
	Abstract	Error-correcting output codes (ECOC) represents a powerful framework to deal with multiclass classification problems based on combining binary classifiers. The key factor affecting the performance of ECOC methods is the independence of binary classifiers, without which the ECOC method would be ineffective. In spite of its ability on classification of problems with relatively large number of classes, it has been applied in few real world problems. In this paper, we investigate the behavior of the ECOC approach on two image vision problems: logo recognition and shape classification using Decision Tree and AdaBoost as the base learners. The results show that the ECOC method can be used to improve the classification performance in comparison with the classical multiclass approaches.
	Address	Shiraz, Iran
	Corporate Author				Thesis
	Publisher	IEEE Xplore	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-1-4673-1478-7	Medium
	Area		Expedition		Conference	AISP
	Notes	HuPBA;MILAB			Approved	no
	Call Number	Admin @ si @ BGE2012b			Serial	2042
Permanent link to this record



	Author	Ernest Valveny; Robert Benavente; Agata Lapedriza; Miquel Ferrer; Jaume Garcia; Gemma Sanchez
	Title	Adaptation of a computer programming course to the EXHE requirements: evaluation five years later			Type	Miscellaneous
	Year	2012	Publication	European Journal of Engineering Education	Abbreviated Journal
	Volume	37	Issue	3	Pages	243-254
	Keywords
	Abstract
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; CIC; OR; invisible;MV			Approved	no
	Call Number	Admin @ si @ VBL2012			Serial	2070
Permanent link to this record



	Author	Jaume Gibert; Ernest Valveny; Horst Bunke
	Title	Feature Selection on Node Statistics Based Embedding of Graphs			Type	Journal Article
	Year	2012	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	33	Issue	15	Pages	1980–1990
	Keywords	Structural pattern recognition; Graph embedding; Feature ranking; PCA; Graph classification
	Abstract	Representing a graph with a feature vector is a common way of making statistical machine learning algorithms applicable to the domain of graphs. Such a transition from graphs to vectors is known as graphembedding. A key issue in graphembedding is to select a proper set of features in order to make the vectorial representation of graphs as strong and discriminative as possible. In this article, we propose features that are constructed out of frequencies of node label representatives. We first build a large set of features and then select the most discriminative ones according to different ranking criteria and feature transformation algorithms. On different classification tasks, we experimentally show that only a small significant subset of these features is needed to achieve the same classification rates as competing to state-of-the-art methods.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GVB2012b			Serial	1993
Permanent link to this record



	Author	Mario Hernandez; Joao Sanchez; Jordi Vitria
	Title	Selected papers from Iberian Conference on Pattern Recognition and Image Analysis			Type	Book Whole
	Year	2012	Publication	Pattern Recognition	Abbreviated Journal
	Volume	45	Issue	9	Pages	3047-3582
	Keywords
	Abstract
	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	OR;MV			Approved	no
	Call Number	Admin @ si @ HSV2012			Serial	2069
Permanent link to this record



	Author	Jaume Gibert; Ernest Valveny; Horst Bunke
	Title	Graph Embedding in Vector Spaces by Node Attribute Statistics			Type	Journal Article
	Year	2012	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	45	Issue	9	Pages	3072-3083
	Keywords	Structural pattern recognition; Graph embedding; Data clustering; Graph classification
	Abstract	Graph-based representations are of broad use and applicability in pattern recognition. They exhibit, however, a major drawback with regards to the processing tools that are available in their domain. Graphembedding into vectorspaces is a growing field among the structural pattern recognition community which aims at providing a feature vector representation for every graph, and thus enables classical statistical learning machinery to be used on graph-based input patterns. In this work, we propose a novel embedding methodology for graphs with continuous nodeattributes and unattributed edges. The approach presented in this paper is based on statistics of the node labels and the edges between them, based on their similarity to a set of representatives. We specifically deal with an important issue of this methodology, namely, the selection of a suitable set of representatives. In an experimental evaluation, we empirically show the advantages of this novel approach in the context of different classification problems using several databases of graphs.
	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 @ GVB2012a			Serial	1992
Permanent link to this record



	Author	Pedro Martins; Paulo Carvalho; Carlo Gatta
	Title	Context Aware Keypoint Extraction for Robust Image Representation			Type	Conference Article
	Year	2012	Publication	23rd British Machine Vision Conference	Abbreviated Journal
	Volume		Issue		Pages	100.1 - 100.12
	Keywords
	Abstract
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	BMVC
	Notes	MILAB			Approved	no
	Call Number	Admin @ si @ MCG2012a			Serial	2140
Permanent link to this record



	Author	Noha Elfiky; Jordi Gonzalez; Xavier Roca
	Title	Compact and Adaptive Spatial Pyramids for Scene Recognition			Type	Journal Article
	Year	2012	Publication	Image and Vision Computing	Abbreviated Journal	IMAVIS
	Volume	30	Issue	8	Pages	492–500
	Keywords
	Abstract	Most successful approaches on scenerecognition tend to efficiently combine global image features with spatial local appearance and shape cues. On the other hand, less attention has been devoted for studying spatial texture features within scenes. Our method is based on the insight that scenes can be seen as a composition of micro-texture patterns. This paper analyzes the role of texture along with its spatial layout for scenerecognition. However, one main drawback of the resulting spatial representation is its huge dimensionality. Hence, we propose a technique that addresses this problem by presenting a compactSpatialPyramid (SP) representation. The basis of our compact representation, namely, CompactAdaptiveSpatialPyramid (CASP) consists of a two-stages compression strategy. This strategy is based on the Agglomerative Information Bottleneck (AIB) theory for (i) compressing the least informative SP features, and, (ii) automatically learning the most appropriate shape for each category. Our method exceeds the state-of-the-art results on several challenging scenerecognition data sets.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ EGR2012			Serial	2004
Permanent link to this record



	Author	Jordi Gonzalez; Thomas B. Moeslund; Liang Wang
	Title	Semantic Understanding of Human Behaviors in Image Sequences: From video-surveillance to video-hermeneutics			Type	Journal Article
	Year	2012	Publication	Computer Vision and Image Understanding	Abbreviated Journal	CVIU
	Volume	116	Issue	3	Pages	305–306
	Keywords
	Abstract	Purpose: Atheromatic plaque progression is affected, among others phenomena, by biomechanical, biochemical, and physiological factors. In this paper, the authors introduce a novel framework able to provide both morphological (vessel radius, plaque thickness, and type) and biomechanical (wall shear stress and Von Mises stress) indices of coronary arteries.Methods: First, the approach reconstructs the three-dimensional morphology of the vessel from intravascular ultrasound (IVUS) and Angiographic sequences, requiring minimal user interaction. Then, a computational pipeline allows to automatically assess fluid-dynamic and mechanical indices. Ten coronary arteries are analyzed illustrating the capabilities of the tool and confirming previous technical and clinical observations.Results: The relations between the arterial indices obtained by IVUS measurement and simulations have been quantitatively analyzed along the whole surface of the artery, extending the analysis of the coronary arteries shown in previous state of the art studies. Additionally, for the first time in the literature, the framework allows the computation of the membrane stresses using a simplified mechanical model of the arterial wall.Conclusions: Circumferentially (within a given frame), statistical analysis shows an inverse relation between the wall shear stress and the plaque thickness. At the global level (comparing a frame within the entire vessel), it is observed that heavy plaque accumulations are in general calcified and are located in the areas of the vessel having high wall shear stress. Finally, in their experiments the inverse proportionality between fluid and structural stresses is observed.
	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	1077-3142	ISBN		Medium
	Area		Expedition		Conference
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ GMW2012			Serial	2005
Permanent link to this record



	Author	Bhaskar Chakraborty; Michael Holte; Thomas B. Moeslund; Jordi Gonzalez
	Title	Selective Spatio-Temporal Interest Points			Type	Journal Article
	Year	2012	Publication	Computer Vision and Image Understanding	Abbreviated Journal	CVIU
	Volume	116	Issue	3	Pages	396-410
	Keywords
	Abstract	Recent progress in the field of human action recognition points towards the use of Spatio-TemporalInterestPoints (STIPs) for local descriptor-based recognition strategies. In this paper, we present a novel approach for robust and selective STIP detection, by applying surround suppression combined with local and temporal constraints. This new method is significantly different from existing STIP detection techniques and improves the performance by detecting more repeatable, stable and distinctive STIPs for human actors, while suppressing unwanted background STIPs. For action representation we use a bag-of-video words (BoV) model of local N-jet features to build a vocabulary of visual-words. To this end, we introduce a novel vocabulary building strategy by combining spatial pyramid and vocabulary compression techniques, resulting in improved performance and efficiency. Action class specific Support Vector Machine (SVM) classifiers are trained for categorization of human actions. A comprehensive set of experiments on popular benchmark datasets (KTH and Weizmann), more challenging datasets of complex scenes with background clutter and camera motion (CVC and CMU), movie and YouTube video clips (Hollywood 2 and YouTube), and complex scenes with multiple actors (MSR I and Multi-KTH), validates our approach and show state-of-the-art performance. Due to the unavailability of ground truth action annotation data for the Multi-KTH dataset, we introduce an actor specific spatio-temporal clustering of STIPs to address the problem of automatic action annotation of multiple simultaneous actors. Additionally, we perform cross-data action recognition by training on source datasets (KTH and Weizmann) and testing on completely different and more challenging target datasets (CVC, CMU, MSR I and Multi-KTH). This documents the robustness of our proposed approach in the realistic scenario, using separate training and test datasets, which in general has been a shortcoming in the performance evaluation of human action recognition 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	1077-3142	ISBN		Medium
	Area		Expedition		Conference
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ CHM2012			Serial	1806
Permanent link to this record



	Author	Bogdan Raducanu; D. Gatica-Perez
	Title	Inferring competitive role patterns in reality TV show through nonverbal analysis			Type	Journal Article
	Year	2012	Publication	Multimedia Tools and Applications	Abbreviated Journal	MTAP
	Volume	56	Issue	1	Pages	207-226
	Keywords
	Abstract	This paper introduces a new facet of social media, namely that depicting social interaction. More concretely, we address this problem from the perspective of nonverbal behavior-based analysis of competitive meetings. For our study, we made use of “The Apprentice” reality TV show, which features a competition for a real, highly paid corporate job. Our analysis is centered around two tasks regarding a person's role in a meeting: predicting the person with the highest status, and predicting the fired candidates. We address this problem by adopting both supervised and unsupervised strategies. The current study was carried out using nonverbal audio cues. Our approach is based only on the nonverbal interaction dynamics during the meeting without relying on the spoken words. The analysis is based on two types of data: individual and relational measures. Results obtained from the analysis of a full season of the show are promising (up to 85.7% of accuracy in the first case and up to 92.8% in the second case). Our approach has been conveniently compared with the Influence Model, demonstrating its superiority.
	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	1380-7501	ISBN		Medium
	Area		Expedition		Conference
	Notes	OR;MV			Approved	no
	Call Number	BCNPCL @ bcnpcl @ RaG2012			Serial	1360
Permanent link to this record



	Author	Arnau Ramisa; David Aldavert; Shrihari Vasudevan; Ricardo Toledo; Ramon Lopez de Mantaras
	Title	Evaluation of Three Vision Based Object Perception Methods for a Mobile Robot			Type	Journal Article
	Year	2012	Publication	Journal of Intelligent and Robotic Systems	Abbreviated Journal	JIRC
	Volume	68	Issue	2	Pages	185-208
	Keywords
	Abstract	This paper addresses visual object perception applied to mobile robotics. Being able to perceive household objects in unstructured environments is a key capability in order to make robots suitable to perform complex tasks in home environments. However, finding a solution for this task is daunting: it requires the ability to handle the variability in image formation in a moving camera with tight time constraints. The paper brings to attention some of the issues with applying three state of the art object recognition and detection methods in a mobile robotics scenario, and proposes methods to deal with windowing/segmentation. Thus, this work aims at evaluating the state-of-the-art in object perception in an attempt to develop a lightweight solution for mobile robotics use/research in typical indoor settings.
	Address
	Corporate Author				Thesis
	Publisher	Springer Netherlands	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0921-0296	ISBN		Medium
	Area		Expedition		Conference
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RAV2012			Serial	2150
Permanent link to this record



	Author	Alicia Fornes; Anjan Dutta; Albert Gordo; Josep Llados
	Title	CVC-MUSCIMA: A Ground-Truth of Handwritten Music Score Images for Writer Identification and Staff Removal			Type	Journal Article
	Year	2012	Publication	International Journal on Document Analysis and Recognition	Abbreviated Journal	IJDAR
	Volume	15	Issue	3	Pages	243-251
	Keywords	Music scores; Handwritten documents; Writer identification; Staff removal; Performance evaluation; Graphics recognition; Ground truths
	Abstract	0,405JCR The analysis of music scores has been an active research field in the last decades. However, there are no publicly available databases of handwritten music scores for the research community. In this paper we present the CVC-MUSCIMA database and ground-truth of handwritten music score images. The dataset consists of 1,000 music sheets written by 50 different musicians. It has been especially designed for writer identification and staff removal tasks. In addition to the description of the dataset, ground-truth, partitioning and evaluation metrics, we also provide some base-line results for easing the comparison between different approaches.
	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	1433-2833	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ FDG2012			Serial	2129
Permanent link to this record