图像特性容差测试仪
Tolerant Testers of Image Properties
摘要:
我们开始系统的研究宽容的测试仪的图像属性,或等效的,算法,近似的距离从给定的图像到所需的属性(即,需要改变的图像,以确保图像满足所需的属性的像素的最小分数)。图像处理是次线性时间算法的一个特别引人注目的应用领域,特别是性能测试。然而,为了使测试算法在图像处理中充分发挥其潜力,它们必须是容忍的,这允许它们对噪声有弹性。在此之前的工作,只有一个宽容的测试算法的图像属性(图像分区)已被公布。我们设计了有效的近似算法以下基本问题:什么比例的像素必须改变图像,使其成为一个半平面?一个凸形物体的表示一个连接对象的表示更准确地说,我们的算法近似的距离,以三个基本属性(是一个半平面,凸性,连通性)在一个小的附加误差$ε$,读取后,在$1/ε$的像素多项式和独立的图像的大小。在$1/ε$中,半平面和凸度测试仪的运行时间也是多项式。这三种性能的公差测试仪以前没有研究过。对于凸性和连通性,甚至存在查询复杂度与输入大小无关的距离近似算法也不是由以前的工作所暗示的。(It不遵循VC维界,因为VC维的凸性和连通性,即使在二维,取决于输入大小。这也不是因为存在非宽容的测试人员。)
英文摘要:
We initiate a systematic study of tolerant testers of image properties or, equivalently, algorithms that approximate the distance from a given image to the desired property (that is, the smallest fraction of pixels that need to change in the image to ensure that the image satisfies the desired property). Image processing is a particularly compelling area of applications for sublinear-time algorithms and, specifically, property testing. However, for testing algorithms to reach their full potential in image processing, they have to be tolerant, which allows them to be resilient to noise. Prior to this work, only one tolerant testing algorithm for an image property (image partitioning) has been published. We design efficient approximation algorithms for the following fundamental questions: What fraction of pixels have to be changed in an image so that it becomes a half-plane? a representation of a convex object? a representation of a connected object? More precisely, our algorithms approximate the distance to three basic properties (being a half-plane, convexity, and connectedness) within a small additive error $ε$, after reading a number of pixels polynomial in $1/ε$ and independent of the size of the image. The running time of the testers for half-plane and convexity is also polynomial in $1/ε$. Tolerant testers for these three properties were not investigated previously. For convexity and connectedness, even the existence of distance approximation algorithms with query complexity independent of the input size is not implied by previous work. (It does not follow from the VC-dimension bounds, since VC dimension of convexity and connectedness, even in two dimensions, depends on the input size. It also does not follow from the existence of non-tolerant testers.)
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。