| Home | [111–120] << 121 122 123 124 125 126 127 128 129 130 >> [131–140] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Shida Beigpour; Christian Riess; Joost Van de Weijer; Elli Angelopoulou | ||||
| Title | Multi-Illuminant Estimation with Conditional Random Fields | Type | Journal Article | ||
| Year | 2014 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 23 | Issue | 1 | Pages | 83-95 |
| Keywords | color constancy; CRF; multi-illuminant | ||||
| Abstract | Most existing color constancy algorithms assume uniform illumination. However, in real-world scenes, this is not often the case. Thus, we propose a novel framework for estimating the colors of multiple illuminants and their spatial distribution in the scene. We formulate this problem as an energy minimization task within a conditional random field over a set of local illuminant estimates. In order to quantitatively evaluate the proposed method, we created a novel data set of two-dominant-illuminant images comprised of laboratory, indoor, and outdoor scenes. Unlike prior work, our database includes accurate pixel-wise ground truth illuminant information. The performance of our method is evaluated on multiple data sets. Experimental results show that our framework clearly outperforms single illuminant estimators as well as a recently proposed multi-illuminant estimation 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 | 1057-7149 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC; LAMP; 600.074; 600.079 | Approved | no | ||
| Call Number | Admin @ si @ BRW2014 | Serial | 2451 | ||
| Permanent link to this record | |||||
| Author | Q. Xue; Laura Igual; A. Berenguel; M. Guerrieri; L. Garrido | ||||
| Title | Active Contour Segmentation with Affine Coordinate-Based Parametrization | Type | Conference Article | ||
| Year | 2014 | Publication | 9th International Conference on Computer Vision Theory and Applications | Abbreviated Journal | |
| Volume | 1 | Issue | Pages | 5-14 | |
| Keywords | Active Contours; Affine Coordinates; Mean Value Coordinates | ||||
| Abstract | In this paper, we present a new framework for image segmentation based on parametrized active contours. The contour and the points of the image space are parametrized using a set of reduced control points that have to form a closed polygon in two dimensional problems and a closed surface in three dimensional problems. By moving the control points, the active contour evolves. We use mean value coordinates as the parametrization tool for the interface, which allows to parametrize any point of the space, inside or outside the closed polygon
or surface. Region-based energies such as the one proposed by Chan and Vese can be easily implemented in both two and three dimensional segmentation problems. We show the usefulness of our approach with several experiments. |
||||
| Address | Lisboa; January 2014 | ||||
| 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 | VISAPP | ||
| Notes | OR;MILAB | Approved | no | ||
| Call Number | Admin @ si @ XIB2014 | Serial | 2452 | ||
| Permanent link to this record | |||||
| Author | David Masip; Michael S. North ; Alexander Todorov; Daniel N. Osherson | ||||
| Title | Automated Prediction of Preferences Using Facial Expressions | Type | Journal Article | ||
| Year | 2014 | Publication | PloS one | Abbreviated Journal | Plos |
| Volume | 9 | Issue | 2 | Pages | e87434 |
| Keywords | |||||
| Abstract | We introduce a computer vision problem from social cognition, namely, the automated detection of attitudes from a person's spontaneous facial expressions. To illustrate the challenges, we introduce two simple algorithms designed to predict observers’ preferences between images (e.g., of celebrities) based on covert videos of the observers’ faces. The two algorithms are almost as accurate as human judges performing the same task but nonetheless far from perfect. Our approach is to locate facial landmarks, then predict preference on the basis of their temporal dynamics. The database contains 768 videos involving four different kinds of preferences. We make it publically available. | ||||
| 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 | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ MNT2014 | Serial | 2453 | ||
| Permanent link to this record | |||||
| Author | Alejandro Gonzalez Alzate; Sebastian Ramos; David Vazquez; Antonio Lopez; Jaume Amores | ||||
| Title | Spatiotemporal Stacked Sequential Learning for Pedestrian Detection | Type | Conference Article | ||
| Year | 2015 | Publication | Pattern Recognition and Image Analysis, Proceedings of 7th Iberian Conference , ibPRIA 2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 3-12 | ||
| Keywords | SSL; Pedestrian Detection | ||||
| Abstract | Pedestrian classifiers decide which image windows contain a pedestrian. In practice, such classifiers provide a relatively high response at neighbor windows overlapping a pedestrian, while the responses around potential false positives are expected to be lower. An analogous reasoning applies for image sequences. If there is a pedestrian located within a frame, the same pedestrian is expected to appear close to the same location in neighbor frames. Therefore, such a location has chances of receiving high classification scores during several frames, while false positives are expected to be more spurious. In this paper we propose to exploit such correlations for improving the accuracy of base pedestrian classifiers. In particular, we propose to use two-stage classifiers which not only rely on the image descriptors required by the base classifiers but also on the response of such base classifiers in a given spatiotemporal neighborhood. More specifically, we train pedestrian classifiers using a stacked sequential learning (SSL) paradigm. We use a new pedestrian dataset we have acquired from a car to evaluate our proposal at different frame rates. We also test on a well known dataset: Caltech. The obtained results show that our SSL proposal boosts detection accuracy significantly with a minimal impact on the computational cost. Interestingly, SSL improves more the accuracy at the most dangerous situations, i.e. when a pedestrian is close to the camera. | ||||
| Address | Santiago de Compostela; España; June 2015 | ||||
| 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 | ACDC | Expedition | Conference | IbPRIA | |
| Notes | ADAS; 600.057; 600.054; 600.076 | Approved | no | ||
| Call Number | GRV2015; ADAS @ adas @ GRV2015 | Serial | 2454 | ||
| Permanent link to this record | |||||
| Author | Jiaolong Xu; Sebastian Ramos; David Vazquez; Antonio Lopez | ||||
| Title | Incremental Domain Adaptation of Deformable Part-based Models | Type | Conference Article | ||
| Year | 2014 | Publication | 25th British Machine Vision Conference | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Pedestrian Detection; Part-based models; Domain Adaptation | ||||
| Abstract | Nowadays, classifiers play a core role in many computer vision tasks. The underlying assumption for learning classifiers is that the training set and the deployment environment (testing) follow the same probability distribution regarding the features used by the classifiers. However, in practice, there are different reasons that can break this constancy assumption. Accordingly, reusing existing classifiers by adapting them from the previous training environment (source domain) to the new testing one (target domain)
is an approach with increasing acceptance in the computer vision community. In this paper we focus on the domain adaptation of deformable part-based models (DPMs) for object detection. In particular, we focus on a relatively unexplored scenario, i.e. incremental domain adaptation for object detection assuming weak-labeling. Therefore, our algorithm is ready to improve existing source-oriented DPM-based detectors as soon as a little amount of labeled target-domain training data is available, and keeps improving as more of such data arrives in a continuous fashion. For achieving this, we follow a multiple instance learning (MIL) paradigm that operates in an incremental per-image basis. As proof of concept, we address the challenging scenario of adapting a DPM-based pedestrian detector trained with synthetic pedestrians to operate in real-world scenarios. The obtained results show that our incremental adaptive models obtain equally good accuracy results as the batch learned models, while being more flexible for handling continuously arriving target-domain data. |
||||
| Address | Nottingham; uk; September 2014 | ||||
| Corporate Author |
Thesis | ||||
| Publisher | BMVA Press | Place of Publication | Editor | Valstar, Michel and French, Andrew and Pridmore, Tony | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | BMVC | ||
| Notes | ADAS; 600.057; 600.054; 600.076 | Approved | no | ||
| Call Number | XRV2014c; ADAS @ adas @ xrv2014c | Serial | 2455 | ||
| Permanent link to this record | |||||
| Author | Sergio Vera; Debora Gil; Miguel Angel Gonzalez Ballester | ||||
| Title | Anatomical parameterization for volumetric meshing of the liver | Type | Conference Article | ||
| Year | 2014 | Publication | SPIE – Medical Imaging | Abbreviated Journal | |
| Volume | 9036 | Issue | Pages | ||
| Keywords | Coordinate System; Anatomy Modeling; Parameterization | ||||
| Abstract | A coordinate system describing the interior of organs is a powerful tool for a systematic localization of injured tissue. If the same coordinate values are assigned to specific anatomical landmarks, the coordinate system allows integration of data across different medical image modalities. Harmonic mappings have been used to produce parametric coordinate systems over the surface of anatomical shapes, given their flexibility to set values
at specific locations through boundary conditions. However, most of the existing implementations in medical imaging restrict to either anatomical surfaces, or the depth coordinate with boundary conditions is given at sites of limited geometric diversity. In this paper we present a method for anatomical volumetric parameterization that extends current harmonic parameterizations to the interior anatomy using information provided by the volume medial surface. We have applied the methodology to define a common reference system for the liver shape and functional anatomy. This reference system sets a solid base for creating anatomical models of the patient’s liver, and allows comparing livers from several patients in a common framework of reference. |
||||
| Address | Amsterdam; September 2014 | ||||
| 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 | SPIE-MI | ||
| Notes | IAM; 600.075 | Approved | no | ||
| Call Number | Admin @ si @ VGG2014 | Serial | 2456 | ||
| Permanent link to this record | |||||
| Author | Enric Marti; Antoni Gurgui; Debora Gil; Aura Hernandez-Sabate; Jaume Rocarias; Ferran Poveda | ||||
| Title | ABP on line: Seguimiento, estregas y evaluación en aprendizaje basado en proyectos | Type | Miscellaneous | ||
| Year | 2014 | Publication | 8th International Congress on University Teaching and Innovation | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Tarragona; juliol 2014 | ||||
| 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 | CIDUI | ||
| Notes | IAM; ADAS; 600.076; 600.063; 600.075 | Approved | no | ||
| Call Number | Admin @ si @ MGG2014 | Serial | 2457 | ||
| Permanent link to this record | |||||
| Author | Carles Sanchez; Oriol Ramos Terrades; Patricia Marquez; Enric Marti; Jaume Rocarias; Debora Gil | ||||
| Title | Evaluación automática de prácticas en Moodle para el aprendizaje autónomo en Ingenierías | Type | Miscellaneous | ||
| Year | 2014 | Publication | 8th International Congress on University Teaching and Innovation | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Tarragona; juliol 2014 | ||||
| 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 | CIDUI | ||
| Notes | IAM; 600.075;DAG | Approved | no | ||
| Call Number | Admin @ si @ SRM2014 | Serial | 2458 | ||
| Permanent link to this record | |||||
| Author | David Fernandez; Josep Llados; Alicia Fornes | ||||
| Title | A graph-based approach for segmenting touching lines in historical handwritten documents | Type | Journal Article | ||
| Year | 2014 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
| Volume | 17 | Issue | 3 | Pages | 293-312 |
| Keywords | Text line segmentation; Handwritten documents; Document image processing; Historical document analysis | ||||
| Abstract | Text line segmentation in handwritten documents is an important task in the recognition of historical documents. Handwritten document images contain text lines with multiple orientations, touching and overlapping characters between consecutive text lines and different document structures, making line segmentation a difficult task. In this paper, we present a new approach for handwritten text line segmentation solving the problems of touching components, curvilinear text lines and horizontally overlapping components. The proposed algorithm formulates line segmentation as finding the central path in the area between two consecutive lines. This is solved as a graph traversal problem. A graph is constructed using the skeleton of the image. Then, a path-finding algorithm is used to find the optimum path between text lines. The proposed algorithm has been evaluated on a comprehensive dataset consisting of five databases: ICDAR2009, ICDAR2013, UMD, the George Washington and the Barcelona Marriages Database. The proposed method outperforms the state-of-the-art considering the different types and difficulties of the benchmarking data. | ||||
| 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 | 1433-2833 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.056; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ FLF2014 | Serial | 2459 | ||
| Permanent link to this record | |||||
| Author | David Fernandez; Pau Riba; Alicia Fornes; Josep Llados | ||||
| Title | On the Influence of Key Point Encoding for Handwritten Word Spotting | Type | Conference Article | ||
| Year | 2014 | Publication | 14th International Conference on Frontiers in Handwriting Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 476 - 481 | ||
| Keywords | Local descriptors; Interest points; Handwritten documents; Word spotting; Historical document analysis | ||||
| Abstract | In this paper we evaluate the influence of the selection of key points and the associated features in the performance of word spotting processes. In general, features can be extracted from a number of characteristic points like corners, contours, skeletons, maxima, minima, crossings, etc. A number of descriptors exist in the literature using different interest point detectors. But the intrinsic variability of handwriting vary strongly on the performance if the interest points are not stable enough. In this paper, we analyze the performance of different descriptors for local interest points. As benchmarking dataset we have used the Barcelona Marriage Database that contains handwritten records of marriages over five centuries. | ||||
| Address | Creete Island; Grecia; September 2014 | ||||
| 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 | 2167-6445 | ISBN | 978-1-4799-4335-7 | Medium | |
| Area | Expedition | Conference | ICFHR | ||
| Notes | DAG; 600.056; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ FRF2014 | Serial | 2460 | ||
| Permanent link to this record | |||||
| Author | David Fernandez; Jon Almazan; Nuria Cirera; Alicia Fornes; Josep Llados | ||||
| Title | BH2M: the Barcelona Historical Handwritten Marriages database | Type | Conference Article | ||
| Year | 2014 | Publication | 22nd International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 256 - 261 | ||
| Keywords | |||||
| Abstract | This paper presents an image database of historical handwritten marriages records stored in the archives of Barcelona cathedral, and the corresponding meta-data addressed to evaluate the performance of document analysis algorithms. The contribution of this paper is twofold. First, it presents a complete ground truth which covers the whole pipeline of handwriting
recognition research, from layout analysis to recognition and understanding. Second, it is the first dataset in the emerging area of genealogical document analysis, where documents are manuscripts pseudo-structured with specific lexicons and the interest is beyond pure transcriptions but context dependent. |
||||
| Address | Creete Island; Grecia; September 2014 | ||||
| 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 | 1051-4651 | ISBN | Medium | ||
| Area | Expedition | Conference | ICPR | ||
| Notes | DAG; 600.056; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ FAC2014 | Serial | 2461 | ||
| Permanent link to this record | |||||
| Author | David Fernandez; R.Manmatha; Josep Llados; Alicia Fornes | ||||
| Title | Sequential Word Spotting in Historical Handwritten Documents | Type | Conference Article | ||
| Year | 2014 | Publication | 11th IAPR International Workshop on Document Analysis and Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 101 - 105 | ||
| Keywords | |||||
| Abstract | In this work we present a handwritten word spotting approach that takes advantage of the a priori known order of appearance of the query words. Given an ordered sequence of query word instances, the proposed approach performs a
sequence alignment with the words in the target collection. Although the alignment is quite sparse, i.e. the number of words in the database is higher than the query set, the improvement in the overall performance is sensitively higher than isolated word spotting. As application dataset, we use a collection of handwritten marriage licenses taking advantage of the ordered index pages of family names. |
||||
| Address | Tours; Francia; April 2014 | ||||
| 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-1-4799-3243-6 | Medium | ||
| Area | Expedition | Conference | DAS | ||
| Notes | DAG; 600.061; 600.056; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ FML2014 | Serial | 2462 | ||
| Permanent link to this record | |||||
| Author | Pau Riba; Jon Almazan; Alicia Fornes; David Fernandez; Ernest Valveny; Josep Llados | ||||
| Title | e-Crowds: a mobile platform for browsing and searching in historical demographyrelated manuscripts | Type | Conference Article | ||
| Year | 2014 | Publication | 14th International Conference on Frontiers in Handwriting Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 228 - 233 | ||
| Keywords | |||||
| Abstract | This paper presents a prototype system running on portable devices for browsing and word searching through historical handwritten document collections. The platform adapts the paradigm of eBook reading, where the narrative is not necessarily sequential, but centered on the user actions. The novelty is to replace digitally born books by digitized historical manuscripts of marriage licenses, so document analysis tasks are required in the browser. With an active reading paradigm, the user can cast queries of people names, so he/she can implicitly follow genealogical links. In addition, the system allows combined searches: the user can refine a search by adding more words to search. As a second contribution, the retrieval functionality involves as a core technology a word spotting module with an unified approach, which allows combined query searches, and also two input modalities: query-by-example, and query-by-string. | ||||
| Address | Creete Island; Grecia; September 2014 | ||||
| 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 | 2167-6445 | ISBN | 978-1-4799-4335-7 | Medium | |
| Area | Expedition | Conference | ICFHR | ||
| Notes | DAG; 600.056; 600.045; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ RAF2014 | Serial | 2463 | ||
| Permanent link to this record | |||||
| Author | Monica Piñol | ||||
| Title | Reinforcement Learning of Visual Descriptors for Object Recognition | Type | Book Whole | ||
| Year | 2014 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | The human visual system is able to recognize the object in an image even if the object is partially occluded, from various points of view, in different colors, or with independence of the distance to the object. To do this, the eye obtains an image and extracts features that are sent to the brain, and then, in the brain the object is recognized. In computer vision, the object recognition branch tries to learns from the human visual system behaviour to achieve its goal. Hence, an algorithm is used to identify representative features of the scene (detection), then another algorithm is used to describe these points (descriptor) and finally the extracted information is used for classifying the object in the scene. The selection of this set of algorithms is a very complicated task and thus, a very active research field. In this thesis we are focused on the selection/learning of the best descriptor for a given image. In the state of the art there are several descriptors but we do not know how to choose the best descriptor because depends on scenes that we will use (dataset) and the algorithm chosen to do the classification. We propose a framework based on reinforcement learning and bag of features to choose the best descriptor according to the given image. The system can analyse the behaviour of different learning algorithms and descriptor sets. Furthermore the proposed framework for improving the classification/recognition ratio can be used with minor changes in other computer vision fields, such as video retrieval. | ||||
| Address | |||||
| Corporate Author |
Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Editor | Ricardo Toledo;Angel Sappa | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-84-940902-5-7 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ Piñ2014 | Serial | 2464 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta | ||||
| Title | Inexact Subgraph Matching Applied to Symbol Spotting in Graphical Documents | Type | Book Whole | ||
| Year | 2014 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | There is a resurgence in the use of structural approaches in the usual object recognition and retrieval problem. Graph theory, in particular, graph matching plays a relevant role in that. Specifically, the detection of an object (or a part of that) in an image in terms of structural features can be formulated as a subgraph matching. Subgraph matching is a challenging task. Specially due to the presence of outliers most of the graph matching algorithms do not perform well in subgraph matching scenario. Also exact subgraph isomorphism has proven to be an NP-complete problem. So naturally, in graph matching community, there are lot of efforts addressing the problem of subgraph matching within suboptimal bound. Most of them work with approximate algorithms that try to get an inexact solution in estimated way. In addition, usual recognition must cope with distortion. Inexact graph matching consists in finding the best isomorphism under a similarity measure. Theoretically this thesis proposes algorithms for solving subgraph matching in an approximate and inexact way.
We consider the symbol spotting problem on graphical documents or line drawings from application point of view. This is a well known problem in the graphics recognition community. It can be further applied for indexing and classification of documents based on their contents. The structural nature of this kind of documents easily motivates one for giving a graph based representation. So the symbol spotting problem on graphical documents can be considered as a subgraph matching problem. The main challenges in this application domain is the noise and distortions that might come during the usage, digitalization and raster to vector conversion of those documents. Apart from that computer vision nowadays is not any more confined within a limited number of images. So dealing a huge number of images with graph based method is a further challenge. In this thesis, on one hand, we have worked on efficient and robust graph representation to cope with the noise and distortions coming from documents. On the other hand, we have worked on different graph based methods and framework to solve the subgraph matching problem in a better approximated way, which can also deal with considerable number of images. Firstly, we propose a symbol spotting method by hashing serialized subgraphs. Graph serialization allows to create factorized substructures such as graph paths, which can be organized in hash tables depending on the structural similarities of the serialized subgraphs. The involvement of hashing techniques helps to reduce the search space substantially and speeds up the spotting procedure. Secondly, we introduce contextual similarities based on the walk based propagation on tensor product graph. These contextual similarities involve higher order information and more reliable than pairwise similarities. We use these higher order similarities to formulate subgraph matching as a node and edge selection problem in the tensor product graph. Thirdly, we propose near convex grouping to form near convex region adjacency graph which eliminates the limitations of traditional region adjacency graph representation for graphic recognition. Fourthly, we propose a hierarchical graph representation by simplifying/correcting the structural errors to create a hierarchical graph of the base graph. Later these hierarchical graph structures are matched with some graph matching methods. Apart from that, in this thesis we have provided an overall experimental comparison of all the methods and some of the state-of-the-art methods. Furthermore, some dataset models have also been proposed. |
||||
| Address | |||||
| Corporate Author |
Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Editor | Josep Llados;Umapada Pal | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-84-940902-4-0 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ Dut2014 | Serial | 2465 | ||
| Permanent link to this record | |||||