Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P . Aminimum Manhattan network of P is a Manhattan network of minimum total length. It is unknown whether it is NP-hard to construct a minimum Manhattan network. The best approximations published so far are a combinatorial 3-approximation algori...

This paper argues that many visual scenes are based on a ”Manhattan” three-dimensional grid which imposes regularities on the image statistics. We construct a Bayesian model which implements this assumption and estimates the viewer orientation relative to the Manhattan grid. For many images, these estimates are good approximations to the viewer orientation (as estimated manually by the authors)...

This letter argues that many visual scenes are based on a "Manhattan" three-dimensional grid that imposes regularities on the image statistics. We construct a Bayesian model that implements this assumption and estimates the viewer orientation relative to the Manhattan grid. For many images, these estimates are good approximations to the viewer orientation (as estimated manually by the authors)....

In this work, we present a general guideline to establish the relation between a distribution model and its corresponding similarity estimation. A rich set of distance metrics, such as Harmonic distance and Geometric distance, is derived according to Maximum Likelihood theory. These metrics can provide a more accurate model than the conventional Euclidean distance and Manhattan distance. Becaus...

Our research target to a computer-aided diagnosis (CAD) system for colorectal endoscopic images with narrow band imaging (NBI) magnification, which identifies a pathology type from local feature in the NBI endoscopic image. We propose a high speed feature transformation for CAD system by using Manhattan distance calculation and on the fly normalization method. A high performance and low cost al...

This paper describes the architecture of a route finding system that computes an optimal route between two given locations efficiently and that considers user preferences when doing so. The basis of the system is an A* algorithm that applies heuristics such as the air distance heuristic or the Manhattan heuristic to compute the shortest path between the two locations. Since A* is not tractable ...

Dynamic Time Warping (DTW) is a widely used distance measurement in time series clustering. DTW invariant to phase perturbations but has quadratic complexity. An effective acceleration method must reduce the utilization ratio during clustering; for example, TADPole uses both upper and lower bounds prune off large of expensive calculations. To further ratio, we find that linear-complexity L1-nor...

In the research field, network performance for different smart applications plays an important role in IoT network. Several factors, such as packet delay, throughput, energy consumption, heterogeneity, proper gateway placement and load balancing, have a greater impact on performance. this article, two optimal are investigated order to improve of Various methods used find lo-cation Coordinating ...