Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	76–90 of 163 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–11]

List View

Citations

Details

	Records
	Author	Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados; Thierry Brouard
	Title	Subgraph Spotting Through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images			Type	Conference Article
	Year	2011	Publication	11th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	870-874
	Keywords
	Abstract	We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a relational data structure is mandatory. Our proposed method accomplishes subgraph spotting through graph embedding. We achieve automatic indexation of a graph repository during off-line learning phase, where we (i) break the graphs into 2-node sub graphs (a.k.a. cliques of order 2), which are primitive building-blocks of a graph, (ii) embed the 2-node sub graphs into feature vectors by employing our recently proposed explicit graph embedding technique, (iii) cluster the feature vectors in classes by employing a classic agglomerative clustering technique, (iv) build an index for the graph repository and (v) learn a Bayesian network classifier. The subgraph spotting is achieved during the on-line querying phase, where we (i) break the query graph into 2-node sub graphs, (ii) embed them into feature vectors, (iii) employ the Bayesian network classifier for classifying the query 2-node sub graphs and (iv) retrieve the respective graphs by looking-up in the index of the graph repository. The graphs containing all query 2-node sub graphs form the set of result graphs for the query. Finally, we employ the adjacency matrix of each result graph along with a score function, for spotting the query graph in it. The proposed subgraph spotting method is equally applicable to a wide range of domains, offering ease of query by example (QBE) and granularity of focused retrieval. Experimental results are presented for graphs generated from two repositories of electronic and architectural document images.
	Address	Beijing, China
	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	1520-5363	ISBN	978-1-4577-1350-7	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ LRL2011			Serial	1790
Permanent link to this record



	Author	Antonio Hernandez; Carlos Primo; Sergio Escalera
	Title	Automatic user interaction correction via Multi-label Graph cuts			Type	Conference Article
	Year	2011	Publication	In ICCV 2011 1st IEEE International Workshop on Human Interaction in Computer Vision HICV	Abbreviated Journal
	Volume		Issue		Pages	1276-1281
	Keywords
	Abstract	Most applications in image segmentation requires from user interaction in order to achieve accurate results. However, user wants to achieve the desired segmentation accuracy reducing effort of manual labelling. In this work, we extend standard multi-label α-expansion Graph Cut algorithm so that it analyzes the interaction of the user in order to modify the object model and improve final segmentation of objects. The approach is inspired in the fact that fast user interactions may introduce some pixel errors confusing object and background. Our results with different degrees of user interaction and input errors show high performance of the proposed approach on a multi-label human limb segmentation problem compared with classical α-expansion algorithm.
	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	978-1-4673-0062-9	Medium
	Area		Expedition		Conference	HICV
	Notes	MILAB; HuPBA			Approved	no
	Call Number	Admin @ si @ HPE2011			Serial	1892
Permanent link to this record



	Author	Jürgen Brauer; Wenjuan Gong; Jordi Gonzalez; Michael Arens
	Title	On the Effect of Temporal Information on Monocular 3D Human Pose Estimation			Type	Conference Article
	Year	2011	Publication	2nd IEEE International Workshop on Analysis and Retrieval of Tracked Events and Motion in Imagery Streams	Abbreviated Journal
	Volume		Issue		Pages	906 - 913
	Keywords
	Abstract	We address the task of estimating 3D human poses from monocular camera sequences. Many works make use of multiple consecutive frames for the estimation of a 3D pose in a frame. Although such an approach should ease the pose estimation task substantially since multiple consecutive frames allow to solve for 2D projection ambiguities in principle, it has not yet been investigated systematically how much we can improve the 3D pose estimates when using multiple consecutive frames opposed to single frame information. In this paper we analyze the difference in quality of 3D pose estimates based on different numbers of consecutive frames from which 2D pose estimates are available. We validate the use of temporal information on two major different approaches for human pose estimation – modeling and learning approaches. The results of our experiments show that both learning and modeling approaches benefit from using multiple frames opposed to single frame input but that the benefit is small when the 2D pose estimates show a high quality in terms of precision.
	Address	Barcelona
	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	978-1-4673-0062-9	Medium
	Area		Expedition		Conference	ARTEMIS
	Notes	ISE			Approved	no
	Call Number	Admin @ si @BGG 2011			Serial	1860
Permanent link to this record



	Author	Mohammad Rouhani; Angel Sappa
	Title	Correspondence Free Registration through a Point-to-Model Distance Minimization			Type	Conference Article
	Year	2011	Publication	13th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	2150-2157
	Keywords
	Abstract	This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of the existing works, which are based on minimizing a point-wise correspondence term, we propose to describe the model set by means of an implicit representation. It allows a new definition of the registration error, which works beyond the point level representation. Moreover, it could be used in a gradient-based optimization framework. The proposed approach consists of two stages. Firstly, a novel formulation is proposed that relates the registration parameters with the distance between the model and data set. Secondly, the registration parameters are obtained by means of the Levengberg-Marquardt algorithm. Experimental results and comparisons with state of the art show the validity of the proposed framework.
	Address	Barcelona
	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	1550-5499	ISBN	978-1-4577-1101-5	Medium
	Area		Expedition		Conference	ICCV
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RoS2011b; ADAS @ adas @			Serial	1832
Permanent link to this record



	Author	Koen E.A. van de Sande; Jasper Uilings; Theo Gevers; Arnold Smeulders
	Title	Segmentation as Selective Search for Object Recognition			Type	Conference Article
	Year	2011	Publication	13th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	1879-1886
	Keywords
	Abstract	For object recognition, the current state-of-the-art is based on exhaustive search. However, to enable the use of more expensive features and classifiers and thereby progress beyond the state-of-the-art, a selective search strategy is needed. Therefore, we adapt segmentation as a selective search by reconsidering segmentation: We propose to generate many approximate locations over few and precise object delineations because (1) an object whose location is never generated can not be recognised and (2) appearance and immediate nearby context are most effective for object recognition. Our method is class-independent and is shown to cover 96.7% of all objects in the Pascal VOC 2007 test set using only 1,536 locations per image. Our selective search enables the use of the more expensive bag-of-words method which we use to substantially improve the state-of-the-art by up to 8.5% for 8 out of 20 classes on the Pascal VOC 2010 detection challenge.
	Address	Barcelona
	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	1550-5499	ISBN	978-1-4577-1101-5	Medium
	Area		Expedition		Conference	ICCV
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ SUG2011			Serial	1780
Permanent link to this record



	Author	Bhaskar Chakraborty; Michael Holte; Thomas B. Moeslund; Jordi Gonzalez; Xavier Roca
	Title	A Selective Spatio-Temporal Interest Point Detector for Human Action Recognition in Complex Scenes			Type	Conference Article
	Year	2011	Publication	13th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	1776-1783
	Keywords
	Abstract	Recent progress in the field of human action recognition points towards the use of Spatio-Temporal Interest Points (STIPs) for local descriptor-based recognition strategies. In this paper we present a new approach for STIP detection by applying surround suppression combined with local and temporal constraints. Our method is significantly different from existing STIP detectors 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-visual 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 existing benchmark datasets, and more challenging datasets of complex scenes, validate our approach and show state-of-the-art performance.
	Address	Barcelona
	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	1550-5499	ISBN	978-1-4577-1101-5	Medium
	Area		Expedition		Conference	ICCV
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ CHM2011			Serial	1811
Permanent link to this record



	Author	Mario Rojas; David Masip; Jordi Vitria
	Title	Predicting Dominance Judgements Automatically: A Machine Learning Approach.			Type	Conference Article
	Year	2011	Publication	IEEE International Workshop on Social Behavior Analysis	Abbreviated Journal
	Volume		Issue		Pages	939-944
	Keywords
	Abstract	The amount of multimodal devices that surround us is growing everyday. In this context, human interaction and communication have become a focus of attention and a hot topic of research. A crucial element in human relations is the evaluation of individuals with respect to facial traits, what is called a first impression. Studies based on appearance have suggested that personality can be expressed by appearance and the observer may use such information to form judgments. In the context of rapid facial evaluation, certain personality traits seem to have a more pronounced effect on the relations and perceptions inside groups. The perception of dominance has been shown to be an active part of social roles at different stages of life, and even play a part in mate selection. The aim of this paper is to study to what extent this information is learnable from the point of view of computer science. Specifically we intend to determine if judgments of dominance can be learned by machine learning techniques. We implement two different descriptors in order to assess this. The first is the histogram of oriented gradients (HOG), and the second is a probabilistic appearance descriptor based on the frequencies of grouped binary tests. State of the art classification rules validate the performance of both descriptors, with respect to the prediction task. Experimental results show that machine learning techniques can predict judgments of dominance rather accurately (accuracies up to 90%) and that the HOG descriptor may characterize appropriately the information necessary for such task.
	Address	Santa Barbara, CA
	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	978-1-4244-9140-7	Medium
	Area		Expedition		Conference	SBA
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ RMV2011b			Serial	1760
Permanent link to this record



	Author	Gemma Roig; Xavier Boix; F. de la Torre; Joan Serrat; C. Vilella
	Title	Hierarchical CRF with product label spaces for parts-based Models			Type	Conference Article
	Year	2011	Publication	IEEE Conference on Automatic Face and Gesture Recognition	Abbreviated Journal
	Volume		Issue		Pages	657-664
	Keywords	Shape; Computational modeling; Principal component analysis; Random variables; Color; Upper bound; Facial features
	Abstract	Non-rigid object detection is a challenging an open research problem in computer vision. It is a critical part in many applications such as image search, surveillance, human-computer interaction or image auto-annotation. Most successful approaches to non-rigid object detection make use of part-based models. In particular, Conditional Random Fields (CRF) have been successfully embedded into a discriminative parts-based model framework due to its effectiveness for learning and inference (usually based on a tree structure). However, CRF-based approaches do not incorporate global constraints and only model pairwise interactions. This is especially important when modeling object classes that may have complex parts interactions (e.g. facial features or body articulations), because neglecting them yields an oversimplified model with suboptimal performance. To overcome this limitation, this paper proposes a novel hierarchical CRF (HCRF). The main contribution is to build a hierarchy of part combinations by extending the label set to a hierarchy of product label spaces. In order to keep the inference computation tractable, we propose an effective method to reduce the new label set. We test our method on two applications: facial feature detection on the Multi-PIE database and human pose estimation on the Buffy dataset.
	Address	Santa Barbara, CA, USA, 2011
	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	FG
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RBT2011			Serial	1862
Permanent link to this record



	Author	Marco Pedersoli; Andrea Vedaldi; Jordi Gonzalez
	Title	A Coarse-to-fine Approach for fast Deformable Object Detection			Type	Conference Article
	Year	2011	Publication	IEEE conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	1353-1360
	Keywords
	Abstract
	Address	Colorado Springs; USA
	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	CVPR
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ PVG2011			Serial	1764
Permanent link to this record



	Author	Miguel Oliveira; Angel Sappa; V.Santos
	Title	Unsupervised Local Color Correction for Coarsely Registered Images			Type	Conference Article
	Year	2011	Publication	IEEE conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	201-208
	Keywords
	Abstract	The current paper proposes a new parametric local color correction technique. Initially, several color transfer functions are computed from the output of the mean shift color segmentation algorithm. Secondly, color influence maps are calculated. Finally, the contribution of every color transfer function is merged using the weights from the color influence maps. The proposed approach is compared with both global and local color correction approaches. Results show that our method outperforms the technique ranked first in a recent performance evaluation on this topic. Moreover, the proposed approach is computed in about one tenth of the time.
	Address	Colorado Springs
	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	1063-6919	ISBN	978-1-4577-0394-2	Medium
	Area		Expedition		Conference	CVPR
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ OSS2011; ADAS @ adas @			Serial	1766
Permanent link to this record



	Author	Albert Gordo; Florent Perronnin
	Title	Asymmetric Distances for Binary Embeddings			Type	Conference Article
	Year	2011	Publication	IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	729 - 736
	Keywords
	Abstract	In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database signatures, it has been noted that this is not strictly a requirement. Indeed, asymmetric schemes which binarize the database signatures but not the query still enjoy the same two benefits but may provide superior accuracy. In this work, we propose two general asymmetric distances which are applicable to a wide variety of embedding techniques including Locality Sensitive Hashing (LSH), Locality Sensitive Binary Codes (LSBC), Spectral Hashing (SH) and Semi-Supervised Hashing (SSH). We experiment on four public benchmarks containing up to 1M images and show that the proposed asymmetric distances consistently lead to large improvements over the symmetric Hamming distance for all binary embedding techniques. We also propose a novel simple binary embedding technique – PCA Embedding (PCAE) – which is shown to yield competitive results with respect to more complex algorithms such as SH and SSH.
	Address	Providence, RI
	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	978-1-4577-0394-2	Medium
	Area		Expedition		Conference	CVPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GoP2011; IAM @ iam @ GoP2011			Serial	1817
Permanent link to this record



	Author	A. Toet; M. Henselmans; M.P. Lucassen; Theo Gevers
	Title	Emotional effects of dynamic textures			Type	Journal
	Year	2011	Publication	i-Perception	Abbreviated Journal	iPER
	Volume	2	Issue	9	Pages	969 – 991
	Keywords
	Abstract	This study explores the effects of various spatiotemporal dynamic texture characteristics on human emotions. The emotional experience of auditory (eg, music) and haptic repetitive patterns has been studied extensively. In contrast, the emotional experience of visual dynamic textures is still largely unknown, despite their natural ubiquity and increasing use in digital media. Participants watched a set of dynamic textures, representing either water or various different media, and self-reported their emotional experience. Motion complexity was found to have mildly relaxing and nondominant effects. In contrast, motion change complexity was found to be arousing and dominant. The speed of dynamics had arousing, dominant, and unpleasant effects. The amplitude of dynamics was also regarded as unpleasant. The regularity of the dynamics over the textures’ area was found to be uninteresting, nondominant, mildly relaxing, and mildly pleasant. The spatial scale of the dynamics had an unpleasant, arousing, and dominant effect, which was larger for textures with diverse content than for water textures. For water textures, the effects of spatial contrast were arousing, dominant, interesting, and mildly unpleasant. None of these effects were observed for textures of diverse content. The current findings are relevant for the design and synthesis of affective multimedia content and for affective scene indexing and retrieval.
	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	2041-6695	ISBN		Medium
	Area		Expedition		Conference
	Notes	ALTRES;ISE			Approved	no
	Call Number	Admin @ si @THL2011			Serial	1843
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	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	Carles Fernandez; Pau Baiget; Xavier Roca; Jordi Gonzalez
	Title	Augmenting Video Surveillance Footage with Virtual Agents for Incremental Event Evaluation			Type	Journal Article
	Year	2011	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	32	Issue	6	Pages	878–889
	Keywords
	Abstract	The fields of segmentation, tracking and behavior analysis demand for challenging video resources to test, in a scalable manner, complex scenarios like crowded environments or scenes with high semantics. Nevertheless, existing public databases cannot scale the presence of appearing agents, which would be useful to study long-term occlusions and crowds. Moreover, creating these resources is expensive and often too particularized to specific needs. We propose an augmented reality framework to increase the complexity of image sequences in terms of occlusions and crowds, in a scalable and controllable manner. Existing datasets can be increased with augmented sequences containing virtual agents. Such sequences are automatically annotated, thus facilitating evaluation in terms of segmentation, tracking, and behavior recognition. In order to easily specify the desired contents, we propose a natural language interface to convert input sentences into virtual agent behaviors. Experimental tests and validation in indoor, street, and soccer environments are provided to show the feasibility of the proposed approach in terms of robustness, scalability, and semantics.
	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	ISE			Approved	no
	Call Number	Admin @ si @ FBR2011b			Serial	1723
Permanent link to this record