Abstract
Over the years, coding—in its broadest definition—has proven a crucial step in visual recognition systems [4, 7]. Many techniques have been investigated, such as bag of words [1, 9, 16, 18, 19, 31], sparse coding [21, 34], and locality-based coding[33, 35]. All these techniques follow a similar flow: Given a dictionary of code words, a query is associated to one or multiple dictionary elements with different weights (i.e. let@tokeneonedot, binary or real). These weights, or codes, act as the new representation for the query and serve as input to a classifier (i.e., support vector machine (SVM)) after an optional pooling step.
| Original language | English |
|---|---|
| Title of host publication | Riemannian Computing in Computer Vision |
| Editors | Pavan K. Turaga, Anuj Srivastava |
| Place of Publication | Cham Switzerland |
| Publisher | Springer |
| Chapter | 16 |
| Pages | 345-361 |
| Number of pages | 17 |
| ISBN (Electronic) | 9783319229577 |
| ISBN (Print) | 9783319229560 |
| DOIs | |
| Publication status | Published - 2016 |
| Externally published | Yes |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver