With quick development of digital images and the availability of imaging tools, massive amounts of images are created. Therefore, efficient management and suitable retrieval, especially by computers, is one of themost challenging fields in image processing. Automatic image annotation (AIA) or refers to attaching words, keywords or comments to an image or to a selected part of it. In this paper,...

We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson’s optimal radius bound as a special case and explains many cases where neighbor-joining is successful even when Atteson’s criterion is not satisfied. We also provide a proof for Atteson’s conjecture on the optimal edge radi...

We describe the first algorithm and software, RNAenn, to compute the partition function and minimum free energy secondary structure for RNA with respect to an extended nearest neighbor energy model. Our next-nearest-neighbor triplet energy model appears to lead to somewhat more cooperative folding than does the nearest neighbor energy model, as judged by melting curves computed with RNAenn and ...

This paper we proposes an extended geodesic distance for head pose estimation. In ISOMAP, two approaches are applied for neighborhood construction, called k-neighbor and -neighbor. For the kneighbor, the number of the neighbors is a const k. For the other one, all the distances between the neighbors is less than . Either the k-neighbor or the -neighbor neglects the difference of each point. Thi...

k-Nearest Neighbor (KNN) is one of the most popular algorithms for pattern recognition. Many researchers have found that the KNN classifier may decrease the precision of classification because of the uneven density of t raining samples .In view of the defect, an improved k-nearest neighbor algorithm is presented using shared nearest neighbor similarity which can compute similarity between test ...

ARP handles neighbor discovery and address resolution in infrastructure networks, but is inadequate for Mobile Ad Hoc Networks (MANETs). Thus, many MANET routing protocols include a neighbor discovery mechanism. This separation of neighbor discovery and address resolution is a fundamental design problem that causes packet loss, particularly when the communication is manycast, a novel variant of...

Finding Nearest Neighbors efficiently is crucial to the design of any nearest neighbor classifier. This paper shows how Layered Range Trees could be used for efficient nearest neighbor classification. The presented algorithm is simple and finds the nearest neighbor in a logarithmic order. It performs d log n + k distance measures to find the nearest neighbor, where k is a constant that is much ...

Two experiments combined masked priming with event-related potential (ERP) recordings to examine effects of primes that are orthographic neighbors of target words. Experiment 1 compared effects of repetition primes with effects of primes that were high-frequency orthographic neighbors of low-frequency targets (e.g., faute-faune [error-wildlife]), and Experiment 2 compared the same word neighbor...

NEAREST NEIGHBOR IMPUTATION Jiahua Chen1 University of Waterloo Jun Shao2 University of Wisconsin-Madison Abstract Nearest neighbor imputation is one of the hot deck methods used to compensate for nonresponse in sample surveys. Although it has a long history of application, theoretical properties of the nearest neighbor imputation method are unknown prior to the current paper. We show that unde...