Back to search

University of York

Data Clustering and Graph-Based Image Matching Methods

Abstract

dc:description.abstract

This thesis describes our novel methods for data clustering, graph characterizing and image matching. In Chapter 3, our main contribution is the M1NN agglomerative clustering method with a new parallel merging algorithm. A cluster characterizing quantity is derived from the path-based dissimilarity measure. In Chapter 4, our main contribution is the modified log likelihood model for quantitative clustering analysis. The energy of a graph is adopted to define the description length to measure the complexity of a clustering. In Chapter 5, our main contribution is an image matching method based on Delaunay graph characterization and node selection. A normalized Euclidean distance on Delaunay graphs is found useful to estimate pairwise distances.

Degree

thesis:*
Name dc:type.qualificationname
Ph.D
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
University of York
Year dc:date.issued
2012

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Fang, Yan
Advisor dc:contributor.advisor
  • Hancock, Edwin

Rights

Language dc:language.dcterms_iso639_2
eng

Identifiers

dc:identifier.*
Identifier
uk.bl.ethos.589143

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Fang, Yan. Data Clustering and Graph-Based Image Matching Methods. doctoral thesis, University of York, 2012.