English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27454/39300
Visitors : 2534941      Online Users : 34
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51621

Title: An PSO-based Approach to Speed up the Fractal Encoding
Authors: H.-W. Tin
S.-W. Leu
Shun-Hsyung Chang
Contributors: 國立臺灣海洋大學:電機工程學系
Date: 2012-06
Issue Date: 2018-12-12T08:17:51Z
Publisher: International Journal of Mathematical Models and Methods in Applied Sciences
Abstract: Abstract: Fractal block coding method is based on a large amount of self-similarity which is exhibited in the image. During the encoding phase of fractal block coding, the size of domain pool determines how much time the encoding spends on searching the best match for each range block. Therefore, most of fractal image coding researches focused on obtaining the best possible accuracy with the smallest possible domain pool. This paper introduces three elaborative designed factors in the fitness function for particle swarm optimization (PSO) and a newly design method to obtain optimal domain blocks. The proposed method based on clustering technology and PSO method obtains the best possible accuracy with the smallest possible domain blocks in optimal pool. As a result, the proposed method greatly reduces the number of searches in the matching process. This paper experimentally demonstrates the proposed method on Java and verified with 3 medical images. By examining the experimental result, one sees that the domain blocks in optimal pool can well approximate the experimental images, and the why all natural images are rich in affine redundancy and have the property of local self-similarity. The proposed method by optimizing domain blocks achieves the image encoding that resulting in the best quality with as little searching as possible. The experimental results also indicate that the proposed method outperforms Jacquin's method for less number of searches in matching process with the quality of image after encodes remaining acceptable. We conclude that proposed method could be obtained domain blocks in optimal pool and successfully used to image encoded and decoded with an efficient search in encoding phase and without noticeable loss of image quality.
Relation: 6(3) pp.499-506
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51621
Appears in Collections:[電機工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML12View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback