未來方向

本論文之未來方向目前暫定共有兩點：平行架構(Parallel Architecture)、

組合問題(Combination)。首先，在粒子群演算法的原始理念中，每一次的迭代 為「所有粒子同時間完成一次的位移」，倘若依照此概念，則可以針對現在硬體 技術的發達加以將演算法往「平行架構(Parallel Architecture)」的模型進行 延伸探討，以利粒子演算法搜尋時間的優化，並且在本論文的建議方法中亦有針 對在程式設計中，採時間函數可能造成更嚴重的「重複搜尋」問題進行約束，其 效能勢必會更優於原始的 BPSO 或者 CBPSO(鯰魚粒子群)；接著，在演化式計算 中，離散型的問題常被視為一種「排列組合」的問題，然而，在本篇論文所探討 的方向中，倘若能透過適當的設計，在搜尋的過程中紀錄不同的最佳解位置，以 至於最後輸出時，能一次性輸出數張對於目標影像匹配率較高之子影像，則可以 更有效地快速搜尋目標影像，藉以達到靈活應用之效果。

53

參考文獻

[1] B. Aler, J. Vincent, C. Anyakoha, “A review of particle swarm optimization,”

Natural Computing, 2008.

[2] D. Karaboga, “An Idea Based on Honey Bee Swarm for Numerical Optimization,”

Technical Report-TR06, Erciyes University, Department of Computer Engineering Department, Kayseri/Türkiye October, 2005.

[3] D. G. Lowe, “Object recognition from local scale-invariant features,” in Proc. of the Seventh IEEE International Conference on Computer Vision, vol.2, pp. 1150–

1157. 1999.

[4] D. G. Lowe, “Distinctive image features from scale-invariant keypoints,”

International Journal of Computer Vision, vol. 60, no.2, pp. 91-110, Nov. 2004

[5] E. Elbeltagi, T. Hegazy, D. Grierson, “Comparison among five evolutionary-based optimization algorithms,” Advanced Engineering Informatics, pp. 43–53, 2005.

[6] H. Bay, T. Tuytelaars, L. V. Gool, “Surf: Speeded up robust features,” in Proc of European Conference on Computer Vision, pp. 404-417, 2006.

[7] J. H. Holland, “Adaption in natural and artificial systems,” The University Michigan Press, Ann Arbor , 1975.

54

[8] J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proc. of IEEE Int. Conf. on Neural Networks, Perth, Australia, vol. 4, pp. 1942-1948, 1995.

[9] J. Kennedy and R. C. Eberhart, “A discrete binary version of the particle swarm algorithm,” in Proc. of IEEE International Conference on Systemics, Cybernetics and Informatics, vol. 5, pp. 4104–4108, 1997.

[10] J. H. Liu, J. W. Liu, “A new particle swarm optimization algorithm and real-time control of traffic signal in urban intersection,” Systems Engineering, 2007.

[11] J. H. Liu, X. P. Fan, Z. H. Qu, “A new particle swarm optimization algorithm based on similarity,” Control and Deceiosn, 2007.

[12] J. H. Liu, X. P. Fan, “The Analysis and Improvement of Binary Particle Swarm Optimization,” in Proc. of the International Conference on Computational Intelligence and Security, 2009.

[13] J. H. Liu, X. P. Fan, Z. H. Qu, “An improved particle swarm optimization with mutation based on similarity,” In Proc. of the 3rd International Conference on Natural Computation, Haikou, China, 2007.

[14] J. Shang and Y. Ke, “An image recognition method using multi-features,” in Proc.

of the 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, pp. 419-423, Oct. 2012.

55

[15] J. X. Wei, Y. H. Sun, X.N. Su,“A novel particle swarm optimization based on immune selection. ”Journal of Nanjing University(Natural Sciences), 2010.

[16] L.Barghout, WL. Lawrence, “Perceptual information processing system,” U.S.

Patent Application 10/618,543, filed July 11, 2003.

[17] L.Chang, R. Wang, H. Zheng, J. Dai, B. Zheng, “Phytoplankton Feature Extraction from Microscopic Images based on SURF-PCA,” OCEANS 2016-Shanghai, pp.1-4, 2016.

[18] L. Y. Chuang, S. W. Tsai, C. H. Yang, “Improved binary particle swarm optimization using catfish effect for feature selection,” Expert Syst. Appl., vol. 38, no. 10, pp. 12699-12707, Sep. 2011.

[19] M. Dorigo,“Optimization, learning and natural algorithms,” Ph.D. Thesis (in Italian), Politechnico de Milano, Milan, Italy, 1992.

[20] M. A. Khanesar, M. Teshnehlab, M. A. Shoorehdeli, “ A Novel Binary Particle Swarm Optimization,” in Proc. of the Mediterranean Conference on Control &

Automation, 2007.

[21] N. S. Altman, “An introduction to kernel and nearest-neighbor nonparametric regression,” The American Statistician., 46 (3): 175–185, 1992.

[22] N. Otsu, “A threshold selection method from gray level histograms,” IEEE Trans.

on Systems, Man and Cybernetics, vol. 9, no. 1, pp. 62-66, Jan. 1979.

56

[23] Papageorgiou, Oren and Poggio, “A general framework for object detection,” in Proc. of International Conference on Computer Vision, 1998.

[24] R. C. Eberhart, J. Kennedy, “A new optimizer using particle swarm theory,” in Proc. of IEEE Int. Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39-43, 1995.

[25] S. B. Jeffrey, D. G. Lowe, “Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces,” in Proc. of the Conference on Computer Vision and Pattern Recognition, Puerto Rico, pp.

1000-1006. 1997.

[26] S. Se, D. Lowe, and J. Little, “Mobile robot localization and mapping with uncertainty using scale-invariant visula landmarks,” The International Journal of Robotics Research, vol. 21, no. 8, pp.735-758, August 2002.

[27] S.Zhang, “Monoculary visionslam algorithm based on pca-surf,” Master’s thesis, Ocean University of China, 2014.

[28] S. Mouadh, S. Anis, M. Nesrine, and M. S. Faouzi, “Optimization of Switching Instants for Optimal Control of Switched discrete Non Linear Systems based on Particle Swarm Algorithm,” in Proc. of the 15th International Conference on Sciences and Techniques of Automatic Control and Computer Engineering (STA), 2014.

57

[29] T. Ojala, M. Pietikäinen, and D. Harwood, “Performance evaluation of texture measures with classification based on Kullback discrimination of distributions,”

in Proc. of the 12th International Conference on Pattern Recognition (ICPR), vol.

1, pp. 582-585, 1994.

[30] T. Ojala, M. Pietikäinen, and D. Harwood,“A Comparative Study of Texture Measures with Classification Based on Feature Distributions,” Pattern Recognition, vol. 29, pp. 51-59, 1996.

[31] Viola and Jones,“Rapid object detection using a boosted cascade of simple features, ” Computer Vision and Pattern Recognition, 2001.

[32] X. Xu, S. Xu, L. Jin, and E. Song, “Characteristic analysis of Otsu threshold and its applications,” Pattern Recognition Letters, vol. 32, no.7, pp. 956-961, May 2011.

[33] Y .Shi, R. C. Eberhart, “A modified particle swarm optimizer,” in Proc. of IEEE International Conference on Evolutionary Computation, New Jersy, pp.69-73, 1998.

[34] Y. Liu, Y.Y. Chung. “Mining Cancer data with Discrete Particle swarm optimization and rule pruning,” in Proc. of International Symposium on IT in Medicine and Education (ITME), 2011.

[35] Y. Wan, J. Wang, X. Sun, and M. Hao, “A modified Otsu image segment method based on the Rayleigh distribution.” in Proc. of the 3rd IEEE International

58

Conference on Computer Science and Information Technology, vol. 5, pp.281-285, July 2010.

[36] 許清淵,王隆仁, “運用改良式 SIFT 技術於航照影像物件辨識,” in Proc. of Conference on Information Technology and Applications in Outlying Island, 2015.

[37] 鄧景元, 運用尺度不變特徵轉換演算法於雷達衛星影像自動匹配之研究, 碩士論文,國立臺灣海洋大學,海洋環境資訊學系, 2010 年 6 月.

[38] 葉怡成、黃文孝，「以遺傳演算法解資源限制排程最佳化問題之研究」，中 華民國第一屆營建管理學術研討會論文集 , 台北, 第Ⅱ 9- Ⅱ 14 , 1999.