{"title":"多媒体数据库中基于内容的检索算法","authors":"V. Gudivada, Gwang S. Jung","doi":"10.1109/MMCS.1996.534974","DOIUrl":null,"url":null,"abstract":"Proposes a linear-time algorithm, referred to as SIM/sub vs/, for processing spatial similarity queries in multimedia databases. SIM/sub vs/ computes the degree to which the spatial relationships among the objects in a database image conform to those specified in the query. SIM/sub vs/ recognizes translation, scale and rotation variants of an image, and variants generated by an arbitrary composition of translation, scale and rotation transformations. The performance of SIM/sub vs/ is compared with those of two previously-known algorithms using a testbed image collection. This comparison demonstrates that SIM/sub vs/ is not only more efficient but performs as well as or better than the other algorithms.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"An algorithm for content-based retrieval in multimedia databases\",\"authors\":\"V. Gudivada, Gwang S. Jung\",\"doi\":\"10.1109/MMCS.1996.534974\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Proposes a linear-time algorithm, referred to as SIM/sub vs/, for processing spatial similarity queries in multimedia databases. SIM/sub vs/ computes the degree to which the spatial relationships among the objects in a database image conform to those specified in the query. SIM/sub vs/ recognizes translation, scale and rotation variants of an image, and variants generated by an arbitrary composition of translation, scale and rotation transformations. The performance of SIM/sub vs/ is compared with those of two previously-known algorithms using a testbed image collection. This comparison demonstrates that SIM/sub vs/ is not only more efficient but performs as well as or better than the other algorithms.\",\"PeriodicalId\":371043,\"journal\":{\"name\":\"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMCS.1996.534974\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMCS.1996.534974","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An algorithm for content-based retrieval in multimedia databases
Proposes a linear-time algorithm, referred to as SIM/sub vs/, for processing spatial similarity queries in multimedia databases. SIM/sub vs/ computes the degree to which the spatial relationships among the objects in a database image conform to those specified in the query. SIM/sub vs/ recognizes translation, scale and rotation variants of an image, and variants generated by an arbitrary composition of translation, scale and rotation transformations. The performance of SIM/sub vs/ is compared with those of two previously-known algorithms using a testbed image collection. This comparison demonstrates that SIM/sub vs/ is not only more efficient but performs as well as or better than the other algorithms.