Structural optimization has recently received wide range attention in computer aided design. One of the reasons is rapid development of so vhisticated but inexpensive engineering workstations with graphic capabilities, multi-windows and fast computation. The other reason is acceptance by people in industry of various computer aided engineering systems including reliable analysis capability such...

Globally optimal formulations of geometric computer vision problems comprise an exciting topic in multiple view geometry. These approaches are unaffected by the quality of a provided initial solution, can directly identify outliers in the given data, and provide a better theoretical understanding of geometric vision problems. The disadvantage of these methods are the substantial computational c...

Shape optimization of the fine scale geometry of elastic objects is investigated under stochastic loading. Thus, the object geometry is described via parametrized geometric details placed on a regular lattice. Here, in a two dimensional set up we focus on ellipsoidal holes as the fine scale geometric details described by the semiaxes and their orientation. Optimization of a deterministic cost f...

Presently the design of the optimal analog and mixed signal (AMS) circuits with lesser design cycle time is a great challenge for the designers. This paper describes the optimization of the current starved voltage controlled oscillator (CSVCO) circuit. The objective functions and constraints of the CSVCO circuit are in the form of posynomial functions of the design variables. The convex optimiz...

A novel algorithm for uncalibrated stereo imagepair rectification under the constraint of geometric distortion, called USR-CGD, is presented in this work. Although it is straightforward to define a rectifying transformation (or homography) given the epipolar geometry, many existing algorithms have unwanted geometric distortions as a side effect. To obtain rectified images with reduced geometric...

A global optimization algorithm for solving generalized geometric programming GGP problem is developed based on a new linearization technique. Furthermore, in order to improve the convergence speed of this algorithm, a new pruning technique is proposed, which can be used to cut away a large part of the current investigated region in which the global optimal solution does not exist. Convergence ...