Deakin University
Browse

File(s) under permanent embargo

Delaunay-supported edges for image graphs

conference contribution
posted on 2015-01-01, 00:00 authored by N Dahm, Y Gao, Terry CaelliTerry Caelli, H Bunke
© 2015 IEEE. Graphs are a powerful and versatile data structure for pattern recognition. However, their flexibility brings inherent complexities for algorithms which seek to create or utilise graphs. In the context of computer vision, many feature detection algorithms can extract a suitable vertex set from an image. The creation of edges between these vertices presents new challenges, and effective methods for edge creation only exist for certain types of vertices such as points and regions. This paper presents a novel method for creating edges for image graphs, while supporting a wide array of vertex types. The presented method is principled, and its robustness is shown experimentally against a number of affine and projective transforms, as well as noise.

History

Pagination

1036-1040

Location

Quebec City, Quebec

Start date

2015-09-27

End date

2015-09-30

ISSN

1522-4880

ISBN-13

9781479983391

Language

eng

Publication classification

E1.1 Full written paper - refereed

Title of proceedings

ICIP 2015 : Proceedings of the 2015 IEEE International Conference on Image Processing

Event

Image Processing. Conference (2015 : Quebec City, Quebec)

Publisher

IEEE

Place of publication

Piscataway, N.J.

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC