On the occurrence probability of local binary patterns: a theoretical study
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3900666 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 1465025 (Why is no real title available?)
- scientific article; zbMATH DE number 3228255 (Why is no real title available?)
- scientific article; zbMATH DE number 3078984 (Why is no real title available?)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Computing the Continuous Discretely
- Dominant Local Binary Patterns for Texture Classification
- Effective lattice point counting in rational convex polytopes
- Fabric defect detection using modified local binary patterns
- Local binary patterns for a hybrid fingerprint matcher
- The Ehrhart polynomial of a lattice polytope
- The Uniform Distribution as a Universal Prior
- The many aspects of counting lattice points in polytopes
- polymake: a framework for analyzing convex polytopes
Cited in
(2)
This page was built for publication: On the occurrence probability of local binary patterns: a theoretical study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932861)