Image segmentation has an important role in image processing because it is a tool to obtain higher level object descriptions for further processing. In some applications such as large image databases or video image sequence segmentations, the speed of the segmentation algorithm may become a drawback of the application. This thesis work is a study to improve the run-time performance of a well-known segmentation algorithm, namely the Recursive Shortest Spanning Tree (RSST). Both the original and the fast RSST found in the literature are analyzed and a comparison is made between these techniques. Simple modifications and an alternative link cost structure are proposed and evaluated. Finally, a distributed implementation based on a simple image partitioning strategy is attempted. The thesis presents the results of an extensive computational study with respect to both run-time performance and image segmentation quality.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/2/12606219/index.pdf |
| Date | 01 July 2005 |
| Creators | Yalcin Bayramoglu, Neslihan |
| Contributors | Bazlamacci, Cuneyt Fehmi |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for METU campus |
Page generated in 0.0018 seconds