			Home About us Contact

Synthesis Algorithm (synthesis + algorithm)

Distribution by Scientific Domains

Engineering	80%

Selected Abstracts

Lazy Solid Texture Synthesis

COMPUTER GRAPHICS FORUM, Issue 4 2008
Yue Dong
Abstract Existing solid texture synthesis algorithms generate a full volume of color content from a set of 2D example images. We introduce a new algorithm with the unique ability to restrict synthesis to a subset of the voxels, while enforcing spatial determinism. This is especially useful when texturing objects, since only a thick layer around the surface needs to be synthesized. A major difficulty lies in reducing the dependency chain of neighborhood matching, so that each voxel only depends on a small number of other voxels. Our key idea is to synthesize a volume from a set of pre-computed 3D candidates, each being a triple of interleaved 2D neighborhoods. We present an efficient algorithm to carefully select in a pre-process only those candidates forming consistent triples. This significantly reduces the search space during subsequent synthesis. The result is a new parallel, spatially deterministic solid texture synthesis algorithm which runs efficiently on the GPU. Our approach generates high resolution solid textures on surfaces within seconds. Memory usage and synthesis time only depend on the output textured surface area. The GPU implementation of our method rapidly synthesizes new textures for the surfaces appearing when interactively breaking or cutting objects. [source]

Alternative formulation and applications aspects of the generalized projection method for array antenna synthesis

INTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENGINEERING, Issue 6 2009
E. Botha
Abstract An array synthesis technique is formulated, which implements the method of generalized projections in the array excitation space. This permits the use of relaxation in the overall recursion relation that is not possible with previous formulations, resulting in accelerated convergence for slowly converging problems. Weighted least squares is introduced as a backward operator in an integral way that enhances the method. Means are described for determining starting points that assist the synthesis algorithm in avoiding so-called traps. The results obtained for a diverse selection of applications of the method are discussed. These demonstrate the effects on convergence of the use of relaxation, different pattern sampling angle selection schemes, and different starting point selection schemes. © 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009. [source]

On linear-parameter-varying (LPV) slip-controller design for two-wheeled vehicles

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Issue 12 2009
Matteo Corno
Abstract This paper describes the application of linear-parameter-varying (LPV) control design techniques to the problem of slip control for two-wheeled vehicles. A nonlinear multi-body motorcycle simulator is employed to derive a control-oriented dynamic model. It is shown that, in order to devise a robust controller with good performance, it is necessary to take into account the dependence of the model on the velocity and on the wheel slip. This dependence is modeled via an LPV system constructed from Jacobian linearizations at different velocities and slip values. The control problem is formulated as a model-matching control problem within the LPV framework; a specific modification of the LPV control synthesis algorithm is proposed to alleviate controller interpolation problems. Linear and nonlinear simulations indicate that the synthesized controller achieves the required robustness and performance. Copyright © 2008 John Wiley & Sons, Ltd. [source]

A new approach to the Orchard,Elliott pattern synthesis algorithm using LMS and pseudoinverse techniques

MICROWAVE AND OPTICAL TECHNOLOGY LETTERS, Issue 1 2001
R. Shavit
Abstract A new approach to the Orchard,Elliott pattern synthesis algorithm based on the least mean-square (LMS) technique and the pseudoinverse technique is described. The new algorithm offers better initial conditions and avoids possible divergence problems throughout the iteration process. The array current distribution obtained is optimized using a genetic algorithm. The effectiveness of the new approach is demonstrated on a linear array with a symmetric flat-topped radiation pattern. © 2001 John Wiley & Sons, Inc. Microwave Opt Technol Lett 30: 12,15, 2001. [source]