论文信息 - Rank algorithms for picture processing

Rank algorithms for picture processing

A class of nonlinear rank algorithms is introduced based on computation of local rank statistics of pictures. These algorithms are superior to the linear ones in the simplicity of local adaptation and are free from their basic disadvantage, spatial inertia. Application of rank algorithms to a wide range of picture processing problems such as smoothing, standardization, detail enhancement, extraction of details and their boundaries, coding, etc. is described.

Vladimir G. Kim | Vladimir Kim | L. Yaroslavskii | Leonid Yaroslavskii

[1] Jong-Sen Lee,et al. Digital image smoothing and the sigma filter , 1983, Comput. Vis. Graph. Image Process..

[2] S. G. Tyan,et al. Median Filtering: Deterministic Properties , 1981 .

[3] Thomas S. Huang,et al. Image enhancement using the median and the interquartile distance , 1984, Comput. Vis. Graph. Image Process..

[4] C. Pomalaza-ráez,et al. An adaptative, nonlinear edge-preserving filter , 1984 .

[5] Maurice G. Kendall,et al. Inference and relationship , 1979 .

[6] Azriel Rosenfeld,et al. Picture Processing by Computer , 1969, CSUR.

[7] P. Sen,et al. Theory of rank tests , 1969 .

[8] B. Frieden. A new restoring algorithm for the preferential enhancement of edge gradients , 1976 .

[9] E. Patrick,et al. Fundamentals of Pattern Recognition , 1973 .

[10] B I Justusson,et al. Median Filtering: Statistical Properties , 1981 .

[11] Werner Frei,et al. Image Enhancement by Histogram Hyperbolization , 1977 .

[12] L. P. I︠A︡roslavskiĭ. Digital picture processing : an introduction , 1985 .