• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.3
• /
• pp.128-134
• /
• 2014

A real-time, continuous-scale image interpolation method is proposed based on a bilinear interpolation with directionally adaptive low-pass filtering. The proposed algorithm was optimized for hardware implementation. The ordinary bi-linear interpolation method has blocking artifacts. The proposed algorithm solves this problem using directionally adaptive low-pass filtering. The algorithm can also solve the severe blurring problem by selectively choosing low-pass filter coefficients. Therefore, the proposed interpolation algorithm can realize a high-quality image scaler for a range of imaging systems, such as digital cameras, CCTV and digital flat panel displays.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.877-880
• /
• 2000

In this paper, we develop an algorithm of soccer image sequences mosaicing using reverse affine transform. The continuous mosaic images of soccer ground field allows the user/viewer to view a “wide picture” of the player’s actions The first step of our algorithm is to automatic detection and tracking player, ball and some lines such as center circle, sideline, penalty line and so on. For this purpose, we use the ground field extraction algorithm using color information and player and line detection algorithm using four P-rules and two L-rules. The second step is Affine transform to map the points from image to model coordinate using predefined and pre-detected four points. General Affine transformation has many holes in target image. In order to delete these holes, we use reverse Affine transform. We tested our method in real image sequence and the experimental results are given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1068-1074
• /
• 2008

In this paper, we propose the algorithm for generating the array of elemental image by using look-up table (L UT) in a computer generated integral imaging system. It makes the LUT independently for the projection point of x and y. The algorithm using LUT to the existing ones needs less computing time to generate the array of elemental image. By comparing the computing time of proposed algorithm with that of the existing algorithms e xperimently, we proved the efficiency of proposed algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.4
• /
• pp.7-16
• /
• 2002

En this paper, we propose the algorithm that has analyzed the map Information automatically to extract the contour lines and numbers, symbols from the map image. After converting the input image to binary one, thinned image is obtained by thinning algorithm. The contour elements in the thinned image are classified and the classified elements are analyzed to automatically classify the numbers from symbols. Finally, the broken parts are restored by reconstruction algorithm. The performance of proposed algorithm is verified through the simulation. The proposed one has good performance.

• 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.

• Journal of Astronomy and Space Sciences
• /
• v.23 no.1
• /
• pp.29-38
• /
• 2006

This paper presents an Image Motion Compensation (IMC) algorithm for the Korea's Communication, Ocean, and Meteorological Satellite (COMS)-1. An IMC algorithm is a priority component of image registration in Image Navigation and Registration (INR) system to locate and register radiometric image data. Due to various perturbations, a satellite has orbit and attitude errors with respect to a reference motion. These errors cause depointing of the imager aiming direction, and in consequence cause image distortions. To correct the depointing of the imager aiming direction, a compensation algorithm is designed by adapting different equations from those used for the GOES satellites. The capability of the algorithm is compared with that of existing algorithm applied to the GOES's INR system. The algorithm developed in this paper improves pointing accuracy by 40%, and efficiently compensates the depointings of the imager aiming direction.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2927-2936
• /
• 2013

In this paper, we propose a noise reduction and hole removal algorithm in order to improve the quality of depth images when they are used for creating 3D contents. In the proposed algorithm, the depth image and the corresponding color image are both used. First, an intensity image is generated by converting the RGB color space into the HSI color space. By estimating the difference of distance and depth between reference and neighbor pixels from the depth image and difference of intensity values from the color image, they are used to remove noise in the proposed algorithm. Then, the proposed hole filling method fills the detected holes with the difference of euclidean distance and intensity values between reference and neighbor pixels from the color image. Finally, we apply a parallel structure of GPGPU to the proposed algorithm to speed-up its processing time for real-time applications. The experimental results show that the proposed algorithm performs better than other conventional algorithms. Especially, the proposed algorithm is more effective in reducing edge blurring effect and removing noise and holes.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.57-60
• /
• 2000

This paper presents a new adaptive fast motion estimation algorithm along with its architecture. The conventional algorithm such as full - search algorithm, three step algorithm have some disadvantages which are related to the amount of computation, the quality of image and the implementation of hardware, the proposed algorithm uses spatial correlation and a slope of motion vector in order to reduce the amount of computation and preserve good image quality, The proposed algorithm is better than the conventional Block Matching Algorithm(BMA) with regard to the amount of computation and image quality. Also, we propose an efficient at chitecture to implement the proposed algorithm. It is suitable for real time processing application.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3694-3702
• /
• 1999

OSL algorithm has an advantage that repeated algorithm is easily derived, even though penalty function which has a complicated transcendental function. In order to solve this problem, we suggested MPEMG algorithm. However, though this algorithm extend convergence rate of smoothing constant, it include the problem that is not faster than OSL algorithm in the convergence rate increasing penalized log-likelihood. Accordingly, in this paper, we will suggest SMOSLG digital image restoration algorithm which is fast in the convergence rate as well as extend convergence region of smoothing constant. And also we will study the usefulness of algorithm suggested through digital image simulation.

• Journal of Korea Multimedia Society
• /
• v.20 no.6
• /
• pp.845-852
• /
• 2017

In this paper, we propose a binarization algorithm using LVQ-Merge clustering method for fast and accurate extraction of cells from cell images. The proposed method clusters pixel data of a given image by using LVQ to remove noise and divides the result into two clusters by applying a hierarchical clustering algorithm to improve the accuracy of binarization. As a result, the execution speed is somewhat slower than that of the conventional LVQ or Otsu algorithm. However, the results of the binarization have very good quality and are almost identical to those judged by the human eye. Especially, the bigger and the more complex the image, the better the binarization quality. This suggests that the proposed method is a useful method for medical image processing field where high-resolution and huge medical images must be processed in real time. In addition, this method is possible to have many clusters instead of two cluster, so it can be used as a method to complement a hierarchical clustering algorithm.