Advances in Graph Matching for Image Interpretation
Saved in:
| Title: | Advances in Graph Matching for Image Interpretation |
|---|---|
| Authors: | Dahm, Nicholas |
| Contributors: | Gao, Yongsheng, Caelli, Terrence, Bunke, Horst |
| Publisher Information: | Griffith University |
| Publication Year: | 2015 |
| Collection: | Griffith University: Griffith Research Online |
| Subject Terms: | Structural pattern recognition, Graph matching, Graph matching algorithms, Image interpretation |
| Description: | In structural pattern recognition, graphs are a powerful and flexible data structure, allowing for the description of complex relationships between data elements. This flexibility comes at a cost, as the unconstrained nature of graphs results in a high computational complexity for graph matching algorithms. Various algorithms have been proposed to mitigate this complexity and make graph matching tractable. Additionally, in domains where the number of graph nodes is low, or where the data provides additional constraints, such as node and edge labels, graph matching has been effectively applied. Such applications include chemical structure matching, protein-protein interaction networks, and network analysis. In the domain of computer vision, graphs have been successfully applied to a number a problems including image segmentation, partitioning, and matching. However, for practical reasons, many of the image matching techniques that utilise graphs do not match graph topology directly. Instead, image graphs are used only to constrain feature locations, or spectral embedding is used to transform image graphs into vectors, which are then matched. ; Thesis (PhD Doctorate) ; Doctor of Philosophy (PhD) ; Griffith School of Engineering ; Science, Environment, Engineering and Technology ; Full Text |
| Document Type: | thesis |
| Language: | English |
| Relation: | https://hdl.handle.net/10072/365647 |
| DOI: | 10.25904/1912/3323 |
| Availability: | https://hdl.handle.net/10072/365647 https://doi.org/10.25904/1912/3323 |
| Rights: | The author owns the copyright in this thesis, unless stated otherwise. ; Public ; open access |
| Accession Number: | edsbas.B4A9B005 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | In structural pattern recognition, graphs are a powerful and flexible data structure, allowing for the description of complex relationships between data elements. This flexibility comes at a cost, as the unconstrained nature of graphs results in a high computational complexity for graph matching algorithms. Various algorithms have been proposed to mitigate this complexity and make graph matching tractable. Additionally, in domains where the number of graph nodes is low, or where the data provides additional constraints, such as node and edge labels, graph matching has been effectively applied. Such applications include chemical structure matching, protein-protein interaction networks, and network analysis. In the domain of computer vision, graphs have been successfully applied to a number a problems including image segmentation, partitioning, and matching. However, for practical reasons, many of the image matching techniques that utilise graphs do not match graph topology directly. Instead, image graphs are used only to constrain feature locations, or spectral embedding is used to transform image graphs into vectors, which are then matched. ; Thesis (PhD Doctorate) ; Doctor of Philosophy (PhD) ; Griffith School of Engineering ; Science, Environment, Engineering and Technology ; Full Text |
|---|---|
| DOI: | 10.25904/1912/3323 |