Arindam Karmakar

Learn More
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given set of n points P = {p1, p2, . . . , pn} such that for any query line or line segment L, it efficiently locates a point c′ on L that minimizes the maximum distance among the points(More)
Let P be a set of n points in the plane. Here an optimization technique is used to solve some optimization problems. A simple deterministic algorithm is proposed to compute smallest square containing at least k points of P . The time and space complexities of the algorithm are O(n log n) and O(n) respectively. For large values of k, the worst case time(More)
In this paper, we identify a minimum width rectangular annulus that encloses a given set of n points in a plane. We propose an O(n2 log n) time and O(n) space algorithm for this problem. To the best of our knowledge this is the first sub-cubic algorithm for a rectangular annulus for arbitrary orientation. © 2012 Elsevier B.V. All rights reserved.
Otsu's global automatic image thresholding technique is widely used in various computer vision-based applications. This paper presents a resource-efficient architecture for the design of Otsu's thresholding algorithm and its implementation in field-programmable gate array (FPGA). The proposed architecture is implemented for a 640x480 size of input image(More)
The objective of path planning for a mobile anchor is to find the path of minimum length that the anchor traverses to localize all sensors. The challenge is to design a movement strategy which reduces path length while meeting the requirements of a good range-free localization technique. A novel deterministic movement strategy is proposed in this paper that(More)