返回
A segmentation algorithm for noisy images: Design and evaluation
DOI:10.1016/S0167-8655(98)00102-0.png)
摘要
En 中文
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a partition of an image into (arbitrarily-shaped) connected regions to minimize the sum of gray-level variations over all partitioned regions, under the constraints that (1) each partitioned region has at least a specified number of pixels, and (2) two adjacent regions have significantly different average gray-levels. To overcome the computational difficulty of directly solving this problem, a minimum spanning tree representation of a gray-level image has been developed. With this tree representation, an image segmentation problem is effectively reduced to a tree partitionings problem, which can be solved efficiently. To evaluate the algorithm, we have studied how noise affects the performance of the algorithm. Three types of noise, transmission noise, Gaussian additive noise, and multiple sources of lightings, are considered, and their effects on the algorithm are studied. (C) 1998 Elsevier Science B.V. All rights reserved.
Keyword:
image segmentation
noisy image processing
minimum spanning tree application
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
暂无机构信息

