• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.6
• /
• pp.95-101
• /
• 2008

In this paper, we present a new smoothing algorithm for variable depth mapping for real time stereoscopic image for 3D display. Proposed algorithm is based on the physical concept, called Laplacian equation and we also discuss the mapping of the depth from scene to displayed image. The approach to solve the problem in stereoscopic image which we adopt in this paper is similar to multi-region algorithm which was proposed by N.Holliman. The main difference thing in our algorithm compared with the N.Holliman's multi-region algorithm is that we use the Laplacian equation by considering the distance between viewer and object. We implement the real time stereoscopic image generation method for OpenGL on the circular polarized LCD screen to demonstrate its real functioning in the visual sensory system in human brain. Even though we make and use artificial objects by using OpenGL to simulate the proposed algorithm we assure that this technology may be applied to stereoscopic camera system not only for personal computer system but also for public broad cast system.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.1
• /
• pp.95-105
• /
• 2012

The selective catalytic reduction (SCR) system is a highly-effective aftertreatment device for NOx reduction of diesel engines. Generally, the ammonia ($NH_3$) was generated from reaction mechanism of SCR in the SCR system using the liquid urea as the reluctant. Therefore, the precise urea dosing control is a very important key for NOx and $NH_3$ slip reduction in the SCR system. This paper investigated NOx and $NH_3$ emission characteristics of urea-SCR dosing system based on model-based control algorithm in order to reduce NOx. In the map-based control algorithm, target amount of urea solution was determined by mass flow rate of exhaust gas obtained from engine rpm, torque and $O_2$ for feed-back control NOx concentration should be measured by NOx sensor. Moreover, this algorithm can not estimate $NH_3$ absorbed on the catalyst. Hence, the urea injection can be too rich or too lean. In this study, the model-based control algorithm was developed and evaluated on the numerical model describing physical and chemical phenomena in SCR system. One channel thermo-fluid model coupled with finely tuned chemical reaction model was applied to this control algorithm. The vehicle test was carried out by using map-based and model-based control algorithms in the NEDC mode in order to evaluate the performance of the model based control algorithm.

• Journal of Korean Society of Transportation
• /
• v.24 no.3 s.89
• /
• pp.177-187
• /
• 2006

It is known that over one million car navigation devices are being currently used in Korea. Most. if not all, route guidance systems, however, Provide only one "best" route to users, not providing any options for various types of users to select. The current practice dose not consider each individual's different preferences. These days, a vast amount of information became available due to the rapid development in information processing technology. Thus, users Prefer choices to be given and like to select the one that suits him/her the "best" among available information. To provide such options in this Paper, we developed an algorithm that provides alternative routes that may not the "least cost" ones, but ones that are close to the "least cost" routes for users to select. The algorithm developed and introduced in the paper utilizes a link-based search method, rather than the traditional node-based search method. The link-based algorithm can still utilize the existing transportation network without any modifications, and yet enables to provide flexible route guidance to meet the various needs of users by allowing transfer to other modes and/or restricting left turns. The algorithm developed has been applied to a toy network and demonstrated successful implementation of the multi-path search algorithm for multi-purpose activities.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.149-159
• /
• 2003

The need for information security increases interests on cipher algorithms recently. Especially, a large volume of data transmission over high-band communication network requires faster encryption and decryption techniques for real-time processing. It would be a good solution for this problem that we implement the cipher algorithm in forms of hardware circuits. Though some previous researches use this approach, they focus only on repeatedly executing the core part of the algorithm to minimize the hardware chip size, while most cipher algorithms are inherently parallel. In this paper, we propose a new design for the SEED block cipher algorithm developed by KISA (Korea Information Security Agency) in 1998 as Korean standard cipher algorithm. It exploits the parallelism of the algorithm basically and implements it in a pipelined fashion. We described the design in VHDL program and performed functional simulations on the program, and then found that it worked correctly. In addition, we synthesized it and verified that it could be implemented in a single FPGA chip, implying that the new design can be Practically used for the actual hardware implementation of a high-speed and high-performance cipher system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.957-964
• /
• 2011

The image stabilization is the procedure of stabilizing the blurred image with image processing method. Due to easy detection of global motion, PA(Projection algorithm) based on digital image stabilization has been studied by many researchers. PA has the advantage of easy implementation and low complexity, but in the case of serious rotational motion the accuracy of the algorithm will be cut down because of its fixed exploring range, and, on the other hand, if extending the exploring range, the block for detecting motion will become small, then we cannot detect correct global motion. In this paper, to overcome the drawback of conventional PA, an Iterative Projection Algorithm (IPA) is proposed, which improved the correctness of global motion by detecting global motion with detecting block which is appropriate to different extent of motion. With IPA, in the case of processing 1000 continual frames shot in automobile, compared with conventional algorithm and other detecting range, the results of PSNR is improved 6.8% at least, and 28.9% at the most.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.67-74
• /
• 2009

Incorrect deployment of RFID readers occurs reader-to-reader interferences in many applications using RFID technologies. Reader-to-reader interference occurs when a reader transmits a signal that interferes with the operation of another reader, thus preventing the second reader from communicating with tags in its interrogation zone. Interference detected by one reader and caused by another reader is referred to as a reader collision. In RFID systems, the reader collision problem is considered to be the bottleneck for the system throughput and reading efficiency. In this paper, we propose a novel RFID reader anti-collision algorithm based on evolutionary algorithm(EA). First, we analyze characteristics of RFID antennas and build database. Also, we propose EA encoding algorithm, fitness algorithm and genetic operators to deploy antennas efficiently. To show superiority of our proposed algorithm, we simulated our proposed algorithm. In the result, our proposed algorithm obtains 95.45% coverage rate and 10.29% interference rate after about 100 generations.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.9-16
• /
• 2014

This paper proposes a linear scratch detection and restoration algorithm using pixel data comparison in a single frame or consecutive frames. There exists a high parallelism in that a scratch detection and restoration algorithm needs a large amount of comparison operations. The proposed scratch detection and restoration algorithm is designed with a GPU for fast computation. We test the proposed algorithm in sequential and parallel processing with the set of digital videos in National Archive of Korea. In the experiments, the scratch detection rate of consecutive frames is as fast as about 20% for that of a single frame. The detection and restoration rates of a GPU-based algorithm are similar to those of a CPU-based algorithm, but the parallel implementation speeds up to about 50 times.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.6
• /
• pp.800-807
• /
• 2016

We propose a fast algorithm using Extreme Contour Point (ECP) to detect the angle of rotated images, is implemented by rotation feature of one covered frame image that can be applied to correct the rotated images like in image processing for real time applications, while CORDIC is inefficient to calculate various points like high definition image since it is only possible to detect rotated angle between one point and the other point. The two advantages of this algorithm, namely compatibility to images in preprocessing by using Sobel edge process for pattern recognition. While the other one is its simplicity for rotated angle detection with cyclic shift of two $1{\times}n$ matrix set without complexity in calculation compared with CORDIC algorithm. In ECP, the edge features of the sample image of gray scale were determined using the Sobel Edge Process. Then, it was subjected to binary code conversion of 0 or 1 with circular boundary to constitute the rotation in invariant conditions. The results were extracted to extreme points of the binary image. Its components expressed not just only the features of angle ${\theta}$ but also the square of radius $r^2$ from the origin of the image. The detected angle of this algorithm is limited only to an angle below 10 degrees but it is appropriate for real time application because it can process a 200 degree with an assumption 20 frames per second. ECP algorithm has an O ($n^2$) in Big O notation that improves the execution time about 7 times the performance if CORDIC algorithm is used.

• Journal of Power Electronics
• /
• v.16 no.5
• /
• pp.1964-1980
• /
• 2016

This paper presents a new simplified harmonics extraction algorithm based on the synchronous reference frame (SRF) for an indirect current controlled (ICC) three-level neutral point diode clamped (NPC) inverter-based shunt active power filter (SAPF). The shunt APF is widely accepted as one of the most effective current harmonics mitigation tools due to its superior adaptability in dynamic state conditions. In its controller, the SRF algorithm which is derived based on the direct-quadrature (DQ) theory has played a significant role as a harmonics extraction algorithm due to its simple implementation features. However, it suffers from significant delays due to its dependency on a numerical filter and unnecessary computation workloads. Moreover, the algorithm is mostly implemented for the direct current controlled (DCC) based SAPF which operates based on a non-sinusoidal reference current. This degrades the mitigation performances since the DCC based operation does not possess exact information on the actual source current which suffers from switching ripples problems. Therefore, three major improvements are introduced which include the development of a mathematical based fundamental component identifier to replace the numerical filter, the removal of redundant features, and the generation of a sinusoidal reference current. The proposed algorithm is developed and evaluated in MATLAB / Simulink. A laboratory prototype utilizing a TMS320F28335 digital signal processor (DSP) is also implemented to validate effectiveness of the proposed algorithm. Both simulation and experimental results are presented. They show significant improvements in terms of total harmonic distortion (THD) and dynamic response when compared to a conventional SRF algorithm.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.