Joint Utilization of Appearance, Geometry and Chance for Scene Logo Retrieval

Soysal, Medeni
Alatan, Abdullah Aydın
A novel approach involving the comparison of appearance and geometrical similarity of local patterns via a combined description is presented. Candidate groups of interest points are identified based on unlikeliness of being matched by chance. For each of the keypoints in these groups, a novel description is proposed. This description utilizes quantized appearance descriptors of interest points to avoid the necessity of matching each test descriptor to each template descriptor. Additionally, one-to-many matching is possible in contrast to its counterparts in the literature. Geometrical descriptions are based on multiple small groups of points, namely quads, in barycentric coordinates, instead of a single large group that is susceptible to partial transformations. These advantages render the proposed algorithm robust to significant appearance changes, especially due to affine transformations, while being resistant to random false matches through simultaneous utilization of geometrical part of the descriptor. This generic, robust template matching technique is evaluated in an application of scene logo retrieval.


Video Shot Boundary Detection by Graph-theoretic Dominant Sets Approach
Asan, Emrah; Alatan, Abdullah Aydın (2009-09-16)
We present a video shot boundary detection algorithm based on the novel graph theoretic concept, namely dominant sets. Dominant sets are defined as a set of the nodes in a graph, mostly similar to each other and dissimilar to the others. In order to achieve this goal, candidate shot boundaries are determined by using simply pixelwise differences between consequent frames. For each candidate position, a testing sequence is constructed by considering 4 frames before the candidate position and 2 frames after t...
Clustering frequent navigation patterns from website logs using ontology and temporal information
Kılıç, Sefa; Karagöz, Pınar; Toroslu, İsmail Hakkı; Department of Computer Engineering (2011)
Given set of web pages labeled with ontological items, the level of similarity between two web pages is measured using the level of similarity between ontological items of pages labeled with. Using similarity measure between two pages, degree of similarity between two sequences of web page visits can be calculated as well. Using clustering algorithms, similar frequent sequences are grouped and representative sequences are selected from these groups. A new sequence is compared with all clusters and it is ass...
Optimum design of grillage systems using harmony search algorithm
Erdal, Ferhat; Saka, Mehmet Polat; Department of Engineering Sciences (2007)
Harmony search method based optimum design algorithm is presented for the grillage systems. This numerical optimization technique imitates the musical performance process that takes place when a musician searches for a better state of harmony. For instance, jazz improvisation seeks to find musically pleasing harmony similar to the optimum design process which seeks to find the optimum solution. The design algorithm considers the displacement and strength constraints which are implemented from LRFD-AISC (Loa...
Context-sensitive matching of two shapes
Başeski, Emre; Tarı, Zehra Sibel; Department of Computer Engineering (2006)
The similarity between two shapes is typically calculated by measuring how well the properties and the spatial organization of the primitives forming the shapes agree. But, when this calculations are done independent from the context, i.e. the whole set of shapes in the experiments, a priori significance to the primitives is assigned, which may cause problematic similarity measures. A possible way of using context information in similarity measure between shape A and shape B is using the category informatio...
Parallel Scalable PDE Constrained Optimization Antenna Identification in Hyperthermia Cancer Treatment Planning
SCHENK, Olaf; Manguoğlu, Murat; CHRİSTEN, Matthias; SATHE, Madan (Springer Science and Business Media LLC, 2009-01-01)
We present a PDE-constrained optimization algorithm which is designed for parallel scalability on distributed-memory architectures with thousands of cores. The method is based on a line-search interior-point algorithm for large-scale continuous optimization, it is matrix-free in that it does not require the factorization of derivative matrices. Instead, it uses a new parallel and robust iterative linear solver on distributed-memory architectures. We will show almost linear parallel scalability results for t...
Citation Formats
M. Soysal and A. A. Alatan, “Joint Utilization of Appearance, Geometry and Chance for Scene Logo Retrieval,” COMPUTER JOURNAL, pp. 1221–1231, 2011, Accessed: 00, 2020. [Online]. Available: