Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

<< 1 2 3 4 5 6 7 8 9 10 >>

List View

Citations

Details

	Records
	Author	Mohammad Rouhani
	Title	3D Data Fitting and Tracking for Real Time Applications			Type	Report
	Year	2009	Publication	CVC Technical Report	Abbreviated Journal
	Volume	138	Issue	138	Pages
	Keywords
	Abstract
	Address	Barcelona, Spain
	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	invisible;ADAS			Approved	no
	Call Number	Admin @ si @ Rou2009			Serial	1150
Permanent link to this record



	Author	Misael Rosales; Petia Radeva; Oriol Rodriguez-Leor; Debora Gil
	Title	Modelling of image-catheter motion for 3-D IVUS			Type	Journal Article
	Year	2009	Publication	Medical image analysis	Abbreviated Journal	MIA
	Volume	13	Issue	1	Pages	91-104
	Keywords	Intravascular ultrasound (IVUS); Motion estimation; Motion decomposition; Fourier
	Abstract	Three-dimensional intravascular ultrasound (IVUS) allows to visualize and obtain volumetric measurements of coronary lesions through an exploration of the cross sections and longitudinal views of arteries. However, the visualization and subsequent morpho-geometric measurements in IVUS longitudinal cuts are subject to distortion caused by periodic image/vessel motion around the IVUS catheter. Usually, to overcome the image motion artifact ECG-gating and image-gated approaches are proposed, leading to slowing the pullback acquisition or disregarding part of IVUS data. In this paper, we argue that the image motion is due to 3-D vessel geometry as well as cardiac dynamics, and propose a dynamic model based on the tracking of an elliptical vessel approximation to recover the rigid transformation and align IVUS images without loosing any IVUS data. We report an extensive validation with synthetic simulated data and in vivo IVUS sequences of 30 patients achieving an average reduction of the image artifact of 97% in synthetic data and 79% in real-data. Our study shows that IVUS alignment improves longitudinal analysis of the IVUS data and is a necessary step towards accurate reconstruction and volumetric measurements of 3-D IVUS.
	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	IAM;MILAB			Approved	no
	Call Number	IAM @ iam @ RRR2009			Serial	1646
Permanent link to this record



	Author	Mirko Arnold; Anarta Ghosh; Gerard Lacey; Stephen Patchett; Hugh Mulcahy
	Title	Indistinct frame detection in colonoscopy videos			Type	Conference Article
	Year	2009	Publication	Machine Vision and Image Processing Conference	Abbreviated Journal
	Volume		Issue		Pages	47-52
	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	800	Expedition		Conference
	Notes	MV			Approved	no
	Call Number	fernando @ fernando @			Serial	2424
Permanent link to this record



	Author	Miquel Ferrer; Ernest Valveny; F. Serratosa; I. Bardaji; Horst Bunke
	Title	Graph-based k-means clustering: A comparison of the set versus the generalized median graph			Type	Conference Article
	Year	2009	Publication	13th International Conference on Computer Analysis of Images and Patterns	Abbreviated Journal
	Volume	5702	Issue		Pages	342–350
	Keywords
	Abstract	In this paper we propose the application of the generalized median graph in a graph-based k-means clustering algorithm. In the graph-based k-means algorithm, the centers of the clusters have been traditionally represented using the set median graph. We propose an approximate method for the generalized median graph computation that allows to use it to represent the centers of the clusters. Experiments on three databases show that using the generalized median graph as the clusters representative yields better results than the set median graph.
	Address	Münster, Germany
	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-03766-5	Medium
	Area		Expedition		Conference	CAIP
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ FVS2009d			Serial	1219
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	Miquel Ferrer; Ernest Valveny; F. Serratosa
	Title	Median Graphs: A Genetic Approach based on New Theoretical Properties			Type	Journal Article
	Year	2009	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	42	Issue	9	Pages	2003–2012
	Keywords	Median graph; Genetic search; Maximum common subgraph; Graph matching; Structural pattern recognition
	Abstract	Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ FVS2009b			Serial	1167
Permanent link to this record



	Author	Miquel Ferrer; Ernest Valveny; F. Serratosa
	Title	Median Graph Computation by means of a Genetic Approach Based on Minimum Common Supergraph and Maximum Common Subraph			Type	Conference Article
	Year	2009	Publication	4th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	5524	Issue		Pages	346–353
	Keywords
	Abstract	Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present a new genetic algorithm for the median graph computation. A set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity, show that we obtain good approximations of the median graph. Finally, we use the median graph in a real nearest neighbour classification showing that it leaves the box of the only-theoretical concepts and demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs.
	Address	Póvoa de Varzim, Portugal
	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-02171-8	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ FVS2009c			Serial	1174
Permanent link to this record



	Author	Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; Horst Bunke
	Title	A Recursive Embedding Approach to Median Graph Computation			Type	Conference Article
	Year	2009	Publication	7th IAPR – TC–15 Workshop on Graph–Based Representations in Pattern Recognition	Abbreviated Journal
	Volume	5534	Issue		Pages	113–123
	Keywords
	Abstract	The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.
	Address	Venice, Italy
	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-02123-7	Medium
	Area		Expedition		Conference	GBR
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ FKV2009			Serial	1173
Permanent link to this record



	Author	Mikhail Mozerov; Ariel Amato; Xavier Roca; Jordi Gonzalez
	Title	Solving the Multi Object Occlusion Problem in a Multiple Camera Tracking System			Type	Journal
	Year	2009	Publication	Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	19	Issue	1	Pages	165-171
	Keywords
	Abstract	An efficient method to overcome adverse effects of occlusion upon object tracking is presented. The method is based on matching paths of objects in time and solves a complex occlusion-caused problem of merging separate segments of the same path.
	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	1054-6618	ISBN		Medium
	Area		Expedition		Conference
	Notes	ISE			Approved	no
	Call Number	ISE @ ise @ MAR2009a			Serial	1160
Permanent link to this record



	Author	Mikhail Mozerov; Ariel Amato; Xavier Roca
	Title	Occlusion Handling in Trinocular Stereo using Composite Disparity Space Image			Type	Conference Article
	Year	2009	Publication	19th International Conference on Computer Graphics and Vision	Abbreviated Journal
	Volume		Issue		Pages	69–73
	Keywords
	Abstract	In this paper we propose a method that smartly improves occlusion handling in stereo matching using trinocular stereo. The main idea is based on the assumption that any occluded region in a matched stereo pair (middle-left images) in general is not occluded in the opposite matched pair (middle-right images). Then two disparity space images (DSI) can be merged in one composite DSI. The proposed integration differs from the known approach that uses a cumulative cost. A dense disparity map is obtained with a global optimization algorithm using the proposed composite DSI. The experimental results are evaluated on the Middlebury data set, showing high performance of the proposed algorithm especially in the occluded regions. One of the top positions in the rank of the Middlebury website confirms the performance of our method to be competitive with the best stereo matching.
	Address	Moscow (Russia)
	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-5-317-02975-3	Medium
	Area		Expedition		Conference	GRAPHICON
	Notes	ISE			Approved	no
	Call Number	ISE @ ise @ MAR2009b			Serial	1207
Permanent link to this record



	Author	Mehdi Mirza-Mohammadi; Sergio Escalera; Petia Radeva
	Title	Contextual-Guided Bag-of-Visual-Words Model for Multi-class Object Categorization			Type	Conference Article
	Year	2009	Publication	13th International Conference on Computer Analysis of Images and Patterns	Abbreviated Journal
	Volume	5702	Issue		Pages	748–756
	Keywords
	Abstract	Bag-of-words model (BOW) is inspired by the text classification problem, where a document is represented by an unsorted set of contained words. Analogously, in the object categorization problem, an image is represented by an unsorted set of discrete visual words (BOVW). In these models, relations among visual words are performed after dictionary construction. However, close object regions can have far descriptions in the feature space, being grouped as different visual words. In this paper, we present a method for considering geometrical information of visual words in the dictionary construction step. Object interest regions are obtained by means of the Harris-Affine detector and then described using the SIFT descriptor. Afterward, a contextual-space and a feature-space are defined, and a merging process is used to fuse feature words based on their proximity in the contextual-space. Moreover, we use the Error Correcting Output Codes framework to learn the new dictionary in order to perform multi-class classification. Results show significant classification improvements when spatial information is taken into account in the dictionary construction step.
	Address
	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-03766-5	Medium
	Area		Expedition		Conference	CAIP
	Notes	HuPBA; MILAB			Approved	no
	Call Number	BCNPCL @ bcnpcl @ MEP2009			Serial	1185
Permanent link to this record



	Author	Mathieu Nicolas Delalandre; Jean-Yves Ramel; Ernest Valveny; Muhammad Muzzamil Luqman
	Title	A Performance Characterization Algorithm for Symbol Localization			Type	Conference Article
	Year	2009	Publication	8th IAPR International Workshop on Graphics Recognition	Abbreviated Journal
	Volume		Issue		Pages	3-11
	Keywords
	Abstract	In this paper we present an algorithm for performance characterization of symbol localization systems. This algorithm is aimed to be a more “reliable” and “open” solution to characterize the performance. To achieve that, it exploits only single points as the result of localization and offers the possibility to reconsider the localization results provided by a system. We use the information about context in groundtruth, and overall localization results, to detect the ambiguous localization results. A probability score is computed for each matching between a localization point and a groundtruth region, depending on the spatial distribution of the other regions in the groundtruth. Final characterization is given with detection rate/probability score plots, describing the sets of possible interpretations of the localization results, according to a given confidence rate. We present experimentation details along with the results for the symbol localization system of [1], exploiting a synthetic dataset of architectural floorplans and electrical diagrams (composed of 200 images and 3861 symbols).
	Address	La Rochelle; July 2009
	Corporate Author				Thesis
	Publisher	Springer	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	GREC
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ DRV2009			Serial	1443
Permanent link to this record



	Author	Maria Salamo; Sergio Escalera; Petia Radeva
	Title	Quality Enhancement based on Reinforcement Learning and Feature Weighting for a Critiquing-Based Recommender			Type	Conference Article
	Year	2009	Publication	8th International Conference on Case-Based Reasoning	Abbreviated Journal
	Volume	5650	Issue		Pages	298–312
	Keywords
	Abstract	Personalizing the product recommendation task is a major focus of research in the area of conversational recommender systems. Conversational case-based recommender systems help users to navigate through product spaces, alternatively making product suggestions and eliciting users feedback. Critiquing is a common form of feedback and incremental critiquing-based recommender system has shown its efficiency to personalize products based primarily on a quality measure. This quality measure influences the recommendation process and it is obtained by the combination of compatibility and similarity scores. In this paper, we describe new compatibility strategies whose basis is on reinforcement learning and a new feature weighting technique which is based on the user’s history of critiques. Moreover, we show that our methodology can significantly improve recommendation efficiency in comparison with the state-of-the-art approaches.
	Address	Seattle, USA
	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-02998-1	Medium
	Area		Expedition		Conference	ICCBR
	Notes	HuPBA; MILAB			Approved	no
	Call Number	BCNPCL @ bcnpcl @ SER2009			Serial	1187
Permanent link to this record



	Author	Marco Pedersoli; Jordi Gonzalez; Juan J. Villanueva
	Title	High-Speed Human Detection Using a Multiresolution Cascade of Histograms of Oriented Gradients			Type	Conference Article
	Year	2009	Publication	4th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	5524	Issue		Pages
	Keywords
	Abstract	This paper presents a new method for human detection based on a multiresolution cascade of Histograms of Oriented Gradients (HOG) that can highly reduce the computational cost of the detection search without affecting accuracy. The method consists of a cascade of sliding window detectors. Each detector is a Support Vector Machine (SVM) composed by features at different resolution, from coarse for the first level to fine for the last one. Considering that the spatial stride of the sliding window search is affected by the HOG features size, unlike previous methods based on Adaboost cascades, we can adopt a spatial stride inversely proportional to the features resolution. This produces that the speed-up of the cascade is not only due to the low number of features that need to be computed in the first levels, but also to the lower number of detection windows that needs to be evaluated. Experimental results shows that our method permits a detection rate comparable with the state of the art, but at the same time a gain in the speed of the detection search of 10-20 times depending on the cascade configuration.
	Address	Póvoa de Varzim, Portugal
	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-02171-8	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	ISE			Approved	no
	Call Number	ISE @ ise @ PGV2009			Serial	1214
Permanent link to this record



	Author	Marçal Rusiñol; K. Bertet; Jean-Marc Ogier; Josep Llados
	Title	Symbol Recognition Using a Concept Lattice of Graphical Patterns			Type	Conference Article
	Year	2009	Publication	8th IAPR International Workshop on Graphics Recognition	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	In this paper we propose a new approach to recognize symbols by the use of a concept lattice. We propose to build a concept lattice in terms of graphical patterns. Each model symbol is decomposed in a set of composing graphical patterns taken as primitives. Each one of these primitives is described by boundary moment invariants. The obtained concept lattice relates which symbolic patterns compose a given graphical symbol. A Hasse diagram is derived from the context and is used to recognize symbols affected by noise. We present some preliminary results over a variation of the dataset of symbols from the GREC 2005 symbol recognition contest.
	Address	La Rochelle; July 2009
	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	GREC
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ RBO2009			Serial	1444
Permanent link to this record