• Title/Summary/Keyword: Fixed Point Algorithm

Search Result 362, Processing Time 0.026 seconds

An Efficient Composite Image Separation by Using Independent Component Analysis Based on Neural Networks (신경망 기반 독립성분분석을 이용한 효율적인 복합영상분리)

  • Cho, Yong-Hyun;Park, Yong-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.3
    • /
    • pp.210-218
    • /
    • 2002
  • This paper proposes an efficient separation method of the composite images by using independent component analysis(ICA) based on neural networks of the approximate learning algorithm. The Proposed learning algorithm is the fixed point(FP) algorithm based on Secant method which can be approximately computed by only the values of function for estimating the root of objective function for optimizing entropy. The secant method is an alternative of the Newton method which is essential to differentiate the function for estimating the root. It can achieve a superior property of the FP algorithm for ICA due to simplify the composite computation of differential process. The proposed algorithm has been applied to the composite signals and image generated by random mixing matrix in the 4 signal of 500-sample and the 10 images of $512{\times}512-pixel$, respectively The simulation results show that the proposed algorithm has better performance of the learning speed and the separation than those using the conventional algorithm based method. It also solved the training performances depending on initial points setting and the nonrealistic learning time for separating the large size image by using the conventional algorithm.

Evaluating Reverse Logistics Networks with Centralized Centers : Hybrid Genetic Algorithm Approach (집중형센터를 가진 역물류네트워크 평가 : 혼합형 유전알고리즘 접근법)

  • Yun, YoungSu
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.4
    • /
    • pp.55-79
    • /
    • 2013
  • In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

Comparative study on dynamic analyses of non-classically damped linear systems

  • Greco, Annalisa;Santini, Adolfo
    • Structural Engineering and Mechanics
    • /
    • v.14 no.6
    • /
    • pp.679-698
    • /
    • 2002
  • In this paper some techniques for the dynamic analysis of non-classically damped linear systems are reviewed and compared. All these methods are based on a transformation of the governing equations using a basis of complex or real vectors. Complex and real vector bases are presented and compared. The complex vector basis is represented by the eigenvectors of the complex eigenproblem obtained considering the non-classical damping matrix of the system. The real vector basis is a set of Ritz vectors derived either as the undamped normal modes of vibration of the system, or by the load dependent vector algorithm (Lanczos vectors). In this latter case the vector basis includes the static correction concept. The rate of convergence of these bases, with reference to a parametric structural system subjected to a fixed spatial distribution of forces, is evaluated. To this aim two error norms are considered, the first based on the spatial distribution of the load and the second on the shear force at the base due to impulsive loading. It is shown that both error norms point out that the rate of convergence is strongly influenced by the spatial distribution of the applied forces.

Statistical Estimation of the Number of Contending Stations and its Application to a Multi-round Contention Resolution Scheme

  • Jang, Seowoo;Choi, Jin-Ghoo;Yoon, Sung-Guk
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4259-4271
    • /
    • 2016
  • With the increased popularity of IEEE 802.11 WLAN, the density of the WLAN devices per access point has also increased, resulting in throughput performance degradation. One of the solutions to the problem is improving the protocol efficiency by a using multi-round contention scheme. This paper first discusses how to estimate the number of contending stations in a WLAN network by using minimum elapsed backoff counter values that can be easily monitored by each station. An approximate closed form expression is derived for the number of active contending stations using the smallest backoff counter value in the network. We then apply this result to adapt the number of contending rounds according to the network loading level to enhance the throughput performance of a multi-round contention scheme. Through simulation, we show that the accuracy of the estimation algorithm depends on the contention parameters of W and the number of backoff counter observing samples, and found a reasonable value for each parameter. We clearly show that our adaptive multi-round contention scheme outperforms the standard contention scheme that uses a fixed number of rounds.

Modified Direct Torque Control System of Five Phase Induction Motor

  • Kim, Nam-Hun;Kim, Min-Huei
    • Journal of Electrical Engineering and Technology
    • /
    • v.4 no.2
    • /
    • pp.266-271
    • /
    • 2009
  • In this paper, improved direct torque control(DTC) of five-phase induction motor(IM) is proposed. Due to the additional degrees of freedom, five-phase IM drives present unique characteristics. One of them is the ability of enhancing the torque producing capability of the motor. Also five-phase motor drives possess many others advantage compared with the traditional three-phase motor drives. Such as, reducing the amplitude and increasing of frequency of torque pulsation, reducing amplitude of current per phase without increasing the voltage per phase and increasing the reliability. The direct torque control method is advantageous when it is applied to the five-phase IM. Because the five-phase inverter provides 32 space vectors in comparison to 8 space voltage vectors by the three-phase inverter. The 32 space voltage vectors are divided into three groups according to their magnitudes. The characteristics and dynamic performance of traditional five-phase DTC are analyzed and new DTC for five-phase IM is proposed. Therefore, a more precise flux and torque control algorithm for the five-phase IM drives can be suggested and explained. For presenting the superior performance of the pro-posed direct torque control, experimental results is presented using a 32 bit fixed point TMS320F2812 digital signal processor

A Design of High-speed Phase Calculator for 3D Depth Image Extraction from TOF Sensor Data (TOF 센서용 3차원 Depth Image 추출을 위한 고속 위상 연산기 설계)

  • Koo, Jung-Youn;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.355-362
    • /
    • 2013
  • A hardware implementation of phase calculator for extracting 3D depth image from TOF(Time-Of-Flight) sensor is described. The designed phase calculator, which adopts a pipelined architecture to improve throughput, performs arctangent operation using vectoring mode of CORDIC algorithm. Fixed-point MATLAB modeling and simulations are carried out to determine the optimized bit-widths and number of iteration. The designed phase calculator is verified by FPGA-in-the-loop verification using MATLAB/Simulink, and synthesized with a TSMC 0.18-${\mu}m$ CMOS cell library. It has 16,000 gates and the estimated throughput is about 9.6 Gbps at 200Mhz@1.8V.

Efficient Counterexample Generation for Game Solving in NuSMV (게임 풀이를 위한 NuSMV의 효율적인 반례 생성)

  • Kwon, Gi-Hwon;Lee, Tae-Hoon
    • The KIPS Transactions:PartD
    • /
    • v.10D no.5
    • /
    • pp.813-820
    • /
    • 2003
  • This paper solves Push-Push game with the model checker NuSMY which exhaustively explores all search space to determine whether a model satisfies a property. In case a model doesn't satisfy properties to be checked, NuSMV generates a counterexample which tells where this unsatisfaction occurs. However, the algorithm for generating counterexample in NuSMV traverses a search space twice so that it is inefficient for solving the game we consider here. To save the time to be required to complete the game, we revise the part of counterexample generation so that it traverses a search space once. As a result, we obtain 62% time improvement and 11% space improvement in solving the game with modified NuSMV.

Position Controller of Rail Guided Unmanned Monitoring System with the Driving Slip Compensator (주행 슬립 오차 보상기를 가지는 레일 가이드 무인 설비 감시 장치의 위치 제어기)

  • Bae, Jongnam;Kwak, Yunchang;Lee, Dong-Hee
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.5
    • /
    • pp.792-799
    • /
    • 2017
  • The real time unmanned monitoring system of an equipment's internal parts and condition requires the monitoring device to be able to stop at a set location on the rail. However, due to the slip between the driving surface and the roller, an error occurs between the actual position and the command position. In this paper, a method to compensate the position error due to the roller slip is proposed. A proximity sensor located at both ends of the rail detects the starting point and the maximum position pulse, linearly compensating the error between the angular position of the motor and the mechanically fixed starting and maximum position pulse of the rail in forward and reverse direction. Moreover, unlike the existing servo position controller, the motor adopts the position detection method of Hall sensor in BLDC (Brushless DC) and applies an algorithm for low-speed driving so that a stable position control is possible. The proposed rail guided unmanned monitoring system with driving slip compensator was tested to verify the effectiveness.

Partitioned coupling strategies for fluid-structure interaction with large displacement: Explicit, implicit and semi-implicit schemes

  • He, Tao
    • Wind and Structures
    • /
    • v.20 no.3
    • /
    • pp.423-448
    • /
    • 2015
  • In this paper the unsteady fluid-structure interaction (FSI) problems with large structural displacement are solved by partitioned solution approaches in the arbitrary Lagrangian-Eulerian finite element framework. The incompressible Navier-Stokes equations are solved by the characteristic-based split (CBS) scheme. Both a rigid body and a geometrically nonlinear solid are considered as the structural models. The latter is solved by Newton-Raphson procedure. The equation governing the structural motion is advanced by Newmark-${\beta}$ method in time. The dynamic mesh is updated by using moving submesh approach that cooperates with the ortho-semi-torsional spring analogy method. A mass source term (MST) is introduced into the CBS scheme to satisfy geometric conservation law. Three partitioned coupling strategies are developed to take FSI into account, involving the explicit, implicit and semi-implicit schemes. The semi-implicit scheme is a mixture of the explicit and implicit coupling schemes due to the fluid projection splitting. In this scheme MST is renewed for interfacial elements. Fixed-point algorithm with Aitken's ${\Delta}^2$ method is carried out to couple different solvers within the implicit and semi-implicit schemes. Flow-induced vibrations of a bridge deck and a flexible cantilever behind an obstacle are analyzed to test the performance of the proposed methods. The overall numerical results agree well with the existing data, demonstrating the validity and applicability of the present approaches.

Robust Controls of a Galvanometer : A Feasibility Study

  • Park, Myoung-Soo;Kim, Young-Chol;Lee, Jae-Won
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.1 no.2
    • /
    • pp.94-98
    • /
    • 1999
  • Optical scanning systems use glavanometers to point the laser beam to the desired position on the workpiece. The angular speed of a galvanometer is typically controlled using Proportional+Integral+Derivative(PID) control algorithms. However, natural variations in the dynamics of different galvanometers due to manufacturing, aging, and environmental factors(i.e., process uncertainty) impose a hard limit on the bandwidth of the galvanometer control system. In general, the control bandwidth translates directly into efficiency of the system response. Since the optical scanning system must have rapid response, the higher control bandwidth is required. Auto-tuning PID algorithms have been accepted in this area since they could overcome some of the problems related to process uncertainty. However, when the galvanometer is attached to a larger mechanical system, the combined dynamics often exhibit resonances. It is well understood that PId algorithms may not have the capacity to increase the control bandwidth in the face of such resonances. This paper compares the achieable performance and robustness of a galvanometer control system using a PID controller tuned by the Ziegler-Nichols method and a controller designed by the Quantitative Feedback Theory(QFT) method. The results clearly indicate that-in contrast to PID designs-QFT can deliver a single, fixed controller which will supply high bandwidth design even when the dynamics is uncertain and includes mechanical resonances.

  • PDF