Back to search

Clemson University

An efficient image segmentation algorithm using bidirectional Mahalanobis distance

Abstract

dc:description.abstract

In this thesis, we present an efficient graph-based image-segmentation algorithm that improves upon the drawbacks of the minimum spanning tree based segmentation algorithm, namely leaks that occur due to the criterion used to merge regions, and the sensitivity of the output to the parameter k. To address these problems, we propose the use of bidirectional Mahalanobis distance, along with a Gaussian model for each region, and an intuitive normalized parameter τ that replaces k and works for all images without having to be changed. Furthermore, we propose an approximation to the algorithm that enables it to run efficiently in O(NlogN) time (N represents the number of pixels in the image), without compromising on the performance. Experiments on a wide variety of images demonstrates the ability of the algorithm to achieve accurate results in an efficient manner.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Electrical Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Suresh, Rahul
Contributors dc:contributor
  • Birchfield, Stanley T
  • Dean , Brian C
  • Hoover , Adam

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/1556

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Suresh, Rahul. An efficient image segmentation algorithm using bidirectional Mahalanobis distance. Thesis thesis, https://open.clemson.edu/all_theses/1556