نتایج جستجو برای: iterative algorithm
تعداد نتایج: 792233 فیلتر نتایج به سال:
Optical focusing through scattering media has a significant impact on optical applications in biological tissues. Recently, iterative wavefront shaping (WFS) been successfully used to focus light or inside media, and various heuristic algorithms have introduced improve the performance. While these results are encouraging, more efforts needed tune parameters towards robust optimum optimization. ...
This paper presents an efficient method for updating the structural finite element model. Model updating is performed through minimizing the difference of recorded acceleration of real damaged structure and hypothetical damaged structure, by updating physical parameters in each phase using iterative process of Levenberg-Marquardt algorithm. This algorithm is based on sensitivity analysis and pr...
The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
UNLABELLED This article demonstrates resolution recovery in 18F SPECT image reconstruction by using an iterative algorithm that corrects for the system geometric response. METHODS Patient and phantom studies were performed using a Picker PRISM 3000 three-detector SPECT system (Picker International, Inc., Cleveland, OH) to image 18F with 511 keV collimators. A measured point response function ...
identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...
The proximal point algorithm, which is a well-known tool for finding minima of convex functions, is generalized from the classical Hilbert space framework into a nonlinear setting, namely, geodesic metric spaces of nonpositive curvature. In this paper we propose an iterative algorithm for finding the common element of the minimizers of a finite family of convex functions a...
This work presents a method for the registration of three-dimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it through the use of a 3-D volume containing the shapes to be registered. The Voronoi diagram of the "model" shape points is first constructed in the volume. Then this is used for the calculation of the closest point operator. This ...
Abstract. The main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. Properties of the Legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. Afterwards, an iterative algorithm is examined for solvin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید