A fast image classification algorithm using Support Vector Machine

ICCTD 2010 - 2010 2nd International Conference on Computer Technology and Development, Proceedings

Volumn , Issue , 2010, Pages 385-388

  Zhao, Dequn ^a   Zou, Weiwei ^a   Sun, GuangMin ^a  

^a BEIJING UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Direct push type; Information retrieval; Support vector machine

Indexed keywords

CLASSIFICATION ALGORITHM; CONTENT BASED IMAGE RETRIEVAL; DIRECT-PUSH; EFFECTIVE PERFORMANCE; HIGH LEVEL SEMANTICS; IMAGE CLASSIFICATION ALGORITHMS; IMAGE INFORMATION; INTERNET TECHNOLOGY; LABELING EFFECTS; LOW-LEVEL FEATURES; MULTIMEDIA INFORMATION; PROCESS IMPROVEMENT; RETRIEVAL TECHNOLOGY; SCREENING PROCESS; SUPPORT VECTOR MACHINE ALGORITHM; TIME COMPLEXITY; VIDEO INFORMATION; VISUAL INFORMATION;

ALGORITHMS; CLASSIFIERS; SEMANTICS; SUPPORT VECTOR MACHINES; TECHNOLOGY; VECTORS;

IMAGE RETRIEVAL;

EID: 78650593291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCTD.2010.5645823     Document Type: Conference Paper

References (18)

1. Adamic LA, Lukose RM, Puniyani AR, Huberman BA (2001) Search in power law networks. Phys Rev 64 046135-046131-046135-046138.
2. Yang B, Garcia-Molina H (2002) Efficient search in peer-to-peer networks. International Conference on Distributed Computing Systems, Vienna.
3. Li X, Wu J (2005) A hybrid searching scheme in unstructured P2P networks. International Conference on Parallel Processing, Oslo.
4. Lv Q, Cao P, Cohen E, Li K, Shenker S (2002) Search and replication in unstructured peer-to-peer networks. ACM SIGMETRICS, Marina Del Rey.
5. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM, San Diego.
6. Antonopoulos N, Exarchakos G (2007) G-ROME: A semantic driven model for capacity sharing among P2P networks. J Internet Res 17 7-20.
7. Salter J, Antonopoulos N (2007) An optimised 2-Tier P2P architecture for contextualised keyword searches. Future Gener Comp Sy 23:241-251.
8. Rowstron A, Druschel P (2001) Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg.
9. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. ACM SIGCOMM, San Diego.
10. Li J, Stribling J, Morris R, Kaashoek MF (2005) Bandwidthefficient management of DHT routing tables. 2nd Symposium on Networked Systems Design and Implementation, Boston.
11. Maymounkov P, Mazi'eres D (2002) Kademlia: A peer to peer information system based on the XOR metric. Internation Workshop on Peer-to-Peer Systems, Cambridge.
12. Rhea S, Geels D, Roscoe T, Kubiatowicz J (2004) Handling chum in a DHT. USENIX Annual Technical Conference, Boston.
13. Vuong S, Li J (2003) Efa: an Efficient content routing algorithm in large peer-to-peer overlay networks. International Conference on Peer-to-Peer Computing, Linkoping.
14. Liu L, Antonopoulos N, Mackin S (2007) Fault-tolerant peer-topeer search on small-world networks. Future Gener Comp Sy 23 921-931.
15. Liu L, Antonopoulos N, Mackin S (2007) Small world peer-to-peer for resource discovery. International Conference on Information Networking, Lecture Notes in Computer Science, Estoril, Portugal.
16. Li J, Vuong S (2004) An efficient clustered architecture for P2P networks. 18th International Conference on Advanced Information Networking and Application, Fukuoka.
17. Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making gnutella-like P2P system scalable. ACM SIGCOMM, Karlsruhe.
18. Xiao L, Liu Y, Ni LM (2005) Improving unstructured peer-to-peer systems by adaptive connection establishment. IEEE Trans Comp 54:176-18.