A novel shape descriptor: Intersection consistency histograms Yeni bir ş ekil betimleyici: Kesişimlerin tutarlilǐgi histogram

Date

2013-04-26

Author

Sivri, Erdal
Kalkan, Sinan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

62
views

0
downloads

In this paper, we propose a novel shape descriptor, called Intersection Consistency Histogram (ICH), which is based on a local regularity measure called Intersection Consistency (IC). Comparing with some widely-used state-of-the-art methods in the literature, we show that ICH performs comparable on several widely-used databases.

Subject Keywords

Histograms, Shape, Pattern recognition, Transform coding, Computer vision, Integrated circuits, Visualization

URI

https://hdl.handle.net/11511/41746

DOI

https://doi.org/10.1109/siu.2013.6531579

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Improving search result clustering by integrating semantic information from Wikipedia Çallı, Çağatay; Üçoluk, Göktürk; Şehitoğlu, Onur Tolga; Department of Computer Engineering (2010) Suffix Tree Clustering (STC) is a search result clustering (SRC) algorithm focused on generating overlapping clusters with meaningful labels in linear time. It showed the feasibility of SRC but in time, subsequent studies introduced description-first algorithms that generate better labels and achieve higher precision. Still, STC remained as the fastest SRC algorithm and there appeared studies concerned with different problems of STC. In this thesis, semantic relations between cluster labels and documents ar...
Towards finding optimal mixture of subspaces for data classification Musa, Mohamed Elhafiz Mustafa; Atalay, Mehmet Volkan; Department of Computer Engineering (2003) In pattern recognition, when data has different structures in different parts of the input space, fitting one global model can be slow and inaccurate. Learning methods can quickly learn the structure of the data in local regions, consequently, offering faster and more accurate model fitting. Breaking training data set into smaller subsets may lead to curse of dimensionality problem, as a training sample subset may not be enough for estimating the required set of parameters for the submodels. Increasing the ...
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...
Using social graphs in one-class collaborative filtering problem Kaya, Hamza; Alpaslan, Ferda Nur; Department of Computer Engineering (2009) One-class collaborative filtering is a special type of collaborative filtering methods that aims to deal with datasets that lack counter-examples. In this work, we introduced social networks as a new data source to the one-class collaborative filtering (OCCF) methods and sought ways to benefit from them when dealing with OCCF problems. We divided our research into two parts. In the first part, we proposed different weighting schemes based on social graphs for some well known OCCF algorithms. One of the weig...
Veri Analizi Araçları Kullanarak Eklemli Şekilleri Şekil Bileşenlerini Bulmadan Temsil Etme Genctav, Aslı; Tarı, Zehra Sibel (null; 2018-11-08) In this work, we propose a new representation for articulated shapes, which does not involve extracting shape components. We first form a high -dimensional feature space by collecting local shape information from each shape point and then perform data analysis to measure the distinctness of each shape point from the remaining points. The obtained distinctness values encode both local and global shape information. We represent shapes via histograms of the distinctness values...

Citation Formats

E. Sivri and S. Kalkan, “A novel shape descriptor: Intersection consistency histograms Yeni bir ş ekil betimleyici: Kesişimlerin tutarlilǐgi histogram,” 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41746.