{"title":"随机分解森林","authors":"Chun-Han Chien, Hwann-Tzong Chen","doi":"10.1109/ACPR.2013.97","DOIUrl":null,"url":null,"abstract":"We present an effective image representation based on a new tree-structured coding technique called `random decomposition forests' (RDFs). Our method combines the merits of visual-word representations and random forests. The proposed RDF is able to decompose a local descriptor into multiple sets of visual words in a recursive and randomized manner. We show that, when combined with standard multiscale and spatial pooling strategies, the code vectors generated by RDF yield a powerful representation for image categorization. We are able to achieve state-of-the-art performance on several popular benchmark datasets.","PeriodicalId":365633,"journal":{"name":"2013 2nd IAPR Asian Conference on Pattern Recognition","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Random Decomposition Forests\",\"authors\":\"Chun-Han Chien, Hwann-Tzong Chen\",\"doi\":\"10.1109/ACPR.2013.97\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an effective image representation based on a new tree-structured coding technique called `random decomposition forests' (RDFs). Our method combines the merits of visual-word representations and random forests. The proposed RDF is able to decompose a local descriptor into multiple sets of visual words in a recursive and randomized manner. We show that, when combined with standard multiscale and spatial pooling strategies, the code vectors generated by RDF yield a powerful representation for image categorization. We are able to achieve state-of-the-art performance on several popular benchmark datasets.\",\"PeriodicalId\":365633,\"journal\":{\"name\":\"2013 2nd IAPR Asian Conference on Pattern Recognition\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 2nd IAPR Asian Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACPR.2013.97\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 2nd IAPR Asian Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACPR.2013.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present an effective image representation based on a new tree-structured coding technique called `random decomposition forests' (RDFs). Our method combines the merits of visual-word representations and random forests. The proposed RDF is able to decompose a local descriptor into multiple sets of visual words in a recursive and randomized manner. We show that, when combined with standard multiscale and spatial pooling strategies, the code vectors generated by RDF yield a powerful representation for image categorization. We are able to achieve state-of-the-art performance on several popular benchmark datasets.