• Journal of Biomedical Engineering Research
• /
• v.19 no.2
• /
• pp.189-198
• /
• 1998

3D medical image reconstruction techniques are useful to figure out complex 3D structures from the set of 2D sections. In the paper, 3D medical image reconstruction system is constructed under PC environment and programmed based on modular programming by using Visual C++ 4.2. The whole procedures are composed of data preparation, gradient estimation, classification, shading, transformation and ray-casting & compositing. Three speed optimization techniques are used for accelerating 3D medical image reconstruction technique. One is to reduce the rays when cast rays to reconstruct 3D medical image, another is to reduce the voxels to be calculated and the other is to apply early ray termination. To implement 3D medical image reconstruction system based on PC, speed optimization techniques are experimented and applied.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.94-97
• /
• 2003

In this Paper, propose for MLP(multilayer perception) neural network that uses optimization recognition training scheme for the wavelet transform and the numeral image add to noise, and apply this system in Numeral Recognition. As important part of original image information preserves maximum using the wavelet transform, node number of neural network and the loaming convergence time did size of input vector so that decrease. Apply in training vector, examine about change of the recognition rate as optimization recognition training scheme raises noise of data gradually. We used original image and original image added 0, 10, 20, 30, 40, 50㏈ noise (or the increase of numeral recognition rate. In case of test image added 30∼50㏈, numeral recognition rate between the original image and image added noise for training Is a little But, in case of test image added 0∼20㏈ noise, the image added 0, 10, 20, 30, 40 , 50㏈ noise is used training. Then numeral recognition rate improved 9 percent.

• The Journal of Korea Robotics Society
• /
• v.9 no.4
• /
• pp.197-205
• /
• 2014

As computer vision algorithms are developed on a continuous basis, the visual information from vision sensors has been widely used in the context of simultaneous localization and mapping (SLAM), called visual SLAM, which utilizes relative motion information between images. This research addresses a visual SLAM framework for online localization and mapping in an unstructured seabed environment that can be applied to a low-cost unmanned underwater vehicle equipped with a single monocular camera as a major measurement sensor. Typically, an image motion model with a predefined dimensionality can be corrupted by errors due to the violation of the model assumptions, which may lead to performance degradation of the visual SLAM estimation. To deal with the erroneous image motion model, this study employs a local bundle optimization (LBO) scheme when a closed loop is detected. The results of comparison between visual SLAM estimation with LBO and the other case are presented to validate the effectiveness of the proposed methodology.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1145-1148
• /
• 2002

This paper presents a new method which is calculated to use only three vanishing points in order to compute the dimensions of object and its pose from a single image of perspective projection taken by a camera and the problem of recovering 3D models from three vanishing points of box scene. Our approach is to compute only three vanishing points without this information such as the focal length, rotation matrix, and translation from images in the case of perspective projection. We assume that the object can be modeled as a linear function of a dimension vector ν. The input of reconstruction is a set of correspondences between features in the model and features in the image. To minimize each the dimensions of the parameterized models, this reconstruction of optimization can be solved by the standard nonlinear optimization techniques with a multi-start method which generates multiple starting points for the optimizer by sampling the parameter space uniformly.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10c
• /
• pp.367-370
• /
• 2007

In this paper, we concentrate on the mask design problem for optical micro-lithography. The pre-distorted mask is obtained by minimizing the error between the designed output image and the projected output image. We use the particle swarm optimization(PSO) and fuzzy system to insure that the resulting images are identical to the desired image. Our method has good performance for the iteration number by an experiment.

• Korean Journal of Remote Sensing
• /
• v.28 no.4
• /
• pp.459-466
• /
• 2012

Satellite operation is divided as user's request, image collection planning, product generation, distribution. Image collection planning is to make image collection plan of satellite to reflect user's request in proper time based on NTO (New Task Order) and AO (Archive Order) using limited satellite resources. Image collection planning has high computational cost because of considering several variables simultaneously, is to be performed identical process repeatedly. In this paper, optimization research of image collection planning is performed for efficient planning. First, formulation of image collection planning is made to require satellite image as much as possible and then Heuristic algorithm is suggested for solution of formulation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.1-8
• /
• 2007

In this paper, research on joint optimization of the image spatial registration and the exposure compensation is conducted. The exposure compensation is performed in a frame work of the intensity compensation based on the polynomial approximation of the relationship between images. This compensation is jointly combined with the registration problem employing the Gauss-Newton nonlinear optimization method. In this paper, to perform for a simple and stable optimization, the block-coordinate method is combined with the Gauss-Newton optimization and extensively compared with the traditional approaches. Furthermore, regression analysis is considered in the compensation part for a better stable performance. By combining the block-coordinate method with the Gauss-Newton optimization, we can obtain a compatible performance reducing the computational complexity and stabilizing the performance. In the numerical result for a particular image, we obtain a satisfactory result for 10 repeats of the iteration, which implies a 50% reduction of the computational complexity. The error is also further reduced by 1.5dB compared to the ordinary method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1205-1223
• /
• 2018

Image enhancement is an emerging method for analyzing the images clearer for interpretation and analysis in the spatial domain. The goal of image enhancement is to serve an input image so that the resultant image is more suited to the particular application. In this paper, a novel method is proposed based on Mamdani fuzzy inference system (FIS) using multiple fuzzy membership functions. It is observed that the shape of membership function while converting the input image into the fuzzy domain is the essential important selection. Then, a set of fuzzy If-Then rule base in fuzzy domain gives the best result in image contrast enhancement. Based on a different combination of membership function shapes, a best predictive solution can be determined which can be suitable for different types of the input image as per application requirements. Our result analysis shows that the quality attributes such as PSNR, Index of Fuzziness (IOF) parameters give different performances with a selection of numbers and different sized membership function in the fuzzy domain. To get more insight, an optimization algorithm is proposed to identify the best combination of the fuzzy membership function for best image contrast enhancement.

• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.370-384
• /
• 2017

The image segmentation is the most important operation in an image processing system. It is located at the joint between the processing and analysis of the images. Unsupervised segmentation aims to automatically separate the image into natural clusters. However, because of its complexity several methods have been proposed, specifically methods of optimization. In our work we are interested to the technique SFLA (Shuffled Frog-Leaping Algorithm). It's a memetic meta-heuristic algorithm that is based on frog populations in nature searching for food. This paper proposes a new approach of unsupervised image segmentation based on SFLA method. It is implemented and applied to different types of images. To validate the performances of our approach, we performed experiments which were compared to the method of K-means.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.825-829
• /
• 2009

In this paper, we examine the fundamental performance of image coding schemes based on multipulse model. First, we introduce several kinds of pulse search methods (i.e., correlation method, pulse overlap search method and pulse amplitude optimization method) for the model. These pulse search methods are derived from auto-correlation function of impulse responses and cross-correlation function between host signals and impulse responses. Next, we explain the basic procedure of multipulse image coding scheme, which uses the above pulse search methods in order to encode the high frequency component of an original image. Finally, by means of computer simulation for some test images, we examine the PSNR(Peak Signal-to-Noise Ratio) and computational complexity of these methods.