Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

[111–120] << 121 122 123 124 125 126 127 128 129 130 >> [131–140]

List View

Citations

Details

	Records
	Author	David Augusto Rojas
	Title	Colouring Local Feature Detection for Matching			Type	Report
	Year	2009	Publication	CVC Technical Report	Abbreviated Journal
	Volume	133	Issue		Pages
	Keywords
	Abstract
	Address
	Corporate Author	Computer Vision Center			Thesis	Master's thesis
	Publisher		Place of Publication	Bellaterra, Barcelona	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	CIC			Approved	no
	Call Number	Admin @ si @ Roj2009			Serial	2392
Permanent link to this record



	Author	Jordi Roca; A.Owen; G.Jordan; Y.Ling; C. Alejandro Parraga; A.Hurlbert
	Title	Inter-individual Variations in Color Naming and the Structure of 3D Color Space			Type	Abstract
	Year	2011	Publication	Journal of Vision	Abbreviated Journal	VSS
	Volume	12	Issue	2	Pages	166
	Keywords
	Abstract	36.307 Many everyday behavioural uses of color vision depend on color naming ability, which is neither measured nor predicted by most standardized tests of color vision, for either normal or anomalous color vision. Here we demonstrate a new method to quantify color naming ability by deriving a compact computational description of individual 3D color spaces. Methods: Individual observers underwent standardized color vision diagnostic tests (including anomaloscope testing) and a series of custom-made color naming tasks using 500 distinct color samples, either CRT stimuli (“light”-based) or Munsell chips (“surface”-based), with both forced- and free-choice color naming paradigms. For each subject, we defined his/her color solid as the set of 3D convex hulls computed for each basic color category from the relevant collection of categorised points in perceptually uniform CIELAB space. From the parameters of the convex hulls, we derived several indices to characterise the 3D structure of the color solid and its inter-individual variations. Using a reference group of 25 normal trichromats (NT), we defined the degree of normality for the shape, location and overlap of each color region, and the extent of “light”-“surface” agreement. Results: Certain features of color perception emerge from analysis of the average NT color solid, e.g.: (1) the white category is slightly shifted towards blue; and (2) the variability in category border location across NT subjects is asymmetric across color space, with least variability in the blue/green region. Comparisons between individual and average NT indices reveal specific naming “deficits”, e.g.: (1) Category volumes for white, green, brown and grey are expanded for anomalous trichromats and dichromats; and (2) the focal structure of color space is disrupted more in protanopia than other forms of anomalous color vision. The indices both capture the structure of subjective color spaces and allow us to quantify inter-individual differences in color naming ability.
	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	1534-7362	ISBN		Medium
	Area		Expedition		Conference
	Notes	CIC			Approved	no
	Call Number	Admin @ si @ ROJ2011			Serial	1758
Permanent link to this record



	Author	Adriana Romero
	Title	Assisting the training of deep neural networks with applications to computer vision			Type	Book Whole
	Year	2015	Publication	PhD Thesis, Universitat de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Deep learning has recently been enjoying an increasing popularity due to its success in solving challenging tasks. In particular, deep learning has proven to be effective in a large variety of computer vision tasks, such as image classification, object recognition and image parsing. Contrary to previous research, which required engineered feature representations, designed by experts, in order to succeed, deep learning attempts to learn representation hierarchies automatically from data. More recently, the trend has been to go deeper with representation hierarchies. Learning (very) deep representation hierarchies is a challenging task, which involves the optimization of highly non-convex functions. Therefore, the search for algorithms to ease the learning of (very) deep representation hierarchies from data is extensive and ongoing. In this thesis, we tackle the challenging problem of easing the learning of (very) deep representation hierarchies. We present a hyper-parameter free, off-the-shelf, simple and fast unsupervised algorithm to discover hidden structure from the input data by enforcing a very strong form of sparsity. We study the applicability and potential of the algorithm to learn representations of varying depth in a handful of applications and domains, highlighting the ability of the algorithm to provide discriminative feature representations that are able to achieve top performance. Yet, while emphasizing the great value of unsupervised learning methods when labeled data is scarce, the recent industrial success of deep learning has revolved around supervised learning. Supervised learning is currently the focus of many recent research advances, which have shown to excel at many computer vision tasks. Top performing systems often involve very large and deep models, which are not well suited for applications with time or memory limitations. More in line with the current trends, we engage in making top performing models more efficient, by designing very deep and thin models. Since training such very deep models still appears to be a challenging task, we introduce a novel algorithm that guides the training of very thin and deep models by hinting their intermediate representations. Very deep and thin models trained by the proposed algorithm end up extracting feature representations that are comparable or even better performing than the ones extracted by large state-of-the-art models, while compellingly reducing the time and memory consumption of the model.
	Address	October 2015
	Corporate Author				Thesis	Ph.D. thesis
	Publisher	Ediciones Graficas Rey	Place of Publication		Editor	Carlo Gatta;Petia Radeva
	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			Approved	no
	Call Number	Admin @ si @ Rom2015			Serial	2707
Permanent link to this record



	Author	Jose Antonio Rodriguez; Florent Perronnin
	Title	Local Gradient Histogram Features for Word Spotting in Unconstrained Handwritten Documents			Type	Book Chapter
	Year	2008	Publication	Graphics Recognition: Recent Advances and New Opportunities	Abbreviated Journal
	Volume	5046	Issue		Pages	188–198
	Keywords
	Abstract
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor	W. Liu, J. Llados, J.M. Ogier
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes				Approved	no
	Call Number	Admin @ si @ RoP2008a			Serial	992
Permanent link to this record



	Author	Jose Antonio Rodriguez; Florent Perronnin
	Title	Local Gradient Histogram Features for Word Spotting in Unconstrained Handwritten Documents			Type	Conference Article
	Year	2008	Publication	International Conference on Frontiers in Handwriting Recognition	Abbreviated Journal
	Volume		Issue		Pages	7–12
	Keywords
	Abstract
	Address	Montreal (Canada)
	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	ICFHR
	Notes				Approved	no
	Call Number	Admin @ si @ RoP2008b			Serial	1066
Permanent link to this record



	Author	Jose Antonio Rodriguez; Florent Perronnin
	Title	Score Normalization for Hmm-based Word Spotting Using Universal Background Model			Type	Conference Article
	Year	2008	Publication	International Conference on Frontiers in Handwriting Recognition	Abbreviated Journal
	Volume		Issue		Pages	82–87
	Keywords
	Abstract
	Address	Montreal (Canada)
	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	ICFHR
	Notes				Approved	no
	Call Number	Admin @ si @ RoP2008c			Serial	1067
Permanent link to this record



	Author	Jose Antonio Rodriguez; Florent Perronnin
	Title	Handwritten word-spotting using hidden Markov models and universal vocabularies			Type	Journal Article
	Year	2009	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	42	Issue	9	Pages	2103-2116
	Keywords	Word-spotting; Hidden Markov model; Score normalization; Universal vocabulary; Handwriting recognition
	Abstract	Handwritten word-spotting is traditionally viewed as an image matching task between one or multiple query word-images and a set of candidate word-images in a database. This is a typical instance of the query-by-example paradigm. In this article, we introduce a statistical framework for the word-spotting problem which employs hidden Markov models (HMMs) to model keywords and a Gaussian mixture model (GMM) for score normalization. We explore the use of two types of HMMs for the word modeling part: continuous HMMs (C-HMMs) and semi-continuous HMMs (SC-HMMs), i.e. HMMs with a shared set of Gaussians. We show on a challenging multi-writer corpus that the proposed statistical framework is always superior to a traditional matching system which uses dynamic time warping (DTW) for word-image distance computation. A very important finding is that the SC-HMM is superior when labeled training data is scarce—as low as one sample per keyword—thanks to the prior information which can be incorporated in the shared set of Gaussians.
	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	0031-3203	ISBN		Medium
	Area		Expedition		Conference
	Notes				Approved	no
	Call Number	Admin @ si @ RoP2009			Serial	1053
Permanent link to this record



	Author	Misael Rosales
	Title	Empirical Simulation Moldel of Intravascular Ultrasound			Type	Miscellaneous
	Year	2002	Publication	Director: P. Radeva, Master Thesis.	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract
	Address	CVC (UAB)
	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				Approved	no
	Call Number	Admin @ si @ Ros2002			Serial	323
Permanent link to this record



	Author	Misael Rosales
	Title	A Physics-Based Image Modelling of IVUS as a Geometric and Kinematic System			Type	Book Whole
	Year	2005	Publication	PhD Thesis, Universitat Autonoma de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract
	Address	CVC (UAB)
	Corporate Author				Thesis	Ph.D. thesis
	Publisher		Place of Publication		Editor	Petia Radeva
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition	978-84-922529-8-7	Conference
	Notes				Approved	no
	Call Number	Admin @ si @ Ros2005			Serial	603
Permanent link to this record



	Author	Mohammad Rouhani; Angel Sappa
	Title	Implicit B-Spline Fitting Using the 3L Algorithm			Type	Conference Article
	Year	2011	Publication	18th IEEE International Conference on Image Processing	Abbreviated Journal
	Volume		Issue		Pages	893-896
	Keywords
	Abstract
	Address	Brussels, Belgium
	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	ICIP
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RoS2011a; ADAS @ adas @			Serial	1782
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	Mohammad Rouhani; Angel Sappa
	Title	Non-Rigid Shape Registration: A Single Linear Least Squares Framework			Type	Conference Article
	Year	2012	Publication	12th European Conference on Computer Vision	Abbreviated Journal
	Volume	7578	Issue		Pages	264-277
	Keywords
	Abstract	This paper proposes a non-rigid registration formulation capturing both global and local deformations in a single framework. This formulation is based on a quadratic estimation of the registration distance together with a quadratic regularization term. Hence, the optimal transformation parameters are easily obtained by solving a liner system of equations, which guarantee a fast convergence. Experimental results with challenging 2D and 3D shapes are presented to show the validity of the proposed framework. Furthermore, comparisons with the most relevant approaches are provided.
	Address	Florencia
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-33785-7	Medium
	Area		Expedition		Conference	ECCV
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RoS2012a			Serial	2158
Permanent link to this record



	Author	Mohammad Rouhani; Angel Sappa
	Title	Implicit Polynomial Representation through a Fast Fitting Error Estimation			Type	Journal Article
	Year	2012	Publication	IEEE Transactions on Image Processing	Abbreviated Journal	TIP
	Volume	21	Issue	4	Pages	2089-2098
	Keywords
	Abstract	Impact Factor This paper presents a simple distance estimation for implicit polynomial fitting. It is computed as the height of a simplex built between the point and the surface (i.e., a triangle in 2-D or a tetrahedron in 3-D), which is used as a coarse but reliable estimation of the orthogonal distance. The proposed distance can be described as a function of the coefficients of the implicit polynomial. Moreover, it is differentiable and has a smooth behavior . Hence, it can be used in any gradient-based optimization. In this paper, its use in a Levenberg-Marquardt framework is shown, which is particularly devoted for nonlinear least squares problems. The proposed estimation is a generalization of the gradient-based distance estimation, which is widely used in the literature. Experimental results, both in 2-D and 3-D data sets, are provided. Comparisons with state-of-the-art techniques are presented, showing the advantages of the proposed 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	1057-7149	ISBN		Medium
	Area		Expedition		Conference
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RoS2012b; ADAS @ adas @			Serial	1937
Permanent link to this record



	Author	German Ros
	Title	Visual SLAM for Driverless Cars: An Initial Survey			Type	Report
	Year	2012	Publication	CVC Technical Report	Abbreviated Journal
	Volume	170	Issue		Pages
	Keywords
	Abstract
	Address
	Corporate Author				Thesis	Master's 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			Approved	no
	Call Number	Admin @ si @ Ros2012c			Serial	2414
Permanent link to this record



	Author	Mohammad Rouhani; Angel Sappa
	Title	The Richer Representation the Better Registration			Type	Journal Article
	Year	2013	Publication	IEEE Transactions on Image Processing	Abbreviated Journal	TIP
	Volume	22	Issue	12	Pages	5036-5049
	Keywords
	Abstract	In this paper, the registration problem is formulated as a point to model distance minimization. Unlike most of the existing works, which are based on minimizing a point-wise correspondence term, this formulation avoids the correspondence search that is time-consuming. In the first stage, the target set is described through an implicit function by employing a linear least squares fitting. This function can be either an implicit polynomial or an implicit B-spline from a coarse to fine representation. In the second stage, we show how the obtained implicit representation is used as an interface to convert point-to-point registration into point-to-implicit problem. Furthermore, we show that this registration distance is smooth and can be minimized through the Levengberg-Marquardt algorithm. All the formulations presented for both stages are compact and easy to implement. In addition, we show that our registration method can be handled using any implicit representation though some are coarse and others provide finer representations; hence, a tradeoff between speed and accuracy can be set by employing the right implicit function. Experimental results and comparisons in 2D and 3D show the robustness and the speed of convergence of the proposed 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	1057-7149	ISBN		Medium
	Area		Expedition		Conference
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RoS2013			Serial	2665
Permanent link to this record