Ray Casting Algorithm is a classic rendering approach in volume rendering. It is widely used in the 3D visualization field of medical images, but the rendering speed is very slowly. In order to improve the rendering s...
详细信息
ISBN:
(纸本)9781612844589
Ray Casting Algorithm is a classic rendering approach in volume rendering. It is widely used in the 3D visualization field of medical images, but the rendering speed is very slowly. In order to improve the rendering speed, an high efficient and speed algorithm of Ray Casting based on space leaping and rapid interpolation is presented. Along with a comparing experiment of three kinds of methods in time and drawing quality, the result shows that the accelerate algorithm proposed in this paper can not only get a high quality rendering image, but also improve a rendering speed to a high level. There is some certain value in practical aspect of 3D visualization of medical images.
In fast affine projection (FAP) adaptation algorithms, it is needed to explicitly or implicitly perform a matrix inversion, during which a small positive regularization factor plays an important role in keeping the al...
详细信息
In fast affine projection (FAP) adaptation algorithms, it is needed to explicitly or implicitly perform a matrix inversion, during which a small positive regularization factor plays an important role in keeping the algorithm stable and optimized. While existing schemes choose the regularization factor based on certain system criteria not related to the inversion, this paper proposes a simple scheme that dynamically diagnoses the inversion process itself for potentials of instability. This work paves the way for further studies on "minimal regularization and step-size control" technique. A FAP adopting this technique can be compared with FAPs with existing regularization schemes for convergence and steady state performance.
We develop a highly accurate software scanned cell projection algorithm which is applicable of any classification system. This algorithm could handle both convex and non-convex meshes, and provide maximum flexibilitie...
详细信息
ISBN:
(纸本)9781424497621
We develop a highly accurate software scanned cell projection algorithm which is applicable of any classification system. This algorithm could handle both convex and non-convex meshes, and provide maximum flexibilities in applicable types of cells. Compared with previous algorithms using 3D commodity graphics hardware, it introduces no the volume decomposition and rendering artifacts in the resulting images. Furthermore, its parallel version is investigated to overcome the bottleneck of the serial one in terms of time and memory consuming for visualizing large scale unstructured data. Finally, high resolution images generated by the parallel algorithm are provided, and the scalability of the algorithm is demonstrated on a PC Cluster with modest parallel resources.
In this paper the new two-dimensional (TD) adaptive filter algorithms are introduced. The presented algorithms are TD variable step-size (VSS) normalized least mean squares (TD-VSS-NLMS) and TD-VSS affine projection a...
详细信息
In this paper the new two-dimensional (TD) adaptive filter algorithms are introduced. The presented algorithms are TD variable step-size (VSS) normalized least mean squares (TD-VSS-NLMS) and TD-VSS affine projection algorithms (TD-VSS-APA). In these algorithms, the step-size changes during the adaptation which leads to the low steady-state mean square error (MSE), and fast convergence speed. We demonstrate the good performance of the derived algorithms in TD system identification and adaptive noise cancellation in digital images for image restoration.
We propose a new projection algorithm for generalized variational inequality with multivalued mapping. Our method is proven to be globally convergent to a solution of the variational inequality problem, provided that ...
详细信息
We propose a new projection algorithm for generalized variational inequality with multivalued mapping. Our method is proven to be globally convergent to a solution of the variational inequality problem, provided that the multivalued mapping is continuous and pseudomonotone with nonempty compact convex values. Preliminary computational experience is also reported.
A letter to the editor is presented in response to the article 'Variable Explicit Regularization in Affine projection Algorithm: Robustness Issues and Optimal Choice,' by Hernán Rey et al.
A letter to the editor is presented in response to the article 'Variable Explicit Regularization in Affine projection Algorithm: Robustness Issues and Optimal Choice,' by Hernán Rey et al.
A response by Hernán Rey and colleagues to a letter to the editor about their article 'Variable Explicit Regularization in Affine projection Algorithm: Robustness Issues and Optimal Choice' is presented.
A response by Hernán Rey and colleagues to a letter to the editor about their article 'Variable Explicit Regularization in Affine projection Algorithm: Robustness Issues and Optimal Choice' is presented.
The problem is considered for control of an electromagnetic moment of the induction motor with a squirrel-cage rotor without the measurement of its rotational speed. By means of the principle of vector control, this p...
详细信息
The problem is considered for control of an electromagnetic moment of the induction motor with a squirrel-cage rotor without the measurement of its rotational speed. By means of the principle of vector control, this problem reduces to developing an adaptive observer of values of the vector of the rotor magnetic-flux linkage. The method of recurrent objective inequalities (ROIs) is used, which enables one to reduce adaptation problems to counting systems of inequalities relative to the vector of the parameters estimated. For the control problem under consideration, these inequalities prove to be nonconvex, which makes it impossible to use directly the projection algorithms developed in the framework of the method of ROIs. In this connection, the common method for the stepwise reduction of the dimension of the nonlinear portion of inequalities is suggested in this work. On condition that the processes of a closed system display a certain natural property of nondegeneracy, this method permits reducing nonconvex inequalities to convex ones and ensures the achievement of the control aim on completion of the transient processes.
Rotational motion estimation is essential for inverse synthetic aperture radar (ISAR) imaging and understanding. For an object rotating with a constant acceleration, a closed-form solution is proposed to jointly estim...
详细信息
Rotational motion estimation is essential for inverse synthetic aperture radar (ISAR) imaging and understanding. For an object rotating with a constant acceleration, a closed-form solution is proposed to jointly estimate the initial rotating velocity (IRV) and the rotating acceleration (RA) by exploiting the pose difference of a triangle on two range-Doppler (RD) images. Then, the RA can be compensated with interpolation processing and an equivalent uniformly rotating object may be obtained. After that, the estimated IRV can be used to re-scale the RD image into the homogeneous range-cross range domain, or to provide more satisfactory imaging result via elaborated algorithms such as polar format algorithm or convolution back-projection algorithm. Finally, experimental results with both simulated and real airplane data are provided to demonstrate the effectiveness of the proposed method.
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In the present paper we study the question ...
详细信息
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In the present paper we study the question of the existence of solutions to such problems. A finite family of subspaces is said to satisfy the Inverse Best Approximation Property (IBAP) if there exists a point that admits any selection of points from these subspaces as best approximations. We provide various characterizations of the IBAP in terms of the geometry of the subspaces. Connections between the IBAP and the linear convergence rate of the periodic projection algorithm for solving the underlying affine feasibility problem are also established. The results are applied to investigate problems in harmonic analysis, integral equations, signal theory, and wavelet frames. (C) 2009 Elsevier Inc. All rights reserved.
暂无评论