• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.502-504
• /
• 2010

We propose novel transition rule of cellular automata for image enhancement and sharpening algorithm using it. Transition rule present sequential and parallel behavior. it also satisfy Lyapunov function. This image sharpening was developed and experimented by using a dynamic feature of convergence to fixed points. We can obtain efficiently sharpened image by performing arithmetic operation at the gradual parts of difference of brightness without image information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.7
• /
• pp.1907-1928
• /
• 2024

In recent years, multi-focus image fusion has emerged as a prominent area of research, with transformers gaining recognition in the field of image processing. Current approaches encounter challenges such as boundary artifacts, loss of detailed information, and inaccurate localization of focused regions, leading to suboptimal fusion outcomes necessitating subsequent post-processing interventions. To address these issues, this paper introduces a novel multi-focus image fusion technique leveraging the Swin Transformer architecture. This method integrates a frequency layer utilizing Wavelet Transform, enhancing performance in comparison to conventional Swin Transformer configurations. Additionally, to mitigate the deficiency of local detail information within the attention mechanism, Convolutional Neural Networks (CNN) are incorporated to enhance region recognition accuracy. Comparative evaluations of various fusion methods across three datasets were conducted in the paper. The experimental findings demonstrate that the proposed model outperformed existing techniques, yielding superior quality in the resultant fused images.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2000.02a
• /
• pp.517-522
• /
• 2000

• Journal of the Korean Society of Radiology
• /
• v.13 no.4
• /
• pp.623-628
• /
• 2019

The aim of this study was to design fast non local means (FNLM) noise reduction algorithm and to confirm its application feasibility in light microscopic image. For that aim, we acquired mouse first molar image and compared between previous widely used noise reduction algorithm and our proposed FNLM algorithm in acquired light microscopic image. Contrast to noise ratio, coefficient of variation, and no reference-based evaluation parameter such as natural image quality evaluator (NIQE) and blind/referenceless image spatial quality evaluator (BRISQUE) were used in this study. According to the result, our proposed FNLM noise reduction algorithm can achieve excellent result in all evaluation parameters. In particular, it was confirmed that the NIQE and BRISQUE evaluation parameters for analyzing the overall morphologcal image of the tooth were 1.14 and 1.12 times better than the original image, respectively. In conclusion, we demonstrated the usefulness and feasibility of FNLM noise reduction algorithm in light microscopic image of small animal tooth.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1449-1461
• /
• 2019

Face sketch synthesis plays an important role in public security and digital entertainment. In this paper, we present a novel face sketch synthesis method via local similarity and nonlocal similarity regularization terms. The local similarity can overcome the technological bottlenecks of the patch representation scheme in traditional learning-based methods. It improves the quality of synthesized sketches by penalizing the dissimilar training patches (thus have very small weights or are discarded). In addition, taking the redundancy of image patches into account, a global nonlocal similarity regularization is employed to restrain the generation of the noise and maintain primitive facial features during the synthesized process. More robust synthesized results can be obtained. Extensive experiments on the public databases validate the generality, effectiveness, and robustness of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.4
• /
• pp.96-104
• /
• 1998

In this paper, the circuit of DTCNN designed using dilation and erosion operation, a basic operation of gray-scale morphology, also each cell designed PE in order to having extension using the local connectivity. In this PE design, connection of between cell and cell become simple. And it is realized to easily VLSI realization as well as to circuit to be parallel processing. As the resutls of simulations, the proposed method was verified to improved more operation speed than the sequential data processing, parallel processing DTCNN was implemented in a 0.8.mu.m CMOS technology using COMPASS Tool.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4060-4079
• /
• 2020

Blur is an important type of image distortion. How to evaluate the quality of blurred image accurately and efficiently is a research hotspot in the field of image processing in recent years. Inspired by the multi-scale perceptual characteristics of the human visual system (HVS), this paper presents a no-reference image blur/sharpness assessment method based on multi-scale local features in the spatial domain. First, considering various content has different sensitivity to blur distortion, the image is divided into smooth, edge, and texture regions in blocks. Then, the Gaussian scale space of the image is constructed, and the categorized contrast features between the original image and the Gaussian scale space images are calculated to express the blur degree of different image contents. To simulate the impact of viewing distance on blur distortion, the distribution characteristics of local maximum gradient of multi-resolution images were also calculated in the spatial domain. Finally, the image blur assessment model is obtained by fusing all features and learning the mapping from features to quality scores by support vector regression (SVR). Performance of the proposed method is evaluated on four synthetically blurred databases and one real blurred database. The experimental results demonstrate that our method can produce quality scores more consistent with subjective evaluations than other methods, especially for real burred images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.350-357
• /
• 2010

In this paper, we present an auto-range fast bilateral filter (FBF) for high-dynamic-range (HDR) images, which increases computation speed by using adaptive standard deviations for range filter (RF) of FBF in iCAM06. Many images that cover the entire dynamic range of the scene with different exposure times are fused into one High Dynamic Range (HDR) image. The representative algorithm for HDR image rendering is iCAM06, which is based on the iCAM framework, such as the local white point adaptation, chromatic adaptation, and the image processing transform (IPT) uniform color space. FBF in iCAM06 uses constant standard deviation in RF. So, it causes unnecessary FBF computation in high stimulus range with broad and low distribution. To solve this problem, the low stimulus image and high stimulus image of CIE tri-stimulus values (XYZ) divided by the threshold are respectively processed by adaptive standard deviation based on its histogram distribution. Experiment results show that the proposed method reduces computation time than the previous FBF.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.54-61
• /
• 2023

With the development of IoT technologies and artificial intelligent, diverse digital image equipments are being used in industrial sites. Because image data can be easily damaged by noise while it's obtained with a camera or a sensor and the damaged image has a bad effect on the process of image processing, noise removal is being demanded as preprocessing. In this thesis, for the restoration of image damaged by the noise of random impulse, a switching filter algorithm based on noise estimation was suggested. With the proposed algorithm, noise estimation and error distraction were carried out according to the similarity of the pixel values in the local mask of the image, and a filter was chosen and switched depending on the ratio of noise existing in the local mask. Simulations were conducted to analyze the noise removal performance of the proposed algorithm, and as a result of magnified image and PSNR comparison, it showed superior performance compared to the existing method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.328-330
• /
• 2015

Edge is a characteristic information that can easily obtain the size, direction and location of objects included in the image, and the edge detection is utilized as a preprocess processing in various image processing application sectors such as object detection and object recognition, etc. For the conventional edge detection methods, there are Sobel, Prewitt and Roberts. These existing edge detection methods are easy to implement but the edge detection characteristics are somewhat insufficient as fixed weighted mask is applied. Therefore, in order to compensate the problems of existing edge detection methods, in this paper, an edge detection algorithm was proposed after applying the weighted value according to the standard deviation and means within the local mask.