A matching algorithm based on linear features

Download
056870.pdf
1996
Yılmaz, Mehmet Uğur
Show full item record
66
views
0
downloads
https://hdl.handle.net/11511/11697
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

A matching algorithm based on linear features
Atalay, Mehmet Volkan (Elsevier BV, 1998-07-01)
A two step feature matching algorithm which is primarily aimed at problems related to the analysis of aerial images of man-made sites is presented. Only linear features and their geometric attributes are used in the algorithm. First, the rotation between the two images is calculated and then matching by relaxation is performed assuming that there is only translation.
A matching algorithm based on Godel coding scheme
Dicle, N; Atalay, Mehmet Volkan (2000-01-28)
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 a...
A parallel ant colony optimization algorithm based on crossover operation
Kalınlı, Adem; Sarıkoç, Fatih (Springer, 2018-11-01)
In this work, we introduce a new parallel ant colony optimization algorithm based on an ant metaphor and the crossover operator from genetic algorithms.The performance of the proposed model is evaluated usingwell-known numerical test problems and then it is applied to train recurrent neural networks to identify linear and nonlinear dynamic plants. The simulation results are compared with results using other algorithms.
A Genetic Isometric Shape Correspondence Algorithm with Adaptive Sampling
Sahillioğlu, Yusuf (2018-11-01)
We exploit the permutation creation ability of genetic optimization to find the permutation of one point set that puts it into correspondence with another one. To this end, we provide a genetic algorithm for the 3D shape correspondence problem, which is the main contribution of this article. As another significant contribution, we present an adaptive sampling approach that relocates the matched points based on the currently available correspondence via an alternating optimization. The point sets to be match...
A lane detection algorithm based on reliable lane markings
Yeniaydın, Yasin; Schmidt, Klaus Verner (2018-05-05)
This paper proposes a robust and effective vision-based lane detection approach. First, two binary images are obtained from the region of interest of gray-scale images. The obtained binary images are merged by a novel neighborhood AND operator and then transformed to a bird's eye view (BEV) via inverse perspective mapping. Then, gaussian probability density functions are fit to the left and right regions of a histogram image acquired from the BEV. Finally, a polynomial lane model is estimated from the ident...
Citation Formats
M. U. Yılmaz, “A matching algorithm based on linear features,” Middle East Technical University, 1996.
METU IIS - Integrated Information Service open@metu.edu.tr