• 전기학회논문지
• /
• 제61권12호
• /
• pp.1903-1910
• /
• 2012

This paper presents a data based low-order controller design algorithm for a linear time-invariant process with a time delay. The algorithm is composed by combining an identification step based on open loop pulse test with a low-order controller design step to obtain the entire set of controllers achieving multiple performance specifications. The initial information necessary for this algorithm are merely the width and amplitude of a rectangular pulse, a controller of four types (PI, PD, PID, first-order), and design objectives. Various parametric approaches that have been developed are merged in the controller design algorithm. The resulting controller set satisfying the design objectives are displayed on the 2D and 3D graphics and thus it is very easy for us to pick a controller inside the admissible set because we can check the corresponding closed-loop performances visually.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.843-846
• /
• 2000

An optical flow-based motion estimation algorithm is proposed for video coding. The algorithm uses block-matching motion estimation with an adaptive search region. The search region is computed from motion fields that are estimated based on the optical flow. The algorithm is based on the fact that true block-motion vectors have similar characteristics to optical flow vectors. Thereafter, the search region is computed using these optical flow vectors that include spatial relationships. In conventional block matching, the search region is fixed. In contrast, in the new method, the appropriate size and location of the search region are both decided by the proposed algorithm. The results obtained using test images show that the proposed algorithm can produce a significant improvement compared with previous block-matching algorithms.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2005년도 추계학술대회 논문집
• /
• pp.250-255
• /
• 2005

본 논문에서는 적응 신호처리의 수렴속도를 향상 시키고 복잡한 계산량을 줄이는 새로운 필터 구조를 제안한다. 그리고 제안한 알고리즘을 웨이블렛 기반 적응 알고리즘에 적용한다. 실제로 합성 음성을 사용하여 적응 잡음 제거기에 적용하여 컴퓨터 시뮬레이션을 통해 제안한 알고리즘과 기존 알고리즘과의 성능을 비교한다. 그 결과 변환 영역 알고리즘은 기존의 시간영역의 알고리즘보다 수렴속도의 향상을 보였고, 웨이블렛 알고리즘, short-length fast running FIR 알고리즘, fast-short-length fast FIR 알고리즘 그리고 제안한 알고리즘에 대한 비교 연구를 수행하였다.

• International Journal of Advanced Culture Technology
• /
• 제5권2호
• /
• pp.74-81
• /
• 2017

Recently, there are many companies that use systems based on artificial intelligence. The accuracy of artificial intelligence depends on the amount of learning data and the appropriate algorithm. However, it is not easy to obtain learning data with a large number of entity. Less data set have large generalization errors due to overfitting. In order to minimize this generalization error, this study proposed DGA(Dropout Genetic Algorithm) which can expect relatively high accuracy even though data with a less data set is applied to machine learning based genetic algorithm to deep learning based dropout. The idea of this paper is to determine the active state of the nodes. Using Gradient about loss function, A new fitness function is defined. Proposed Algorithm DGA is supplementing stochastic inconsistency about Dropout. Also DGA solved problem by the complexity of the fitness function and expression range of the model about Genetic Algorithm As a result of experiments using MNIST data proposed algorithm accuracy is 75.3%. Using only Dropout algorithm accuracy is 41.4%. It is shown that DGA is better than using only dropout.

• Journal of Power Electronics
• /
• 제16권6호
• /
• pp.2212-2220
• /
• 2016

Based on the conventional PID algorithm and the adaptive PID (AD-PID) algorithm, a separate sampling adaptive PID (SSA-PID) algorithm is proposed to improve the transient response of digitally controlled DC-DC converters. The SSA-PID algorithm, which can be divided into an oversampled adaptive P (AD-P) control and an adaptive ID (AD-ID) control, adopts a higher sampling frequency for AD-P control and a conventional sampling frequency for AD-ID control. In addition, it can also adaptively adjust the PID parameters (i.e. $K_p$, $K_i$ and $K_d$) based on the system state. Simulation results show that the proposed algorithm has better line transient and load transient responses than the conventional PID and AD-PID algorithms. Compared with the conventional PID and AD-PID algorithms, the experimental results based on a FPGA indicate that the recovery time of the SSA-PID algorithm is reduced by 80% and 67% separately, and that overshoot is decreased by 33% and 12% for a 700mA load step. Moreover, the SSA-PID algorithm can achieve zero overshoot during startup.

• Journal of Information Processing Systems
• /
• 제16권6호
• /
• pp.1343-1358
• /
• 2020

In the stagewise arithmetic orthogonal matching pursuit algorithm, the weak threshold used in sparsity estimation is determined via maximum iterations. Different maximum iterations correspond to different thresholds and affect the performance of the algorithm. To solve this problem, we propose an improved variable weak threshold based on the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the residual error value to control the weak threshold. When the residual value decreases, the threshold value continuously increases, so that the atoms contained in the atomic set are closer to the real sparsity value, making it possible to improve the reconstruction accuracy. In addition, we improved the generalized Jaccard coefficient in order to replace the inner product method that is used in the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the covariance to replace the joint expectation for two variables based on the generalized Jaccard coefficient. The improved generalized Jaccard coefficient can be used to generate a more accurate calculation of the correlation between the measurement matrixes. In addition, the residual is more accurate, which can reduce the possibility of selecting the wrong atoms. We demonstrate using simulations that the proposed algorithm produces a better reconstruction result in the reconstruction of a one-dimensional signal and two-dimensional image signal.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권8호
• /
• pp.2119-2136
• /
• 2024

The rapid progress of social media allows more people to express their feelings and opinions online. Many data on social media contains people's emotional information, which can be used for people's psychological analysis and emotional calculation. This research is based on the simplified psychological scale algorithm of multi-theory integration. It aims to accurately analyze people's psychological emotion. According to the comparative analysis of algorithm performance, the results show that the highest recall rate of the algorithm in this study is 95%, while the highest recall rate of the item response theory algorithm and the social network analysis algorithm is 68% and 87%. The acceleration ratio and data volume of the research algorithm are analyzed. The results show that when 400,000 data are calculated in the Hadoop cluster and there are 8 nodes, the maximum acceleration ratio is 40%. When the data volume is 8GB, the maximum scale ratio of 8 nodes is 43%. Finally, we carried out an empirical analysis on the model that compute the population's psychological and emotional conditions. During the analysis, the psychological simplification scale algorithm was adopted and multiple theories were taken into account. Then, we collected negative comments and expressions about Japan's discharge of radioactive water in microblog and compared them with the trend derived by the model. The results were consistent. Therefore, this research model has achieved good results in the emotion classification of microblog comments.

• 한국전자통신학회논문지
• /
• 제8권4호
• /
• pp.555-560
• /
• 2013

본 논문에서는 거리측정, 로그전력, 실효치 방법에 의하여 유성음, 무성음, 묵음 구간을 검출하여, 서브밴드 필터에 의한 잡음제거 알고리즘을 제안한다. 제안한 알고리즘은 각 프레임에서 서브밴드 필터를 사용하여 잡음으로 오염된 음성신호로부터 백색잡음 및 도로잡음의 스펙트럼을 차감하는 방법이다. 본 실험에서는 Aurora-2 데이터베이스에 포함된 음성신호와 잡음신호를 사용하여 스펙트럼 차감 알고리즘의 결과를 나타낸다. 잡음에 의하여 오염된 음성신호에 대하여 신호대잡음비를 사용하여 본 알고리즘이 유효하다는 것을 확인한다. 실험으로부터 백색잡음에 대하여 평균 2.1 dB, 도로잡음에 대하여 평균 1.91 dB의 출력 신호대잡음비가 개선된 것을 확인할 수 있었다.

• 한국인공지능학회지
• /
• 제5권1호
• /
• pp.18-28
• /
• 2017

Recently, there are many companies that use systems based on artificial intelligence. The accuracy of artificial intelligence depends on the amount of learning data and the appropriate algorithm. However, it is not easy to obtain learning data with a large number of entity. Less data set have large generalization errors due to overfitting. In order to minimize this generalization error, this study proposed DGA which can expect relatively high accuracy even though data with a less data set is applied to machine learning based genetic algorithm to deep learning based dropout. The idea of this paper is to determine the active state of the nodes. Using Gradient about loss function, A new fitness function is defined. Proposed Algorithm DGA is supplementing stochastic inconsistency about Dropout. Also DGA solved problem by the complexity of the fitness function and expression range of the model about Genetic Algorithm As a result of experiments using MNIST data proposed algorithm accuracy is 75.3%. Using only Dropout algorithm accuracy is 41.4%. It is shown that DGA is better than using only dropout.

• 정보통신설비학회논문지
• /
• 제5권1호
• /
• pp.25-36
• /
• 2006

This paper discusses the implementation and performance evaluation of a DSP-based digital beamformer using the Texas Instrument TMSC6711 DSP processor for smart antenna applications. Two adaptive beamforming algorithms which served as the brain for the beamformer, the Normalized Least-Mean-Square (NLMS) and the Constant Modulus Algorithms (CMA) were embedded into the processor and evaluated. Result shows that the NLMS-based digital beamformer outperforms the CMA-based digital beamformer: 1)For NLMS algorithm, the antenna steers to the direction of the desired user even at low iteration value and the suppression level towards the interferer increases as the number of iteration increase. For CMA algorithm, the beam radiation pattern slowly steers to the desired user as the number of iteration increased, but at arate slower than NLMS algorithm and the sidelobe level is shown to increases as the number of iteration increase. 2) The NLMS algorithm has faster convergence than CMA algorithm and the error convergence for CMA algorithm sometimes is subject to misadjustment.