新手之家 │有问必答│     我要上雅虎首页    我也使用这个模板 http://i.cn.yahoo.com/google00088 复制 收藏

2008
  • 当前所在地:中国 福建 厦门市
  • 公司: GPM
  • 学校: 集美大学
  • 出生地:中国 福建 其它
  • 最高学历:本科
  • 血型:O型 身高:166-170 CM
  • 婚姻状况:未婚

2008不在你的朋友圈

更新时间:2008年9月17日 注册时间:2007年8月

访问量

24,107

博客文章分类

If I could fly free I would leave everything I owned 查看更多

rank filter
2008-02-19 14:36:38

The weighted rank filter

The basic idea

A rank filter (RF) is an image processing algorithm that replaces each pixel p by its rank relative to the pixels in some neighborhood of p. Thus if p is the brightest pixel in its neighborhood, it is mapped to white; if it is the darkest, it is mapped to black; and if it is the median, it is mapped to 50% gray.

A rank filter can also be described as applying to each pixel an histogram equalization mapping, where the histogram is restricted to the pixel's neighborhood. Indeed the basic RF is is usually called local histogram equalization in the literature.

A rank filter rejects most of the intensity variations with scale greater than the window size, while amplifying those with smaller scales. It is therefore basically a high-pass filter. Very loosely, it can be viewed as a "complement" of the well-known median filter.

Note that the RF is quite non-linear. Compared to linear high-pass filters, it has the advantage of being morphological, in the sense that its output is not affected by arbitrary monotonic mapping of the intensity values. It is therefore useful in restoring the contrast of images that have been overexposed, underexposed, or badly corrected; especially images that have been degraded by a photograpic or process whose parameters vary (not too fast) from pixel to pixel.

The weighted rank filter

The basic RF described above has one drawback: an isolated bright or dark spot surrounded by a contrasting background will produce an "echo" whose shape is that of the window.

We can avoid such defects by using a weighted rank filter (WRF): a variant of the basic rank filter, in which the neighbors are weighted according to distance, and the rank computation takes such weights into account. More precisely, the rank of a pixel p is redefined as the sum of the weights of the neighbors of p which are darker than p, divided by the sum of all neighbor weights.

A suitable weight function is the 2-D Gaussian distribution

w[x,y] = exp(-(x^2+y^2)/r^2)

The characteristic radius r defines the effective size of the neighborhood.

最近更新时间:2008-02-19 14:36:38 浏览数(53)

发表评价

(0)(0)

登录雅虎空间,给你喜欢的博客发表评论。