Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

[161–170] << 171 172 173 174 175 176 177 178 179 180 >> [181–190]

List View

Citations

Details

	Records
	Author	E. Serradell; Adriana Romero; R. Leta; Carlo Gatta; Francesc Moreno-Noguer
	Title	Simultaneous Correspondence and Non-Rigid 3D Reconstruction of the Coronary Tree from Single X-Ray Images			Type	Conference Article
	Year	2011	Publication	13th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	850-857
	Keywords
	Abstract
	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		Medium
	Area		Expedition		Conference	ICCV
	Notes	MILAB			Approved	no
	Call Number	Admin @ si @ SRL2011			Serial	1803
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	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	Javier Marin; David Vazquez; Antonio Lopez; Jaume Amores; Bastian Leibe
	Title	Random Forests of Local Experts for Pedestrian Detection			Type	Conference Article
	Year	2013	Publication	15th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	2592 - 2599
	Keywords	ADAS; Random Forest; Pedestrian Detection
	Abstract	Pedestrian detection is one of the most challenging tasks in computer vision, and has received a lot of attention in the last years. Recently, some authors have shown the advantages of using combinations of part/patch-based detectors in order to cope with the large variability of poses and the existence of partial occlusions. In this paper, we propose a pedestrian detection method that efficiently combines multiple local experts by means of a Random Forest ensemble. The proposed method works with rich block-based representations such as HOG and LBP, in such a way that the same features are reused by the multiple local experts, so that no extra computational cost is needed with respect to a holistic method. Furthermore, we demonstrate how to integrate the proposed approach with a cascaded architecture in order to achieve not only high accuracy but also an acceptable efficiency. In particular, the resulting detector operates at five frames per second using a laptop machine. We tested the proposed method with well-known challenging datasets such as Caltech, ETH, Daimler, and INRIA. The method proposed in this work consistently ranks among the top performers in all the datasets, being either the best method or having a small difference with the best one.
	Address	Sydney; Australia; December 2013
	Corporate Author				Thesis
	Publisher	IEEE	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		Medium
	Area		Expedition		Conference	ICCV
	Notes	ADAS; 600.057; 600.054			Approved	no
	Call Number	ADAS @ adas @ MVL2013			Serial	2333
Permanent link to this record



	Author	Jon Almazan; Albert Gordo; Alicia Fornes; Ernest Valveny
	Title	Handwritten Word Spotting with Corrected Attributes			Type	Conference Article
	Year	2013	Publication	15th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	1017-1024
	Keywords
	Abstract	We propose an approach to multi-writer word spotting, where the goal is to find a query word in a dataset comprised of document images. We propose an attributes-based approach that leads to a low-dimensional, fixed-length representation of the word images that is fast to compute and, especially, fast to compare. This approach naturally leads to an unified representation of word images and strings, which seamlessly allows one to indistinctly perform query-by-example, where the query is an image, and query-by-string, where the query is a string. We also propose a calibration scheme to correct the attributes scores based on Canonical Correlation Analysis that greatly improves the results on a challenging dataset. We test our approach on two public datasets showing state-of-the-art results.
	Address	Sydney; Australia; December 2013
	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		Medium
	Area		Expedition		Conference	ICCV
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ AGF2013			Serial	2327
Permanent link to this record



	Author	Gemma Roig; Xavier Boix; R. de Nijs; Sebastian Ramos; K. Kühnlenz; Luc Van Gool
	Title	Active MAP Inference in CRFs for Efficient Semantic Segmentation			Type	Conference Article
	Year	2013	Publication	15th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	2312 - 2319
	Keywords	Semantic Segmentation
	Abstract	Most MAP inference algorithms for CRFs optimize an energy function knowing all the potentials. In this paper, we focus on CRFs where the computational cost of instantiating the potentials is orders of magnitude higher than MAP inference. This is often the case in semantic image segmentation, where most potentials are instantiated by slow classifiers fed with costly features. We introduce Active MAP inference 1) to on-the-fly select a subset of potentials to be instantiated in the energy function, leaving the rest of the parameters of the potentials unknown, and 2) to estimate the MAP labeling from such incomplete energy function. Results for semantic segmentation benchmarks, namely PASCAL VOC 2010 [5] and MSRC-21 [19], show that Active MAP inference achieves similar levels of accuracy but with major efficiency gains.
	Address	Sydney; Australia; December 2013
	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		Medium
	Area		Expedition		Conference	ICCV
	Notes	ADAS; 600.057			Approved	no
	Call Number	ADAS @ adas @ RBN2013			Serial	2377
Permanent link to this record



	Author	Adria Ruiz; Joost Van de Weijer; Xavier Binefa
	Title	From emotions to action units with hidden and semi-hidden-task learning			Type	Conference Article
	Year	2015	Publication	16th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	3703-3711
	Keywords
	Abstract	Limited annotated training data is a challenging problem in Action Unit recognition. In this paper, we investigate how the use of large databases labelled according to the 6 universal facial expressions can increase the generalization ability of Action Unit classifiers. For this purpose, we propose a novel learning framework: Hidden-Task Learning. HTL aims to learn a set of Hidden-Tasks (Action Units)for which samples are not available but, in contrast, training data is easier to obtain from a set of related VisibleTasks (Facial Expressions). To that end, HTL is able to exploit prior knowledge about the relation between Hidden and Visible-Tasks. In our case, we base this prior knowledge on empirical psychological studies providing statistical correlations between Action Units and universal facial expressions. Additionally, we extend HTL to Semi-Hidden Task Learning (SHTL) assuming that Action Unit training samples are also provided. Performing exhaustive experiments over four different datasets, we show that HTL and SHTL improve the generalization ability of AU classifiers by training them with additional facial expression data. Additionally, we show that SHTL achieves competitive performance compared with state-of-the-art Transductive Learning approaches which face the problem of limited training data by using unlabelled test samples during training.
	Address	Santiago de Chile; Chile; December 2015
	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	ICCV
	Notes	LAMP; 600.068; 600.079			Approved	no
	Call Number	Admin @ si @ RWB2015			Serial	2671
Permanent link to this record



	Author	Marc Masana; Joost Van de Weijer; Luis Herranz;Andrew Bagdanov; Jose Manuel Alvarez
	Title	Domain-adaptive deep network compression			Type	Conference Article
	Year	2017	Publication	17th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Deep Neural Networks trained on large datasets can be easily transferred to new domains with far fewer labeled examples by a process called fine-tuning. This has the advantage that representations learned in the large source domain can be exploited on smaller target domains. However, networks designed to be optimal for the source task are often prohibitively large for the target task. In this work we address the compression of networks after domain transfer. We focus on compression algorithms based on low-rank matrix decomposition. Existing methods base compression solely on learned network weights and ignore the statistics of network activations. We show that domain transfer leads to large shifts in network activations and that it is desirable to take this into account when compressing. We demonstrate that considering activation statistics when compressing weights leads to a rank-constrained regression problem with a closed-form solution. Because our method takes into account the target domain, it can more optimally remove the redundancy in the weights. Experiments show that our Domain Adaptive Low Rank (DALR) method significantly outperforms existing low-rank compression techniques. With our approach, the fc6 layer of VGG19 can be compressed more than 4x more than using truncated SVD alone – with only a minor or no loss in accuracy. When applied to domain-transferred networks it allows for compression down to only 5-20% of the original number of parameters with only a minor drop in performance.
	Address	Venice; Italy; October 2017
	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	ICCV
	Notes	LAMP; 601.305; 600.106; 600.120			Approved	no
	Call Number	Admin @ si @			Serial	3034
Permanent link to this record



	Author	Xialei Liu; Joost Van de Weijer; Andrew Bagdanov
	Title	RankIQA: Learning from Rankings for No-reference Image Quality Assessment			Type	Conference Article
	Year	2017	Publication	17th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	We propose a no-reference image quality assessment (NR-IQA) approach that learns from rankings (RankIQA). To address the problem of limited IQA dataset size, we train a Siamese Network to rank images in terms of image quality by using synthetically generated distortions for which relative image quality is known. These ranked image sets can be automatically generated without laborious human labeling. We then use fine-tuning to transfer the knowledge represented in the trained Siamese Network to a traditional CNN that estimates absolute image quality from single images. We demonstrate how our approach can be made significantly more efficient than traditional Siamese Networks by forward propagating a batch of images through a single network and backpropagating gradients derived from all pairs of images in the batch. Experiments on the TID2013 benchmark show that we improve the state-of-the-art by over 5%. Furthermore, on the LIVE benchmark we show that our approach is superior to existing NR-IQA techniques and that we even outperform the state-of-the-art in full-reference IQA (FR-IQA) methods without having to resort to high-quality reference images to infer IQA.
	Address	Venice; Italy; October 2017
	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	ICCV
	Notes	LAMP; 600.106; 600.109; 600.120			Approved	no
	Call Number	Admin @ si @ LWB2017b			Serial	3036
Permanent link to this record



	Author	Lichao Zhang; Abel Gonzalez-Garcia; Joost Van de Weijer; Martin Danelljan; Fahad Shahbaz Khan
	Title	Learning the Model Update for Siamese Trackers			Type	Conference Article
	Year	2019	Publication	18th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	4009-4018
	Keywords
	Abstract	Siamese approaches address the visual tracking problem by extracting an appearance template from the current frame, which is used to localize the target in the next frame. In general, this template is linearly combined with the accumulated template from the previous frame, resulting in an exponential decay of information over time. While such an approach to updating has led to improved results, its simplicity limits the potential gain likely to be obtained by learning to update. Therefore, we propose to replace the handcrafted update function with a method which learns to update. We use a convolutional neural network, called UpdateNet, which given the initial template, the accumulated template and the template of the current frame aims to estimate the optimal template for the next frame. The UpdateNet is compact and can easily be integrated into existing Siamese trackers. We demonstrate the generality of the proposed approach by applying it to two Siamese trackers, SiamFC and DaSiamRPN. Extensive experiments on VOT2016, VOT2018, LaSOT, and TrackingNet datasets demonstrate that our UpdateNet effectively predicts the new target template, outperforming the standard linear update. On the large-scale TrackingNet dataset, our UpdateNet improves the results of DaSiamRPN with an absolute gain of 3.9% in terms of success score.
	Address	Seul; Corea; October 2019
	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	ICCV
	Notes	LAMP; 600.109; 600.141; 600.120			Approved	no
	Call Number	Admin @ si @ ZGW2019			Serial	3295
Permanent link to this record



	Author	Ali Furkan Biten; Ruben Tito; Andres Mafla; Lluis Gomez; Marçal Rusiñol; C.V. Jawahar; Ernest Valveny; Dimosthenis Karatzas
	Title	Scene Text Visual Question Answering			Type	Conference Article
	Year	2019	Publication	18th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	4291-4301
	Keywords
	Abstract	Current visual question answering datasets do not consider the rich semantic information conveyed by text within an image. In this work, we present a new dataset, ST-VQA, that aims to highlight the importance of exploiting highlevel semantic information present in images as textual cues in the Visual Question Answering process. We use this dataset to define a series of tasks of increasing difficulty for which reading the scene text in the context provided by the visual information is necessary to reason and generate an appropriate answer. We propose a new evaluation metric for these tasks to account both for reasoning errors as well as shortcomings of the text recognition module. In addition we put forward a series of baseline methods, which provide further insight to the newly released dataset, and set the scene for further research.
	Address	Seul; Corea; October 2019
	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	ICCV
	Notes	DAG; 600.129; 600.135; 601.338; 600.121			Approved	no
	Call Number	Admin @ si @ BTM2019b			Serial	3285
Permanent link to this record



	Author	Axel Barroso-Laguna; Edgar Riba; Daniel Ponsa; Krystian Mikolajczyk
	Title	Key.Net: Keypoint Detection by Handcrafted and Learned CNN Filters			Type	Conference Article
	Year	2019	Publication	18th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	5835-5843
	Keywords
	Abstract	We introduce a novel approach for keypoint detection task that combines handcrafted and learned CNN filters within a shallow multi-scale architecture. Handcrafted filters provide anchor structures for learned filters, which localize, score and rank repeatable features. Scale-space representation is used within the network to extract keypoints at different levels. We design a loss function to detect robust features that exist across a range of scales and to maximize the repeatability score. Our Key.Net model is trained on data synthetically created from ImageNet and evaluated on HPatches benchmark. Results show that our approach outperforms state-of-the-art detectors in terms of repeatability, matching performance and complexity.
	Address	Seul; Corea; October 2019
	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	ICCV
	Notes	MSIAU; 600.122			Approved	no
	Call Number	Admin @ si @ BRP2019			Serial	3290
Permanent link to this record



	Author	Hamed H. Aghdam; Abel Gonzalez-Garcia; Joost Van de Weijer; Antonio Lopez
	Title	Active Learning for Deep Detection Neural Networks			Type	Conference Article
	Year	2019	Publication	18th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	3672-3680
	Keywords
	Abstract	The cost of drawing object bounding boxes (ie labeling) for millions of images is prohibitively high. For instance, labeling pedestrians in a regular urban image could take 35 seconds on average. Active learning aims to reduce the cost of labeling by selecting only those images that are informative to improve the detection network accuracy. In this paper, we propose a method to perform active learning of object detectors based on convolutional neural networks. We propose a new image-level scoring process to rank unlabeled images for their automatic selection, which clearly outperforms classical scores. The proposed method can be applied to videos and sets of still images. In the former case, temporal selection rules can complement our scoring process. As a relevant use case, we extensively study the performance of our method on the task of pedestrian detection. Overall, the experiments show that the proposed method performs better than random selection.
	Address	Seul; Korea; October 2019
	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	ICCV
	Notes	ADAS; LAMP; 600.124; 600.109; 600.141; 600.120; 600.118			Approved	no
	Call Number	Admin @ si @ AGW2019			Serial	3321
Permanent link to this record



	Author	Felipe Codevilla; Eder Santana; Antonio Lopez; Adrien Gaidon
	Title	Exploring the Limitations of Behavior Cloning for Autonomous Driving			Type	Conference Article
	Year	2019	Publication	18th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	9328-9337
	Keywords
	Abstract	Driving requires reacting to a wide variety of complex environment conditions and agent behaviors. Explicitly modeling each possible scenario is unrealistic. In contrast, imitation learning can, in theory, leverage data from large fleets of human-driven cars. Behavior cloning in particular has been successfully used to learn simple visuomotor policies end-to-end, but scaling to the full spectrum of driving behaviors remains an unsolved problem. In this paper, we propose a new benchmark to experimentally investigate the scalability and limitations of behavior cloning. We show that behavior cloning leads to state-of-the-art results, executing complex lateral and longitudinal maneuvers, even in unseen environments, without being explicitly programmed to do so. However, we confirm some limitations of the behavior cloning approach: some well-known limitations (eg, dataset bias and overfitting), new generalization issues (eg, dynamic objects and the lack of a causal modeling), and training instabilities, all requiring further research before behavior cloning can graduate to real-world driving. The code, dataset, benchmark, and agent studied in this paper can be found at github.
	Address	Seul; Korea; October 2019
	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	ICCV
	Notes	ADAS; 600.124; 600.118			Approved	no
	Call Number	Admin @ si @ CSL2019			Serial	3322
Permanent link to this record



	Author	David Berga; Xose R. Fernandez-Vidal; Xavier Otazu; Xose M. Pardo
	Title	SID4VAM: A Benchmark Dataset with Synthetic Images for Visual Attention Modeling			Type	Conference Article
	Year	2019	Publication	18th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	8788-8797
	Keywords
	Abstract	A benchmark of saliency models performance with a synthetic image dataset is provided. Model performance is evaluated through saliency metrics as well as the influence of model inspiration and consistency with human psychophysics. SID4VAM is composed of 230 synthetic images, with known salient regions. Images were generated with 15 distinct types of low-level features (e.g. orientation, brightness, color, size...) with a target-distractor popout type of synthetic patterns. We have used Free-Viewing and Visual Search task instructions and 7 feature contrasts for each feature category. Our study reveals that state-ofthe-art Deep Learning saliency models do not perform well with synthetic pattern images, instead, models with Spectral/Fourier inspiration outperform others in saliency metrics and are more consistent with human psychophysical experimentation. This study proposes a new way to evaluate saliency models in the forthcoming literature, accounting for synthetic images with uniquely low-level feature contexts, distinct from previous eye tracking image datasets.
	Address	Seul; Corea; October 2019
	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	ICCV
	Notes	NEUROBIT; 600.128			Approved	no
	Call Number	Admin @ si @ BFO2019b			Serial	3372
Permanent link to this record