首頁 > 網路資源 > 大同大學數位論文系統

Title page for etd-0803111-081623


URN etd-0803111-081623 Statistics This thesis had been viewed 1534 times. Download 0 times.
Author Jo-Lun Hung
Author's Email Address No Public.
Department Computer Science and Enginerring
Year 2010 Semester 2
Degree Master Type of Document Master's Thesis
Language zh-TW.Big5 Chinese Page Count 41
Title Flooding-Based Approach for Image Segmentation to Improve the Performance of Graph-Cut
Keyword
  • max-flow/min-cut
  • Graph-Cut
  • Graph-Cut
  • max-flow/min-cut
  • Abstract Following the rapid growth of computing speed of computers, image segmentation
    technique attracts many researches. Graph-Cut algorithm is the most popular method adopted by researchers. It uses the max-flow/min-cut principle as the theoretical base for image segmentation. Roughly speaking, using Graph-Cut algorithm to segment an image, users firstly choose some representative portions of the image as the foreground and background
    seeds to build a netflow graph so as to model the kinship between pixels. Accordingly, the max-flow/min-cut principle is applied to segment the image foreground and background appropriately. The traditional Graph-Cut algorithm uses pixels to form the main vertices of the netflow graph. If the image size is too big, it requires tremendous amount of computation
    time. To accelerate the segmentation process, Flooding-Fill algorithm is applied to aggregating neighboring prixels of similar colors to mean-color nodes so as to reduce the size of netflow graph. This will save significant amount of computation time and not deteriorate the segmentation quality provided that a suitable interactive mechanism is involved. Besides, to achieve natural combination for image composition, we also estimate
    the values for pixels located at the boundaries between foreground and background based on the definite foreground and background pixels.
    Advisor Committee
  • Tai-Wen Yue - advisor
  • Chen-Chiung Hsieh - co-chair
  • none - co-chair
  • Files indicate not accessible
    Date of Defense 2011-07-05 Date of Submission 2011-08-03


    Browse | Search All Available ETDs