Please use this identifier to cite or link to this item:
https://doi.org/10.1007/978-3-642-37484-5_41
DC Field | Value | |
---|---|---|
dc.title | Beyond spatial pyramid matching: Spatial soft voting for image classification | |
dc.contributor.author | Yamasaki T. | |
dc.contributor.author | Chen T. | |
dc.date.accessioned | 2018-08-21T04:56:24Z | |
dc.date.available | 2018-08-21T04:56:24Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Yamasaki T., Chen T. (2013). Beyond spatial pyramid matching: Spatial soft voting for image classification. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7729 LNCS (PART 2) : 506-519. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-37484-5_41 | |
dc.identifier.isbn | 9783642374838 | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/146107 | |
dc.description.abstract | Recently, spatial partitioning approaches such as spatial pyramid matching (SPM) are commonly used in image classification to collect the global and local features of the images. They divide the input image into small sub-regions (typically in a hierarchical manner) and generate a feature vector for each of them. Although the codes for the descriptors are assigned softly in modern image feature representation techniques, the codes must fall into only a single sub-region when forming the feature vector. In other words, the soft code assignment is used in the descriptor space but the codes are still "hard" voted from the view point of the image space. This paper proposes a spatial soft voting method, in which the existence of the codes are expressed by a Gaussian function and the maps of the existence are sampled to form a feature vector. The generated feature vectors are "soft" both in the descriptor space and the image space. In addition, extra computational cost as compared to SPM is negligibly small. The concept of the spatial soft voting is general and can be applied to most hard spatial partitioning approaches. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | OFFICE OF THE PROVOST | |
dc.contributor.department | DEPARTMENT OF COMPUTER SCIENCE | |
dc.description.doi | 10.1007/978-3-642-37484-5_41 | |
dc.description.sourcetitle | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
dc.description.volume | 7729 LNCS | |
dc.description.issue | PART 2 | |
dc.description.page | 506-519 | |
dc.published.state | published | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.