電腦科學與資訊工程

利用深度學習將黑白影片色彩化

1920年代和1930年代,攝影設備剛剛起步,攝影設備只能拍攝黑白圖像的照片或影片,但仍有許多經典電影被記錄下來。如今,隨著科技的進步,攝影設備也在不斷迭代,彩色成像技術和高品質成像技術不斷被更好的技術所取代。因此,如何將黑白圖像轉換為彩色圖像成為一個重要的研究課題。本研究的目的是將黑白影片轉換成彩色影片。我們的方法可以分為兩部分:彩色化模型設計和影片連續性優化。在顏色轉換模型設計部分,我們使用了生成對抗網絡(GANs)技術,基於U-Net設計了5個模型,並使用COCO數據集訓練顏色生成模型。在電影連續性優化部分,我們首先使用景觀數據集中微調的前五個模型中最好的模型。在這個過程中,我們發現模型生成的影片存在顏色不連續的問題。因此,我們設計了三套方案來解決,比如使用H.264重新編碼生成電影,使用平均像素的色調值提高電影的色調穩定性,使用ORB預測個別幀。結果表明,影片的色彩轉換效果表現優異。

A.N.T.s: Algorithm for Navigating Traffic System in Automated Warehouses

According to CNN Indonesia 2020, the demand for e-Commerce in Indonesia has nearly doubled during this pandemic. This surge in demand calls for a time-efficient method for warehouse order-picking. One approach to achieve that goal is by incorporating automation in their warehouse systems. Globally, the market of warehouse robotics is expected to reach 12.6 billion USD by 2027 (Data Bridge Market Research, 2020). In this research, the warehouse system studied would utilize AMR (Autonomous Mobile Robots) to lift and deliver movable shelf units to the packing station where workers are at. This research designed a heuristic algorithm called A.N.T.s (Algorithm for Navigating Traffic System) to conduct task assigning and pathfinding for AMR in the automated warehouse. The warehouse layout was drawn as a two-dimensional map in grids. When an order is placed, A.N.T.s would assign the task to a robot that would require the least amount of time to reach the target shelf. A.N.T.s then conducted pathfinding heuristically using Manhattan Distance. A.N.T.s would help the robot to navigate its way to the target shelf unit, lift the shelf and bring it to the designated packing station. A.N.T.s algorithm was tested in various warehouse layouts and with a varying number of AMRs. Comparison against the commonly used Djikstra’s algorithm was also conducted (Shaikh and Dhale, 2013). Results show that the proposed A.N.T.s algorithm could execute 100 orders in a 27x23 layout with five robots 9.96 times faster than Dijkstra with no collisions. The algorithm is also shown to be able to help assign tasks to robots and help them find short paths to navigate their ways to the shelf units and packing stations. A.N.T.s could navigate traffic to avoid deadlocks and collisions in the warehouse with the aid of lanes and directions.

自動X光檢測重建2.5D圖形用於非破壞性檢測:印刷電路板之應用

為了解決自動光學檢測的非穿透性檢測物體方式,使用自動X光檢測能解決此問題,因此,本研究嘗試開發自動X光檢測技術,並藉由常見的印刷電路板作為應用。作為結果,本研究能進行X光模擬理想化印刷電路板,搭配實體X光取像,藉由平移堆疊法重建出2.5D印刷電路板影像,並藉由霍夫法圓形辨識圈選錫球,輸入卷積神經網路,辨識錫球焊點之優劣。

A.N.T.s: Algorithm for Navigating Traffic System in Automated Warehouses

According to CNN Indonesia 2020, the demand for e-Commerce in Indonesia has nearly doubled during this pandemic. This surge in demand calls for a time-efficient method for warehouse order-picking. One approach to achieve that goal is by incorporating automation in their warehouse systems. Globally, the market of warehouse robotics is expected to reach 12.6 billion USD by 2027 (Data Bridge Market Research, 2020). In this research, the warehouse system studied would utilize AMR (Autonomous Mobile Robots) to lift and deliver movable shelf units to the packing station where workers are at. This research designed a heuristic algorithm called A.N.T.s (Algorithm for Navigating Traffic System) to conduct task assigning and pathfinding for AMR in the automated warehouse. The warehouse layout was drawn as a two-dimensional map in grids. When an order is placed, A.N.T.s would assign the task to a robot that would require the least amount of time to reach the target shelf. A.N.T.s then conducted pathfinding heuristically using Manhattan Distance. A.N.T.s would help the robot to navigate its way to the target shelf unit, lift the shelf and bring it to the designated packing station. A.N.T.s algorithm was tested in various warehouse layouts and with a varying number of AMRs. Comparison against the commonly used Djikstra’s algorithm was also conducted (Shaikh and Dhale, 2013). Results show that the proposed A.N.T.s algorithm could execute 100 orders in a 27x23 layout with five robots 9.96 times faster than Dijkstra with no collisions. The algorithm is also shown to be able to help assign tasks to robots and help them find short paths to navigate their ways to the shelf units and packing stations. A.N.T.s could navigate traffic to avoid deadlocks and collisions in the warehouse with the aid of lanes and directions.