Tracking interacting human body parts from a single two-dimensional view is difficult due to occlusion, ambiguity and spatio-temporal discontinuities. We present a Bayesian network method for this task. The method is not reliant upon spatio-temporal continuity, but exploits it when present. Our inferencebased tracking model is compared with a CONDENSATION model augmented with a probabilistic ex...

The abstract boundary construction of Scott and Szekeres is a general and flexible way to define singularities in General Relativity. The abstract boundary construction also proves of great utility when applied to questions about more general boundary features of space-time. Within this construction an essential singularity is a non-regular boundary point which is accessible by a curve of inter...

Iran is the biggest pistachio producer and exporter in the world. Surely, one of the most problems of pistachio industry is Aflatoxin contamination in recent years that treated exportation this valuable crop. This research was done in order to evaluate Aflatoxin contamination in indehiscence and mechanical splitting pistachios of Ouhadi cultivars in Rafsanjan region. Treatments of this research...

This paper describes a quick 3D-to-2D point matching algorithm. Our major contribution is to substitute a new O(2n) algorithm for the traditional N ! method by introducing a convex hull based enumerator. Projecting a 3D point set into a 2D plane yields a corresponding 2D point set. In some cases, matching information is lost. Therefore, we wish to recover the 3D-to-2D correspondence in order to...

To further understand the rock damage zone, an approach based on microcrack distribution was proposed to characterize crack space of specimens in this research. Acoustic emission (AE) technology utilized sandstone obtain spatial microcracks which uniaxial compression forms single-cracked fracture. The theoretical pattern (TDPS), 3D convex hull, and minimum volume enclosing ellipsoid (MVEE) algo...

Bentley, Faust and Preparata [1] presented a linear time algorithm for computing an approximate convex hull in two-dimensional space. They compute a polygon with vertices in the given set of points in the plane such that the polygon is arbitrarily close to the convex hull of the point set. Soisalon-Soininen [2] modified the approximation scheme of [1] and, among other things, gave a criterion w...

Given a set of n points P in the plane, the first layer L1 of P is formed by the points that appear on P ’s convex hull. In general, a point belongs to layer Li, if it lies on the convex hull of the set P \ ⋃ j<i{Lj}. The convex layers problem is to compute the convex layers Li. Existing algorithms for this problem either do not achieve the optimal O (n log n) runtime and linear space, or are o...

Bounded linear regularity, the strong conical hull intersection property (strong CHIP), and the conical hull intersection property (CHIP) are properties of a collection of finitely many closed convex intersecting sets in Euclidean space. It was shown recently that these properties are fundamental in several branches of convex optimization, including convex feasibility problems, error bounds, Fe...

This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution space and the computational efforts required. In alternative to local consistency, we propose maintaining global hull-consistency and present experimental results that show that this may be an appropriate alternative t...