In this paper we discuss a possible discrete approximation of non-metrical Minkowski distances. The existing approaches for Minkowski metrics considering distance functions based on local neighborhoods are not suitable for this task in their present form. We can overcome this difficulty with considering the minimum of such distance functions. In this way we can take full advantage of the former...

Let (W,d) be a metric space and S = {s1 . . . sk} an ordered list of subsets of W . The distance between p ∈ W and si ∈ S is d(p, si) = min{ d(p, q) : q ∈ si }. S is a resolving set forW if d(x, si) = d(y, si) for all si implies x = y. A metric basis is a resolving set of minimal cardinality, named the metric dimension of (W,d). The metric dimension has been extensively studied in the literatur...

In this paper we will introduce a new method for approximating non-metrical Minkowski distances. The existing approaches for Minkowski metrics considering distance functions based on local neighborhoods are not suitable for this task in their present form. In our approach we can overcome this difficulty with considering the minimum of such distance functions. In this way we can take full advant...

Ongoing work towards appearance-based 3D hand pose estimation from a single image is presented. A large database of synthetic hand views is generated using a 3D hand model and computer graphics. The views display different hand shapes as seen from arbitrary viewpoints. Each synthetic view is automatically labeled with parameters describing its hand shape and viewing parameters. Given an input i...

Benchmarking methods for 3d hand tracking is still an open problem due to the difficulty of acquiring ground truth data. We introduce a new dataset and benchmarking protocol that is insensitive to the accumulative error of other protocols. To this end, we create testing frame pairs of increasing difficulty and measure the pose estimation error separately for each of them. This approach gives ne...

General object recognition is a difficult problem. In [2], we proposed a novel solution for object recognition in an unconstrained environment. We simplified the recognition problem by attaching a special planar pattern on objects of interest. This approach allows us to determine the pose easily. A robust detector for the pattern was developed for the first stage of the solution (Soh[3]). This ...

Neighborhoods and neighborhood sequences play important roles in several branches of pattern analysis. In earlier papers in Zn only certain special (e.g. periodic or octagonal) sequences were investigated. In this paper we study neighborhood sequences which are either ultimately periodic or allow at every neighborhood to do nothing at no cost. We give finite procedures and descriptive theoretic...