LBP and irregular graph pyramids
In this paper, a new codification of Local Binary Patterns (LBP) is given using graph pyramids. The LBP code characterizes the topological category (local max, min, slope, saddle) of the gray level landscape around the center region. Given a 2D grayscale image I, our goal is to obtain a simplified i...
| Autores: | , , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/30935 |
| Acceso en línea: | http://hdl.handle.net/11441/30935 https://doi.org/10.1007/978-3-319-23117-4_59 |
| Access Level: | acceso abierto |
| Palabra clave: | Local binary patterns Irregular graph pyramid Primal and dual graph Topological characterization Minimum contrast algorithm |
| Sumario: | In this paper, a new codification of Local Binary Patterns (LBP) is given using graph pyramids. The LBP code characterizes the topological category (local max, min, slope, saddle) of the gray level landscape around the center region. Given a 2D grayscale image I, our goal is to obtain a simplified image which can be seen as “minimal” representation in terms of topological characterization of I. For this, a method is developed based on merging regions and Minimum Contrast Algorithm. |
|---|