Identification in image using Euclidean balls Original Research Article

The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These codes find their application, for example, in sensor networks. The network is modelled by a graph. In this paper, the goal is to find good identifying codes in a natural setting, that is, in a graph image where image is the set of vertices and each vertex (sensor) can check its neighbours within Euclidean distance image. We also consider a graph closely connected to a well-studied king grid, which provides optimal identifying codes for image and image.