透過您的圖書館登入
IP:3.12.161.77
  • 學位論文

UbiShop: 無所不在之線上商品影像搜尋系統

UbiShop: A Ubiquitous Image Search System for Online Shopping Commodity

指導教授 : 陳銘憲

摘要


隨著多媒體分析與機器學習等技術日益地進展,藉由比對輸入影像與大量影像資料的特徵值而辨識出所拍攝之影像,並擷取相似影像及其相關資訊,已變得越來越可行。此外,由於智慧型手機的普及與行動通訊革新的迅速成長,人們漸漸可以透過行動裝置無所不在地從遠端伺服器取得想要的資訊。結合這兩種趨勢,我們提出一個線上購物商品影像搜尋系統UbiShop,讓使用者利用智慧型手機對感興趣商品拍照,並取得該商品更多的網路資訊。 本篇論文提出的階層式基於虛擬雜湊之描述子比對演算法(Hierarchical pseudo Hash-based Descriptors Matching),解決過去區域描述子比對方法需耗費大量時間的問題。此演算法比傳統描述子比對方法大大地加速許多,而只損失些許精確度,於不同測試資料集所做的實驗皆達到優異的效能。此外,我們設計一個兩階層之排序機制;以階層式基於虛擬雜湊之描述子比對演算法保留前K 張最可能相符之影像,並運用傳統區域描述子比對準則,重新排序這些影像。將此機制運用於UbiShop 系統,不但能達到即時的搜尋效率,更兼顧了極佳的搜尋效能。 除此之外,我們也針對每張手錶影像,建立其相似圖片清單。當搜尋到目標手錶時,便能推薦使用者該手錶之其他款式相似的手錶。因此,我們提出基於特定物件之區域性顏色直方圖(Specific Object-based Regional Color Histogram)特徵值比對方法,分別於物件不同區域比較其顏色直方圖,再根據彼此特徵值相似度排序,為每張手錶建立相似圖片清單。 考量目前行動裝置運算與儲存能力的限制,我們設計一個主從式架構系統,將複雜的運算移往伺服器端,而只留下簡易的使用者互動介面於行動裝置。此概念讓大量影像及資訊儲存於伺服器,並使本系統在未來能延伸到更多商品種類。

並列摘要


As advancement of multimedia analysis and machine learning proceeds with each passing day, it becomes more possible to recognize captured images, and retrieve similar images and related information by comparing extracted features of query image with large numbers of images in datasets. In addition, thanks to popularity of smart phone and evolution of mobile telecommunication grow rapidly, people are gradually able to use mobile device to get desired information ubiquitously through transmission from remote servers. Combining these trends, we propose an online shopping commodity image search system, UbiShop, which makes users snap interesting commodities through smart phones and receives information about the commodities from the web. In this thesis, to solve problem of previous local descriptors matching with high cost time, we propose Hierarchical pseudo Hash-based Descriptors Matching (H-pHDM) algorithm that greatly speeds up traditional descriptors matching with little accuracy loss. The experiments conducted on different testing datasets achieve great performance. Furthermore, to exploit to UbiShop system and concern about both retrieval time and accuracy, we design a two-level ranking mechanism that keeps top-K images which are most likely the matched images by H-pHDM algorithm, and re-ranks these images by conventional local descriptors matching criteria. Besides, we even construct similar images lists for watches datasets that recommend users other watches with similar visual style as target watch is retrieved. Hence, we propose Specific Object-based Regional Color Histogram (SORCH) feature matching approach that compares color histogram on different regions of objects respectively and ranks by similarities with other images to construct the lists. In addition, considering the limitation of computation power and capacity of current mobile devices, we design a client-server architecture system to put complex computation to server side, yet keep simple user interaction on mobile device. The notion lets large numbers of images and information be stored in the server and makes the system be extensible with more commodity categories in the future.

參考文獻


[2] D. G. Lowe, “Distinctive image features from scale-invariant keypoints”, International Journal of Computer Vision, 60(2), pp. 91-110, 2004.
[3] K. Mikolajczyk and C. Schmid, “A performance evaluation of local descriptors”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 257-263, 2003.
[4] K. Mikolajczyk and C. Schmid, “A performance evaluation of local descriptors,” Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 27, no. 10, pp. 1615-1630, 2005.
[5] J. S. Beis and D. G. Lowe, “Shape indexing using approximate nearest-neighbour search in high-dimensional spaces”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Puerto Rico, pp. 1000-1006, 1997
[6] J. Friedman, J. Bently, and R. Finkel, “An Algorithm for Finding Best Matches in Logarithmic Expected Time”, ACM Transactions on Mathematical Software, vol. 3, no. 3, pp. 209-226, 1977.

延伸閱讀