| Records |
| Author |
Debora Gil; Antonio Esteban Lansaque; Agnes Borras; Carles Sanchez |
| Title |
Enhancing virtual bronchoscopy with intra-operative data using a multi-objective GAN |
Type |
Journal Article |
| Year |
2019 |
Publication |
International Journal of Computer Assisted Radiology and Surgery |
Abbreviated Journal |
IJCAR |
| Volume |
7 |
Issue |
1 |
Pages |
|
| Keywords |
|
Abstract  |
This manuscript has been withdrawn by bioRxiv due to upload of an incorrect version of the manuscript by the authors. Therefore, this manuscript should not be cited as reference for this project. |
| 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; 600.139; 600.145 |
Approved |
no |
| Call Number |
Admin @ si @ GEB2019 |
Serial |
3307 |
| Permanent link to this record |
| |
|
| |
| Author |
Henry Velesaca; Patricia Suarez; Raul Mira; Angel Sappa |
| Title |
Computer Vision based Food Grain Classification: a Comprehensive Survey |
Type |
Journal Article |
| Year |
2021 |
Publication |
Computers and Electronics in Agriculture |
Abbreviated Journal |
CEA |
| Volume |
187 |
Issue |
|
Pages |
106287 |
| Keywords |
|
| Abstract |
This manuscript presents a comprehensive survey on recent computer vision based food grain classification techniques. It includes state-of-the-art approaches intended for different grain varieties. The approaches proposed in the literature are analyzed according to the processing stages considered in the classification pipeline, making it easier to identify common techniques and comparisons. Additionally, the type of images considered by each approach (i.e., images from the: visible, infrared, multispectral, hyperspectral bands) together with the strategy used to generate ground truth data (i.e., real and synthetic images) are reviewed. Finally, conclusions highlighting future needs and challenges are presented. |
| 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 |
MSIAU; 600.130; 600.122 |
Approved |
no |
| Call Number |
Admin @ si @ VSM2021 |
Serial |
3576 |
| Permanent link to this record |
| |
|
| |
| Author |
Henry Velesaca; Gisel Bastidas-Guacho; Mohammad Rouhani; Angel Sappa |
| Title |
Multimodal image registration techniques: a comprehensive survey |
Type |
Journal Article |
| Year |
2024 |
Publication |
Multimedia Tools and Applications |
Abbreviated Journal |
MTAP |
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
This manuscript presents a review of state-of-the-art techniques proposed in the literature for multimodal image registration, addressing instances where images from different modalities need to be precisely aligned in the same reference system. This scenario arises when the images to be registered come from different modalities, among the visible and thermal spectral bands, 3D-RGB, or flash-no flash, or NIR-visible. The review spans different techniques from classical approaches to more modern ones based on deep learning, aiming to highlight the particularities required at each step in the registration pipeline when dealing with multimodal images. It is noteworthy that medical images are excluded from this review due to their specific characteristics, including the use of both active and passive sensors or the non-rigid nature of the body contained in the image. |
| 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 |
MSIAU |
Approved |
no |
| Call Number |
Admin @ si @ VBR2024 |
Serial |
3997 |
| Permanent link to this record |
| |
|
| |
| Author |
Antonio Clavelli; Dimosthenis Karatzas; Josep Llados; Mario Ferraro; Giuseppe Boccignone |
| Title |
Towards Modelling an Attention-Based Text Localization Process |
Type |
Conference Article |
| Year |
2013 |
Publication |
6th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
| Volume |
7887 |
Issue |
|
Pages |
296-303 |
| Keywords |
text localization; visual attention; eye guidance |
| Abstract |
This note introduces a visual attention model of text localization in real-world scenes. The core of the model built upon the proto-object concept is discussed. It is shown how such dynamic mid-level representation of the scene can be derived in the framework of an action-perception loop engaging salience, text information value computation, and eye guidance mechanisms.
Preliminary results that compare model generated scanpaths with those eye-tracked from human subjects are presented. |
| 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 |
LNCS |
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0302-9743 |
ISBN |
978-3-642-38627-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
IbPRIA |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ CKL2013 |
Serial |
2291 |
| Permanent link to this record |
| |
|
| |
| Author |
D. Jayagopi; Bogdan Raducanu; D. Gatica-Perez |
| Title |
Characterizing conversational group dynamics using nonverbal behaviour |
Type |
Conference Article |
| Year |
2009 |
Publication |
10th IEEE International Conference on Multimedia and Expo |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
370–373 |
| Keywords |
|
| Abstract |
This paper addresses the novel problem of characterizing conversational group dynamics. It is well documented in social psychology that depending on the objectives a group, the dynamics are different. For example, a competitive meeting has a different objective from that of a collaborative meeting. We propose a method to characterize group dynamics based on the joint description of a group members' aggregated acoustical nonverbal behaviour to classify two meeting datasets (one being cooperative-type and the other being competitive-type). We use 4.5 hours of real behavioural multi-party data and show that our methodology can achieve a classification rate of upto 100%. |
| Address |
New York, USA |
| 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 |
1945-7871 |
ISBN |
978-1-4244-4290-4 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICME |
| Notes |
OR;MV |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ JRG2009 |
Serial |
1217 |
| Permanent link to this record |
| |
|
| |
| Author |
Jasper Uilings; Koen E.A. van de Sande; Theo Gevers; Arnold Smeulders |
| Title |
Selective Search for Object Recognition |
Type |
Journal Article |
| Year |
2013 |
Publication |
International Journal of Computer Vision |
Abbreviated Journal |
IJCV |
| Volume |
104 |
Issue |
2 |
Pages |
154-171 |
| Keywords |
|
| Abstract |
This paper addresses the problem of generating possible object locations for use in object recognition. We introduce selective search which combines the strength of both an exhaustive search and segmentation. Like segmentation, we use the image structure to guide our sampling process. Like exhaustive search, we aim to capture all possible object locations. Instead of a single technique to generate possible object locations, we diversify our search and use a variety of complementary image partitionings to deal with as many image conditions as possible. Our selective search results in a small set of data-driven, class-independent, high quality locations, yielding 99 % recall and a Mean Average Best Overlap of 0.879 at 10,097 locations. The reduced number of locations compared to an exhaustive search enables the use of stronger machine learning techniques and stronger appearance models for object recognition. In this paper we show that our selective search enables the use of the powerful Bag-of-Words model for recognition. The selective search software is made publicly available (Software: http://disi.unitn.it/~uijlings/SelectiveSearch.html). |
| 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 |
0920-5691 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
ALTRES;ISE |
Approved |
no |
| Call Number |
Admin @ si @ USG2013 |
Serial |
2362 |
| Permanent link to this record |
| |
|
| |
| Author |
Yaxing Wang; Luis Herranz; Joost Van de Weijer |
| Title |
Mix and match networks: multi-domain alignment for unpaired image-to-image translation |
Type |
Journal Article |
| Year |
2020 |
Publication |
International Journal of Computer Vision |
Abbreviated Journal |
IJCV |
| Volume |
128 |
Issue |
|
Pages |
2849–2872 |
| Keywords |
|
| Abstract |
This paper addresses the problem of inferring unseen cross-modal image-to-image translations between multiple modalities. We assume that only some of the pairwise translations have been seen (i.e. trained) and infer the remaining unseen translations (where training pairs are not available). We propose mix and match networks, an approach where multiple encoders and decoders are aligned in such a way that the desired translation can be obtained by simply cascading the source encoder and the target decoder, even when they have not interacted during the training stage (i.e. unseen). The main challenge lies in the alignment of the latent representations at the bottlenecks of encoder-decoder pairs. We propose an architecture with several tools to encourage alignment, including autoencoders and robust side information and latent consistency losses. We show the benefits of our approach in terms of effectiveness and scalability compared with other pairwise image-to-image translation approaches. We also propose zero-pair cross-modal image translation, a challenging setting where the objective is inferring semantic segmentation from depth (and vice-versa) without explicit segmentation-depth pairs, and only from two (disjoint) segmentation-RGB and depth-RGB training sets. We observe that a certain part of the shared information between unseen modalities might not be reachable, so we further propose a variant that leverages pseudo-pairs which allows us to exploit this shared information between the unseen modalities |
| 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 |
LAMP; 600.109; 600.106; 600.141; 600.120 |
Approved |
no |
| Call Number |
Admin @ si @ WHW2020 |
Serial |
3424 |
| Permanent link to this record |
| |
|
| |
| Author |
Yunchao Gong; Svetlana Lazebnik; Albert Gordo; Florent Perronnin |
| Title |
Iterative quantization: A procrustean approach to learning binary codes for Large-Scale Image Retrieval |
Type |
Journal Article |
| Year |
2012 |
Publication |
IEEE Transactions on Pattern Analysis and Machine Intelligence |
Abbreviated Journal |
TPAMI |
| Volume |
35 |
Issue |
12 |
Pages |
2916-2929 |
| Keywords |
|
| Abstract |
This paper addresses the problem of learning similarity-preserving binary codes for efficient similarity search in large-scale image collections. We formulate this problem in terms of finding a rotation of zero-centered data so as to minimize the quantization error of mapping this data to the vertices of a zero-centered binary hypercube, and propose a simple and efficient alternating minimization algorithm to accomplish this task. This algorithm, dubbed iterative quantization (ITQ), has connections to multi-class spectral clustering and to the orthogonal Procrustes problem, and it can be used both with unsupervised data embeddings such as PCA and supervised embeddings such as canonical correlation analysis (CCA). The resulting binary codes significantly outperform several other state-of-the-art methods. We also show that further performance improvements can result from transforming the data with a nonlinear kernel mapping prior to PCA or CCA. Finally, we demonstrate an application of ITQ to learning binary attributes or “classemes” on the ImageNet dataset. |
| 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 |
0162-8828 |
ISBN |
978-1-4577-0394-2 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ GLG 2012b |
Serial |
2008 |
| Permanent link to this record |
| |
|
| |
| Author |
Bogdan Raducanu; Jordi Vitria; D. Gatica-Perez |
| Title |
You are Fired! Nonverbal Role Analysis in Competitive Meetings |
Type |
Conference Article |
| Year |
2009 |
Publication |
IEEE International Conference on Audio, Speech and Signal Processing |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1949–1952 |
| Keywords |
|
| Abstract |
This paper addresses the problem of social interaction analysis in competitive meetings, using nonverbal cues. For our study, we made use of ldquoThe Apprenticerdquo reality TV show, which features a competition for a real, highly paid corporate job. Our analysis is centered around two tasks regarding a person's role in a meeting: predicting the person with the highest status and predicting the fired candidates. The current study was carried out using nonverbal audio cues. Results obtained from the analysis of a full season of the show, representing around 90 minutes of audio data, are very promising (up to 85.7% of accuracy in the first case and up to 92.8% in the second case). Our approach is based only on the nonverbal interaction dynamics during the meeting without relying on the spoken words. |
| Address |
Taipei, Taiwan |
| 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-6149 |
ISBN |
978-1-4244-2353-8 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICASSP |
| Notes |
OR;MV |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ RVG2009 |
Serial |
1154 |
| Permanent link to this record |
| |
|
| |
| Author |
Ferran Diego; G.D. Evangelidis; Joan Serrat |
| Title |
Night-time outdoor surveillance by mobile cameras |
Type |
Conference Article |
| Year |
2012 |
Publication |
1st International Conference on Pattern Recognition Applications and Methods |
Abbreviated Journal |
|
| Volume |
2 |
Issue |
|
Pages |
365-371 |
| Keywords |
|
| Abstract |
This paper addresses the problem of video surveillance by mobile cameras. We present a method that allows online change detection in night-time outdoor surveillance. Because of the camera movement, background frames are not available and must be “localized” in former sequences and registered with the current frames. To this end, we propose a Frame Localization And Registration (FLAR) approach that solves the problem efficiently. Frames of former sequences define a database which is queried by current frames in turn. To quickly retrieve nearest neighbors, database is indexed through a visual dictionary method based on the SURF descriptor. Furthermore, the frame localization is benefited by a temporal filter that exploits the temporal coherence of videos. Next, the recently proposed ECC alignment scheme is used to spatially register the synchronized frames. Finally, change detection methods apply to aligned frames in order to mark suspicious areas. Experiments with real night sequences recorded by in-vehicle cameras demonstrate the performance of the proposed method and verify its efficiency and effectiveness against other methods. |
| Address |
Algarve, Portugal |
| 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 |
ICPRAM |
| Notes |
ADAS |
Approved |
no |
| Call Number |
Admin @ si @ DES2012 |
Serial |
2035 |
| Permanent link to this record |
| |
|
| |
| Author |
Bogdan Raducanu; Fadi Dornaika |
| Title |
Texture-independent recognition of facial expressions in image snapshots and videos |
Type |
Journal Article |
| Year |
2013 |
Publication |
Machine Vision and Applications |
Abbreviated Journal |
MVA |
| Volume |
24 |
Issue |
4 |
Pages |
811-820 |
| Keywords |
|
| Abstract |
This paper addresses the static and dynamic recognition of basic facial expressions. It has two main contributions. First, we introduce a view- and texture-independent scheme that exploits facial action parameters estimated by an appearance-based 3D face tracker. We represent the learned facial actions associated with different facial expressions by time series. Second, we compare this dynamic scheme with a static one based on analyzing individual snapshots and show that the former performs better than the latter. We provide evaluations of performance using three subspace learning techniques: linear discriminant analysis, non-parametric discriminant analysis and support vector machines. |
| 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 |
0932-8092 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
OR; 600.046; 605.203;MV |
Approved |
no |
| Call Number |
Admin @ si @ RaD2013 |
Serial |
2230 |
| Permanent link to this record |
| |
|
| |
| Author |
Arnau Ramisa; David Aldavert; Shrihari Vasudevan; Ricardo Toledo; Ramon Lopez de Mantaras |
| Title |
Evaluation of Three Vision Based Object Perception Methods for a Mobile Robot |
Type |
Journal Article |
| Year |
2012 |
Publication |
Journal of Intelligent and Robotic Systems |
Abbreviated Journal |
JIRC |
| Volume |
68 |
Issue |
2 |
Pages |
185-208 |
| Keywords |
|
| Abstract |
This paper addresses visual object perception applied to mobile robotics. Being able to perceive household objects in unstructured environments is a key capability in order to make robots suitable to perform complex tasks in home environments. However, finding a solution for this task is daunting: it requires the ability to handle the variability in image formation in a moving camera with tight time constraints. The paper brings to attention some of the issues with applying three state of the art object recognition and detection methods in a mobile robotics scenario, and proposes methods to deal with windowing/segmentation. Thus, this work aims at evaluating the state-of-the-art in object perception in an attempt to develop a lightweight solution for mobile robotics use/research in typical indoor settings. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer Netherlands |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0921-0296 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
ADAS |
Approved |
no |
| Call Number |
Admin @ si @ RAV2012 |
Serial |
2150 |
| Permanent link to this record |
| |
|
| |
| Author |
Anjan Dutta; Umapada Pal; Josep Llados |
| Title |
Compact Correlated Features for Writer Independent Signature Verification |
Type |
Conference Article |
| Year |
2016 |
Publication |
23rd International Conference on Pattern Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
This paper considers the offline signature verification problem which is considered to be an important research line in the field of pattern recognition. In this work we propose hybrid features that consider the local features and their global statistics in the signature image. This has been done by creating a vocabulary of histogram of oriented gradients (HOGs). We impose weights on these local features based on the height information of water reservoirs obtained from the signature. Spatial information between local features are thought to play a vital role in considering the geometry of the signatures which distinguishes the originals from the forged ones. Nevertheless, learning a condensed set of higher order neighbouring features based on visual words, e.g., doublets and triplets, continues to be a challenging problem as possible combinations of visual words grow exponentially. To avoid this explosion of size, we create a code of local pairwise features which are represented as joint descriptors. Local features are paired based on the edges of a graph representation built upon the Delaunay triangulation. We reveal the advantage of combining both type of visual codebooks (order one and pairwise) for signature verification task. This is validated through an encouraging result on two benchmark datasets viz. CEDAR and GPDS300. |
| Address |
Cancun; Mexico; December 2016 |
| 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 |
ICPR |
| Notes |
DAG; 600.097 |
Approved |
no |
| Call Number |
Admin @ si @ DPL2016 |
Serial |
2875 |
| Permanent link to this record |
| |
|
| |
| Author |
Weiqing Min; Shuqiang Jiang; Jitao Sang; Huayang Wang; Xinda Liu; Luis Herranz |
| Title |
Being a Supercook: Joint Food Attributes and Multimodal Content Modeling for Recipe Retrieval and Exploration |
Type |
Journal Article |
| Year |
2017 |
Publication |
IEEE Transactions on Multimedia |
Abbreviated Journal |
TMM |
| Volume |
19 |
Issue |
5 |
Pages |
1100 - 1113 |
| Keywords |
|
| Abstract |
This paper considers the problem of recipe-oriented image-ingredient correlation learning with multi-attributes for recipe retrieval and exploration. Existing methods mainly focus on food visual information for recognition while we model visual information, textual content (e.g., ingredients), and attributes (e.g., cuisine and course) together to solve extended recipe-oriented problems, such as multimodal cuisine classification and attribute-enhanced food image retrieval. As a solution, we propose a multimodal multitask deep belief network (M3TDBN) to learn joint image-ingredient representation regularized by different attributes. By grouping ingredients into visible ingredients (which are visible in the food image, e.g., “chicken” and “mushroom”) and nonvisible ingredients (e.g., “salt” and “oil”), M3TDBN is capable of learning both midlevel visual representation between images and visible ingredients and nonvisual representation. Furthermore, in order to utilize different attributes to improve the intermodality correlation, M3TDBN incorporates multitask learning to make different attributes collaborate each other. Based on the proposed M3TDBN, we exploit the derived deep features and the discovered correlations for three extended novel applications: 1) multimodal cuisine classification; 2) attribute-augmented cross-modal recipe image retrieval; and 3) ingredient and attribute inference from food images. The proposed approach is evaluated on the constructed Yummly dataset and the evaluation results have validated the effectiveness of the proposed approach. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
LAMP; 600.120 |
Approved |
no |
| Call Number |
Admin @ si @ MJS2017 |
Serial |
2964 |
| Permanent link to this record |
| |
|
| |
| 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 |
