• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.6
• /
• pp.258-266
• /
• 2002

This paper proposes the methodology of the image processing algorithm that estimates the pose of the inner-pipe crawling robot. The inner-pipe crawling robot is usually equipped with a lighting device and a camera on its head for monitoring and inspection purpose of defects on the pipe wall and/or the maintenance operation. The proposed methodology is using these devices without introducing the extra sensors and is based on the fact that the position and the intensity of the reflected light from the inner wall of the pipe vary with the robot posture and the camera. The proposed algorithm is divided into two parts, estimating the translation and rotation angle of the camera, followed by the actual pose estimation of the robot . Based on the fact that the vanishing point of the reflected light moves into the opposite direction from the camera rotation, the camera rotation angle can be estimated. And, based on the fact that the most bright parts of the reflected light moves into the same direction with the camera translation, the camera position most bright parts of the reflected light moves into the same direction with the camera translation, the camera position can be obtained. To investigate the performance of the algorithm, the algorithm is applied to a sewage maintenance robot.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.271-286
• /
• 2013

Recently, a pixel-chaotic-shuffling (PCS) method has been proposed by Huang et al. for encrypting color images using multiple chaotic systems like the Henon, the Lorenz, the Chua, and the Rossler systems. All of which have great encryption performance. The authors claimed that their pixel-chaotic-shuffle (PCS) encryption method has high confidential security. However, the security analysis of the PCS method against the chosen-plaintext attack (CPA) and known-plaintext attack (KPA) performed by Solak et al. successfully breaks the PCS encryption scheme without knowing the secret key. In this paper we present an improved shuffling pattern for the plaintext image bits to make the cryptosystem proposed by Huang et al. resistant to chosen-plaintext attack and known-plaintext attack. The modifications in the existing PCS encryption method are proposed to improve its security performance against the potential attacks described above. The Number of Pixel Change Rate (NPCR), Unified Average Changed Intensity (UACI), information entropy, and correlation coefficient analysis are performed to evaluate the statistical performance of the modified PCS method. The simulation analysis reveals that the modified PCS method has better statistical features and is more resistant to attacks than Huang et al.'s PCS method.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.521-526
• /
• 2003

In this paper, we propose a geometric active contour model based on intensity information and curve evolution for detecting region boundaries. We put boundary extraction problem as the minimization of the difference between the average intensity of the region and the intensity of the expanding closed curves. We used level set theory to implement the curve evolution for optimal solution. It offered much more freedom in the initial curve position than a general active contour model. Our methods could detect regions whose boundaries are not necessarily defiened by gradient compared to general edge based methods and detect multiple boundaries at the same time. We could improve the result by using anisotropic diffusion filter in image preprocessing. The performance of our model was demonstrated on several data sets like CT and MRI medical images.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.253-255
• /
• 2022

Thanks to the 4th industrial revolution and the development of various communication media, technologies such as artificial intelligence and automation are being grafted into industrial sites in various fields, and accordingly, the importance of data processing is increasing. Image noise removal is a pre-processing process for image processing, and is mainly used in fields requiring high-level image processing technology. Various studies have been conducted to remove noise, but various problems arise in the process of noise removal, such as image detail preservation, texture restoration, and noise removal in a special area. In this paper, we propose a switching mask filter based on the noise intensity to preserve the detailed image information during the impulse noise removal process. The proposed filter algorithm obtains the final output by switching to the extended mask when it is determined that the density is higher than the reference value when noise is determined in the area designated as the filtering mask. Simulation was conducted to evaluate the performance of the proposed algorithm, and the performance was analyzed compared to the existing method.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.3
• /
• pp.43-48
• /
• 2018

In this paper, we present a method for removing shadows from scanned documents. Compared to the existing methods such as one based on image pyramid representation or adaptive thresholding, our method produces more robust and higher quality results. The basic idea of the approach is to use the local image statistics and to separate interesting regions from the image such as the regions around letters and figures. For the separated regions, we adaptively adjust the local brightness and contrast, and apply the sigmoid function to the intensity values as well to enhance the clarity of the image. For separated the other empty regions, we apply the gradient-base image hole filling method to fill the region with smooth color change.

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

Most recognition methods of car licence plate have difficulties concerning plate recognition rates and system stability in that restricted car images are used and good image capture environment is required. To overcome these difficulties, I proposed a new recognition method of car licence plates, in which both intensity variation and color information are used. For a captured car image, multiple candidate plate-bands are extracted based on the number of intensity variation. To have an equal performance on abnormally dark and bright Images. plate lightness is calculated and adjusted based on the brightness of plate background. Candidate plate regions are extracted using contour following on plate color pixels in oath plate band. A candidate region is decided as a real plate region after extracting character regions and then recognizing them. I recognize characters using template matching since total number of possible characters is small and they art machine printed. To show the efficiency of the proposed method, I tested it on 200 car images and found that the method shows good performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.30-35
• /
• 2010

This paper presents a quality enhancement of images by using a histogram equalization based on the symmetric logistic function. The histogram equalization is a simple and effective spatial processing method that it enhances the quality by adjusting the brightness of image. The logistic function that is a sigmoidal nonlinear transformation function, is applied to non-linearly enhance the brightness of the image according to its intensity level frequency. We propose a flexible and symmetrical logistic function by only using the intensity with maximum frequency in an histogram and the total number of pixels. The proposed function decreases the computation load of an exponential function in the traditional logistic function. The proposed method has been applied for equalizing 5 images with a different resolution and histogram distribution. The experimental results show that the proposed method has the superior enhancement performances compared with the source images and the traditional global histogram equalization, respectively.

• The KIPS Transactions:PartB
• /
• v.17B no.4
• /
• pp.303-308
• /
• 2010

In this paper, we propose a medical image registration technique combining the gradient vector flow and modified conditional entropy. The registration is conducted by the use of a measure based on the entropy of conditional probabilities. To achieve the registration, we first define a modified conditional entropy (MCE) computed from the joint histograms for the area intensities of two given images. In order to combine the spatial information into a traditional registration measure, we use the gradient vector flow field. Then the MCE is computed from the gradient vector flow intensity (GVFI) combining the gradient information and their intensity values of original images. To evaluate the performance of the proposed registration method, we conduct experiments with our method as well as existing method based on the mutual information (MI) criteria. We evaluate the precision of MI- and MCE-based measurements by comparing the registration obtained from MR images and transformed CT images. The experimental results show that the proposed method is faster and more accurate than other optimization methods.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.571-574
• /
• 2005

In this paper, we propose an efficient image segmentation technique for large-sized monochrome images using a hybrid approach which combines threshold and region-based techniques. First, an image is partitioned into fixed-size blocks and for each block the representative intensity is determined by averaging pixel intensities within the block. Next, the neighborhood blocks that have similar characteristics with respect to a specific threshold are merged in order to form candidate regions. Finally, those candidate regions are refined to get final target object regions by merging regions considering the spatial locality and certain criteria. We have performed experiments on images selected from various domains and showed that our technique was able to extract target object regions appropriately from most images.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.21 no.2
• /
• pp.63-73
• /
• 2017

Segmenting the image into multiple regions is at the core of image processing. Many segmentation formulations of an images with multiple regions have been suggested over the years. We consider segmentation algorithm based on the multi-phase level set method in this work. Proposed method gives the best result upon other methods found in the references. Moreover it can segment images with intensity inhomogeneity and have multiple junction. We extend our method (GLIF) in [T. Dultuya, and M. Kang, Segmentation with shape prior using global and local image fitting energy, J.KSIAM Vol.18, No.3, 225-244, 2014.] using a multiphase level set formulation to segment images with multiple regions and junction. We test our method on different images and compare the method to other existing methods.