نتایج جستجو برای: shape error

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

2011
C. Y. Lai Z. You

The Collapsible Rib Tensioned Surface CRTS re ector is a new concept for multipur pose deployable membrane re ectors that is being developed by the European Space Agency It is based on the inherent geometrical stability of a doubly curved membrane with high in plane sti ness maintained in a state of tension by a series of exible ribs The shape of a CRTS re ector is not uniquely determined It re...

1998
Markus Törmä Juha Hyyppä

Tree species proportions of forest stands were estimated using ranging scatterometer called HUTSCAT. Employed estimation method was multilayer perceptron neural network with error backpropagation training algorithm. Two methods for feature extraction were tested; other based on intensity and shape of measured profiles, other only shape. Different neural network configurations were tried and it ...

1995
Kenneth F. Alvin

A new method for identifying the location of finite element model errors given test-identified frequencies and mode shape data is presented. The new method builds on the concept of the modal force error vector, which is the undamped impedance of the given finite element model at each identified frequency multiplied by the corresponding identified mode shape. In order to mitigate the problems as...

Journal: :IEEE Trans. Pattern Anal. Mach. Intell. 1999
Ruo Zhang Ping-Sing Tsai James Edwin Cryer Mubarak Shah

ÐSince the first shape-from-shading (SFS) technique was developed by Horn in the early 1970s, many different approaches have emerged. In this paper, six well-known SFS algorithms are implemented and compared. The performance of the algorithms was analyzed on synthetic images using mean and standard deviation of depth (Z) error, mean of surface gradient (p, q) error, and CPU timing. Each algorit...

2009
Tomáš Kliegr

UTA methods use linear programming techniques for finding additive utility functions that best explain stated preferences. However, most UTA methods including the popular UTA-Star are limited to monotonic preferences. UTA-NM (Non Monotonic) is inspired by UTA Star but allows non-monotonic partial utility functions if they decrease total model error. The shape of the utility functions is determi...

2007
Alicia Fornés Sergio Escalera Josep Lladós Gemma Sánchez Petia Radeva Oriol Pujol

One of the major difficulties of handwriting recognition is the variability among symbols because of the different writer styles. In this paper we introduce the boosting of blurred shape models with error correction, which is a robust approach for describing and recognizing handwritten symbols tolerant to this variability. A symbol is described by a probability density function of blurred shape...

1997
David A. Simon Takeo Kanade

Shape-based registration is a process for estimating the transformation between two shape representations of an object. It is used in many image-guided surgical systems to establish a transformation between preand intra-operative coordinate systems. This paper describes several tools which are useful for improving the accuracy resulting from shape-based registration: constraint analysis, constr...

2006
Xiujuan Chai Shiguang Shan Laiyun Qing Wen Gao

In this paper, a new method is presented to estimate the 3D pose of facial image based on statistical Gaussian error models. The basic idea is that the pose angle can be computed by the orthogonal projection computation if the specific 3D shape vector of the given person is known. In our algorithm, Gaussian probability density function is used to model the distributions of the 3D shape vector a...

Journal: :Computers & Graphics 2009
Juan Cao Xin Li Guozhao Wang Hong Qin

Recently, a new bivariate simplex spline scheme based on Delaunay configuration has been introduced into the geometric computing community, and it defines a complete spline space that retains many attractive theoretic and computational properties. In this paper, we develop a novel shape modeling framework to reconstruct a closed surface of arbitrary topology based on this new spline scheme. Our...

Journal: :Des. Codes Cryptography 1999
Neil J. Calkin Jennifer D. Key Marialuisa J. de Resmini

The geometric codes are the duals of the codes defined by the designs associated with finite geometries. The latter are generalized Reed-Muller codes, but the geometric codes are, in general, not. We obtain values for the minimum weight of these codes in the binary case, using geometric constructions in the associated geometries, and the BCH bound from coding theory. Using Hamada’s formula, we ...

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

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