2014 24th International Conference on Field Programmable Logic and Applications (FPL) 2014
DOI: 10.1109/fpl.2014.6927402
|View full text |Cite
|
Sign up to set email alerts
|

An FPGA sliding window-based architecture harris corner detector

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 33 publications
(18 citation statements)
references
References 5 publications
0
18
0
Order By: Relevance
“…Assuming n pairs of matching points are got through feature point matching and the coordinate values of the ith pair in I 1 and I 2 are (x i1 ,y i1 ) and (x i2 ,y i2 ) respectively, then calculate the coordinate offsets between them: (8) Calculate the number of the matched point pairs with the same Δx and Δy. The Δx and Δy of which the number is the largest are considered as the offsets in direction x and direction y of the two images.…”
Section: Determination Of the Best Matching Pointsmentioning
confidence: 99%
See 2 more Smart Citations
“…Assuming n pairs of matching points are got through feature point matching and the coordinate values of the ith pair in I 1 and I 2 are (x i1 ,y i1 ) and (x i2 ,y i2 ) respectively, then calculate the coordinate offsets between them: (8) Calculate the number of the matched point pairs with the same Δx and Δy. The Δx and Δy of which the number is the largest are considered as the offsets in direction x and direction y of the two images.…”
Section: Determination Of the Best Matching Pointsmentioning
confidence: 99%
“…Add the values with the same coefficients in the image window and filter the eight values. Make lookup tables with the size of 2 8 and store the adding results of the products of the ith place of the eight values and their responding Gaussian template coefficients. Make an eight-bit address of lookup table with the ith place of each figure, then output the ith place of the figure having been processed by Gaussian filter.…”
Section: Significant Feature Point Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…There are several computer vision applications that used these corner detection algorithms successfully [39,49,40], and several smart cameras included them in their self-contained algorithms [6,2]. Unfortunately, in several applications the corner detection algorithms are not compatible with high textured regions [22] or can not perform real-time processing on full HD images [24,33,4]. We can mention the three most important limitations affecting the current corner detection algorithms:…”
Section: Performance Of Corner Detection Algorithmsmentioning
confidence: 99%
“…Furthermore, most accurate algorithms like Shi & Tomasi/Harris & Stephens, have relatively complex mathematical formulation (quotients, roots, etc. ), that require high hardware resources [24,33,4], hardware requirements are ×4 more than corner detection algorithms with straightforward FPGA implementation. On the other hand, corner detection algorithms with straightforward FPGA implementation like FAST [35] have low hardware demand but accuracy and robustness is low.…”
Section: Performance Of Corner Detection Algorithmsmentioning
confidence: 99%