scholarly journals Reducing the Time Complexity of Minkowski-Sum Based Similarity Calculations by Using Geometric Inequalities

Author(s):  
Henk Bekker ◽  
Axel Brink
2009 ◽  
Vol 19 (05) ◽  
pp. 441-456 ◽  
Author(s):  
HENK BEKKER ◽  
AXEL A. BRINK ◽  
JOS B. T. M. ROERDINK

To calculate the Minkowski-sum based similarity measure of two convex polyhedra, many relative orientations have to be considered. These relative orientations are characterized by the fact that some faces and edges of the polyhedra are parallel. For every relative orientation of the polyhedra, the volume or mixed volume of their Minkowski sum is evaluated. From the minimum of this volume, the similarity measure is calculated. In this article two issues are addressed. First, we propose and test a method to reduce the set of relative orientations to be considered by using geometric inequalities in the slope diagrams of the polyhedra. In this way, the time complexity of O(n6) is reduced to O(n4.5). Secondly, we determine which relative orientation problems are ill-posed and may be skipped because they do not maximize the similarity measure.


Author(s):  
Suresha .M ◽  
. Sandeep

Local features are of great importance in computer vision. It performs feature detection and feature matching are two important tasks. In this paper concentrates on the problem of recognition of birds using local features. Investigation summarizes the local features SURF, FAST and HARRIS against blurred and illumination images. FAST and Harris corner algorithm have given less accuracy for blurred images. The SURF algorithm gives best result for blurred image because its identify strongest local features and time complexity is less and experimental demonstration shows that SURF algorithm is robust for blurred images and the FAST algorithms is suitable for images with illumination.


2020 ◽  
Vol 2020 (10) ◽  
Author(s):  
Song He ◽  
Zhenjie Li ◽  
Prashanth Raman ◽  
Chi Zhang

Abstract Stringy canonical forms are a class of integrals that provide α′-deformations of the canonical form of any polytopes. For generalized associahedra of finite-type cluster algebras, there exist completely rigid stringy integrals, whose configuration spaces are the so-called binary geometries, and for classical types are associated with (generalized) scattering of particles and strings. In this paper, we propose a large class of rigid stringy canonical forms for another class of polytopes, generalized permutohedra, which also include associahedra and cyclohedra as special cases (type An and Bn generalized associahedra). Remarkably, we find that the configuration spaces of such integrals are also binary geometries, which were suspected to exist for generalized associahedra only. For any generalized permutohedron that can be written as Minkowski sum of coordinate simplices, we show that its rigid stringy integral factorizes into products of lower integrals for massless poles at finite α′, and the configuration space is binary although the u equations take a more general form than those “perfect” ones for cluster cases. Moreover, we provide an infinite class of examples obtained by degenerations of type An and Bn integrals, which have perfect u equations as well. Our results provide yet another family of generalizations of the usual string integral and moduli space, whose physical interpretations remain to be explored.


2011 ◽  
Vol 130-134 ◽  
pp. 2915-2919
Author(s):  
Ping Duan ◽  
Jia Tian Li ◽  
Jia Li

Spherical Delaunay triangulation (SDT) which is a powerful tool to represent, organize and analyze spherical space data has become a focus of spherical GIS research. Projection stitching algorithm is one of the main construction algorithms of SDT. The basic idea of stitching algorithm is that the sphere is divided into two hemispheres to avoid projected image point coincidence. So, the practicality of projection stitching algorithm is lower because of merging two hemispheres. Aimed at the disadvantage of projection stitching algorithm, this paper puts forward a new algorithm to construct SDT used perspective projection principle. The projection center is placed on sphere to establish one-to-one mapping between spherical space points and plane image points. Experiment shows that the time complexity of our algorithm depends on Delaunay triangulation construction algorithm of the plane.


Sign in / Sign up

Export Citation Format

Share Document