FAST IMAGE MATCHING IN HUGE DATABASE
Nidhal K. El Abbadi1 & Lamis Al Saadi2 Show affiliations
- University of Kufa, Iraq
- University of Babylon, Iraq
Journal of Computer Science, Volume 10, Issue 8, pp. 1488–1496 · doi.org/10.3844/jcssp.2014.1488.1496
Abstract
In today’s multimedia age, images are becoming more and more common in various fields. Database is an area that has found extensive use of images in past few years. With the increased usage of image data, the need to search and matching images efficiently and accurately from a large image database or a cluster of images databases has increased. Image search has become a popular feature in many search engines, including Google, Yahoo!, MSN, etc., majority of which use very little, if any, image information. In this study we introduced a novel algorithm for searching for image in huge database based on SVD, the proposed algorithm solved some of the other searching algorithms problems, like problems of image scaling, image rotation, search time. The contribution of this algorithm is to retrieve the exact image and/or the image with different view or captured in different time with fixed time regardless the database size, database can be indexed according to the Suggested Values extracted from SVD. The proposed algorithm gives high performance and solved many issues related to other image search algorithms.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2014 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Abbadi, N. K. E. & Saadi, L. A. (2014). FAST IMAGE MATCHING IN HUGE DATABASE. Journal of Computer Science, 10(8), 1488–1496. https://doi.org/10.3844/jcssp.2014.1488.1496
- Licence
- © Science Publications
- Issue
- Volume 10, Issue 8
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
