Abstract
Local binary pattern histograms have proved very successful texture descriptors. Despite this success, the description procedure bears some drawbacks that are still lacking solutions in the literature. One of the problems arises when the number of extractable local patterns reduces while their dimension increases rendering the output histogram descriptions sparse and unstable, finally showing up as a reduced recognition rate. A smoothing method based on kernel density estimation was recently proposed as a means to tackle the aforementioned problem. A constituent part of the method is to determine how much to smooth a histogram. Previously, this was solved via trial-and-error in a problem-specific manner. In this paper, the goal is to present data-driven methods to determine this smoothing automatically. In the end, we present unsupervised and supervised methods for the given task and validate their performance with a representative set of local binary pattern variants in texture analysis problems covering material categorization and face recognition.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
