| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–12] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Anjan Dutta; Josep Llados; Horst Bunke; Umapada Pal | ||||
| Title | Near Convex Region Adjacency Graph and Approximate Neighborhood String Matching for Symbol Spotting in Graphical Documents | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1078-1082 | ||
Keywords  |
|||||
| Abstract | This paper deals with a subgraph matching problem in Region Adjacency Graph (RAG) applied to symbol spotting in graphical documents. RAG is a very important, efficient and natural way of representing graphical information with a graph but this is limited to cases where the information is well defined with perfectly delineated regions. What if the information we are interested in is not confined within well defined regions? This paper addresses this particular problem and solves it by defining near convex grouping of oriented line segments which results in near convex regions. Pure convexity imposes hard constraints and can not handle all the cases efficiently. Hence to solve this problem we have defined a new type of convexity of regions, which allows convex regions to have concavity to some extend. We call this kind of regions Near Convex Regions (NCRs). These NCRs are then used to create the Near Convex Region Adjacency Graph (NCRAG) and with this representation we have formulated the problem of symbol spotting in graphical documents as a subgraph matching problem. For subgraph matching we have used the Approximate Edit Distance Algorithm (AEDA) on the neighborhood string, which starts working after finding a key node in the input or target graph and iteratively identifies similar nodes of the query graph in the neighborhood of the key node. The experiments are performed on artificial, real and distorted datasets. | ||||
| Address | Washington; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.045; 600.056; 600.061; 601.152 | Approved | no | ||
| Call Number | Admin @ si @ DLB2013a | Serial | 2358 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Josep Llados; Horst Bunke; Umapada Pal | ||||
| Title | A Product graph based method for dual subgraph matching applied to symbol spotting | Type | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords |
|||||
| Abstract | Product graph has been shown to be an efficient way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. This paper focuses on the two major limitations of the previous version of product graph: (1) Spurious nodes and edges in the graph representation and (2) Inefficient node and edge attributes. To deal with noisy information of vectorized graphical documents, we consider a dual graph representation on the original graph representing the graphical information and the product graph is computed between the dual graphs of the query graphs and the input graph.
The dual graph with redundant edges is helpful for efficient and tolerating encoding of the structural information of the graphical documents. The adjacency matrix of the product graph locates similar path information of two graphs and exponentiating the adjacency matrix finds similar paths of greater lengths. Nodes joining similar paths between two graphs are found by combining different exponentials of adjacency matrices. An experimental investigation reveals that the recall obtained by this approach is quite encouraging. |
||||
| Address | Bethlehem; PA; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | GREC | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ DLB2013b | Serial | 2359 | ||
| Permanent link to this record | |||||
| Author | Kaida Xiao; Chenyang Fu; D.Mylonas; Dimosthenis Karatzas; S. Wuerger | ||||
| Title | Unique Hue Data for Colour Appearance Models. Part ii: Chromatic Adaptation Transform | Type | Journal Article | ||
| Year | 2013 | Publication | Color Research & Application | Abbreviated Journal | CRA |
| Volume | 38 | Issue | 1 | Pages | 22-29 |
| Keywords |
|||||
| Abstract | Unique hue settings of 185 observers under three room-lighting conditions were used to evaluate the accuracy of full and mixed chromatic adaptation transform models of CIECAM02 in terms of unique hue reproduction. Perceptual hue shifts in CIECAM02 were evaluated for both models with no clear difference using the current Commission Internationale de l'Éclairage (CIE) recommendation for mixed chromatic adaptation ratio. Using our large dataset of unique hue data as a benchmark, an optimised parameter is proposed for chromatic adaptation under mixed illumination conditions that produces more accurate results in unique hue reproduction. © 2011 Wiley Periodicals, Inc. Col Res Appl, 2013 | ||||
| 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 | Admin @ si @ XFM2013 | Serial | 1822 | ||
| Permanent link to this record | |||||
| Author | S.Grau; Ana Puig; Sergio Escalera; Maria Salamo | ||||
| Title | Intelligent Interactive Volume Classification | Type | Conference Article | ||
| Year | 2013 | Publication | Pacific Graphics | Abbreviated Journal | |
| Volume | 32 | Issue | 7 | Pages | 23-28 |
| Keywords |
|||||
| Abstract | This paper defines an intelligent and interactive framework to classify multiple regions of interest from the original data on demand, without requiring any preprocessing or previous segmentation. The proposed intelligent and interactive approach is divided in three stages: visualize, training and testing. First, users visualize and label some samples directly on slices of the volume. Training and testing are based on a framework of Error Correcting Output Codes and Adaboost classifiers that learn to classify each region the user has painted. Later, at the testing stage, each classifier is directly applied on the rest of samples and combined to perform multi-class labeling, being used in the final rendering. We also parallelized the training stage using a GPU-based implementation for
obtaining a rapid interaction and classification. |
||||
| 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 | 978-3-905674-50-7 | Medium | ||
| Area | Expedition | Conference | PG | ||
| Notes | HuPBA; 600.046;MILAB | Approved | no | ||
| Call Number | Admin @ si @ GPE2013b | Serial | 2355 | ||
| Permanent link to this record | |||||
| Author | M. Visani; V.C.Kieu; Alicia Fornes; N.Journet | ||||
| Title | The ICDAR 2013 Music Scores Competition: Staff Removal | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1439-1443 | ||
| Keywords |
|||||
| Abstract | The first competition on music scores that was organized at ICDAR in 2011 awoke the interest of researchers, who participated both at staff removal and writer identification tasks. In this second edition, we focus on the staff removal task and simulate a real case scenario: old music scores. For this purpose, we have generated a new set of images using two kinds of degradations: local noise and 3D distortions. This paper describes the dataset, distortion methods, evaluation metrics, the participant's methods and the obtained results. | ||||
| Address | Washington; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.045; 600.061 | Approved | no | ||
| Call Number | Admin @ si @ VKF2013 | Serial | 2338 | ||
| Permanent link to this record | |||||
| Author | Patricia Marquez; Debora Gil; Aura Hernandez-Sabate | ||||
| Title | Evaluation of the Capabilities of Confidence Measures for Assessing Optical Flow Quality | Type | Conference Article | ||
| Year | 2013 | Publication | ICCV Workshop on Computer Vision in Vehicle Technology: From Earth to Mars | Abbreviated Journal | |
| Volume | Issue | Pages | 624-631 | ||
| Keywords |
|||||
| Abstract | Assessing Optical Flow (OF) quality is essential for its further use in reliable decision support systems. The absence of ground truth in such situations leads to the computation of OF Confidence Measures (CM) obtained from either input or output data. A fair comparison across the capabilities of the different CM for bounding OF error is required in order to choose the best OF-CM pair for discarding points where OF computation is not reliable. This paper presents a statistical probabilistic framework for assessing the quality of a given CM. Our quality measure is given in terms of the percentage of pixels whose OF error bound can not be determined by CM values. We also provide statistical tools for the computation of CM values that ensures a given accuracy of the flow field. | ||||
| Address | Sydney; Australia; December 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | CVTT:E2M | ||
| Notes | IAM; ADAS; 600.044; 600.057; 601.145 | Approved | no | ||
| Call Number | Admin @ si @ MGH2013b | Serial | 2351 | ||
| Permanent link to this record | |||||
| Author | Francesco Ciompi; Rui Hua; Simone Balocco; Marina Alberti; Oriol Pujol; Carles Caus; J. Mauri; Petia Radeva | ||||
| Title | Learning to Detect Stent Struts in Intravascular Ultrasound | Type | Conference Article | ||
| Year | 2013 | Publication | 6th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 7887 | Issue | Pages | 575-583 | |
| Keywords |
|||||
| Abstract | In this paper we tackle the automatic detection of struts elements (metallic braces of a stent device) in Intravascular Ultrasound (IVUS) sequences. The proposed method is based on context-aware classification of IVUS images, where we use Multi-Class Multi-Scale Stacked Sequential Learning (M2SSL). Additionally, we introduce a novel technique to reduce the amount of required contextual features. The comparison with binary and multi-class learning is also performed, using a dataset of IVUS images with struts manually annotated by an expert. The best performing configuration reaches a F-measure F = 63.97% . | ||||
| Address | Madeira; Portugal; June 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-38627-5 | Medium | |
| Area | Expedition | Conference | IbPRIA | ||
| Notes | MILAB; HuPBA; 605.203; 600.046 | Approved | no | ||
| Call Number | Admin @ si @ CHB2013 | Serial | 2349 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; V. Poulain d'Andecy; Dimosthenis Karatzas; Josep Llados | ||||
| Title | Classification of Administrative Document Images by Logo Identification | Type | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords |
|||||
| Abstract | This paper is focused on the categorization of administrative document images (such as invoices) based on the recognition of the supplier's graphical logo. Two different methods are proposed, the first one uses a bag-of-visual-words model whereas the second one tries to locate logo images described by the blurred shape model descriptor within documents by a sliding-window technique. Preliminar results are reported with a dataset of real administrative documents. | ||||
| Address | Bethlehem; PA; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | GREC | ||
| Notes | DAG; 600.056; 600.045; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ | Serial | 2348 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Dimosthenis Karatzas; Josep Llados | ||||
| Title | Spotting Graphical Symbols in Camera-Acquired Documents in Real Time | Type | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords |
|||||
| Abstract | In this paper we present a system devoted to spot graphical symbols in camera-acquired document images. The system is based on the extraction and further matching of ORB compact local features computed over interest key-points. Then, the FLANN indexing framework based on approximate nearest neighbor search allows to efficiently match local descriptors between the captured scene and the graphical models. Finally, the RANSAC algorithm is used in order to compute the homography between the spotted symbol and its appearance in the document image. The proposed approach is efficient and is able to work in real time. | ||||
| Address | Bethlehem; PA; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | GREC | ||
| Notes | DAG; 600.045; 600.055; 600.061; 602.101 | Approved | no | ||
| Call Number | Admin @ si @ RKL2013 | Serial | 2347 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; T.Benkhelfallah; V. Poulain d'Andecy | ||||
| Title | Field Extraction from Administrative Documents by Incremental Structural Templates | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1100 - 1104 | ||
| Keywords |
|||||
| Abstract | In this paper we present an incremental framework aimed at extracting field information from administrative document images in the context of a Digital Mail-room scenario. Given a single training sample in which the user has marked which fields have to be extracted from a particular document class, a document model representing structural relationships among words is built. This model is incrementally refined as the system processes more and more documents from the same class. A reformulation of the tf-idf statistic scheme allows to adjust the importance weights of the structural relationships among words. We report in the experimental section our results obtained with a large dataset of real invoices. | ||||
| Address | Washington; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.56; 600.045; 605.203; 602.101 | Approved | no | ||
| Call Number | Admin @ si @ RBP2013 | Serial | 2346 | ||
| Permanent link to this record | |||||
| Author | Albert Gordo; Marçal Rusiñol; Dimosthenis Karatzas; Andrew Bagdanov | ||||
| Title | Document Classification and Page Stream Segmentation for Digital Mailroom Applications | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 621-625 | ||
| Keywords |
|||||
| Abstract | In this paper we present a method for the segmentation of continuous page streams into multipage documents and the simultaneous classification of the resulting documents. We first present an approach to combine the multiple pages of a document into a single feature vector that represents the whole document. Despite its simplicity and low computational cost, the proposed representation yields results comparable to more complex methods in multipage document classification tasks. We then exploit this representation in the context of page stream segmentation. The most plausible segmentation of a page stream into a sequence of multipage documents is obtained by optimizing a statistical model that represents the probability of each segmented multipage document belonging to a particular class. Experimental results are reported on a large sample of real administrative multipage documents. | ||||
| Address | Washington; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.056; 602.101 | Approved | no | ||
| Call Number | Admin @ si @ GRK2013c | Serial | 2345 | ||
| Permanent link to this record | |||||
| Author | L. Rothacker; Marçal Rusiñol; G.A. Fink | ||||
| Title | Bag-of-Features HMMs for segmentation-free word spotting in handwritten documents | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1305 - 1309 | ||
| Keywords |
|||||
| Abstract | Recent HMM-based approaches to handwritten word spotting require large amounts of learning samples and mostly rely on a prior segmentation of the document. We propose to use Bag-of-Features HMMs in a patch-based segmentation-free framework that are estimated by a single sample. Bag-of-Features HMMs use statistics of local image feature representatives. Therefore they can be considered as a variant of discrete HMMs allowing to model the observation of a number of features at a point in time. The discrete nature enables us to estimate a query model with only a single example of the query provided by the user. This makes our method very flexible with respect to the availability of training data. Furthermore, we are able to outperform state-of-the-art results on the George Washington dataset. | ||||
| Address | Washington; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ RRF2013 | Serial | 2344 | ||
| Permanent link to this record | |||||
| Author | Ernest Valveny; Oriol Ramos Terrades; Joan Mas; Marçal Rusiñol | ||||
| Title | Interactive Document Retrieval and Classification. | Type | Book Chapter | ||
| Year | 2013 | Publication | Multimodal Interaction in Image and Video Applications | Abbreviated Journal | |
| Volume | 48 | Issue | Pages | 17-30 | |
| Keywords |
|||||
| Abstract | In this chapter we describe a system for document retrieval and classification following the interactive-predictive framework. In particular, the system addresses two different scenarios of document analysis: document classification based on visual appearance and logo detection. These two classical problems of document analysis are formulated following the interactive-predictive model, taking the user interaction into account to make easier the process of annotating and labelling the documents. A system implementing this model in a real scenario is presented and analyzed. This system also takes advantage of active learning techniques to speed up the task of labelling the documents. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | Angel Sappa; Jordi Vitria | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1868-4394 | ISBN | 978-3-642-35931-6 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ VRM2013 | Serial | 2341 | ||
| Permanent link to this record | |||||
| Author | Thanh Ha Do; Salvatore Tabbone; Oriol Ramos Terrades | ||||
| Title | New Approach for Symbol Recognition Combining Shape Context of Interest Points with Sparse Representation | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 265-269 | ||
| Keywords |
|||||
| Abstract | In this paper, we propose a new approach for symbol description. Our method is built based on the combination of shape context of interest points descriptor and sparse representation. More specifically, we first learn a dictionary describing shape context of interest point descriptors. Then, based on information retrieval techniques, we build a vector model for each symbol based on its sparse representation in a visual vocabulary whose visual words are columns in the learneddictionary. The retrieval task is performed by ranking symbols based on similarity between vector models. Evaluation of our method, using benchmark datasets, demonstrates the validity of our approach and shows that it outperforms related state-of-theart methods. | ||||
| Address | Washington; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ DTR2013b | Serial | 2331 | ||
| Permanent link to this record | |||||
| Author | Jon Almazan; Albert Gordo; Alicia Fornes; Ernest Valveny | ||||
| Title | Handwritten Word Spotting with Corrected Attributes | Type | Conference Article | ||
| Year | 2013 | Publication | 15th IEEE International Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | 1017-1024 | ||
| Keywords |
|||||
| Abstract | We propose an approach to multi-writer word spotting, where the goal is to find a query word in a dataset comprised of document images. We propose an attributes-based approach that leads to a low-dimensional, fixed-length representation of the word images that is fast to compute and, especially, fast to compare. This approach naturally leads to an unified representation of word images and strings, which seamlessly allows one to indistinctly perform query-by-example, where the query is an image, and query-by-string, where the query is a string. We also propose a calibration scheme to correct the attributes scores based on Canonical Correlation Analysis that greatly improves the results on a challenging dataset. We test our approach on two public datasets showing state-of-the-art results. | ||||
| Address | Sydney; Australia; December 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1550-5499 | ISBN | Medium | ||
| Area | Expedition | Conference | ICCV | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ AGF2013 | Serial | 2327 | ||
| Permanent link to this record | |||||