Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	46–60 of 1420 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–20]

List View

Citations

Details

	Records
	Author	Andreas Fischer; Ching Y. Suen; Volkmar Frinken; Kaspar Riesen; Horst Bunke
	Title	A Fast Matching Algorithm for Graph-Based Handwriting Recognition			Type	Conference Article
	Year	2013	Publication	9th IAPR – TC15 Workshop on Graph-based Representation in Pattern Recognition	Abbreviated Journal
	Volume	7877	Issue		Pages	194-203
	Keywords
	Abstract	The recognition of unconstrained handwriting images is usually based on vectorial representation and statistical classification. Despite their high representational power, graphs are rarely used in this field due to a lack of efficient graph-based recognition methods. Recently, graph similarity features have been proposed to bridge the gap between structural representation and statistical classification by means of vector space embedding. This approach has shown a high performance in terms of accuracy but had shortcomings in terms of computational speed. The time complexity of the Hungarian algorithm that is used to approximate the edit distance between two handwriting graphs is demanding for a real-world scenario. In this paper, we propose a faster graph matching algorithm which is derived from the Hausdorff distance. On the historical Parzival database it is demonstrated that the proposed method achieves a speedup factor of 12.9 without significant loss in recognition accuracy.
	Address	Vienna; Austria; May 2013
	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-38220-8	Medium
	Area		Expedition		Conference	GBR
	Notes	DAG; 600.045; 605.203			Approved	no
	Call Number	Admin @ si @ FSF2013			Serial	2294
Permanent link to this record



	Author	Jose Carlos Rubio; Joan Serrat; Antonio Lopez
	Title	Video Co-segmentation			Type	Conference Article
	Year	2012	Publication	11th Asian Conference on Computer Vision	Abbreviated Journal
	Volume	7725	Issue		Pages	13-24
	Keywords
	Abstract	Segmentation of a single image is in general a highly underconstrained problem. A frequent approach to solve it is to somehow provide prior knowledge or constraints on how the objects of interest look like (in terms of their shape, size, color, location or structure). Image co-segmentation trades the need for such knowledge for something much easier to obtain, namely, additional images showing the object from other viewpoints. Now the segmentation problem is posed as one of differentiating the similar object regions in all the images from the more varying background. In this paper, for the first time, we extend this approach to video segmentation: given two or more video sequences showing the same object (or objects belonging to the same class) moving in a similar manner, we aim to outline its region in all the frames. In addition, the method works in an unsupervised manner, by learning to segment at testing time. We compare favorably with two state-of-the-art methods on video segmentation and report results on benchmark videos.
	Address	Daejeon, Korea
	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-37443-2	Medium
	Area		Expedition		Conference	ACCV
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RSL2012d			Serial	2153
Permanent link to this record



	Author	Ferran Poveda; Debora Gil;Enric Marti
	Title	Multi-resolution DT-MRI cardiac tractography			Type	Conference Article
	Year	2012	Publication	Statistical Atlases And Computational Models Of The Heart: Imaging and Modelling Challenges	Abbreviated Journal
	Volume	7746	Issue		Pages	270-277
	Keywords
	Abstract	Even using objective measures from DT-MRI no consensus about myocardial architecture has been achieved so far. Streamlining provides good reconstructions at low level of detail, but falls short to give global abstract interpretations. In this paper, we present a multi-resolution methodology that is able to produce simplified representations of cardiac architecture. Our approach produces a reduced set of tracts that are representative of the main geometric features of myocardial anatomical structure. Experiments show that fiber geometry is preserved along reductions, which validates the simplified model for interpretation of cardiac architecture.
	Address	Nice, France
	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-36960-5	Medium
	Area		Expedition		Conference	STACOM
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ PGM2012			Serial	1986
Permanent link to this record



	Author	Debora Gil;Agnes Borras;Ruth Aris;Mariano Vazquez;Pierre Lafortune; Guillame Houzeaux
	Title	What a difference in biomechanics cardiac fiber makes			Type	Conference Article
	Year	2012	Publication	Statistical Atlases And Computational Models Of The Heart: Imaging and Modelling Challenges	Abbreviated Journal
	Volume	7746	Issue		Pages	253-260
	Keywords
	Abstract	Computational simulations of the heart are a powerful tool for a comprehensive understanding of cardiac function and its intrinsic relationship with its muscular architecture. Cardiac biomechanical models require a vector field representing the orientation of cardiac fibers. A wrong orientation of the fibers can lead to a non-realistic simulation of the heart functionality. In this paper we explore the impact of the fiber information on the simulated biomechanics of cardiac muscular anatomy. We have used the John Hopkins database to perform a biomechanical simulation using both a synthetic benchmark fiber distribution and the data obtained experimentally from DTI. Results illustrate how differences in fiber orientation affect heart deformation along cardiac cycle.
	Address	Nice, France
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-36960-5	Medium
	Area		Expedition		Conference	STACOM
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ GBA2012			Serial	1987
Permanent link to this record



	Author	Simeon Petkov; Adriana Romero; Xavier Carrillo; Petia Radeva; Carlo Gatta
	Title	Robust and accurate diaphragm border detection in cardiac X-Ray angiographies			Type	Conference Article
	Year	2012	Publication	Statistical Atlases And Computational Models Of The Heart: Imaging and Modelling Challenges	Abbreviated Journal
	Volume	7746	Issue		Pages	225-234
	Keywords
	Abstract	Workshop STACOM, dins del MICCAI X-ray angiography is the most common imaging modality employed in the diagnosis of coronary diseases prior to or during a catheter-based intervention. The analysis of the patient X-Ray sequence can provide useful information about the degree of arterial stenosis, the myocardial perfusion and other clinical parameters. If the sequence has been acquired to evaluate the perfusion grade, the opacity due to the diaphragm could potentially hinder any kind of visual inspection and make more difficult a computer aided measurements. In this paper we propose an accurate and robust method to automatically identify the diaphragm border in each frame. Quantitative evaluation on a set of 11 sequences shows that the proposed algorithm outperforms previous methods.
	Address	Nice, France
	Corporate Author				Thesis
	Publisher		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-36960-5	Medium
	Area		Expedition		Conference	STACOM
	Notes	MILAB			Approved	no
	Call Number	Admin @ si @ PRC2012			Serial	2028
Permanent link to this record



	Author	Anjan Dutta; Josep Llados; Umapada Pal
	Title	Bag-of-GraphPaths Descriptors for Symbol Recognition and Spotting in Line Drawings			Type	Conference Article
	Year	2011	Publication	In proceedings of 9th IAPR Workshop on Graphic Recognition	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Graphical symbol recognition and spotting recently have become an important research activity. In this work we present a descriptor for symbols, especially for line drawings. The descriptor is based on the graph representation of graphical objects. We construct graphs from the vectorized information of the binarized images, where the critical points detected by the vectorization algorithm are considered as nodes and the lines joining them are considered as edges. Graph paths between two nodes in a graph are the finite sequences of nodes following the order from the starting to the final node. The occurrences of different graph paths in a given graph is an important feature, as they capture the geometrical and structural attributes of a graph. So the graph representing a symbol can efficiently be represent by the occurrences of its different paths. Their occurrences in a symbol can be obtained in terms of a histogram counting the number of some fixed prototype paths, we call the histogram as the Bag-of-GraphPaths (BOGP). These BOGP histograms are used as a descriptor to measure the distance among the symbols in vector space. We use the descriptor for three applications, they are: (1) classification of the graphical symbols, (2) spotting of the architectural symbols on floorplans, (3) classification of the historical handwritten words.
	Address	Seoul, Korea
	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-36823-3	Medium
	Area		Expedition		Conference	GREC
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ DLP2011c			Serial	1825
Permanent link to this record



	Author	Joost Van de Weijer; Fahad Shahbaz Khan
	Title	Fusing Color and Shape for Bag-of-Words Based Object Recognition			Type	Conference Article
	Year	2013	Publication	4th Computational Color Imaging Workshop	Abbreviated Journal
	Volume	7786	Issue		Pages	25-34
	Keywords	Object Recognition; color features; bag-of-words; image classification
	Abstract	In this article we provide an analysis of existing methods for the incorporation of color in bag-of-words based image representations. We propose a list of desired properties on which bases fusing methods can be compared. We discuss existing methods and indicate shortcomings of the two well-known fusing methods, namely early and late fusion. Several recent works have addressed these shortcomings by exploiting top-down information in the bag-of-words pipeline: color attention which is motivated from human vision, and Portmanteau vocabularies which are based on information theoretic compression of product vocabularies. We point out several remaining challenges in cue fusion and provide directions for future research.
	Address	Chiba; Japan; March 2013
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-36699-4	Medium
	Area		Expedition		Conference	CCIW
	Notes	CIC; 600.048			Approved	no
	Call Number	Admin @ si @ WeK2013			Serial	2283
Permanent link to this record



	Author	Karel Paleček; David Geronimo; Frederic Lerasle
	Title	Pre-attention cues for person detection			Type	Conference Article
	Year	2012	Publication	Cognitive Behavioural Systems, COST 2102 International Training School	Abbreviated Journal
	Volume		Issue		Pages	225-235
	Keywords
	Abstract	Current state-of-the-art person detectors have been proven reliable and achieve very good detection rates. However, the performance is often far from real time, which limits their use to low resolution images only. In this paper, we deal with candidate window generation problem for person detection, i.e. we want to reduce the computational complexity of a person detector by reducing the number of regions that has to be evaluated. We base our work on Alexe’s paper [1], which introduced several pre-attention cues for generic object detection. We evaluate these cues in the context of person detection and show that their performance degrades rapidly for scenes containing multiple objects of interest such as pictures from urban environment. We extend this set by new cues, which better suits our class-specific task. The cues are designed to be simple and efficient, so that they can be used in the pre-attention phase of a more complex sliding window based person detector.
	Address	Dresden, 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-34583-8	Medium
	Area		Expedition		Conference	COST-TS
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ PGL2012			Serial	2148
Permanent link to this record



	Author	Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados
	Title	Improving Fuzzy Multilevel Graph Embedding through Feature Selection Technique			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	243-253
	Keywords
	Abstract	Graphs are the most powerful, expressive and convenient data structures but there is a lack of efficient computational tools and algorithms for processing them. The embedding of graphs into numeric vector spaces permits them to access the state-of-the-art computational efficient statistical models and tools. In this paper we take forward our work on explicit graph embedding and present an improvement to our earlier proposed method, named “fuzzy multilevel graph embedding – FMGE”, through feature selection technique. FMGE achieves the embedding of attributed graphs into low dimensional vector spaces by performing a multilevel analysis of graphs and extracting a set of global, structural and elementary level features. Feature selection permits FMGE to select the subset of most discriminating features and to discard the confusing ones for underlying graph dataset. Experimental results for graph classification experimentation on IAM letter, GREC and fingerprint graph databases, show improvement in the performance of FMGE.
	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-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ LRL2012			Serial	2381
Permanent link to this record



	Author	Volkmar Frinken; Alicia Fornes; Josep Llados; Jean-Marc Ogier
	Title	Bidirectional Language Model for Handwriting Recognition			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	611-619
	Keywords
	Abstract	In order to improve the results of automatically recognized handwritten text, information about the language is commonly included in the recognition process. A common approach is to represent a text line as a sequence. It is processed in one direction and the language information via n-grams is directly included in the decoding. This approach, however, only uses context on one side to estimate a word’s probability. Therefore, we propose a bidirectional recognition in this paper, using distinct forward and a backward language models. By combining decoding hypotheses from both directions, we achieve a significant increase in recognition accuracy for the off-line writer independent handwriting recognition task. Both language models are of the same type and can be estimated on the same corpus. Hence, the increase in recognition accuracy comes without any additional need for training data or language modeling complexity.
	Address	Japan
	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-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ FFL2012			Serial	2057
Permanent link to this record



	Author	Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados
	Title	Hierarchical graph representation for symbol spotting in graphical document images			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	529-538
	Keywords
	Abstract	Symbol spotting can be defined as locating given query symbol in a large collection of graphical documents. In this paper we present a hierarchical graph representation for symbols. This representation allows graph matching methods to deal with low-level vectorization errors and, thus, to perform a robust symbol spotting. To show the potential of this approach, we conduct an experiment with the SESYD dataset.
	Address	Miyajima-Itsukushima, Hiroshima
	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-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ BDJ2012			Serial	2126
Permanent link to this record



	Author	Jaume Gibert; Ernest Valveny; Horst Bunke; Alicia Fornes
	Title	On the Correlation of Graph Edit Distance and L1 Distance in the Attribute Statistics Embedding Space			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	135-143
	Keywords
	Abstract	Graph embeddings in vector spaces aim at assigning a pattern vector to every graph so that the problems of graph classification and clustering can be solved by using data processing algorithms originally developed for statistical feature vectors. An important requirement graph features should fulfil is that they reproduce as much as possible the properties among objects in the graph domain. In particular, it is usually desired that distances between pairs of graphs in the graph domain closely resemble those between their corresponding vectorial representations. In this work, we analyse relations between the edit distance in the graph domain and the L1 distance of the attribute statistics based embedding, for which good classification performance has been reported on various datasets. We show that there is actually a high correlation between the two kinds of distances provided that the corresponding parameter values that account for balancing the weight between node and edge based features are properly selected.
	Address
	Corporate Author				Thesis
	Publisher	Springer-Berlag, Berlin	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GVB2012c			Serial	2167
Permanent link to this record



	Author	Fadi Dornaika; A.Assoum; Bogdan Raducanu
	Title	Automatic Dimensionality Estimation for Manifold Learning through Optimal Feature Selection			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	575-583
	Keywords
	Abstract	A very important aspect in manifold learning is represented by automatic estimation of the intrinsic dimensionality. Unfortunately, this problem has received few attention in the literature of manifold learning. In this paper, we argue that feature selection paradigm can be used to the problem of automatic dimensionality estimation. Besides this, it also leads to improved recognition rates. Our approach for optimal feature selection is based on a Genetic Algorithm. As a case study for manifold learning, we have considered Laplacian Eigenmaps (LE) and Locally Linear Embedding (LLE). The effectiveness of the proposed framework was tested on the face recognition problem. Extensive experiments carried out on ORL, UMIST, Yale, and Extended Yale face data sets confirmed our hypothesis.
	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-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ DAR2012			Serial	2174
Permanent link to this record



	Author	Bogdan Raducanu; Fadi Dornaika
	Title	Out-of-Sample Embedding by Sparse Representation			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	336-344
	Keywords
	Abstract	A critical aspect of non-linear dimensionality reduction techniques is represented by the construction of the adjacency graph. The difficulty resides in finding the optimal parameters, a process which, in general, is heuristically driven. Recently, sparse representation has been proposed as a non-parametric solution to overcome this problem. In this paper, we demonstrate that this approach not only serves for the graph construction, but also represents an efficient and accurate alternative for out-of-sample embedding. Considering for a case study the Laplacian Eigenmaps, we applied our method to the face recognition problem. Experimental results conducted on some challenging datasets confirmed the robustness of our approach and its superiority when compared to existing techniques.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ RaD2012c			Serial	2175
Permanent link to this record



	Author	Patricia Marquez;Debora Gil;Aura Hernandez-Sabate
	Title	A Complete Confidence Framework for Optical Flow			Type	Conference Article
	Year	2012	Publication	12th European Conference on Computer Vision – Workshops and Demonstrations	Abbreviated Journal
	Volume	7584	Issue	2	Pages	124-133
	Keywords	Optical flow, confidence measures, sparsification plots, error prediction plots
	Abstract	Medial representations are powerful tools for describing and parameterizing the volumetric shape of anatomical structures. Existing methods show excellent results when applied to 2D objects, but their quality drops across dimensions. This paper contributes to the computation of medial manifolds in two aspects. First, we provide a standard scheme for the computation of medial manifolds that avoid degenerated medial axis segments; second, we introduce an energy based method which performs independently of the dimension. We evaluate quantitatively the performance of our method with respect to existing approaches, by applying them to synthetic shapes of known medial geometry. Finally, we show results on shape representation of multiple abdominal organs, exploring the use of medial manifolds for the representation of multi-organ relations.
	Address
	Corporate Author				Thesis
	Publisher	Springer-Verlag	Place of Publication	Florence, Italy, October 7-13, 2012	Editor	Andrea Fusiello, Vittorio Murino ,Rita Cucchiara
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-33867-0	Medium
	Area		Expedition		Conference	ECCVW
	Notes	IAM;ADAS;			Approved	no
	Call Number	IAM @ iam @ MGH2012b			Serial	1991
Permanent link to this record