نتایج جستجو برای: global gradient algorithm
تعداد نتایج: 1260152 فیلتر نتایج به سال:
In this paper we analyze a specific problem within the context of recovering the geometric shape of an unknown surface from multiple noisy shading patterns generated by consecutive parallel illuminations by different light-sources. Shading-based single-view shape recovery in computer vision often leads to vector fields (i.e. estimated surface normals) which have to be integrated for calculation...
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
In this paper, we propose a novel 2D-to-3D video conversion method for 3D entertainment applications. 3D entertainment is getting more and more popular and can be found in many contexts, such as TV and home gaming equipment. 3D image sensors are a new method to produce stereoscopic video content conveniently and at a low cost, and can thus meet the urgent demand for 3D videos in the 3D entertai...
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
The uni-modal error surfaces and intrinsic stable behaviors of adaptive finite impulse response (FIR) filters make gradient based algorithms very effective in the design of these filters. Gradient based design methods are well developed for the design of adaptive FIR filters and widely applied to the distinct areas such as noise cancellation, system identification and channel equalization. Howe...
In this paper, the global optimization of a nonconvex objective function under linear and nonlinear differentiable constraints is studied, a reduced gradient and GRG descent methods with random perturbation is proposed and it is desired to establish the global convergence of the algorithm. Some numerical examples are also given by the problems of statistical, octagon, mixture, alkylation and po...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید