• Journal of the Semiconductor & Display Technology
• /
• v.20 no.1
• /
• pp.108-112
• /
• 2021

Undesired reflection removal from an image captured through glass window is widely needed with the prevalence of camera. In this paper, we present and implement a reflection removal algorithm, which is specially designed for smart devices. Our implementation requires smart phone application to take two input pictures of the same target, one with flash light on and another with flash light off. Then, we find a flash spot in the picture, match the features to align the input pictures, transform the color space, and finally combine the pictures. As the result, we get a resulting image with removed reflection, achieving the visually pleasant.

• Structural Engineering and Mechanics
• /
• v.52 no.2
• /
• pp.405-426
• /
• 2014

In this paper, a new meta-heuristic algorithm named Ranked Particles Optimization (RPO), is presented. This algorithm is not inspired from natural or physical phenomena. However, it is based on numerous researches in the field of meta-heuristic optimization algorithms. In this algorithm, like other meta-heuristic algorithms, optimization process starts with by producing a population of random solutions, Particles, located in the feasible search space. In the next step, cost functions corresponding to all random particles are evaluated and some of those having minimum cost functions are stored. These particles are ranked and their weighted average is calculated and named Ranked Center. New solutions are produced by moving each particle along its previous motion, the ranked center, and the best particle found thus far. The robustness of this algorithm is verified by solving some mathematical and structural optimization problems. Simplicity of implementation and reaching to desired solution are two main characteristics of this algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.11
• /
• pp.1145-1153
• /
• 2011

EMB (Electro-Mechanical Brake) systems can provide improved braking and stability functions such as ABS, EBD, TCS, ESC, BA, ACC, etc. For the implementation of the EMB systems, reliable and robust fault detection algorithm is required. In this study, a model-based fault detection algorithm is designed based on the analytical redundancy method in order to monitor current and force sensor faults in EMB systems. A state-space model for the EMB is derived including faulty signals. The fault diagnosis algorithm is constructed using the analytical redundancy method. Observer is designed for the EMB and the fault detectability condition is examined based on the residual analysis. The performance of the proposed model-based fault detection algorithm is verified in simulations. The effectiveness of the proposed algorithm is demonstrated in various faulty cases.

• ETRI Journal
• /
• v.25 no.6
• /
• pp.475-488
• /
• 2003

In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.42 no.3
• /
• pp.13-24
• /
• 2017

This paper aims to implement "structural changes detection procedure" in pairs trading algorithm and to show that the proposed approach outperforms the extant pair trading algorithm. Structural changes in pairs trading are defined in terms of changes in cointegrating factors and broken cointegration relationship. These changes are designed to test extant structural changes and unit root test methodologies. The simulation finds that expanding the changes in structure, increasing the mean reverting process of spread, and extending the consecutive days of broken cointegration will increase the performances of the proposed algorithm. Empirical study results are also consistent those of the simulation studies. The proposed algorithm outperforms the extant algorithm relative to risk and return given that the cumulative profit/loss has a significant upward-slope with minimal variance.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1183-1186
• /
• 1998

Adaptive nois canceller can extract the noiseremoved spech in noisy speech signal by adapting the filter-coefficients to the background noise environment. A kind of LMS algorithm is one of the most popular adaptive algorithm for noise cancellation due to low complexity, good numerical property and the merit of easy implementation. However there is the matter of increasing misadjustment at voiced speech signal. Therefore the demanded speech signal may be extracted. In this paper, we propose a fast and noise robust wavelet packet adaptive noise canceller with NLMS-SUM method LMS combined algorithm. That is, we decompose the frequency of noisy speech signal at the base of the proposed analysis tree structure. NLMS algorithm in low frequency band can efficiently dliminate the effect of the low frequency noise and SUM method LMS algorithm at each high frequency band can remove the high frequency nosie. The proposed wavelet packet adaptive noise canceller is enhanced the more in SNR and according to Itakura-Satio(IS) distance, it is closer to the clean speech signal than any other previous adaptive noise canceller.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.305-309
• /
• 2011

A sparse reconfigurable adaptive filter (SRAF) based on a photonic switch determines the appropriate time delays and weight values for an optical switch implementation of tapped-delay-line (TDL) systems. It is well known that the choice of switch delays is significantly important for efficiently implementing the SRAF. If the same values exist as calculating the sum of weight magnitudes for implementing the connection constraint required by the SRAF, conventional connection algorithm based on sequentially selection the maximum elements might not work perfectly. In an effort to increase the effectiveness of system identification, an upgraded connection algorithm used progressive calculation to obtain the better solution is considered in this paper. The performance of the proposed connection constraint algorithm is illustrated by computer simulation for a system identification application.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.2
• /
• pp.138-145
• /
• 2000

In this paper an initial alignment algorithm for a strapdown inertial navigation system is implemented using a RISC CPU board. The algorithm computes roll pitch and yaw angles of the direction cosine matrix utilizing measured components of the specific force and earth rate when the navigation system is stationary. The coarse alignment algorithm is performed first and then the fine alignment algorithm containing a 3rd-order gyrocompass loop follows. The experimental set consists of an IMU a CPU board and a monitoring system Experimental results show that the implemented algorithm can be utilized in navigation systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.210-212
• /
• 2000

In this paper, we propose an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks and implemented it with VLSI Proposed algorithm is based on the cell loss priority bit in the ATM cell header. This algorithm can solve the measurement phasing problem in cell conformance testing in ATM networks. Proposed algorithm can minimize the cell loss ratio of high priority cell(CLP=0) and resolve the burstiness of cells which may be introduced in traffic multiplexing and demultiplexing procedure. The result of performance evaluation shows that the performance of proposed algorithm is better than that of ITU-T usage parameter control algorithm.

• Journal of Korea Multimedia Society
• /
• v.6 no.4
• /
• pp.610-619
• /
• 2003

This paper presents a concept of cellular automata and a modular exponentiation algorithm and implementation of a basic EIGamal encryption by using cellular automata. Nowadays most of modular exponentiation algorithms are implemented by a linear feedback shift register(LFSR), but its structure has disadvantage which is difficult to implement an operation scheme when the basis is changed frequently The proposed algorithm based on a cellular automata in this paper can overcome this shortcomings, and can be effectively applied to the modular exponentiation algorithm by using the characteristic of the parallelism and flexibility of cellular automata. We also propose a new fast multiplier algorithm using the normal basis representation. A new multiplier algorithm based on normal basis is quite fast than the conventional algorithms using standard basis. This application is also applicable to construct operational structures such as multiplication, exponentiation and inversion algorithm for EIGamal cryptosystem.