本論文提出一個在點對點網路資料庫系統中使用之以內容為基礎的影像檢索系統。因為中央化的檢索系統會造成網路流量負載過大以及運算量負擔不均，因此採用點對點系統來改善這些問題。每一個端點(peer)在同一時間可以同時執行影像檢索及回傳相似影像給來源端點，並根據檢索訊息和端點資料庫特徵的吻合程度，來決定要如何傳遞檢索訊息。我們提出一個有效率的點對點資料庫檢索架構，可以使整個點對點系統有規律地運作並且可以依照使用者人數調整訊息傳遞參數以提供最佳檢索效能。模擬結果顯示，藉由在每一端點上進行多重特徵檢索可以改善網路流量和回取率。最重要的特性是針對一個檢索端點，在不同的時間上提供可調適的效能，模擬顯示檢索效率比之前的研究，即煙火式和廣先搜尋式兩種，還要好。且為了提供最佳的效能，針對不同數目之線上使用者，我們提出一個最佳化的系統規劃方法，模擬結果顯示經最佳化的系統，在相同人數的情況下，回取率可以改善130%~ 200%。

A peer-to-peer content-based image retrieval system (P2P CBIR) has been proposed in this thesis. The centralized image retrieval system suffers from heavy traffics and computing loads and can be largely improved with this P2P system. Each peer is capable of performing image retrieval with heterogeneous features and return relevant images to source peer, and, in the same time, determines the broadcasting policy and propagates the query message (Q). We have proposed an efficient architecture for one peer to let the whole P2P system be operated in a regular and scalable approach. Simulations show that the retrieval performance can be improved by using multiple features in the P2P CBIR system, either in network traffics or recall rates. The most promising feature of the proposed method is that it provides a scalable approach for the query peer for different elapsed time. Simulations show that query efficiency of the scalable retrieval is better than previous research, i.e., firework and breaded first search. Furthermore, to provide best system performance, in terms of the number of on-line users and retrieval performances, we propose to perform system configuration in an optimal way. Simulations demonstrate that the optimal configuration can lead to 130% ~ 200% improvements in the recall rate under the same number of on-line users.

[1] Napster, http://www.napster.com/
[2] The Gnutella protocol specification v0.41,
http://www9.limewire.com/developer/gnutella protocol 0.4.pdf/.
[3] I. Clarke et al., “Freenet: a distributed anonymous information storage and retrieval
system,” In H. Federrath, editor, Designing Privacy Enhancing Technologies,
number 2009 in LNCS, pp. 46-66, Berkeley, CA, USA, July 2000.
[4] S. Ratnasamy et al, “Routing algorithm for DHTs: some open question,” In Proc.
First International Peer-to-Peer Workshop, pp. 45-52, 2002.
[5] J. Kim, Peer-to-Peer overlay networks,
http://ww2.cs.fsu.edu/ jungkkim/P2P.html
[6] J. Lu and J. Callan, “Content-based retrieval in hybrid peer-to-peer networks,”
CIKM’03, pp.199-206, New Orleans, Louisiana, USA, November 3-8, 2003.
[7] T. Inaba et al, “Design and implementation of an efficient search mechanism based
on the hybrid P2P model for ubiquitous computing systems,” Applications and the
Internet, 2006. SAINT 2006, pp. 45-53, 23-27 Jan. 2006.
[8] B. Liu et al, “Supporting complex multi-dimensional queries in P2P systems,” ICSCS’
05, pp. 155-164, 06-10 June 2005.
[9] J. Yang et al, “An efficient interest-group based search mechanism in unstructured
peer-to-peer networks,” ICCNMC’03, pp. 247-252, 20-23 Oct. 2003.
[10] D. A. Menasc´e, “Scalable P2P search,” Internet Computing, IEEE, vol. 7, issue 2,
pp. 83-87, March-April 2003.
[11] X. Li and J. Wu, “A hybrid searching scheme in unstructured P2P networks ,”
Proceeding of the 2005 International Conference on Parallel Processing (ICPP’05),
pp. 277-284, June 2005.
[12] D. Zeinalipour-Yazti et al, “Information retrieval techniques for peer-to-peer networks,”
the IEEE CS and the AIP, vol. 06, issue 4, pp. 20-26, July-Aug 2004.
[13] D. Tsoumakos and N. Roussopoulos, “Adaptive probabilistic search for peer-topeer
networks,”Peer-to-Peer Computing, 2003, pp. 102-109, 1-3 Sept. 2003.
[14] Y. Zhu et al, “Making search efficient on Gnutella-like P2P systems,” IPDPS’05,
pp. 56a-56a, 04-08 April 2005.
[15] T. Lin et al, “Search performance analysis and robust search algorithm in unstructured
peer-to-peer networks ,” CCGrid 2004, pp. 346-354, 19-22 April 2004.
[16] S. H. Kwok and K. Y. Chan, “An enhanced Gnutella P2P protocol: A search perspective,”
AINA’04, vol. 1, pp. 599-604, 2004.
[17] H. Zhang et al, “A multi-agent approach for peer-to-peer-based information
retrieval systems,” Proceedings of Third International Joint Conference on Autonomous
Agents and MultiAgent Systems, pp. 456-464. July 2004.
[18] W. M¨ uller and A. Henrich, “Fast retrieval of high dimensional feature vectors in
P2P networks using compact peer data summaries,” MIR’03, pp. 79-86 , Berkeley,
California, USA, November 7, 2003.
[19] W. M¨ uller et al, “Efficient content-based P2P image retrieval using peer content
descriptions,” Proceedings of the SPIE. vol. 5304, pp.57-68, 2003.
[20] I. King et al, “Distributed content-based visual information retrieval system on
peer-to-peer networks,” ACM Transactions on Information Systems, vol. 22, no. 3,
pp. 477-501, 2004.
[21] I. Lee and L. Guan, “A distributed content-based image retrieval system over the
peer-to-peer network,” IEEE conf. Upcoming Engineer, 2003.
[22] J.-J. Chen et al, “A dynamically adapted retrieval algorithm for multi-instance
image query with heterogeneous features,” to appear in IEEE Consumer Communications
& Networking 2004.
[23] J.-J. Chen and C.-Y. Liu, “A universal query mechanism for similarity retrieval
based on shape information in image databases,” IEEE Int. Conf. on Acoustics,
Speech, and Signal Processing, vol. 4, pp. 3676-3679, 2002.
[24] J.-J. Chen et al, “Similarity retrieval in image databases by boosted common
shape features among query images,” IEEE The 2nd Pacific-Rim Conference on
Multimedia, PCM 2001, pp. 285-292, Oct. 2001.
[25] Overview of the MPEG-7 Standard (version 7), ISO/IEC JTC1/SC29/WG11
N4674, March 2002.
[26] Z. Li and M. S. Drew, Fundamentals of Multimedia, New Jersey: Prentice Hall,
2004.
[27] M. Abdel-Mottaleb, S. Krishnamachari, “Multimedia descriptions based on
MPEG-7: extraction and applications,” IEEE Transactions on Multimedia, vol. 6,
issue 3, pp. 459-468, June 2004.
[28] Y. Liu et al, “Location awareness in unstructured peer-to-peer systems ,” IEEE
Transactions on Parallel and Distributed Systems, vol. 16, issue 2, pp. 163-174,
Feb. 2005.
[29] Y. Liu et al, “Approaching optimal peer-to-peer overlays ,” Proceedings of the 13th
IEEE International Symposium on Modeling, Analysis, and Simulation of Computer
and Telecommunication Systems,, pp. 407-414, Sept. 2005.