{"title":"病毒:图像检索使用形状","authors":"Meirav Adoram, M. Lew","doi":"10.1109/MMCS.1999.778552","DOIUrl":null,"url":null,"abstract":"Finding shapes in image databases is a challenging topic in content based retrieval. In this paper the goal is to find database images which contain shapes similar to the query of the user. Unlike most solutions to this problem, the algorithm presented in this paper is meant to cope with changes in rotation, scale, translation, and lossy compression noise. A Java application was built which uses snakes and invariant moments. The GVF snake was used because it has two significant advantages over the traditional snake formulation. First, the GVF snake can fit into concavities, and second, the GVF snake can fit itself to objects using both expansion and contraction of the snake. The objects in the images were segmented with the active contours, and then invariant moments were calculated and compared with a minimum distance classifier. Retrieval quality of the system was measured with respect to original images, rotated images, scaled images, noisy images, and combinations of those distortions.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"23 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"IRUS: image retrieval using shape\",\"authors\":\"Meirav Adoram, M. Lew\",\"doi\":\"10.1109/MMCS.1999.778552\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finding shapes in image databases is a challenging topic in content based retrieval. In this paper the goal is to find database images which contain shapes similar to the query of the user. Unlike most solutions to this problem, the algorithm presented in this paper is meant to cope with changes in rotation, scale, translation, and lossy compression noise. A Java application was built which uses snakes and invariant moments. The GVF snake was used because it has two significant advantages over the traditional snake formulation. First, the GVF snake can fit into concavities, and second, the GVF snake can fit itself to objects using both expansion and contraction of the snake. The objects in the images were segmented with the active contours, and then invariant moments were calculated and compared with a minimum distance classifier. Retrieval quality of the system was measured with respect to original images, rotated images, scaled images, noisy images, and combinations of those distortions.\",\"PeriodicalId\":408680,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Multimedia Computing and Systems\",\"volume\":\"23 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Conference on Multimedia Computing and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMCS.1999.778552\",\"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 IEEE International Conference on Multimedia Computing and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMCS.1999.778552","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finding shapes in image databases is a challenging topic in content based retrieval. In this paper the goal is to find database images which contain shapes similar to the query of the user. Unlike most solutions to this problem, the algorithm presented in this paper is meant to cope with changes in rotation, scale, translation, and lossy compression noise. A Java application was built which uses snakes and invariant moments. The GVF snake was used because it has two significant advantages over the traditional snake formulation. First, the GVF snake can fit into concavities, and second, the GVF snake can fit itself to objects using both expansion and contraction of the snake. The objects in the images were segmented with the active contours, and then invariant moments were calculated and compared with a minimum distance classifier. Retrieval quality of the system was measured with respect to original images, rotated images, scaled images, noisy images, and combinations of those distortions.