Two-dimensional peak filter in almost linear time

被引:0
|
作者
Belov, A. M. [1 ]
Verichev, A. V. [1 ,2 ]
Myasnikov, V. V. [1 ]
机构
[1] Samara Natl Res Univ, Moskovskoe Shosse 34, Samara 443086, Russia
[2] Russian Acad Sci, Image Proc Syst Inst, Branch Fed Sci Res Ctr Crystallog & Photon, Molodogvardeiskaya St 151, Samara 443001, Russia
关键词
local peak; peak filter; two-dimensional array; digital image; finite state machine; computational complexity;
D O I
10.1016/j.proeng.2017.09.662
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The goal of this paper is to develop a fast algorithm for local peak filtering of two-dimensional arrays. The ambiguity of the concept of a local peak is demonstrated and additional conditions introduced that resolve it. A correct peak filter that takes into account the above conditions is developed. To evaluate effectiveness of the proposed algorithm two known algorithms for finding local maxima are described. Estimates of the computational complexity of algorithms for the best and worst cases are given. Analysis of dependency of the algorithm execution time from image size, sliding window size and a number of local maxima, is made. The results of experimental research showed that performance of the correct peak filter is higher than its incorrect counterparts. (C) 2017 The Authors. Published by Elsevier Ltd.
引用
收藏
页码:408 / 416
页数:9
相关论文
共 50 条