臺灣博碩士論文加值系統

鏟花加工技術在一個高精度的精密機械生產上是很重要的，一個零組件在經過機器加工後會產生些微的誤差值，這些誤差值是需要透過鏟花加工以微量的鏟、削、刮來鏟除，因為在鏟花加工後能夠讓工件表面更精準，本研究為了縮短自動化鏟花加工的時間，將自動化鏟花加工主要的動作分為1.執行鏟花加工的下刀動作，鏟刀動作時間0.475 秒/次2.工件位移的路徑，移動1個像素是0.1mm，由於在執行鏟花加工技術它每次鏟除的量是固定的所以沒辦法去做更改，但工件在移動的路徑是可做規劃的，所以本研究針對工具機在工件位移的路徑做個修改，改變原本鏟花加工時所採用的Row-Major order，改用區塊分割並以鄰近鏟除點為優先處理，利用線性四元樹的資料結構搭配Hilbert Curve演算法，因為線性四元樹包含著區塊的特性，Hilbert Curve具有最佳群聚的特性，可以讓每個要鏟除的區塊有著最佳的路徑，來減少工件位移路徑過長的問題。
最後，在自動鏟花加工機去模擬測試，分析原本路徑以及三個新路徑的比較，結果是可以改善的，但我們發現鏟花在加工只有些微縮短花費時間，所以在工件加工面的下刀點編排是需要在改進的，未來將針對更多測試工件去測試，並找出較佳的編排方法。

Scraping techniques mean a lot to the manufacturing of precision machinery of high-accuracy. When processing a piece of component with the machine, some minor errors may occur, which shall be eliminated by slightly scraping, as it can make the work-piece surface more precious. To shorten the processing time of automated scraping, this paper divided the primary actions of automated scraping process into: 1. action of beginning scraping, with the action time of 0.475 second/time; 2. displacement path of the work-piece, with a displacement of 1 pixel equaling to 0.1mm. It is impossible to change the scraping capacity which is fixed in executing scraping, but the displacement path of work-piece can be planned, so the paper changed the displacement path of the machine tool to modify the Row-Major order adopted originally in scraping. It used the decomposition and took the points neighboring to the scraping position for priority processing, and also utilized the structure of linear quadtree and Hilbert Curve Algorithm. Since the linear quadtree possesses the feature of block while Hilbert Curve has the property of optimum bunching, it can render all blocks to be scraped with the best routes, which can shorten the excessive length of displacement path.
Finally, according to the simulation test from automated scraping machine and analyze the original path and the new path, the result is can be improved. But we found that scraping only shortened spend time slightly . Therefore, the scraping schedule from the work-piece surface Edit the knife point is need to be improved .In the future, there will be more testing work-piece test and find the better scheduling method.

摘要..........i
Abstract.....ii
誌謝.........iv
目錄..........v
表目錄........vi
圖目錄.......vii
第一章 簡介.....1
1.1研究背景.....1
1.2研究動機.....2
1.3研究目的.....2
1.4論文架構.....3
第二章 文獻探討......4
2.1四元樹(Quadtree)與線性四元樹(Linear Quadtree).........4
2.2空間分割索引......5
2.3 鏟花加工技術.....8
第三章 研究方法......10
3.1鏟斑資料蒐集......11
3.2區塊分割技術......17
3.3 Hilbert Curve走訪應用.......21
3.4鏟花加工路徑之組成參數........29
第四章 實驗結果與分析............32
4.1實驗環境與測試影像說明........32
4.2內存消耗量與執行時間..........45
4.3實驗結果.....................46
第五章 結論與未來展望............49
參考文獻........................50
Extended Abstract..............53
Abstract.......................53
簡歷(CV).......................59

[1]Aouat, S. and Larabi, S., ”Indexing Binary Images using quad-tree Decomposition,” IEEE International Conference on Systems Man and Cybernetics (SMC), pp. 3074-3080, 2010.
[2]Aizawa, K. and Tanaka, S., “A Constant-Time Algorithm for Finding Neighbors in Quadtrees,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, Iss. 7, pp. 1178-1183, 2009.
[3]Barskar, R. and Ahmed, G.F., “3D Object Retrieval Using Silhouette Feature Vector on Shady Images,” International Conference on Emerging Trendsin Robotics and Communication Technologies (INTERACT), pp. 69-73, Dec. 2010.
[4]Chung, K.-L., Huang, Y.-L., and Liu, Y.-W., “Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query,” Inf. Sci., vol.177, pp. 2130-2451, 2007.
[5]Yung-Kuan Chan and Chin-Chen Chang, “Block Image Retrieval Based ona Compressed Linear Quadtree,” Proceedings of the 2003 Joint Conference of the Fourth International Conference on Information, Communications and Signal Processing and Fourth Pacific Rim Conference on Multimedia, vol. 1, pp. 31-35, 2003.
[6]YU-WEI CHEN and CHI-YEN HUANG, “Linear Quadtree Construction in Real Time,” JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, vol. 26, pp. 1917-1930, 2010.
[7]Kuo-Liang Chung, Yao-Hong Tsai, and Fei-Ching Hu, “Space-Filling Approach for Fast Window Query on Compressed Images,” IEEE Transactions on Image Processing, vol. 9, Iss. 12, pp. 2109-2116, 2000.
[8]Mengyue Hu, Xiaolin Tian, Shaowei Xia, and Yue Qin, “Image scramblingbased on 3-D Hilbert curve,” 2010 3rd International Congress on Image and Signal Processing (CISP), vol. 1, pp. 147-149, 2010.
[9]Jagadish, H. V., “Analysis of the Hilbert curve for representing two-dimensional space,” Information Processing Letters, vol. 62, pp. 17-22, 1997.
[10]F. Keissarian, “A New Quadtree-based Image Compression Techique usingPattern Matching Algorithm,” ICCES, vol. 12, no. 4, pp. 137-143, 2009.
[11]Kilimci, P. and Kalipsiz, O., “Indexing of Spatiotemporal Data A Comparison between Sweep and Z-Order Space Filling Curves,” International Conference on Information Society (i-Society), pp. 450-456, 2011.
[12]Kadowaki, R., Motomura, K., Ohkura, S., and Aizawa, K., “Graphs Representing Quadtree Structures using Eight Edges,” 2010 4th International Symposium on Communications, Control and Signal Processing (ISCCSP),
pp. 1-5, 2010.
[13]Li, Chenyang, Zhu, Hong, and Wang, Nengchao, “Fast N-Dimensional Hilbert Mapping Algorithm,” 2008. ICCSA ''08. International Conference on Computational Sciences and Its Applications, pp. 507-513, 2008.
[14]Leibe, B. and Schiele, B., “Analyzing Appearance and Contour Based Methods for Object Categorization,” IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2, pp. II - 409-15, 2003.
[15]Mandot, M. and Venugopalan, K., “A Survey of Surface Retrieval Techniques for 3D Models,” 2008. ICETET ''08. First International Conference on Emerging Trends in Engineering and Technology, pp. 48-51, 2008.
[16]Moon, B., Jagadish, H.V., Faloutsos, C., and Saltz, J.H., "Analysis of the Clustering Properties of the Hilbert Space-Filling Curve," IEEE Transactions on Knowledge and Data Engineering, vol. 13, Iss. 1, pp. 124-141, 2001.
[17]Stocco, L.J. and Schrack, G., “On Spatial Orders and Location Codes,” IEEE Transactions on Computers, vol. 58, Iss. 3, pp. 424-432, 2008.
[18]C.-C. Wu and Y.-I. Chang, “Quad-splitting algorithm for a window query on a Hilbert curve,” IET Image Process, vol. 3, Iss. 5, pp. 299-311, 2009.
[19]Wu, C.-C. and Chang, Y.-I., “Approximately even partition algorithm for coding the Hilbert curve of arbitrary-sized image,” IET Image Processing,
vol. 6, Iss. 6, pp. 746-755, 2012.
[20]Wagan, A.I., Godil, A., and Bres, S., “3D Shape Retrieval by Visual Parts Similarity,” IEEE Applied Imagery Pattern Recognition Workshop (AIPRW), pp. 1-6, Oct. 2009.
[21]覺文郁, 王泓澍, 陳博韋, 江明冀, 陳嘉宏, 蔡偉成, 張維中, 與邱國慶 "鏟花工件檢測裝置與技術開發," 中國機械工程學會第二十六屆全國學術研討會論文集, 中華民國九十八年十一月二十日、二十一日.
[22]陳正和, "機器視覺於鏟花承斑檢測之應用," 國立勤益科技大學機械工程系,2012.
[23]陳正和與黃峻彥, "運用機器視覺於鏟花加工面自動檢測系統之研究", 綠色科技工程與應用研討會(GTEA),2013.
[24]PMC鏟花技術交流平台 , "http://scraping.pmc.org.tw".
[25]黃金輝, "自動化鏟花加工技術建立,"國立國立虎尾科技大學自動化工程系,2011.
[26]謝東賢, "工具機導軌精度量測與性能評估," 國立成功大學製造資訊與系統研究所, 2011.
[27]陳建宏, "PC-Based自動鏟花系統," 國立國立虎尾科技大學自動化工程系,2013.
[28]機械月刊, "http://www.mmmpc.com.tw/yuehyin/MagSummary.aspxID=557&MID=10419", 越吟有限公司,2011年3月.
[29]HappyMan''s,"https://cg2010studio.wordpress.com/2011/12/06/%E6%91%A9%E9%A0%93%E7%A2%BC-morton-code/", 逍遙文工作室,2011年12月06.
[30]Pei-Min Chen, "Variant code transformations for linear quadtrees, " Pattern Recognition Letters, vol. 23, Iss. 11, pp. 1253-1262, September 2002.
[31]CLIFFORD A. SHAFFER AND HANAN SAMEY, "Optimal Quadtree Construction Algorithms," COMPUTER VISION, GRAPHICS, AND IMAGE PROCESSING, vol. 37, pp. 402-419, 1987.
[32]超酷算法:用四元樹(quadtree)和Hilbert Curve做空間索引(spatial indexing),
"http://blog.notdot.net/2009/11/Damn-Cool-Algorithms-Spatial-indexing-with-Quadtrees-and-Hilbert-Curves", 2015年1月5號.
[33]Kuo-Liang Chung, Yao-Hong Tsai, and Fei-Ching Hu, "Space-Filling Approach for Fast Window Query on Compressed Images",IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 9, ON. 12,DECEMBER 2000.