Name
Abstract | ||
|---|---|---|
An efficient and geometric-distortion-free approach, namely the fast binary robust local feature (FBRLF), is proposed. The FBRLF searches the stable features from an image with the proposed multiscale adaptive and generic corner detection based on the accelerated segment test (MAGAST) to yield an optimum threshold value based on adaptive and generic corner detection based on the accelerated segment test (AGAST). To overcome the problem of image noise, the Gaussian template is applied, which is efficiently boosted by the adoption of an integral image. The feature matching is conducted by incorporating the voting mechanism and lookup table method to achieve a high accuracy with low computational complexity. The experimental results clearly demonstrate the superiority of the proposed method compared with the former schemes regarding local stable feature performance and processing efficiency. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.3390/s19102315 | SENSORS |
Keywords | Field | DocType |
local invariant feature,feature detection,pattern matching | Lookup table,Corner detection,Threshold limit value,Algorithm,Electronic engineering,Image noise,Gaussian,Engineering,Pattern matching,Computational complexity theory,Binary number | Journal |
Volume | Issue | ISSN |
19 | 10.0 | 1424-8220 |
Citations | PageRank | References |
1 | 0.38 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing-Ming Guo | 1 | 830 | 77.60 |
| Li-Ying Chang | 2 | 1 | 0.38 |
| Jiann-Der Lee | 3 | 211 | 34.02 |