该文介绍了一种稳定而有效的算法,它能够检测出包围某一已知区域的所有凸形.这些凸形的边界可以是不连续的,这使得这种算法在发现由于部分遮挡或噪声等其他原因而使边界中断的凸形物体时更为有效,从而为进一步的识别工作提供了重要的线索.“,”In this paper, an efficient and robust algorithm have been proposed. This new method can detect all of the salient convex groups which encircle a known region. Even if the boundaries of the convex group hare been interrupted due to some reasons, the proposed method also works well. so this algorithm is more effective to find convex groups whose contour are partially occluded or missing due to noise.