Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

<< 1 2 3 4 >>

List View

Citations

Details

	Records
	Author	Jordi Vitria; J. Llacer
	Title	Reconstructing 3D light microscopic images using the EM algorithm			Type	Journal Article
	Year	1996	Publication	Pattern Recognition Letters	Abbreviated Journal
	Volume	17	Issue	14	Pages	1491–1498
	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	OR;MV			Approved	no
	Call Number	BCNPCL @ bcnpcl @ ViL1996			Serial	74
Permanent link to this record



	Author	Sergio Escalera; Oriol Pujol; Petia Radeva
	Title	Re-coding ECOCs without retraining			Type	Journal Article
	Year	2010	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	31	Issue	7	Pages	555–562
	Keywords
	Abstract	A standard way to deal with multi-class categorization problems is by the combination of binary classifiers in a pairwise voting procedure. Recently, this classical approach has been formalized in the Error-Correcting Output Codes (ECOC) framework. In the ECOC framework, the one-versus-one coding demonstrates to achieve higher performance than the rest of coding designs. The binary problems that we train in the one-versus-one strategy are significantly smaller than in the rest of designs, and usually easier to be learnt, taking into account the smaller overlapping between classes. However, a high percentage of the positions coded by zero of the coding matrix, which implies a high sparseness degree, does not codify meta-class membership information. In this paper, we show that using the training data we can redefine without re-training, in a problem-dependent way, the one-versus-one coding matrix so that the new coded information helps the system to increase its generalization capability. Moreover, the new re-coding strategy is generalized to be applied over any binary code. The results over several UCI Machine Learning repository data sets and two real multi-class problems show that performance improvements can be obtained re-coding the classical one-versus-one and Sparse random designs compared to different state-of-the-art ECOC configurations.
	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		ISBN		Medium
	Area		Expedition		Conference
	Notes	MILAB;HUPBA			Approved	no
	Call Number	BCNPCL @ bcnpcl @ EPR2010e			Serial	1338
Permanent link to this record



	Author	Antonio Hernandez; Miguel Angel Bautista; Xavier Perez Sala; Victor Ponce; Sergio Escalera; Xavier Baro; Oriol Pujol; Cecilio Angulo
	Title	Probability-based Dynamic Time Warping and Bag-of-Visual-and-Depth-Words for Human Gesture Recognition in RGB-D			Type	Journal Article
	Year	2014	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	50	Issue	1	Pages	112-121
	Keywords	RGB-D; Bag-of-Words; Dynamic Time Warping; Human Gesture Recognition
	Abstract	PATREC5825 We present a methodology to address the problem of human gesture segmentation and recognition in video and depth image sequences. A Bag-of-Visual-and-Depth-Words (BoVDW) model is introduced as an extension of the Bag-of-Visual-Words (BoVW) model. State-of-the-art RGB and depth features, including a newly proposed depth descriptor, are analysed and combined in a late fusion form. The method is integrated in a Human Gesture Recognition pipeline, together with a novel probability-based Dynamic Time Warping (PDTW) algorithm which is used to perform prior segmentation of idle gestures. The proposed DTW variant uses samples of the same gesture category to build a Gaussian Mixture Model driven probabilistic model of that gesture class. Results of the whole Human Gesture Recognition pipeline in a public data set show better performance in comparison to both standard BoVW model and DTW 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		ISBN		Medium
	Area		Expedition		Conference
	Notes	HuPBA;MV; 605.203			Approved	no
	Call Number	Admin @ si @ HBP2014			Serial	2353
Permanent link to this record



	Author	Sergio Escalera; David Masip; Eloi Puertas; Petia Radeva; Oriol Pujol
	Title	Online Error-Correcting Output Codes			Type	Journal Article
	Year	2011	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	32	Issue	3	Pages	458-467
	Keywords
	Abstract	IF JCR CCIA 1.303 2009 54/103 This article proposes a general extension of the error correcting output codes framework to the online learning scenario. As a result, the final classifier handles the addition of new classes independently of the base classifier used. In particular, this extension supports the use of both online example incremental and batch classifiers as base learners. The extension of the traditional problem independent codings one-versus-all and one-versus-one is introduced. Furthermore, two new codings are proposed, unbalanced online ECOC and a problem dependent online ECOC. This last online coding technique takes advantage of the problem data for minimizing the number of dichotomizers used in the ECOC framework while preserving a high accuracy. These techniques are validated on an online setting of 11 data sets from UCI database and applied to two real machine vision applications: traffic sign recognition and face recognition. As a result, the online ECOC techniques proposed provide a feasible and robust way for handling new classes using any base classifier.
	Address
	Corporate Author				Thesis
	Publisher	Elsevier	Place of Publication	North Holland	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	MILAB;OR;HuPBA;MV			Approved	no
	Call Number	Admin @ si @ EMP2011			Serial	1714
Permanent link to this record



	Author	Pedro Martins; Paulo Carvalho; Carlo Gatta
	Title	On the completeness of feature-driven maximally stable extremal regions			Type	Journal Article
	Year	2016	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	74	Issue		Pages	9-16
	Keywords	Local features; Completeness; Maximally Stable Extremal Regions
	Abstract	By definition, local image features provide a compact representation of the image in which most of the image information is preserved. This capability offered by local features has been overlooked, despite being relevant in many application scenarios. In this paper, we analyze and discuss the performance of feature-driven Maximally Stable Extremal Regions (MSER) in terms of the coverage of informative image parts (completeness). This type of features results from an MSER extraction on saliency maps in which features related to objects boundaries or even symmetry axes are highlighted. These maps are intended to be suitable domains for MSER detection, allowing this detector to provide a better coverage of informative image parts. Our experimental results, which were based on a large-scale evaluation, show that feature-driven MSER have relatively high completeness values and provide more complete sets than a traditional MSER detection even when sets of similar cardinality are considered.
	Address
	Corporate Author				Thesis
	Publisher	Elsevier B.V.	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	LAMP;MILAB;			Approved	no
	Call Number	Admin @ si @ MCG2016			Serial	2748
Permanent link to this record



	Author	M. Bressan; Jordi Vitria
	Title	Nonparametric Discriminant Analysis and Nearest Neighbor Classification			Type	Journal Article
	Year	2003	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	24	Issue	15	Pages	2743–2749
	Keywords
	Abstract	IF: 0.809
	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	OR;MV			Approved	no
	Call Number	BCNPCL @ bcnpcl @ BrV2003b			Serial	367
Permanent link to this record



	Author	Victor Ponce; Sergio Escalera; Marc Perez; Oriol Janes; Xavier Baro
	Title	Non-Verbal Communication Analysis in Victim-Offender Mediations			Type	Journal Article
	Year	2015	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	67	Issue	1	Pages	19-27
	Keywords	Victim–Offender Mediation; Multi-modal human behavior analysis; Face and gesture recognition; Social signal processing; Computer vision; Machine learning
	Abstract	We present a non-invasive ambient intelligence framework for the semi-automatic analysis of non-verbal communication applied to the restorative justice field. We propose the use of computer vision and social signal processing technologies in real scenarios of Victim–Offender Mediations, applying feature extraction techniques to multi-modal audio-RGB-depth data. We compute a set of behavioral indicators that define communicative cues from the fields of psychology and observational methodology. We test our methodology on data captured in real Victim–Offender Mediation sessions in Catalonia. We define the ground truth based on expert opinions when annotating the observed social responses. Using different state of the art binary classification approaches, our system achieves recognition accuracies of 86% when predicting satisfaction, and 79% when predicting both agreement and receptivity. Applying a regression strategy, we obtain a mean deviation for the predictions between 0.5 and 0.7 in the range [1–5] for the computed social 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		ISBN		Medium
	Area		Expedition		Conference
	Notes	HuPBA;MV			Approved	no
	Call Number	Admin @ si @ PEP2015			Serial	2583
Permanent link to this record



	Author	Fernando Barrera; Felipe Lumbreras; Angel Sappa
	Title	Multispectral Piecewise Planar Stereo using Manhattan-World Assumption			Type	Journal Article
	Year	2013	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	34	Issue	1	Pages	52-61
	Keywords	Multispectral stereo rig; Dense disparity maps from multispectral stereo; Color and infrared images
	Abstract	This paper proposes a new framework for extracting dense disparity maps from a multispectral stereo rig. The system is constructed with an infrared and a color camera. It is intended to explore novel multispectral stereo matching approaches that will allow further extraction of semantic information. The proposed framework consists of three stages. Firstly, an initial sparse disparity map is generated by using a cost function based on feature matching in a multiresolution scheme. Then, by looking at the color image, a set of planar hypotheses is defined to describe the surfaces on the scene. Finally, the previous stages are combined by reformulating the disparity computation as a global minimization problem. The paper has two main contributions. The first contribution combines mutual information with a shape descriptor based on gradient in a multiresolution scheme. The second contribution, which is based on the Manhattan-world assumption, extracts a dense disparity representation using the graph cut algorithm. Experimental results in outdoor scenarios are provided showing the validity of the proposed framework.
	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	ADAS; 600.054; 600.055; 605.203			Approved	no
	Call Number	Admin @ si @ BLS2013			Serial	2245
Permanent link to this record



	Author	Lluis Gomez; Ali Furkan Biten; Ruben Tito; Andres Mafla; Marçal Rusiñol; Ernest Valveny; Dimosthenis Karatzas
	Title	Multimodal grid features and cell pointers for scene text visual question answering			Type	Journal Article
	Year	2021	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	150	Issue		Pages	242-249
	Keywords
	Abstract	This paper presents a new model for the task of scene text visual question answering. In this task questions about a given image can only be answered by reading and understanding scene text. Current state of the art models for this task make use of a dual attention mechanism in which one attention module attends to visual features while the other attends to textual features. A possible issue with this is that it makes difficult for the model to reason jointly about both modalities. To fix this problem we propose a new model that is based on an single attention mechanism that attends to multi-modal features conditioned to the question. The output weights of this attention module over a grid of multi-modal spatial features are interpreted as the probability that a certain spatial location of the image contains the answer text to the given question. Our experiments demonstrate competitive performance in two standard datasets with a model that is faster than previous methods at inference time. Furthermore, we also provide a novel analysis of the ST-VQA dataset based on a human performance study. Supplementary material, code, and data is made available through this link.
	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; 600.084; 600.121			Approved	no
	Call Number	Admin @ si @ GBT2021			Serial	3620
Permanent link to this record



	Author	Meysam Madadi; Sergio Escalera; Jordi Gonzalez; Xavier Roca; Felipe Lumbreras
	Title	Multi-part body segmentation based on depth maps for soft biometry analysis			Type	Journal Article
	Year	2015	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	56	Issue		Pages	14-21
	Keywords	3D shape context; 3D point cloud alignment; Depth maps; Human body segmentation; Soft biometry analysis
	Abstract	This paper presents a novel method extracting biometric measures using depth sensors. Given a multi-part labeled training data, a new subject is aligned to the best model of the dataset, and soft biometrics such as lengths or circumference sizes of limbs and body are computed. The process is performed by training relevant pose clusters, defining a representative model, and fitting a 3D shape context descriptor within an iterative matching procedure. We show robust measures by applying orthogonal plates to body hull. We test our approach in a novel full-body RGB-Depth data set, showing accurate estimation of soft biometrics and better segmentation accuracy in comparison with random forest approach without requiring large training data.
	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	HuPBA; ISE; ADAS; 600.076;600.049; 600.063; 600.054; 302.018;MILAB			Approved	no
	Call Number	Admin @ si @ MEG2015			Serial	2588
Permanent link to this record



	Author	Albert Clapes; Miguel Reyes; Sergio Escalera
	Title	Multi-modal User Identification and Object Recognition Surveillance System			Type	Journal Article
	Year	2013	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	34	Issue	7	Pages	799-808
	Keywords	Multi-modal RGB-Depth data analysis; User identification; Object recognition; Intelligent surveillance; Visual features; Statistical learning
	Abstract	We propose an automatic surveillance system for user identification and object recognition based on multi-modal RGB-Depth data analysis. We model a RGBD environment learning a pixel-based background Gaussian distribution. Then, user and object candidate regions are detected and recognized using robust statistical approaches. The system robustly recognizes users and updates the system in an online way, identifying and detecting new actors in the scene. Moreover, segmented objects are described, matched, recognized, and updated online using view-point 3D descriptions, being robust to partial occlusions and local 3D viewpoint rotations. Finally, the system saves the historic of user–object assignments, being specially useful for surveillance scenarios. The system has been evaluated on a novel data set containing different indoor/outdoor scenarios, objects, and users, showing accurate recognition and better performance than standard state-of-the-art approaches.
	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		ISBN		Medium
	Area		Expedition		Conference
	Notes	HUPBA; 600.046; 605.203;MILAB			Approved	no
	Call Number	Admin @ si @ CRE2013			Serial	2248
Permanent link to this record



	Author	Miguel Angel Bautista; Sergio Escalera; Xavier Baro; Petia Radeva; Jordi Vitria; Oriol Pujol
	Title	Minimal Design of Error-Correcting Output Codes			Type	Journal Article
	Year	2011	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	33	Issue	6	Pages	693-702
	Keywords	Multi-class classification; Error-correcting output codes; Ensemble of classifiers
	Abstract	IF JCR CCIA 1.303 2009 54/103 The classification of large number of object categories is a challenging trend in the pattern recognition field. In literature, this is often addressed using an ensemble of classifiers. In this scope, the Error-correcting output codes framework has demonstrated to be a powerful tool for combining classifiers. However, most state-of-the-art ECOC approaches use a linear or exponential number of classifiers, making the discrimination of a large number of classes unfeasible. In this paper, we explore and propose a minimal design of ECOC in terms of the number of classifiers. Evolutionary computation is used for tuning the parameters of the classifiers and looking for the best minimal ECOC code configuration. The results over several public UCI datasets and different multi-class computer vision problems show that the proposed methodology obtains comparable (even better) results than state-of-the-art ECOC methodologies with far less number of dichotomizers.
	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	0167-8655	ISBN		Medium
	Area		Expedition		Conference
	Notes	MILAB; OR;HuPBA;MV			Approved	no
	Call Number	Admin @ si @ BEB2011a			Serial	1800
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



	Author	A. Martinez; Jordi Vitria
	Title	Learning mixture models using a genetic version of the EM algorithm.			Type	Journal Article
	Year	2000	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	21	Issue	8	Pages	759–769
	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	OR;MV			Approved	no
	Call Number	BCNPCL @ bcnpcl @ MVi2000			Serial	335
Permanent link to this record



	Author	Pau Riba; Josep Llados; Alicia Fornes; Anjan Dutta
	Title	Large-scale graph indexing using binary embeddings of node contexts for information spotting in document image databases			Type	Journal Article
	Year	2017	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	87	Issue		Pages	203-211
	Keywords
	Abstract	Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations. However, retrieving a query graph from a large dataset of graphs implies a high computational complexity. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. With this aim, in this paper we propose a graph indexation formalism applied to visual retrieval. A binary embedding is defined as hashing keys for graph nodes. Given a database of labeled graphs, graph nodes are complemented with vectors of attributes representing their local context. Then, each attribute vector is converted to a binary code applying a binary-valued hash function. Therefore, graph retrieval is formulated in terms of finding target graphs in the database whose nodes have a small Hamming distance from the query nodes, easily computed with bitwise logical operators. As an application example, we validate the performance of the proposed methods in different real scenarios such as handwritten word spotting in images of historical documents or symbol spotting in architectural floor plans.
	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; 600.097; 602.006; 603.053; 600.121			Approved	no
	Call Number	RLF2017b			Serial	2873
Permanent link to this record