Name
Abstract | ||
|---|---|---|
Binary codes that are binarizations of features represented by real numbers have recently been used in the object recognition field, in order to achieve reduced memory and robustness with respect to noise. However, binarizing features represented by real numbers has a problem in that a great deal of the information within the features drops out. That is why we focus on quantization residual, which is information that drops out when features are binarized. With this study, we introduce a transition likelihood model into classifiers, in order to take into consideration the possibility that a binary code which has been observed from an image will transition to another binary code. This enables classifications that consider transitions to the desired binary code, even if the observed binary code differs from the actually desired binary code for some reason. From the results of experiments, we confirmed that the proposed method enables an increase in detection performance while maintaining the same levels of memory and computing costs as those for previous methods of binarizing features. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ACPR.2013.82 | ACPR |
Keywords | DocType | Citations |
detection performance,image coding,binarizing feature,binary code,computing cost,real number,previous method,great deal,transition likelihood model,likelihood model,classifier introducing transition,image classification,quantization residual,observed binary code,classifiers,binary codes,human detection,object recognition field | Conference | 0 |
PageRank | References | Authors |
0.34 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuji Yamauchi | 1 | 43 | 10.45 |
| Takeo Kanade | 2 | 25073 | 4203.02 |
| fujiyoshi | 3 | 730 | 101.43 |