Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Global Binary Patterns: A Novel Shape Descriptor
Date
2013-05-23
Author
Erdal, Sivri
Kalkan, Sinan
Metadata
Show full item record
Item Usage Stats
99
views
0
downloads
Cite This
In this paper, we propose a novel shape descriptor, called Global Binary Patterns (GBP), based on interpreting intensity values along a direction in an image as binary numbers, converting these binary numbers to their decimal values and concatenating these decimal values as the elements of a vector that is the GBP representation of the shape. Comparing with some widelyused state-of-the-art methods in the literature, we show that GBP is very fast and its performance on several widely-used databases is comparable or better.
URI
https://hdl.handle.net/11511/85394
http://kovan.ceng.metu.edu.tr/~sinan/publications/MVA13_Sivri.pdf
http://www.mva-org.jp/Proceedings/2013USB/papers/06-04.pdf
Conference Name
Int. IAPR Conference on Machine Vision and Applications, (20 - 23 Mayıs 2013)
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Waterfall region analysis for iterative decoding
Yılmaz, Ali Özgür (2004-12-01)
Finite length analysis of iterative decoders can be done by using probabilistic models based on EXIT charts. The validity of these models will be investigated by checking the performance of iterative decoding under various scenarios.
Galois structure of modular forms of even weight
Gurel, E. (Elsevier BV, 2009-10-01)
We calculate the equivariant Euler characteristics of powers of the canonical sheaf on certain modular curves over Z which have a tame action of a finite abelian group. As a consequence, we obtain information on the Galois module structure of modular forms of even weight having Fourier coefficients in certain ideals of rings of cyclotomic algebraic integers. (c) 2009 Elsevier Inc. All rights reserved.
Continuous dimensionality characterization of image structures
Felsberg, Michael; Kalkan, Sinan; Kruger, Norbert (Elsevier BV, 2009-05-04)
Intrinsic dimensionality is a concept introduced by statistics and later used in image processing to measure the dimensionality of a data set. In this paper, we introduce a continuous representation of the intrinsic dimension of an image patch in terms of its local spectrum or, equivalently, its gradient field. By making use of a cone structure and barycentric co-ordinates, we can associate three confidences to the three different ideal cases of intrinsic dimensions corresponding to homogeneous image patche...
BenchMetrics: a systematic benchmarking method for binary classification performance metrics
Canbek, Gurol; Taşkaya Temizel, Tuğba; SAĞIROĞLU, ŞEREF (2021-08-01)
This paper proposes a systematic benchmarking method called BenchMetrics to analyze and compare the robustness of binary classification performance metrics based on the confusion matrix for a crisp classifier. BenchMetrics, introducing new concepts such as meta-metrics (metrics about metrics) and metric space, has been tested on fifteen well-known metrics including balanced accuracy, normalized mutual information, Cohen's Kappa, and Matthews correlation coefficient (MCC), along with two recently proposed me...
Some new results on binary polynomial multiplication
Cenk, Murat (2015-11-01)
This paper presents several methods for reducing the number of bit operations for multiplication of polynomials over the binary field. First, a modified Bernstein's 3-way algorithm is introduced, followed by a new 5-way algorithm. Next, a new 3-way algorithm that improves asymptotic arithmetic complexity compared to Bernstein's 3-way algorithm is introduced. This new algorithm uses three multiplications of one-third size polynomials over the binary field and one multiplication of one-third size polynomials ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Erdal and S. Kalkan, “Global Binary Patterns: A Novel Shape Descriptor,” Kyoto, Japonya, 2013, vol. 1, p. 169, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/85394.