• ETRI Journal
• /
• 제42권6호
• /
• pp.922-931
• /
• 2020

A hierarchical iterative algorithm for the canonical polyadic decomposition (CPD) of tensors is proposed by improving the traditional conjugate gradient least squares (CGLS) method. Methods based on algebraic operations are investigated with the objective of estimating the direction of arrival (DoA) and polarization parameters of signals impinging on an array with electromagnetic (EM) vector-sensors. The proposed algorithm adopts a hierarchical iterative strategy, which enables the algorithm to obtain a fast recovery for the highly collinear factor matrix. Moreover, considering the same accuracy threshold, the proposed algorithm can achieve faster convergence compared with the alternating least squares (ALS) algorithm wherein the highly collinear factor matrix is absent. The results reveal that the proposed algorithm can achieve better performance under the condition of fewer snapshots, compared with the ALS-based algorithm and the algorithm based on generalized eigenvalue decomposition (GEVD). Furthermore, with regard to an array with a small number of sensors, the observed advantage in estimating the DoA and polarization parameters of the signal is notable.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• 제20권8호
• /
• pp.534-540
• /
• 2008

In this paper, the optimal bang-bang control problem of an air-conditioning system with slab thermal storage was formulated by gradient method. Furthermore, the numeric solution obtained by gradient method algorithm was compared with the analytic solution obtained on the basis of maximum principle. The control variable is changed uncontinuously at the start time of thermal storage operation in an analytic solution. On the other hand, it is showed as a continuous solution in a numeric solution. The numeric solution reproduces the analytic solution when a tolerance for convergence is applied severely. It is conceivable that gradient method is effective in the analysis of the optimal bang-bang control of the large-scale system like an air-conditioning system with slab thermal storage.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (2)
• /
• pp.697-699
• /
• 2004

Stochastic Neighbor Embedding(SNE) is a probabilistic method of mapping high-dimensional data space into a low-dimensional representation with preserving neighbor identities. Even though SNE shows several useful properties, the gradient-based naive SNE algorithm has a critical limitation that it is very slow to converge. To overcome this limitation, faster optimization methods should be considered by using trust region method we call this method fast TR SNE. Moreover, this paper presents a couple of useful optimization methods(i.e. conjugate gradient method and Newton's method) to embody fast SNE algorithm. We compared above three methods and conclude that TR-SNE is the best algorithm among them considering speed and stability. Finally, we show several visualizing experiments of TR-SNE to confirm its stability by experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권4호
• /
• pp.1075-1089
• /
• 2024

In this paper, the optimizations of multi-hop cooperative molecular communication (CMC) system in cylindrical anomalous-diffusive channel in three-dimensional enviroment are investigated. First, we derive the performance of bit error probability (BEP) of CMC system under decode-and-forward relay strategy. Then for achieving minimum average BEP, the optimization variables are detection thresholds at cooperative nodes and destination node, and the corresponding optimization problem is formulated. Furthermore, we use conjugate gradient (CG) algorithm to solve this optimization problem to search optimal detection thresholds. The numerical results show the optimal detection thresholds can be obtained by CG algorithm, which has good convergence behaviors with fewer iterations to achieve minimized average BEP compared with gradient decent algorithm and Bisection method which are used in molecular communication.

• The Journal of Korea Robotics Society
• /
• 제6권2호
• /
• pp.97-107
• /
• 2011

This paper describes efficient flight control algorithms for building a reconfigurable ad-hoc wireless sensor networks between nodes on the ground and airborne nodes mounted on autonomous vehicles to increase the operational range of an aerial robot or the communication connectivity. Two autonomous flight control algorithms based on adaptive gradient climbing approach are developed to steer the aerial vehicles to reach optimal locations for the maximum communication throughputs in the airborne sensor networks. The first autonomous vehicle control algorithm is presented for seeking the source of a scalar signal by directly using the extremum-seeking based forward surge control approach with no position information of the aerial vehicle. The second flight control algorithm is developed with the angular rate command by integrating an adaptive gradient climbing technique which uses an on-line gradient estimator to identify the derivative of a performance cost function. They incorporate the network performance into the feedback path to mitigate interference and noise. A communication propagation model is used to predict the link quality of the communication connectivity between distributed nodes. Simulation study is conducted to evaluate the effectiveness of the proposed reconfigurable airborne wireless networking control algorithms.

• Proceedings of the KOR-KST Conference
• /
• 대한교통학회 1999년도 제36회 학술발표회논문집
• /
• pp.65-70
• /
• 1999

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• 제49권11호
• /
• pp.610-616
• /
• 2000

This paper presents an active noise control algorithm via Walsh transform domain controller learned by genetic algorithm. Typical active noise control algorithms such as the filtered-x lms algorithm are based on the gradient algorithm. Gradient algorithm have two major problems; local minima and eigenvalue ratio. To solve these problems, we propose a combined algorithm which consist of genetic learning algorithm and discrete Walsh transform called Walsh Transform Domain Genetic Algorithm(WTDGA). Analyses and computer simulations on the effect of Walsh transform to the genetic algorithm are performed. The results show that WTDGA increase convergence speed and reduce steady state errors.

• Journal of KIISE:Software and Applications
• /
• 제37권1호
• /
• pp.9-18
• /
• 2010

This paper proposes a deformable registration method using a demon algorithm for aligning the lungs between end-exhale and end-inhale CT scans. The lungs are globally aligned by affine transformation and locally deformed by a demon algorithm. The use of floating gradient force allows a fast convergence in the lung regions with a weak gradient of the reference image. The active-cell-based demon algorithm helps to accelerate the registration process and reduce the probability of deformation folding because it avoids unnecessary computation of the displacement for well-matched lung regions. The performance of the proposed method was evaluated through comparisons of methods that use a reference gradient force or a combined gradient force as well as methods with and without active cells. The results show that the proposed method can accurately register lungs with large deformations and can reduce the processing time considerably.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제8권2호
• /
• pp.7-13
• /
• 2004

A Conjugate Gradient (CG) algorithm for unconstrained minimization is proposed which is invariant to a nonlinear scaling of a strictly convex quadratic function and which generates mutually conjugate directions for extended quadratic functions. It is derived for inexact line searches and is designed for the minimization of general nonlinear functions. It compares favorably in numerical tests with the original Dixon algorithm on which the new algorithm is based.

• The Journal of the Acoustical Society of Korea
• /
• 제24권2E호
• /
• pp.54-60
• /
• 2005

A new multichannel blind deconvolution algorithm is proposed for speech mixtures. It employs unidirectional filters and normalization of gradient terms in the frequency domain. The proposed algorithm is shown to be approximately nonholonomic. Thus it provides improved convergence and separation performances without whitening effect for nonstationary sources such as speech and audio signals. Simulations using real world recordings confirm superior performances over existing algorithms and its usefulness for real applications.