AN EFFICIENT ALGORITHM FOR RUNNING WINDOW PEL GRAY LEVEL RANKING IN 2-D IMAGES

被引：17

作者：

CHAUDHURI, BB

机构：

[1] Electronics and Communication Sciences Unit, Indian Statistical Institute, Calcutta, 700 035, 203 Barrackore, Trunk Road

来源：

PATTERN RECOGNITION LETTERS | 1990年 / 11卷 / 02期

关键词：

Fast algorithm; gray level thinning; max/min filtering; median filtering; rank-over filtering;

D O I：

10.1016/0167-8655(90)90116-J

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

An efficient algorithm is proposed for computing the rank orders of pel gray levels over running windows in a 2-D image array. For a n×n=M-pels window, it is shown that the worst case computer complexity is O(M) and it is independent of the image business. Practical results show a factor of 1.5 to 2.5 improvement over the worst case and this algorithm compares favourably with other proposed algorithms. The algorithm may be used for min, max or median filtering as well as for image transformations involving rank orders. © 1990.

引用

页码：77 / 80

页数：4