Metric based comparison operations such as finding maximum, nearest and farthest neighbor are fundamental to studying various clustering techniques k -center agglomerative hierarchical clustering. These crucially rely on accurate estimation of pairwise distance between records. However, computing exact features the records, their distances is often challenging, sometimes not possible. We circum...

PURPOSE To investigate the effect of hinge position on corneal topography after laser in situ keratomileusis (LASIK) for myopia. SETTING Academic center and refractive surgery practice. METHODS Topography data obtained from 89 eyes of 46 patients after LASIK were analyzed. Using a system of Cartesian coordinates, data along the horizontal and vertical axes were analyzed, measuring sagittal ...

Suppose there are k types of facilities, e. g. schools, post offices, supermarkets, modeled by n colored points in the plane, each type by its own color. One basic goal in choosing a residence location is in having at least one representative of each facility type in the neighborhood. In this paper we provide algorithms that may help to achieve this goal for various specifications of the term “...

This paper is concerned with pool-based active learning for deep neural networks. Motivated by coreset dataset compression ideas, we present a novel active learning algorithm that queries consecutive points from the pool using farthest-first traversals in the space of neural activation over a representation layer. We show consistent and overwhelming improvement in sample complexity over passive...

We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in amortized time O(n1/2 log n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n) per update. Our algorithm uses a novel construction, the ordered nearest neighbor path of a set of points. Our results generalize to higher d...

An earlier result states that, on the surface of a convex polyhedron with vertices endowed with its intrinsic metric, a point cannot have more than antipodes (farthest points). In this paper we produce examples of polyhedra with vertices, on which some suitable point admits exactly antipodes. We also proved that, for any positive number 1, there exist (in the closure of the set of these polyhed...

We consider the problem of computing all farthest neighbors (and the diameter) of a given set of n points in the presence of highways and obstacles in the plane. When traveling on the plane, travelers may use highways for faster movement and must avoid all obstacles. We present an efficient solution to this problem based on knowledge from earlier research on shortest path computation. Our algor...

We propose a real-time fingertip detection algorithm based on depth information. It can robustly detect single fingertip regardless of the position and direction of the hand. With the depth information of front view, depth map of top view and side view is generated. Due to the difference between finger thickness and fist thickness, we use thickness histogram to segment the finger from the fist....

Endmember estimation plays a key role in hyperspectral image unmixing, often requiring an of the number endmembers and extracting endmembers. However, most existing extraction algorithms require prior knowledge regarding endmembers, being critical process during unmixing. To bridge this, new maximum distance analysis (MDA) method is proposed that simultaneously estimates spectral signatures wit...

A minimax two-facility location problem in multidimensional space with Chebyshev metric is examined subject to box constraints on the feasible area. In problem, there are two groups of points known coordinates, and one needs find coordinates for optimal new under given constraints. The considered if it minimizes maximum following values: distance between first point farthest group, second point...