• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.79-86
• /
• 2004

In the integration of Sommerfeld type for space domain Green's function, a accurate closed-from Green's function method provides more exact solution than the typical complex image method and two-level method. The accurate closed-form Green's function method is applied to obtain the space domain Green's functions of planar structures with general sources. Please put the abstract of paper here.

• International journal of advanced smart convergence
• /
• v.2 no.1
• /
• pp.18-20
• /
• 2013

The significance, is to introduce a novel way to employ the improved Runge-Kutta fifth order five stage method, here after called as Modified IRK(5,5) method, for system of second order robot arm problem and variations in angles at the joints in which parameters governing with two degrees of freedom which requires lesser number of function evaluations per time step as compared to the existing ones, in order to save time and spaceAn ultimate aim of this present paper is to solve application problem such as robot arm and initial value problems by applying Runge-Kutta fifth order five stage numerical techniques. The calculated output for robot arm coincides with exact solution which is found to be better, suitable and feasible for solving real time problems.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.4
• /
• pp.406-414
• /
• 1997

A real-time inspection system is developed using line scan cameras. Several improved algorithms are proposed for real-time detection of defects in this automated inspection system. The major improved algorithms include the preprocessing, the threshold decision, and the clustering algorithms. The preprocessing algorithms are for exact binarization and the threshold decision algorithm is for fast detection of defects in 1-D binary images. The clustering algorithm is also developed for fast classifying of the defects. The system is applied to PCBs(Printed Circuit Boards) inspection. The typical defects in PCBs are pits, dent, wrinkle, scratch, and black spots. The results show that most defects are detected and classified successfully.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.4
• /
• pp.159-165
• /
• 2012

The accurate focusing position should be determined for accurate measurements In VMS. Camera lens focusing is an important problem in computer vision and video measuring systems (VMS) that use CCD cameras and high precision XYZ stages. Camera focusing is a very important step in high precision measurement systems that use computer vision technique. The auto focusing process consists of two steps, the focus value measurement step and the exact focusing position determination step. It is suitable for eliminating high frequency noises with lower processing time and without blurring. An automatic focusing technique is applied to measure a crater with a one-dimensional search algorithm for finding the best focus. Throughout this paper, the suggested algorithm for the Auto focusing was combined with the learning. As a result, it is expected that such a combination would be expanded into the system of recognizing voices in a noisy environment.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.59-66
• /
• 2004

Symmetry region searching can extract face region without a prior information in an image by using symmetric. However, this method requires a plenty of the computation time because the mask size to process symmetry region searching must be larger than the size of object such as eye, nose and mouth in face. in this paper, it proposed symmetric by using symmetry region searching and Wavelet Transform to reduce computation time of symmetry region searching, and It was applied to this method in an original image. To extract exact face region, we also experimented face region searching by using domain division in extraction region.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2333-2344
• /
• 1998

We present a two step approach for estimating the motionand sturcture parameters from region orrespondences in two frames. Given four or more region corresondences on the same planar surface, the motion and planar orientation parameters are first linearly estimated based on second-order approximation of the displacement field of the image plane. Then, using this linear estimate as an initial guess, a nonlinear estimate is obtained by iteratively minimizing an objective function using the exact experession of the displacement field. The objective function involves the centroids of corresponding regions and relationships among low-order moments. Through simulations, we show that the two-step region-based approach gives robust estimates. The performance of nonlinear region-based estimation is compared with that of linear region-based and point-based methods. Experimental results for two image pairs, on esynthetic and one real, ar epresented to show the practical applicability of our approach.

• Journal of Information Processing Systems
• /
• v.9 no.4
• /
• pp.621-632
• /
• 2013

The most important things for a forest fire detection system are the exact extraction of the smoke from image and being able to clearly distinguish the smoke from those with similar qualities, such as clouds and fog. This research presents an intelligent forest fire detection algorithm via image processing by using the Gaussian Mixture model (GMM), which can be applied to detect smoke at the earliest time possible in a forest. GMMs are usually addressed by making the model adaptive so that its parameters can track changing illuminations and by making the model more complex so that it can represent multimodal backgrounds more accurately for smoke plume segmentation in the forest. Also, in this paper, we suggest a way to classify the smoke plumes via a feature extraction using HSL(Hue, Saturation and Lightness or Luminanace) color space analysis.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.3
• /
• pp.99-103
• /
• 2011

The stereoscopic vision system is the algorithm to obtain the depth of target object of stereo vision image. This paper presents an efficient disparity matching method using blue edge filter and graph cut algorithm. We do recommend the use of the simple sobel edge operator. The application of B band sobel edge operator over image demonstrates result with somewhat noisy (distinct border). The basic technique is to construct a specialized graph for the energy function to be minimized such that the minimum cut on the graph also minimizes the energy (either globally or locally). This method has the advantage of saving a lot of data. We propose a preprocessing effective stereo matching method based on sobel algorithm which uses blue edge information and the graph cut, we could obtain effective depth map.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.88-96
• /
• 1996

Computer vision-based gesture recognition systems consist of image segmentation, object tracking and decision. However, it is difficult to segment an object from image for gesture in computer systems because of vaious illuminations and backgrounds. In this paper, we describe a method to learn features for segmentation, which improves the performance of computer vision-based hand-gesture recognition systems. Systems interact with a user to acquire exact training data and segment information according to a predefined plan. System provides some models to the user, takes pictures of the user's response and then analyzes the pictures with models and a prior knowledge. The system sends messages to the user and operates learning module to extract information with the analyzed result.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06a
• /
• pp.171-176
• /
• 1999

Template matching is one of the most often used techniques for machine vision applications to find a template of size M$\times$M or subimage in a scene image of size N$\times$N. Most template matching methods, however, require pixel operations between the template and the image under analysis resulting in high computational cost of O(M2N2). So in this thesis, we present a two stage template matching method. In the first stage, we use a novel low cost feature whose complexity is approaching O(N2) to select matching candidates. In the second stage, we use conventional template matching method to find out the exact matching point. We compare the result with other methods in terms of complexity, efficiency and performance. Proposed method was proved to have constant time complexity and to be quite invariant to noise.