ERA

Download the full-sized PDF of The evolution of snake toward automation for multiple blob-object segmentationDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3PC8W

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

The evolution of snake toward automation for multiple blob-object segmentation Open Access

Descriptions

Other title
Subject/Keyword
multiple object detection
active contour or snake
automatic segmentation
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Saha, Baidya Nath
Supervisor and department
Ray, Nilanjan (Computing Science)
Examining committee member and department
Greiner, Russell (Computing Science)
Pattichis, Marios S. (Electrical and Computer Engineering, University of New Mexico)
Mandal, Mrinal (Electrical and Computer Engineering)
Boulanger, Pierre (Computing Science)
Zhang, Hong (Computing Science)
Department
Department of Computing Science
Specialization

Date accepted
2011-08-29T19:28:37Z
Graduation date
2011-11
Degree
Doctor of Philosophy
Degree level
Doctoral
Abstract
For the last two decades “active contour” or “snake” has been effective as an interactive image segmentation tool in a wide range of applications, especially for blob-object delineation. In the interactive snake segmentation process, a user draws a rough object outline; next, a cost function is optimized to drive the user-drawn contour a.k.a. snake to delineate the desired object boundary. Although successful as an interactive segmentation tool, snake exhibits poor performances in various noteworthy image segmentation applications that require complete automation. Examples include oil sand particle delineation, biological cell segmentation and so on. This thesis presents a novel, completely automated snake/active contour algorithm for multiple blob-object delineation. The algorithm consists of three sequential steps: (a) snake initialization: where we apply a Probabilistic Quad Tree (PQT) based approximate segmentation technique on an image to find the regions of interest (ROI) where the probability of having objects is very high and place seeds uniformly within the ROIs; (b) snake evolution: where we evolve one novel interleave directional gradient vector flow (IDGVF) snake from each seed; (c) snake validation: where we classify the snakes into object and non-object classes using a novel adaptive regularized boosting (ARboost). Existing efforts towards snake automation have concentrated only on the succession of initialization and evolution steps and have practically overlooked the snake validation step. Here, we emphasize that we cannot skip the validation step, even though the initialization and evolution have performed well. Our proposed novel validation step, executed after complete convergence of a snake contour from a given initialization, classifies the evolved contour into desired object and non-object classes. ARboost employs a novel loss function for boosting that enables to classify snakes more accurately into object and non-object classes than other variants of boosting. PQT generates substantially fewer seed points and is therefore more efficient than other initialization methods without degrading the segmentation performance. We have demonstrated that IDGVF is more robust to initialization and it possesses a broader capture range than other variants of GVF snakes. The proposed automated snake algorithm has been successfully applied to two real data sets: oil sand ore images that have relevance in the oil sand mining industry and leukocyte images that are significant in biomedical engineering.
Language
English
DOI
doi:10.7939/R3PC8W
Rights
Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-05-01T04:22:44.817+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 5317892
Last modified: 2015:10:12 21:01:13-06:00
Filename: Saha_Baidya Nath_Fall 2011.pdf
Original checksum: 89748fe0927a224d4607176ece9a4694
Well formed: true
Valid: true
Page count: 131
File language: en-US
Activity of users you follow
User Activity Date