• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.5
• /
• pp.247-253
• /
• 2012

This paper presents sensor network based autonomous vehicle system using a proposed image processing algorithm. The proposed image processing algorithm consists of pre-processing and five-stage image processing: coordinate calculation, driving area decision, line segment calculation, steeling decision, and acceleration decision. We evaluate the performance of the proposed algorithm on both straight road and curved road. Experimental results indicate that the proposed algorithm works well for autonomous vehicles. However, control accuracy of the proposed algorithm decreases as speed is increasing.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1479-1494
• /
• 2020

As an important part of image processing, image demosaicking has been widely researched. It is especially necessary to propose an efficient interpolation algorithm with good visual quality and performance. To improve the limitations of residual interpolation (RI), based on RI algorithm, minimalized-Laplacian RI (MLRI), and iterative RI (IRI), this paper focuses on adaptive RI (ARI) and proposes an improved ARI (IARI) algorithm which obtains more distinct R, G, and B colors in the images. The proposed scheme fully considers the brightness information and edge information of the image. Since the ARI algorithm is not completely adaptive, IARI algorithm executes ARI algorithm twice on R and B components according to the directional difference, which surely achieves an adaptive algorithm for all color components. Experimental results show that the improved method has better performance than other four existing methods both in subjective assessment and objective assessment, especially in the complex edge area and color brightness recovery.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.3
• /
• pp.49-58
• /
• 2020

Image interpolation, a technology that converts low resolution images into high resolution images, has been widely used in various image processing fields such as CCTV, web-cam, and medical imaging. This technique is based on the fact that the statistical distributions of the white Gaussian noise and the difference between the interpolated image and the original image is similar to each other. The proposed algorithm is composed of three steps. In first, the interpolated image is derived by random image interpolation. In second, we derive weighting functions that are used to apply non-local mean filtering. In the final step, the prediction error is corrected by performing non-local mean filtering by applying the selected weighting function. It can be considered as a post-processing algorithm to further reduce the prediction error after applying an arbitrary image interpolation algorithm. Simulation results show that the proposed method yields reasonable performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.2
• /
• pp.91-95
• /
• 2011

In this paper, we present an improved multi-scale gradient algorithm. The proposed algorithm works the effectively handling of both step and blurred edges. In the proposed algorithm, the image sharpening operator is sharpening the edges and contours of the objects. This operation gives an opportunity to get noise reduced image and step edged image. After that, multi-scale gradient operator works on noise reduced image in order to get a gradient image. The gradient image is segmented by watershed transform. The approach of region merging is used after watershed transform. The region merging is carried out according to the region area and region homogeneity. The region number of the proposed algorithm is 36% shorter than that of the existing algorithm because the proposed algorithm produces a few irrelevant regions. Moreover, the computational time of the proposed algorithm is relatively fast in comparison with the existing one.

• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.232-239
• /
• 2023

Aiming at the poor compression quality of traditional image compression coding (ICC) algorithm, a multi-description ICC algorithm based on depth learning is put forward in this study. In this study, first an image compression algorithm was designed based on multi-description coding theory. Image compression samples were collected, and the measurement matrix was calculated. Then, it processed the multi-description ICC sample set by using the convolutional self-coding neural system in depth learning. Compressing the wavelet coefficients after coding and synthesizing the multi-description image band sparse matrix obtained the multi-description ICC sequence. Averaging the multi-description image coding data in accordance with the effective single point's position could finally realize the compression coding of multi-description images. According to experimental results, the designed algorithm consumes less time for image compression, and exhibits better image compression quality and better image reconstruction effect.

• Journal of Platform Technology
• /
• v.6 no.4
• /
• pp.26-33
• /
• 2018

In this paper, we propose an image retrieval algorithm for real-time processing and design it as hardware. The proposed method is based on the classification of BoWs(Bag of Words) algorithm and proposes an image search algorithm using bit stream. K-fold cross validation is used for the verification of the algorithm. Data is classified into seven classes, each class has seven images and a total of 49 images are tested. The test has two kinds of accuracy measurement and speed measurement. The accuracy of the image classification was 86.2% for the BoWs algorithm and 83.7% the proposed hardware-accelerated software implementation algorithm, and the BoWs algorithm was 2.5% higher. The image retrieval processing speed of BoWs is 7.89s and our algorithm is 1.55s. Our algorithm is 5.09 times faster than BoWs algorithm. The algorithm is largely divided into software and hardware parts. In the software structure, C-language is used. The Scale Invariant Feature Transform algorithm is used to extract feature points that are invariant to size and rotation from the image. Bit streams are generated from the extracted feature point. In the hardware architecture, the proposed image retrieval algorithm is written in Verilog HDL and designed and verified by FPGA and Design Compiler. The generated bit streams are stored, the clustering step is performed, and a searcher image databases or an input image databases are generated and matched. Using the proposed algorithm, we can improve convenience and satisfaction of the user in terms of speed if we search using database matching method which represents each object.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.10
• /
• pp.78-88
• /
• 1995

For producing iron or steel products with good quality, the concentration of the material components should be analyzed quickly with high relability using XRF(Fluorescent X-Ray Spectrometer). Since the analysis results are much dependent upon the surface con- dition, the samples have to be prepared to have good test condition. This study presents an image processing system for inspecting the surface condition of the iron test sample. In order to use thd computer vision system, we need to develop a lighting device and image processing algorithm. For the adequate lighting device of inspection system, the indirect lighting device is contrived to cut the external light and provide uniform, stable and cold light. The image processing algorithm is aimed to reduce inspection time and to get similar analyzing results to those of the experienced operators. At first, the image processing algorithm checks whether the surface of the iron sample is ground well or not. Then, the defects; hole or dig are conted and surface condition is evaluated. In addition, the algorithm gives the reliability of the analyzing results in order to help operator's decision.

• Journal of information and communication convergence engineering
• /
• v.20 no.3
• /
• pp.195-203
• /
• 2022

Noise generated during image acquisition and transmission can negatively impact the results of image processing applications, and noise removal is typically a part of image preprocessing. Denoising techniques combined with nonlocal techniques have received significant attention in recent years, owing to the development of sophisticated hardware and image processing algorithms, much attention has been paid to; however, this approach is relatively poor for edge preservation of fine image details. To address this limitation, the current study combined a steering kernel technique with adaptive masks that can adjust the size according to the noise intensity of an image. The algorithm sets the steering weight based on a similarity comparison, allowing it to respond to edge components more effectively. The proposed algorithm was compared with existing denoising algorithms using quantitative evaluation and enlarged images. The proposed algorithm exhibited good general denoising performance and better performance in edge area processing than existing non-local techniques.

• Communications for Statistical Applications and Methods
• /
• v.29 no.2
• /
• pp.277-286
• /
• 2022

Due to the uniquely slow convergence speed of the EM algorithm, it suffers form a lot of processing time until the desired deconvolution image is obtained when the image is large. To cope with the problem, in this paper, an immediate solution of the EM algorithm is provided under the Gaussian image model. It is derived by finding the recurrent formular of the EM algorithm and then substituting the results repeatedly. In this paper, two types of immediate soultion of image deconboution by EM algorithm are provided, and both methods have been shown to work well. It is expected that it free the processing time of image deconvolution because it no longer requires an iterative process. Based on this, we can find the statistical properties of the restored image at specific iterates. We demonstrate the effectiveness of the proposed method through a simple experiment, and discuss future concerns.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.109-114
• /
• 1987

In this thesis, we work on the curve recognition with real time processing and the Robot tracking method on recognized curve. Image information of segment curve is supplied to computer to run to a Robot so that it is a feedback system. Image coordinate frame to world coordinate transformation represents in this paper and curve matching algorithm subscribes by two method, first transformation matching algorithm, second image coordinate matching algorithm. Also Robot running time to computer image processing time relationships finally includes.