The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents a new method for person-specific face shape estimation under varying head pose of a previously unseen person from a single image. We describe a featureless approach based on a deformable 3D model and a learned face subspace. The proposed approach is based on maximizing a likelihood measure associated with a learned face subspace, which is carried out by a stochastic and genetic...
We construct a scale space of shape of closed Riemannian manifolds, equipped with metrics derived from spectral representations and the Hausdorff distance. The representation depends only on the intrinsic geometry of the manifolds, making it robust to pose and articulation. The computation of shape distance involves an optimization problem over the 2p-element group of all p-bit strings, which is approached...
This paper presents a novel method of generating new probability distributions tailored to specific problem classes for use in optimisation mutation operators. A range of tailored operators with varying behaviours are created using the proposed technique and the evolved multi-modal polynomial distributions are found to match the performance of a tuned Gaussian distribution when applied to a mutation...
The goal of multimodal optimisation is to identify multiple desirable optima of a fitness landscape within a single run of an evolutionary algorithm. Typically, one must resort to niching methods to perform this task, and such methods often require the use of a niche radius to distinguish between optima. Typically, this niche radius is difficult to set, leading to suboptimal performance of niching...
A new stochastic optimization algorithm referred to by the authors as the `Mean-Variance Optimization' (MVO) algorithm is presented in this paper. MVO falls into the category of the so-called “population-based stochastic optimization technique.” The uniqueness of the MVO algorithm is based on the strategic transformation used for mutating the offspring based on mean-variance of the n-best dynamic...
The aim of this article is to present a new projective stereological image processing method to estimate the volume of a 3D particle with known convex shape from its different projected areas. In order to do so, an optimization algorithm is performed to determine the size parameters of the particle which maximize the likelihood function of the probability density associated with the observed projected...
In this paper, a new approach for the geometric refinement of road networks using network snakes and SAR images is presented. Network snakes are based on the well-known active contour models, but in addition to the image energy and internal energy the topology is introduced into the optimization process. This graph-based active contour method enables a complete topological and shape control during...
An analytic cost model is presented for M/G/1/N queueing systems. It considers the cost of customer loss versus customer delays, by varying buffer size and processor speed. We find optimal (and near optimal) configurations for a wide variety of service-time distributions. The model can provide insight into when it is better to invest in increased processor speed than to supply more buffer space. It...
Scaled Convex Hulls (SCHs) have been recently proposed by Liu et al. as the basis of a method to build linear classifiers that, when extended to kernel settings, provides an alternative approach to more established methods such as SVMs. Here we show how to adapt the Mitchell-Dem'yanov-Malozemov (MDM) algorithm to build such SCH-based classifiers by solving a concrete nearest point problem. We shall...
Traffic state (for instance, link travel time, velocity, volume) in the links of the urban road network should be taken into account while calculating the shortest path in real application situations. However, the traffic state of the urban road network varies in different places and at different time. Constructing a time varying road network is critical to explore the time varying shortest path....
For the reason of practical use in propeller design for low-dynamic aircrafts in Near Space, it is very important to have high-performance low-Reynolds-number airfoils which should have high lift-drag ratio, high endurance factor and high maximum-lift-coefficient, etc. Multi-objective optimal design can effectively solve the multiple design-points problem, which is an effective means and methods for...
Two methods is proposed to modify the shape of combined subdivision surface. One is to realize the shape modification of the combined subdivision surface by editing the curve network and updating the surface by the overlapping subdivision method, and the other one combines vertex constraint with the shape optimization method based on discrete PDE(partial differential equation), and realizes the shape...
An optimization model for grain gradation of monolithic refractory is purposed on the basis of close packing theory and field production situation. Through applying ant colony algorithms, an optimization strategy concerning grain gradation of monolithic refractory is presented. The simulation results show that our method conforms to the requirements of actual productive technology, and the optimized...
In this paper, we propose an efficient groupwise morphometric analysis to characterize morphological variations between healthy and pathological states. The proposed framework extends the work of Baloch in which a manifold for each anatomy was constructed by collecting lossless [transformation, residual] descriptors with various transformation parameters, and the optimal set of transformation parameters...
Given very few images containing a common object of interest under severe variations in appearance, we detect the common object and provide a compact visual representation of that object, depicted by a binary sketch. Our algorithm is composed of two stages: (i) Detect a mutually common (yet non-trivial) ensemble of `self-similarity descriptors' shared by all the input images. (ii) Having found such...
The method of amending chord length parameterization was used to process different feasible point vectors of ship's section area, and the parameterized cubic spline curves were used to express the different subsections of ship's section area curve (SAC). The work of designing a good ship's SAC was converted to a problem of multi-objective optimization. The objects of single functions were set as the...
As processing capabilities of microelectronic devices increase, so does the power dissipated by them. To add to that, power distributions are non-uniform and this may create significant hot spots. These devices require improvements in thermal performance of the entire system due to their higher power dissipation and non-uniform power distribution. This study looks at impingement type heat sinks, which...
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric shapes, that minimizes the amount of deviation from isometry. We cast the problem as a complete surface correspondence problem. Our method first divides the given shapes to be matched into surface patches of equal area and then...
We propose a method to generate a highly accurate 3D face model from a set of wide-baseline images in a weakly calibrated setup. Our approach is purely data driven, and produces faithful 3D models without any pre-defined models, unlike other statistical model-based approaches. Our results do not rely upon a critical initialization step nor parameters for optimization steps. We process 5 images (including...
We present an intrinsic framework for constructing sulcal shape atlases on the human cortex. We propose the analysis of sulcal and gyral patterns by representing them by continuous open curves in R3. The space of such curves, also termed as the shape manifold is equipped with a Riemannian L2 metric on the tangent space, and shows desirable properties while matching shapes of sulci. On account of the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.