@inproceedings{xin2010novel,
abstract = {An image could be described with local features like SIFT and with those features, images could be represented as "Bag-of-Visual-Words"(BVW). This representation has been widely used in content based image retrieval. Comparing BVW of two images is usually done in Euclidean space, like Euclidean distance or weighted variants. Neither of these methods consider the inter cluster relations. If there is a feature in one image without any match in all the clusters of another image's features, there will be no score for that feature. But, there are still some match in neighbor clusters. In this paper, we use dynamic programming to calculate full inter cluster distance map and with the distance, we can evaluate a feature in neighbor clusters. Our proposed method is evaluated in Caltech 101 database and experiments show that our method generally exceeds the method that don't consider inter cluster distance. {\textcopyright} 2010 IEEE.},
author = {Xin, Xin and Katsaggelos, Aggelos K.},
booktitle = {2010 IEEE International Conference on Image Processing},
doi = {10.1109/ICIP.2010.5651817},
isbn = {978-1-4244-7992-4},
issn = {15224880},
keywords = {Bag of visual word,Dynamic programming,ISOMAP,Image retrieval},
month = {sep},
organization = {IEEE},
pages = {3213--3216},
publisher = {IEEE},
title = {{A novel image retrieval framework exploring inter cluster distance}},
url = {http://ieeexplore.ieee.org/document/5651817/},
year = {2010}
}

{"_id":"eAJgAaLX5dYLeJdhM","bibbaseid":"xin-katsaggelos-anovelimageretrievalframeworkexploringinterclusterdistance-2010","author_short":["Xin, X.","Katsaggelos, A. K."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"An image could be described with local features like SIFT and with those features, images could be represented as \"Bag-of-Visual-Words\"(BVW). This representation has been widely used in content based image retrieval. Comparing BVW of two images is usually done in Euclidean space, like Euclidean distance or weighted variants. Neither of these methods consider the inter cluster relations. If there is a feature in one image without any match in all the clusters of another image's features, there will be no score for that feature. But, there are still some match in neighbor clusters. In this paper, we use dynamic programming to calculate full inter cluster distance map and with the distance, we can evaluate a feature in neighbor clusters. Our proposed method is evaluated in Caltech 101 database and experiments show that our method generally exceeds the method that don't consider inter cluster distance. © 2010 IEEE.","author":[{"propositions":[],"lastnames":["Xin"],"firstnames":["Xin"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos","K."],"suffixes":[]}],"booktitle":"2010 IEEE International Conference on Image Processing","doi":"10.1109/ICIP.2010.5651817","isbn":"978-1-4244-7992-4","issn":"15224880","keywords":"Bag of visual word,Dynamic programming,ISOMAP,Image retrieval","month":"sep","organization":"IEEE","pages":"3213–3216","publisher":"IEEE","title":"A novel image retrieval framework exploring inter cluster distance","url":"http://ieeexplore.ieee.org/document/5651817/","year":"2010","bibtex":"@inproceedings{xin2010novel,\nabstract = {An image could be described with local features like SIFT and with those features, images could be represented as \"Bag-of-Visual-Words\"(BVW). This representation has been widely used in content based image retrieval. Comparing BVW of two images is usually done in Euclidean space, like Euclidean distance or weighted variants. Neither of these methods consider the inter cluster relations. If there is a feature in one image without any match in all the clusters of another image's features, there will be no score for that feature. But, there are still some match in neighbor clusters. In this paper, we use dynamic programming to calculate full inter cluster distance map and with the distance, we can evaluate a feature in neighbor clusters. Our proposed method is evaluated in Caltech 101 database and experiments show that our method generally exceeds the method that don't consider inter cluster distance. {\\textcopyright} 2010 IEEE.},\nauthor = {Xin, Xin and Katsaggelos, Aggelos K.},\nbooktitle = {2010 IEEE International Conference on Image Processing},\ndoi = {10.1109/ICIP.2010.5651817},\nisbn = {978-1-4244-7992-4},\nissn = {15224880},\nkeywords = {Bag of visual word,Dynamic programming,ISOMAP,Image retrieval},\nmonth = {sep},\norganization = {IEEE},\npages = {3213--3216},\npublisher = {IEEE},\ntitle = {{A novel image retrieval framework exploring inter cluster distance}},\nurl = {http://ieeexplore.ieee.org/document/5651817/},\nyear = {2010}\n}\n","author_short":["Xin, X.","Katsaggelos, A. K."],"key":"xin2010novel","id":"xin2010novel","bibbaseid":"xin-katsaggelos-anovelimageretrievalframeworkexploringinterclusterdistance-2010","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/5651817/"},"keyword":["Bag of visual word","Dynamic programming","ISOMAP","Image retrieval"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["KTWAakbPXLGfYseXn","ePKPjG8C6yvpk4mEK","ya2CyA73rpZseyrZ8","37Qfzv6wRptYkoSCL","zFPgsTDAW8aDnb5iN","E6Bth2QB5BYjBMZE7","nbnEjsN7MJhurAK9x","PNQZj6FjzoxxJk4Yi","7FpDWDGJ4KgpDiGfB","bod9ms4MQJHuJgPpp","QR9t5P2cLdJuzhfzK","D8k2SxfC5dKNRFgro","7Dwzbxq93HWrJEhT6","qhF8zxmGcJfvtdeAg","fvDEHD49E2ZRwE3fb","H7crv8NWhZup4d4by","DHqokWsryttGh7pJE","vRJd4wNg9HpoZSMHD","sYxQ6pxFgA59JRhxi","w2WahSbYrbcCKBDsC","XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":["bag of visual word","dynamic programming","isomap","image retrieval"],"search_terms":["novel","image","retrieval","framework","exploring","inter","cluster","distance","xin","katsaggelos"],"title":"A novel image retrieval framework exploring inter cluster distance","year":2010}