• 제목/요약/키워드: Chen algorithm

검색결과 496건 처리시간 0.026초

Research on Noise Reduction Algorithm Based on Combination of LMS Filter and Spectral Subtraction

  • Cao, Danyang;Chen, Zhixin;Gao, Xue
    • Journal of Information Processing Systems
    • /
    • 제15권4호
    • /
    • pp.748-764
    • /
    • 2019
  • In order to deal with the filtering delay problem of least mean square adaptive filter noise reduction algorithm and music noise problem of spectral subtraction algorithm during the speech signal processing, we combine these two algorithms and propose one novel noise reduction method, showing a strong performance on par or even better than state of the art methods. We first use the least mean square algorithm to reduce the average intensity of noise, and then add spectral subtraction algorithm to reduce remaining noise again. Experiments prove that using the spectral subtraction again after the least mean square adaptive filter algorithm overcomes shortcomings which come from the former two algorithms. Also the novel method increases the signal-to-noise ratio of original speech data and improves the final noise reduction performance.

Task Scheduling and Resource Management Strategy for Edge Cloud Computing Using Improved Genetic Algorithm

  • Xiuye Yin;Liyong Chen
    • Journal of Information Processing Systems
    • /
    • 제19권4호
    • /
    • pp.450-464
    • /
    • 2023
  • To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.

An Evolutionary Hybrid Algorithm for Control System Analysis

  • Sulistiyo;Nakao Zensho;Wei, Chen-Yen
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.535-538
    • /
    • 2003
  • We employ Genetic Programming (GP) which is optimized with Simulated Annealing (SA) to recognize characteristic of a plan. Its result is described in Laplace function. The algorithm proceeds with automatic PID designs for the plant.

  • PDF

POLYNOMIAL CONVERGENCE OF PRIMAL-DUAL ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang
    • Journal of applied mathematics & informatics
    • /
    • 제30권1_2호
    • /
    • pp.127-133
    • /
    • 2012
  • We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

ANALYSIS OF A SMOOTHING METHOD FOR SYMMETRIC CONIC LINEAR PROGRAMMING

  • Liu Yong-Jin;Zhang Li-Wei;Wang Yin-He
    • Journal of applied mathematics & informatics
    • /
    • 제22권1_2호
    • /
    • pp.133-148
    • /
    • 2006
  • This paper proposes a smoothing method for symmetric conic linear programming (SCLP). We first characterize the central path conditions for SCLP problems with the help of Chen-Harker-Kanzow-Smale smoothing function. A smoothing-type algorithm is constructed based on this characterization and the global convergence and locally quadratic convergence for the proposed algorithm are demonstrated.

A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR PROGRAMMING BASED ON A SELF-REGULAR PROXIMITY

  • Liu, Zhongyi;Chen, Yue
    • Journal of applied mathematics & informatics
    • /
    • 제29권1_2호
    • /
    • pp.119-133
    • /
    • 2011
  • This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming. We introduce a special self-regular proximity to induce the feasibility step and also to measure proximity to the central path. The result of polynomial complexity coincides with the best-known iteration bound for infeasible interior-point methods, namely, O(n log n/${\varepsilon}$).

Improvement of Tomographic Imaging in Coded Aperture System based on Simulated annealing

  • Noritoshi Kitabatake;Chen, Yen-Wei;Zensyo Nakao
    • Proceedings of the IEEK Conference
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -1
    • /
    • pp.425-428
    • /
    • 2000
  • In this paper, we propose a new method based on SA(simulated annealing) with a fast algorithm for 3D image reconstructrion from the coded apereture images. The reconstructed images can be significantly improved by SA and to large computation cost of SA can be significantly reduced by the fast algorithm.

  • PDF

The Generation of SPOT True Color Image Using Neural Network Algorithm

  • Chen, Chi-Farn;Huang, Chih-Yung
    • Proceedings of the KSRS Conference
    • /
    • 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
    • /
    • pp.940-942
    • /
    • 2003
  • In an attempt to enhance the visual effect of SPOT image, this study develops a neural network algorithm to transform SPOT false color into simulated true color. The method has been tested using Landsat TM and SPOT images. The qualitative and quantitative comparisons indicate that the striking similarity can be found between the true and simulated true images in terms of the visual looks and the statistical analysis.

  • PDF

MODIFIED SIMULATED ANNEALING ALGORITHM FOR OPTIMIZING LINEAR SCHEDULING PROJECTS WITH MULTIPLE RESOURCE CONSTRAINTS

  • Po-Han Chen;Seyed Mohsen Shahandashti
    • International conference on construction engineering and project management
    • /
    • The 2th International Conference on Construction Engineering and Project Management
    • /
    • pp.777-786
    • /
    • 2007
  • This paper presents a modified simulated annealing algorithm to optimize linear scheduling projects with multiple resource constraints and its effectiveness is verified with a proposed problem. A two-stage solution-finding procedure is used to model the problem. Then the simulated annealing and the modified simulated annealing are compared in the same condition. The comparison results and the reasons of improvement by the modified simulated annealing are presented at the end.

  • PDF

Adaptive robust control for a direct drive SCARA robot manipulator (직접구동 SCARA 로봇 머니퓰레이터에 대한 적응견실제어)

  • Lee, Ji-Hyung;Kang, Chul-Goo
    • Journal of the Korean Society for Precision Engineering
    • /
    • 제12권8호
    • /
    • pp.140-146
    • /
    • 1995
  • In case the uncertainty existing in a system is assumed to satisfy the matching condition and to be come-bounded. Y. H. Chen proposed an adaptive robust control algorithm which introduced adaptive sheme for a design parameter into robust deterministic controls. In this paper, the adaptive robust control algorithm is applied to the position tracking control of direct drive robots, and simulation and experimental studies are conducted to evaluate control performance.

  • PDF