The optimized parallel implementation for an improved fast correlation matching algorithm on multi-DSPs interconnected by FPGA

2009 ◽  
Author(s):  
Hao Wang ◽  
Zhiguo Cao ◽  
Zhenjun Zhang ◽  
Quan Zhang
Keyword(s):  
Parallel Implementation ◽  
Matching Algorithm ◽  
Correlation Matching

Three-Dimensional Microsphere Tracking Using Off-Focus Images Based on Cross-Correlation Matching Algorithm

2015 ◽  
Vol 35 (2) ◽  
pp. 0212002
Author(s):  
谢湘军 Xie Xiangjun ◽  
雷海 Lei Hai ◽  
常新宇 Chang Xinyu ◽  
曾雅楠 Zeng Yanan ◽  
胡晓东 Hu Xiaodong ◽  
...  
Keyword(s):  
Cross Correlation ◽  
Three Dimensional ◽  
Matching Algorithm ◽  
Correlation Matching

scholarly journals Target Image Matching Algorithm Based on Binocular CCD Ranging

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Dongming Li ◽  
Wei Su ◽  
Jinhua Yang ◽  
Lijuan Zhang
Keyword(s):  
Measurement Accuracy ◽  
Experimental Results ◽  
Target Image ◽  
Actual Measurement ◽  
Matching Algorithm ◽  
Cubic Surface ◽  
Fitting Algorithm ◽  
Surface Fitting Algorithm ◽  
System Errors ◽  
Correlation Matching

This paper proposed target image in a subpixel level matching algorithm for binocular CCD ranging, which is based on the principle of binocular CCD ranging. In the paper, firstly, we introduced the ranging principle of the binocular ranging system and deduced a binocular parallax formula. Secondly, we deduced the algorithm which was named improved cross-correlation matching algorithm and cubic surface fitting algorithm for target images matched, and it could achieve a subpixel level matching for binocular CCD ranging images. Lastly, through experiment we have analyzed and verified the actual CCD ranging images, then analyzed the errors of the experimental results and corrected the formula of calculating system errors. Experimental results showed that the actual measurement accuracy of a target within 3 km was higher than 0.52%, which meet the accuracy requirements of the high precision binocular ranging.

scholarly journals Parallel implementation of maximum-shift algorithm using OpenMp

2021 ◽  
Vol 22 (3) ◽  
pp. 1529
Author(s):  
Atheer Akram AbdulRazzaq ◽  
Qusay Shihab Hamad ◽  
Ahmed Majid Taha
Keyword(s):  
Deoxyribonucleic Acid ◽  
Parallel Implementation ◽  
String Matching ◽  
Parallel Execution ◽  
Computer Applications ◽  
English Text ◽  
Data Types ◽  
Matching Algorithm ◽  
Dna Database ◽  
Robust Techniques

String matching is considered as one of the center issues within the field of computer science, where there are numerous computer applications that supply the clients with string matching services. The increment within the number of databases which are created and protected in numerous computer gadgets had impacted researchers with the slant towards getting robust techniques in tending to this issue. In this study, the Maximum-Shift string matching algorithm is chosen to be executed with multi-core innovation through the utilization of OpenMP paradigm, in order to decrease the successive time, and increment the speedup and efficiency of the algorithm. The deoxyribonucleic acid (DNA), protein and the English text datasets are utilized to test the parallel execution that influences the Maximum-Shift algorithm execution when utilized with multi-core environment. The results demonstrated that the execution is affected by the performance between the parallel and consecutive execution of Maximum-Shift algorithm by data type. The English text appeared ideal comes about within the parallel execution time as compared to other datasets, whereas the DNA database set appeared the most elevated comes about when compared to other data types in terms of speedup and efficiency capabilities.

scholarly journals A NOVEL SUB-PIXEL MATCHING ALGORITHM BASED ON PHASE CORRELATION USING PEAK CALCULATION

2016 ◽  
Vol XLI-B1 ◽  
pp. 253-257 ◽  
Author(s):  
Junfeng Xie ◽  
Fan Mo ◽  
Chao Yang ◽  
Pin Li ◽  
Shiqiang Tian
Keyword(s):  
Satellite Images ◽  
Phase Correlation ◽  
Matching Accuracy ◽  
Matching Algorithm ◽  
Pixel Matching ◽  
Fitting In ◽  
Geometrical Relationship ◽  
Matching Window ◽  
Correlation Matching ◽  
Better Than

The matching accuracy of homonymy points of stereo images is a key point in the development of photogrammetry, which influences the geometrical accuracy of the image products. This paper presents a novel sub-pixel matching method phase correlation using peak calculation to improve the matching accuracy. The peak theoretic centre that means to sub-pixel deviation can be acquired by Peak Calculation (PC) according to inherent geometrical relationship, which is generated by inverse normalized cross-power spectrum, and the mismatching points are rejected by two strategies: window constraint, which is designed by matching window and geometric constraint, and correlation coefficient, which is effective for satellite images used for mismatching points removing. After above, a lot of high-precise homonymy points can be left. Lastly, three experiments are taken to verify the accuracy and efficiency of the presented method. Excellent results show that the presented method is better than traditional phase correlation matching methods based on surface fitting in these aspects of accuracy and efficiency, and the accuracy of the proposed phase correlation matching algorithm can reach 0.1 pixel with a higher calculation efficiency.

Research of Dynamic Target Tracking Algorithm

2013 ◽  
Vol 448-453 ◽  
pp. 3601-3604
Author(s):  
Yu Bing Dong ◽  
Ming Jing Li ◽  
Jie Li
Keyword(s):  
Target Tracking ◽  
Cross Correlation ◽  
Search Algorithm ◽  
Automatic Recognition ◽  
Tracking Algorithm ◽  
Experimental Results ◽  
Matching Algorithm ◽  
Normalized Cross Correlation ◽  
Dynamic Target ◽  
Correlation Matching

An improved correlation matching algorithm is proposed in order to overcome some shortcomings of detecting the position of object accurately. A tracking algorithm with normalized cross correlation is introduced. In order to enhance the match speed, we have adopted pyramid search algorithm. The experimental results show that the algorithm has characteristics including automatic recognition of the object; permitting tracking and prediction when the object become shaded; the algorithm makes adaptive decision of varied object during the process of tracking.

scholarly journals A NOVEL SUB-PIXEL MATCHING ALGORITHM BASED ON PHASE CORRELATION USING PEAK CALCULATION

2016 ◽  
Vol XLI-B1 ◽  
pp. 253-257
Author(s):  
Junfeng Xie ◽  
Fan Mo ◽  
Chao Yang ◽  
Pin Li ◽  
Shiqiang Tian
Keyword(s):  
Satellite Images ◽  
Phase Correlation ◽  
Matching Accuracy ◽  
Matching Algorithm ◽  
Pixel Matching ◽  
Fitting In ◽  
Geometrical Relationship ◽  
Matching Window ◽  
Correlation Matching ◽  
Better Than

The matching accuracy of homonymy points of stereo images is a key point in the development of photogrammetry, which influences the geometrical accuracy of the image products. This paper presents a novel sub-pixel matching method phase correlation using peak calculation to improve the matching accuracy. The peak theoretic centre that means to sub-pixel deviation can be acquired by Peak Calculation (PC) according to inherent geometrical relationship, which is generated by inverse normalized cross-power spectrum, and the mismatching points are rejected by two strategies: window constraint, which is designed by matching window and geometric constraint, and correlation coefficient, which is effective for satellite images used for mismatching points removing. After above, a lot of high-precise homonymy points can be left. Lastly, three experiments are taken to verify the accuracy and efficiency of the presented method. Excellent results show that the presented method is better than traditional phase correlation matching methods based on surface fitting in these aspects of accuracy and efficiency, and the accuracy of the proposed phase correlation matching algorithm can reach 0.1 pixel with a higher calculation efficiency.

A New Correlation Matching Algorithm Based on Differential Evolution for Aircraft Geomagnetic Aid Navigation

2011 ◽  
Vol 94-96 ◽  
pp. 2032-2038 ◽  
Author(s):  
Zun Yi Xu ◽  
Yi Liu ◽  
Lei Yan
Keyword(s):  
Differential Evolution ◽  
Geomagnetic Field ◽  
High Reliability ◽  
Differential Evolution Algorithm ◽  
Matching Algorithm ◽  
Running Time ◽  
Core Function ◽  
Average Running Time ◽  
Feature Normalization ◽  
Correlation Matching

Considering the requirements of the high accuracy, high reliability and real-time capability for the aircraft geomagnetic correlation matching algorithm, the similarity core function, geomagnetic properties and search methods will be processed synthetically in this paper. The correlation variance is introduced as the similarity core function, the feature normalization of the geomagnetic field is introduced as the matching parameters and the differential evolution algorithm is introduced for reducing the running time. The experiments have been done in the laboratory based on the actual measured geomagnetic field data, its results show that: the matching probability and accuracy of the new algorithm are better than the traditional one on the whole and the average running time is shortened from 7～11s to 1～2s.

Sign in / Sign up

Export Citation Format

Share Document