نتایج جستجو برای: centroid design d

تعداد نتایج: 1504100  

2000
Rocío Díaz de León Luis Enrique Sucar

A novel approach for human silhouette recognition is presented. The method is based on Fourier descriptors. We made an analysis of which and how many descriptors are enough to have a general human silhouette representation, and concluded that a reduced number of components, low and high frecuency, is sufficient for representing a human silhouette and for its recognition in different posses. Bas...

Journal: :CoRR 2008
Khaled M. Elbassioni Hans Raj Tiwary

Let P be an H-polytope in R with vertex set V . The vertex centroid is defined as the average of the vertices in V . We prove that computing the vertex centroid of an H-polytope is #P-hard. Moreover, we show that even just checking whether the vertex centroid lies in a given halfspace is already #P-hard for H-polytopes. We also consider the problem of approximating the vertex centroid by findin...

2010
Bruno Bruni Gianluca Bartolucci Samuele Ciattini Silvia Coran

In the title compound, C(13)H(15)N(2) (+)·Cl(-)·H(2)O, the ions and water mol-ecules are -connected by N-H⋯Cl, O-H⋯Cl, NH⋯Cl⋯HO, NH⋯Cl⋯HN and OH⋯Cl⋯HO inter-actions, forming discrete D(2) and D(2) (1)(3) chains, C(2) (1)(6) chains and R(4) (2)(8) rings, leading to a neutral two-dimensional network. The crystal structure is further stabilized by π-π stacking inter-actions [centroid-centroid dist...

2004
Gerald Weber

It is shown that the centroid is a reference point for the symmetric difference with loss factor cz = 1 + 2 d 2 d+1 < 1 + 2d for convex figures under affine transformations. This generalizes an earlier result for two dimensions.

Journal: :Soft Computing 2016

2009
E. Janousova

Automatic classification of schizophrenia patients and healthy controls based on their 3-D MRI deformation images is introduced here. The image data are reduced by 2DPCA to avoid high computational expenses. Consecutively, reduced data are classified into the two groups according to the centroid method or the average linkage method. The results show that the algorithm gives better results while...

2001
Xavier Amatriain Perfecto Herrera

Content description has become a topic of interest for many researchers in the audiovisual field [1][2]. While manual annotation has been used for many years in different applications, the focus now is on finding automatic contentextraction and content-navigation tools. An increasing number of projects, in some of which we are actively involved, focus on the extraction of meaningful features fr...

2016
R. Raol

The image-based detection and tracking of moving objects are extremely important for many aerospace and aviation applications, including satellite-based imagery. In this paper, we briefly review various approaches related to image-centroid and/or target tracking. We emphasize square root algorithms that are supposed to be more efficient than the basic implementation of KF. Then, we present some...

2009
Khaled M. Elbassioni Hans Raj Tiwary

Let P be an H-polytope in R with vertex set V . The vertex centroid is defined as the average of the vertices in V . We first prove that computing the vertex centroid of an H-polytope, or even just checking whether it lies in a given halfspace, are #P-hard. We also consider the problem of approximating the vertex centroid by finding a point within an ǫ distance from it and prove this problem to...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید