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 study introduces an approach to three-dimensional vehicle pose estimation using a stereo camera system. After computation of stereo and optical flow on the investigated scene, a four-dimensional clustering approach separates the static from the moving objects in the scene. The iterative closest point algorithm (ICP) estimates the vehicle pose using a cuboid as a weak vehicle model. In contrast...
In this study, a novel iterative optimization clustering algorithm is proposed by using a manifold distance based dissimilarity metric which can measure the geodesic distance along the manifold and a criterion function which can express the clustering target, that is the samples in the same cluster being somehow more similar than samples in different one. The steps of the algorithm are discussed in...
This paper presents the hierarchical cluster counting (HCC), a new quality metric for nondominated sets generated by multi-objective optimizers that is based on hierarchical clustering techniques. In the computation of the HCC, the samples in the estimate set are sequentially grouped into clusters. The nearest clusters in a given iteration are joined together until all the data is grouped in only...
This paper describes a new scheme for generating paths that are optimized for faster execution while keeping a certain amount of clearance away from obstacles. An optimized path is first extracted from multiple query PRM using a Lazy A* algorithm with a weighted Linfin norm, this latter is post-processed to correct its clearance to over a desired threshold in regions where it is geometrically possible...
On-line handwritten signature aligning is crucial in verification. This paper deals with this aligning as an optimization problem. By transforming the squared Euclidean distance based DTW distance in terms of geometric transformations including rotation, scaling and translation, corresponding optimal objective functions are formulated and solved in closed form. Subsequently, an iterative optimization...
Many methods for analog circuit sizing are available as commercial, in-house and academic tools. They are based on continuous optimization, e.g., of transistor geometries, although the subsequent layout step requires values on a pre-defined grid. In addition, sizing of transistors for bipolar and RF circuits frequently necessitates the use of multiples of predefined values for the design parameters...
For depth information estimation of microscope defocus image, a blur parameter model of defocus image based on Markov random field has been present. It converts problem of depth estimation into optimization problem. An improved iterated conditional modes algorithm has been applied to complete optimization problem, which the select of initial point employed least squares estimate algorithm prevents...
In two recent contributions, we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and suggested an enhanced version of the Steepest Descent (ESD) algorithm, which we have shown to be competitive with other distributed localization algorithms in terms of estimation accuracy and numerical complexity. Moreover, therein we have conducted...
This paper is aimed to solve the multi-facility location problems of distribution centers by multi-objective decision method. After analyzing the requirements and characteristics of distribution time, it put forward a multi-facility location model in which the distribution cost was taken as decision objective and the distribution time was changed to a group of constrains. It designed a bi-step heuristics...
In this paper the characters of pitch angle, yaw angle and roll angle of kinetic interceptor (KI) with side window during the terminal guidance process are discussed. In order to guarantee that KI is able to track target missile with high speed continually, a novel method to design the desired attitude angles is presented. Given an ellipse side window, the constraints from visibility, angle of attack...
Currently many non-tractable considered problems have been solved satisfactorily through methods of approximate optimization called metaheuristic. These methods use non-deterministic approaches that find good solutions which, however, do not guarantee the determination of the global optimum. The success of a metaheuristic is conditioned by capacity to adequately alternate between exploration and exploitation...
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.