Home | [1–10] << 11 12 >> |
Records | |||||
---|---|---|---|---|---|
Author | Mirko Arnold; Anarta Ghosh; Stephen Ameling; G Lacey | ||||
Title | Automatic segmentation and inpainting of specular highlights for endoscopic imaging | Type | Journal Article | ||
Year | 2010 | Publication | EURASIP Journal on Image and Video Processing | Abbreviated Journal | EURASIP JIVP |
Volume | 2010 | Issue | 9 | Pages | |
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 | 2423 | ||
Permanent link to this record | |||||
Author | Santiago Segui; Laura Igual; Jordi Vitria | ||||
Title | Weighted Bagging for Graph based One-Class Classifiers | Type | Conference Article | ||
Year | 2010 | Publication | 9th International Workshop on Multiple Classifier Systems | Abbreviated Journal | |
Volume | 5997 | Issue | Pages | 1-10 | |
Keywords | |||||
Abstract | Most conventional learning algorithms require both positive and negative training data for achieving accurate classification results. However, the problem of learning classifiers from only positive data arises in many applications where negative data are too costly, difficult to obtain, or not available at all. Minimum Spanning Tree Class Descriptor (MSTCD) was presented as a method that achieves better accuracies than other one-class classifiers in high dimensional data. However, the presence of outliers in the target class severely harms the performance of this classifier. In this paper we propose two bagging strategies for MSTCD that reduce the influence of outliers in training data. We show the improved performance on both real and artificially contaminated data. | ||||
Address | Cairo, Egypt | ||||
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-12126-5 | Medium | |
Area | Expedition | Conference | MCS | ||
Notes | MILAB;OR;MV | Approved | no | ||
Call Number | BCNPCL @ bcnpcl @ SIV2010 | Serial | 1284 | ||
Permanent link to this record | |||||
Author | Salim Jouili; Salvatore Tabbone; Ernest Valveny | ||||
Title | Comparing Graph Similarity Measures for Graphical Recognition | Type | Book Chapter | ||
Year | 2010 | Publication | Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers | Abbreviated Journal | |
Volume | 6020 | Issue | Pages | 37-48 | |
Keywords | |||||
Abstract | In this paper we evaluate four graph distance measures. The analysis is performed for document retrieval tasks. For this aim, different kind of documents are used including line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each graph distance measure depends on the kind of data and the graph representation technique. | ||||
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-13727-3 | Medium | |
Area | Expedition | Conference | GREC | ||
Notes | DAG | Approved | no | ||
Call Number | Admin @ si @ JTV2010 | Serial | 2404 | ||
Permanent link to this record | |||||
Author | Jean-Marc Ogier; Wenyin Liu; Josep Llados (eds) | ||||
Title | Graphics Recognition: Achievements, Challenges, and Evolution | Type | Book Whole | ||
Year | 2010 | Publication | 8th International Workshop GREC 2009. | Abbreviated Journal | |
Volume | 6020 | Issue | Pages | ||
Keywords | |||||
Abstract | |||||
Address | La Rochelle | ||||
Corporate Author | Thesis | ||||
Publisher | Springer Link | Place of Publication | Editor | Jean-Marc Ogier; Wenyin Liu; Josep Llados | |
Language | Summary Language | Original Title | |||
Series Editor | Series Title | Lecture Notes in Computer Science | Abbreviated Series Title | LNCS | |
Series Volume | Series Issue | Edition | |||
ISSN | ISBN | 978-3-642-13727-3 | Medium | ||
Area | Expedition | Conference | GREC | ||
Notes | DAG | Approved | no | ||
Call Number | Admin @ si @ OLL2010 | Serial | 1976 | ||
Permanent link to this record | |||||
Author | Joan Mas; Gemma Sanchez; Josep Llados | ||||
Title | SSP: Sketching slide Presentations, a Syntactic Approach | Type | Book Chapter | ||
Year | 2010 | Publication | Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers | Abbreviated Journal | |
Volume | 6020 | Issue | Pages | 118-129 | |
Keywords | |||||
Abstract | The design of a slide presentation is a creative process. In this process first, humans visualize in their minds what they want to explain. Then, they have to be able to represent this knowledge in an understandable way. There exists a lot of commercial software that allows to create our own slide presentations but the creativity of the user is rather limited. In this article we present an application that allows the user to create and visualize a slide presentation from a sketch. A slide may be seen as a graphical document or a diagram where its elements are placed in a particular spatial arrangement. To describe and recognize slides a syntactic approach is proposed. This approach is based on an Adjacency Grammar and a parsing methodology to cope with this kind of grammars. The experimental evaluation shows the performance of our methodology from a qualitative and a quantitative point of view. Six different slides containing different number of symbols, from 4 to 7, have been given to the users and they have drawn them without restrictions in the order of the elements. The quantitative results give an idea on how suitable is our methodology to describe and recognize the different elements in a slide. | ||||
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-13727-3 | Medium | |
Area | Expedition | Conference | GREC | ||
Notes | DAG | Approved | no | ||
Call Number | MSL2010 | Serial | 2405 | ||
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 | Book Chapter | ||
Year | 2010 | Publication | Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers | Abbreviated Journal | |
Volume | 6020 | Issue | Pages | 260–271 | |
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 | |||||
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-13727-3 | Medium | |
Area | Expedition | Conference | GREC | ||
Notes | DAG | Approved | no | ||
Call Number | Admin @ si @ DRV2010 | Serial | 2406 | ||
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 | Book Chapter | ||
Year | 2010 | Publication | Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers | Abbreviated Journal | |
Volume | 6020 | Issue | Pages | 187-198 | |
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 | |||||
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-13727-3 | Medium | |
Area | Expedition | Conference | |||
Notes | DAG | Approved | no | ||
Call Number | Admin @ si @ RBO2010 | Serial | 2407 | ||
Permanent link to this record | |||||
Author | Partha Pratim Roy; Umapada Pal; Josep Llados | ||||
Title | Touching Text Character Localization in Graphical Documents using SIFT | Type | Book Chapter | ||
Year | 2010 | Publication | Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers | Abbreviated Journal | |
Volume | 6020 | Issue | Pages | 199-211 | |
Keywords | Support Vector Machine; Text Component; Graphical Line; Document Image; Scale Invariant Feature Transform | ||||
Abstract | Interpretation of graphical document images is a challenging task as it requires proper understanding of text/graphics symbols present in such documents. Difficulties arise in graphical document recognition when text and symbol overlapped/touched. Intersection of text and symbols with graphical lines and curves occur frequently in graphical documents and hence separation of such symbols is very difficult.
Several pattern recognition and classification techniques exist to recognize isolated text/symbol. But, the touching/overlapping text and symbol recognition has not yet been dealt successfully. An interesting technique, Scale Invariant Feature Transform (SIFT), originally devised for object recognition can take care of overlapping problems. Even if SIFT features have emerged as a very powerful object descriptors, their employment in graphical documents context has not been investigated much. In this paper we present the adaptation of the SIFT approach in the context of text character localization (spotting) in graphical documents. We evaluate the applicability of this technique in such documents and discuss the scope of improvement by combining some state-of-the-art approaches. |
||||
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-13727-3 | Medium | |
Area | Expedition | Conference | |||
Notes | DAG | Approved | no | ||
Call Number | Admin @ si @ RPL2010c | Serial | 2408 | ||
Permanent link to this record | |||||
Author | Susana Alvarez; Anna Salvatella; Maria Vanrell; Xavier Otazu | ||||
Title | 3D Texton Spaces for color-texture retrieval | Type | Conference Article | ||
Year | 2010 | Publication | 7th International Conference on Image Analysis and Recognition | Abbreviated Journal | |
Volume | 6111 | Issue | Pages | 354–363 | |
Keywords | |||||
Abstract | Color and texture are visual cues of different nature, their integration in an useful visual descriptor is not an easy problem. One way to combine both features is to compute spatial texture descriptors independently on each color channel. Another way is to do the integration at the descriptor level. In this case the problem of normalizing both cues arises. In this paper we solve the latest problem by fusing color and texture through distances in texton spaces. Textons are the attributes of image blobs and they are responsible for texture discrimination as defined in Julesz’s Texton theory. We describe them in two low-dimensional and uniform spaces, namely, shape and color. The dissimilarity between color texture images is computed by combining the distances in these two spaces. Following this approach, we propose our TCD descriptor which outperforms current state of art methods in the two different approaches mentioned above, early combination with LBP and late combination with MPEG-7. This is done on an image retrieval experiment over a highly diverse texture dataset from Corel. | ||||
Address | |||||
Corporate Author | Thesis | ||||
Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | A.C. Campilho and M.S. Kamel | |
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-13771-6 | Medium | |
Area | Expedition | Conference | ICIAR | ||
Notes | CIC | Approved | no | ||
Call Number | CAT @ cat @ ASV2010a | Serial | 1325 | ||
Permanent link to this record | |||||
Author | Naveen Onkarappa; Angel Sappa | ||||
Title | On-Board Monocular Vision System Pose Estimation through a Dense Optical Flow | Type | Conference Article | ||
Year | 2010 | Publication | 7th International Conference on Image Analysis and Recognition | Abbreviated Journal | |
Volume | 6111 | Issue | Pages | 230-239 | |
Keywords | |||||
Abstract | This paper presents a robust technique for estimating on-board monocular vision system pose. The proposed approach is based on a dense optical flow that is robust against shadows, reflections and illumination changes. A RANSAC based scheme is used to cope with the outliers in the optical flow. The proposed technique is intended to be used in driver assistance systems for applications such as obstacle or pedestrian detection. Experimental results on different scenarios, both from synthetic and real sequences, shows usefulness of the proposed approach. | ||||
Address | Povoa 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-13771-6 | Medium | |
Area | Expedition | Conference | ICIAR | ||
Notes | ADAS | Approved | no | ||
Call Number | ADAS @ adas @ OnS2010 | Serial | 1342 | ||
Permanent link to this record | |||||
Author | Wenjuan Gong; Andrew Bagdanov; Xavier Roca; Jordi Gonzalez | ||||
Title | Automatic Key Pose Selection for 3D Human Action Recognition | Type | Conference Article | ||
Year | 2010 | Publication | 6th International Conference on Articulated Motion and Deformable Objects | Abbreviated Journal | |
Volume | 6169 | Issue | Pages | 290–299 | |
Keywords | |||||
Abstract | This article describes a novel approach to the modeling of human actions in 3D. The method we propose is based on a “bag of poses” model that represents human actions as histograms of key-pose occurrences over the course of a video sequence. Actions are first represented as 3D poses using a sequence of 36 direction cosines corresponding to the angles 12 joints form with the world coordinate frame in an articulated human body model. These pose representations are then projected to three-dimensional, action-specific principal eigenspaces which we refer to as aSpaces. We introduce a method for key-pose selection based on a local-motion energy optimization criterion and we show that this method is more stable and more resistant to noisy data than other key-poses selection criteria for action recognition. | ||||
Address | |||||
Corporate Author | Thesis | ||||
Publisher | Springer Verlag | 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-14060-0 | Medium | |
Area | Expedition | Conference | AMDO | ||
Notes | ISE | Approved | no | ||
Call Number | DAG @ dag @ GBR2010 | Serial | 1317 | ||
Permanent link to this record | |||||
Author | Jaume Gibert; Ernest Valveny | ||||
Title | Graph Embedding based on Nodes Attributes Representatives and a Graph of Words Representation. | Type | Conference Article | ||
Year | 2010 | Publication | 13th International worshop on structural and syntactic pattern recognition and 8th international worshop on statistical pattern recognition | Abbreviated Journal | |
Volume | 6218 | Issue | Pages | 223–232 | |
Keywords | |||||
Abstract | Although graph embedding has recently been used to extend statistical pattern recognition techniques to the graph domain, some existing embeddings are usually computationally expensive as they rely on classical graph-based operations. In this paper we present a new way to embed graphs into vector spaces by first encapsulating the information stored in the original graph under another graph representation by clustering the attributes of the graphs to be processed. This new representation makes the association of graphs to vectors an easy step by just arranging both node attributes and the adjacency matrix in the form of vectors. To test our method, we use two different databases of graphs whose nodes attributes are of different nature. A comparison with a reference method permits to show that this new embedding is better in terms of classification rates, while being much more faster. | ||||
Address | |||||
Corporate Author | Thesis | ||||
Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | In E.R. Hancock, R.C. Wilson, T. Windeatt, I. Ulusoy and F. Escolano, | |
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-14979-5 | Medium | |
Area | Expedition | Conference | S+SSPR | ||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ GiV2010 | Serial | 1416 | ||
Permanent link to this record | |||||
Author | Marco Pedersoli; Jordi Gonzalez; Andrew Bagdanov; Juan J. Villanueva | ||||
Title | Recursive Coarse-to-Fine Localization for fast Object Recognition | Type | Conference Article | ||
Year | 2010 | Publication | 11th European Conference on Computer Vision | Abbreviated Journal | |
Volume | 6313 | Issue | II | Pages | 280–293 |
Keywords | |||||
Abstract | Cascading techniques are commonly used to speed-up the scan of an image for object detection. However, cascades of detectors are slow to train due to the high number of detectors and corresponding thresholds to learn. Furthermore, they do not use any prior knowledge about the scene structure to decide where to focus the search. To handle these problems, we propose a new way to scan an image, where we couple a recursive coarse-to-fine refinement together with spatial constraints of the object location. For doing that we split an image into a set of uniformly distributed neighborhood regions, and for each of these we apply a local greedy search over feature resolutions. The neighborhood is defined as a scanning region that only one object can occupy. Therefore the best hypothesis is obtained as the location with maximum score and no thresholds are needed. We present an implementation of our method using a pyramid of HOG features and we evaluate it on two standard databases, VOC2007 and INRIA dataset. Results show that the Recursive Coarse-to-Fine Localization (RCFL) achieves a 12x speed-up compared to standard sliding windows. Compared with a cascade of multiple resolutions approach our method has slightly better performance in speed and Average-Precision. Furthermore, in contrast to cascading approach, the speed-up is independent of image conditions, the number of detected objects and clutter. | ||||
Address | Crete (Greece) | ||||
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-15566-6 | Medium | |
Area | Expedition | Conference | ECCV | ||
Notes | ISE | Approved | no | ||
Call Number | DAG @ dag @ PGB2010 | Serial | 1438 | ||
Permanent link to this record | |||||
Author | Carles Fernandez; Jordi Gonzalez; Xavier Roca | ||||
Title | Automatic Learning of Background Semantics in Generic Surveilled Scenes | Type | Conference Article | ||
Year | 2010 | Publication | 11th European Conference on Computer Vision | Abbreviated Journal | |
Volume | 6313 | Issue | II | Pages | 678–692 |
Keywords | |||||
Abstract | Advanced surveillance systems for behavior recognition in outdoor traffic scenes depend strongly on the particular configuration of the scenario. Scene-independent trajectory analysis techniques statistically infer semantics in locations where motion occurs, and such inferences are typically limited to abnormality. Thus, it is interesting to design contributions that automatically categorize more specific semantic regions. State-of-the-art approaches for unsupervised scene labeling exploit trajectory data to segment areas like sources, sinks, or waiting zones. Our method, in addition, incorporates scene-independent knowledge to assign more meaningful labels like crosswalks, sidewalks, or parking spaces. First, a spatiotemporal scene model is obtained from trajectory analysis. Subsequently, a so-called GI-MRF inference process reinforces spatial coherence, and incorporates taxonomy-guided smoothness constraints. Our method achieves automatic and effective labeling of conceptual regions in urban scenarios, and is robust to tracking errors. Experimental validation on 5 surveillance databases has been conducted to assess the generality and accuracy of the segmentations. The resulting scene models are used for model-based behavior analysis. | ||||
Address | Crete (Greece) | ||||
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-15551-2 | Medium | |
Area | Expedition | Conference | ECCV | ||
Notes | ISE | Approved | no | ||
Call Number | ISE @ ise @ FGR2010 | Serial | 1439 | ||
Permanent link to this record | |||||
Author | Jaume Garcia; Debora Gil; Aura Hernandez-Sabate | ||||
Title | Endowing Canonical Geometries to Cardiac Structures | Type | Book Chapter | ||
Year | 2010 | Publication | Statistical Atlases And Computational Models Of The Heart | Abbreviated Journal | |
Volume | 6364 | Issue | Pages | 124-133 | |
Keywords | |||||
Abstract | International conference on Cardiac electrophysiological simulation challenge
In this paper, we show that canonical (shape-based) geometries can be endowed to cardiac structures using tubular coordinates defined over their medial axis. We give an analytic formulation of these geometries by means of B-Splines. Since B-Splines present vector space structure PCA can be applied to their control points and statistical models relating boundaries and the interior of the anatomical structures can be derived. We demonstrate the applicability in two cardiac structures, the 3D Left Ventricular volume, and the 2D Left-Right ventricle set in 2D Short Axis view. |
||||
Address | |||||
Corporate Author | Thesis | ||||
Publisher | Springer Berlin / Heidelberg | Place of Publication | Editor | Camara, O.; Pop, M.; Rhode, K.; Sermesant, M.; Smith, N.; Young, A. | |
Language | Summary Language | Original Title | |||
Series Editor | Series Title | Lecture Notes in Computer Science | Abbreviated Series Title | LNCS | |
Series Volume | Series Issue | Edition | |||
ISSN | ISBN | Medium | |||
Area | Expedition | Conference | |||
Notes | IAM | Approved | no | ||
Call Number | IAM @ iam @ GGH2010b | Serial | 1515 | ||
Permanent link to this record |