The rotated speeded-up robust features algorithm (R-SURF)
Jurgensen, Sean M.
Fargues, Monique P.
MetadataShow full item record
Weaknesses in the Fast Hessian detector utilized by the speeded-up robust features (SURF) algorithm are examined in this research. We evaluate the SURF algorithm to identify possible areas for improvement in the performance. A proposed alternative to the SURF detector is proposed called rotated SURF (R-SURF). This method utilizes filters that are rotated 45 degrees counter-clockwise, and this modification is tested with standard detector testing methods against the regular SURF detector. Performance testing shows that the R-SURF outperforms the regular SURF detector when subject to image blurring, illumination changes and compression. Based on the testing results, the R-SURF detector outperforms regular SURF slightly when subjected to affine (viewpoint) changes. For image scale and rotation transformations, R-SURF outperforms for very small transformation values, but the regular SURF algorithm performs better for larger variations. The application of this research in the larger recognition process is also discussed.
Approved for public release; distribution is unlimitedIncludes supplementary material
Showing items related by title, author, creator and subject.
Cornett, Annette P. (Monterey, California. Naval Postgraduate School, 1993-06);Multigrid methods were developed to solve partial differential equations. Research has shown that these methods are applicable to a broader range of problems. This thesis investigates the application of multigrid techniques ...
Bowman, Patrick J. (Monterey, California. Naval Postgraduate School, 1993-09);A current trend in radar technology is automatic detection and tracking systems. An integral part of these automatic systems is the CFAR (constant False Alarm Rate) detector. A CFAR detector is the signal process algorithm ...
Guthe, Douglas Burden, Jr. (Monterey, California. Naval Postgraduate School, 1983-09);A method for determining the optimal or near-optimal search path for the wake of a moving target when the searcher's motion is constrained is presented. The problem uses a Markov action model in discrete time and space ...