圖像檢索系統(tǒng)外文翻譯-預(yù)覽頁(yè)
【正文】 tem is installed on a desktop puter with an AMD Athlon XP 1800+ and 1 GB RAM running CentOS with Sun Java , Jakarta Tomcat and PostgreSQL installed. The memory usage of the VM is about 90 MB (this includes the memory used by Tomcat and our system). When the user does not enter any search text and the query object does not contain textbased features, a linear search over all the collection is performed. In this case, the search time depends mainly on the number of pared features and the distance functions used. Using all the features available in the system, the search time of the linear scan is about 20 seconds. Using only the RGB Histogram 333 and Euclidean distance, the search time of a linear scan is about 1 second. It is worth noting that the images features are retrieved from a file during the search and are not stored in main memory. Figure 2. The advanced search. When the user enters any search text or the query contains textbased features, the inverted file is used for retrieving the set of images that contain them. In this case, on average, the search time is reduced to less than a second. VI. CONCLUSIONS In this work, we presented a system that allows a bined search of textbased and contentbased features on a sample of more than 115,000 images of Flickr obtained from the SAPIR collection. We are evaluating the inclusion of the M3tree [2] into the system as an indexing structure for dynamic binations of metric distances. ACKNOWLEDGMENT This work was partially supported by FONDECYT (Chile) Project 11070037. REFERENCES [1] R. A. BaezaYates and B. RibeiroNeto. “Modern Information Retrieval”. AddisonWesley Longman Publishing Co., Inc., Boston, MA, USA, 1999. [2] B. Bustos and T. Skopal. “Dynamic similarity search in multimetric spaces”. In Proc. 8th ACM SIGMM International Workshop on Multimedia Information Retrieval (MIR’06), pages 137–146. ACM Press, 2020. [3] F. Falchi, M. Kacimi, Y. Mass, F. Rabitti, and P. Zezula. “SAPIR: Scalable and distributed image searching”. In SAMT (Posters and Demos), vol. 300 of CEUR Workshop Proceedings, pages 11–12, Genoa, Italy, November 2020. [4] M. F. Porter. “An algorithm for suffix stripping”. Program, 14(3):130137, July 1980. martin/PorterStemmer/
公司管理相關(guān)推薦
鄂ICP備17016276號(hào)-1