A matching algorithm based on Godel coding scheme

Date

2000-01-28

Author

Dicle, N
Atalay, Mehmet Volkan

Metadata

Show full item record

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

Item Usage Stats

70
views

0
downloads

We describe an algorithm for the correspondence of line features between two consecutive images. The algorithm is based on Godel coding of the features and singular value decomposition. First, line segments are extracted by Canny operator followed by the end-point-fit method. Line segments are represented by coordinates of midpoints and the angle of a perpendicular line from a reference point. Then, a proximity matrix is constructed following the minimal mapping theory of Ullman. Thus if two line segments are correlated, the corresponding matrix element is the Godel coded difference of their features; otherwise the element is assigned to a maximum number. Finally, singular value decomposition is applied on the proximity matrix. Godel coded differences strengthens the method due to the fact that not only the norms of the vectors are compared for matching but also their unique Godel numbers are involved. Proposed algorithm is implemented and tested both on calibrated and uncalibrated stereo image pairs and the matching results are promising.

Subject Keywords

Godel Coding, Ullman Principles, Proximity Matrix, Singular Value Decomposition, Line Matching

URI

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

DOI

https://doi.org/10.1117/12.382992

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A Novel Bag-of-Visual-Words Approach for Geospatial Object Detection Aytekin, Caglar; Alatan, Abdullah Aydın (2011-04-29) A novel bag-of-visual-words algorithm is presented with two extensions compared to its classical version: exploiting scale information and weighting visual words. The scale information that is already extracted with SIFT detector is included as an additional element to the SIFT key-point descriptor, while the visual words are weighted during histogram assignment proportional to their importance which is measured by the ratio of their occurrences in the object to the occurrences in the background. The algori...
An algorithm for line matching in an image by mapping into an n-dimensional vector space Sultanov, Raiymbek; Atakan, Ahmet; Ismailova, Rita (2019-01-01) This paper proposes a minimal length difference algorithm for construction of a line in an image by solving the problem of optimal contour approximation. In this algorithm, a method for finding interest points is proposed, and the object matching (classification) is done by mapping interest points onto a vector space. In cases where the lines in the representation of the images are not smooth, the algorithm converges rapidly. The results of the experiments showed that for convergence of the contour simplifi...
A modified algorithm for peer-to-peer security Akleylek, Sedat; Emmungil, Levent; NURİYEV, URFAT (2007-01-01) In this paper we present the steganographic approach to peer-to-peer systems with a modified algorithm. This gives the user a very high level of protection against being compelled to disclose its contents. Even the realization of the quantum computer cannot solve NP-hard problem in a polynomial time, a modified algorithm with steganographic use depending on Knapsack problem may make peer-to-peer systems secure.
A Layout algorithm for visualization of graph alignments Akarsu, Andaç; Can, Tolga; Department of Computer Engineering (2017) Graph layout algorithms are commonly used when visualizing. Usually these algorithms focus on a single graph. To be able to visualize multiple graphs at once, such as the results of graph alignment algorithms on biological networks, new layout algorithms need to be developed. A layout algorithm for visualizing graph alignments should display the aligned graphs separately, so that both the graphs and their alignment can be viewed individually. In addition, for better interpretation of the alignment results, ...
A new scheme for off-line handwrittten connected digit recognition Arica, N; Yarman Vural, Fatoş Tunay (1998-04-23) In this study, we introduce a new scheme for off-line handwritten connected digit string recognition problem, which uses a sequence of segmentation and recognition algorithms. The proposed system assumes no constraint in writing style, size or variations.

Citation Formats

N. Dicle and M. V. Atalay, “A matching algorithm based on Godel coding scheme,” 2000, vol. 3974, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40098.