Weight-Optimal Local Binary Patterns
Abstract
In this work, we have proposed a learning paradigm for obtaining weight-optimal local binary patterns (WoLBP). We first re-formulate the LBP problem into matrix multiplication with all the bitmaps flattened and then resort to the Fisher ratio criterion for obtaining the optimal weight matrix for LBP encoding. The solution is closed form and can be easily solved using one eigen-decomposition. The experimental results on the FRGC ver2.0 database have shown that the WoLBP gains significant performance improvement over traditional LBP, and such WoLBP learning procedure can be directly ported to many other LBP variants to further improve their performances.
Cite
Text
Juefei-Xu and Savvides. "Weight-Optimal Local Binary Patterns." European Conference on Computer Vision Workshops, 2014. doi:10.1007/978-3-319-16181-5_11Markdown
[Juefei-Xu and Savvides. "Weight-Optimal Local Binary Patterns." European Conference on Computer Vision Workshops, 2014.](https://mlanthology.org/eccvw/2014/juefeixu2014eccvw-weightoptimal/) doi:10.1007/978-3-319-16181-5_11BibTeX
@inproceedings{juefeixu2014eccvw-weightoptimal,
title = {{Weight-Optimal Local Binary Patterns}},
author = {Juefei-Xu, Felix and Savvides, Marios},
booktitle = {European Conference on Computer Vision Workshops},
year = {2014},
pages = {148-159},
doi = {10.1007/978-3-319-16181-5_11},
url = {https://mlanthology.org/eccvw/2014/juefeixu2014eccvw-weightoptimal/}
}