The Wilcoxon signed-rank test is exploited for document organization and retrieval in this paper. A novel modeling method for documents and a distance metric between documents are proposed. Both document modeling and document comparisons are based on signed-ranks and are applied to the frequency of occurrence of the document bigrams. A metric using the Wilcoxon signed-rank test exploits these s...

When we use range finders to observe the shape of an object, many occluded areas may occur. These become holes and gaps in the model and make it undesirable to utilize the model for various applications. We propose a novel method to fill holes and gaps and complement such an incomplete model. We use a signed distance field (SDF) as an intermediate representation, which stores Euclidean signed d...

When we use range finders to observe the shape of an object, many occluded areas may occur. These become holes and gaps in the model and make it undesirable to utilize the model for various applications. We propose a novel method to fill holes and gaps and complement such an incomplete model. We use a signed distance field (SDF) as an intermediate representation, which stores Euclidean signed d...

The application of the level set method in image segmentation has been very popular due to its capability of automatically handling changes in topology. However, a re-initialization procedure, which leads to expensive computation, is required in the traditional level set method to keep the level set function as a signed distance function to its interface. A method based on Gaussian filtering an...

The optic disc (OD) is one of the important anatomic structures on the retina, the changes of which shape and area may indicate disease processes, thus needs computerized quantification assistance. In this study, we proposed a self-adaptive distance regularized level set evolution method for OD segmentation without the periodically re-initializing steps in the level set function execution to a ...

Given two convex polyhedra P and Q and a direction s, the minimum directional distance (MDD) is defined to be the shortest translational distance along the direction s that is required to make P and Q just in contact. In this paper we propose a novel method, called MDD-DUAL , for computing the MDD between two convex polyhedra. The MDD is equivalent to the shortest distance between the origin an...

We give a pair of well-matched lower and upper bounds for the expectation of reversal distance under the hypothesis of random gene order by investigating the expected number of cycles in the breakpoint graph of linear signed permutations. Sankoff and Haque [9] proved similar results for circular signed permutations based on approximations based on a slightly different model; while our approach ...

In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These problems are very important in the study of the evolution of genomes. We give a general formulation for lower bounds of the transposition and block-interchange dis...