Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electrical Engineering / 電機工程學系
  4. A new Compression-Oriented Fast Image Segmentation Technique
 
  • Details

A new Compression-Oriented Fast Image Segmentation Technique

Date Issued
2009
Date
2009
Author(s)
Kuo, Cheng-Jin
URI
http://ntur.lib.ntu.edu.tw//handle/246246/188068
Abstract
In this thesis, we define the role of image segmentation as the front-stage processing of the image compression. Base on this, we hope there is an image segment algorithm with three advantages which are the fast speed, the good shape connectivity of its segmenting result, and the good shape matching.In chapter 2, we introduce some region-based image segmenting algorithm, including hierarchical data clustering, partitional data clustering, region growing algorithm, and splitting and merging algorithm.In chapter 3, we introduce the edge-based image segmenting algorithm and take the watershed algorithm as an example.In chapter 4, we introduce the improvement of the Fourier descriptor. It helps us to realize the importance of recording the boundary of an image shape.In the front of chapter 5, we compare the three algorithms below, Seeds Region Growing, K-means algorithm, and Watershed algorithm. We compare them and discuss the advantages and the drawbacks of them base on to be the compression-oriented image segmenting algorithm. The region growing algorithm is very reliable in shape matching with the good connectivity of its segmenting result, but it is too slow for us to use it. The K-means algorithm is very fast, but its segmenting result is fragmentary. It is very inconvenient for us to record the boundaries of the results after we sent the results into the compression stage. The watershed algorithm is widely use in image segmenting, but it is also famous, and maybe, notorious for the over-segmentation result. n the end of chapter 5, we propose and introduce our image segmenting algorithm in details. Our algorithm owns the advantages of the fast speed, the good shape connectivity with its segmenting results, and the not bad shape matching. n chapter 6, moreover, we improve our algorithm by using the adaptive threshold selecting with the local variance and the frequency. It help us to segment the image with suitable threshold value and improve the shape matching of our image segmenting method.here are conclusions and future work in chapter 7.ay this thesis be helpful for you.
Subjects
image processing
fast image segmentation
edge detection
fourier descriptor
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-98-J96921039-1.pdf

Size

23.32 KB

Format

Adobe PDF

Checksum

(MD5):8b70a5881b68855d97798f0bb12907cf

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science