• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.121-127
• /
• 2010

This paper relates with the improved CMA blind adaptive equalization algorithm which uses the constellation matching method that improve the inverse modelling efficiency of a communication channel compared to the present CMA blind adaptive equalizer. The amplitude distortion can be compensated in the present CMA blind adaptive equalizer which is used for the reduction of intersymbol interference by distortion that generate such as a band limited wireless mobile channel, but in the improved adaptive alogorithm operates with the minimize the amplitude phase distortion in the output of equalizer by applying the cost function that is composition of additional signal constellation matching error terms. In order to evaluation of the inverse modeling efficiency of improved algorithm, the residual intersymbol interference and recovered signal constellation were compared by computer simulation. As a result of comparion of computer simulation, the improved algorithm has a good stability in the residual intersymbol interference in the steady state, but it has a slow convergence rate in the adaptation state in initial state.

• The KIPS Transactions:PartB
• /
• v.17B no.5
• /
• pp.333-344
• /
• 2010

This paper addresses the way to compose paronamic images from images taken the same objects. With the spread of digital camera, the panoramic image has been studied to generate with its interest. In this paper, we propose a panoramic image generation method using scaling and rotation invariant features. First, feature points are extracted from input images and matched with a RANSAC algorithm. Then, after the perspective model is estimated, the input image is registered with this model. Since the SURF feature extraction algorithm is adapted, the proposed method is robust against geometric distortions such as scaling and rotation. Also, the improvement of computational cost is achieved. In the experiment, the SURF feature in the proposed method is compared with features from Harris corner detector or the SIFT algorithm. The proposed method is tested by generating panoramic images using $640{\times}480$ images. Results show that it takes 0.4 second in average for computation and is more efficient than other schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.71-79
• /
• 2006

Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.545-557
• /
• 2001

In this paper we propose a hierarchical classification algorithm based on rough membership function which can reason a new object approximately. We use the fuzzy reasoning method that substitutes fuzzy membership value for linguistic uncertainty and reason approximately based on the composition of membership values of conditional sttributes Here we use the rough membership function instead of the fuzzy membership function It can reduce the process that the fuzzy algorithm using fuzzy membership function produces fuzzy rules In addition, we transform the information system to the understandable minimal decision information system In order to do we, study the discretization of continuous valued attributes and propose the discretization algorithm based on the rough membership function and the entropy of the information theory The test shows a good partition that produce the smaller decision system We experimented the IRIS data etc. using our proposed algorithm The experimental results with IRIS data shows 96%~98% rate of classification.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.1
• /
• pp.163-170
• /
• 2022

This paper introduces a method of extracting facial features due to unrefined inputs in real life and improving the problem of not guaranteeing the ideal performance and speed of the object recognition model through a storage algorithm through weight summation. Many facial recognition processes ensure accuracy in ideal situations, but the problem of not being able to cope with numerous biases that can occur in real life is drawing attention, which may soon lead to serious problems in the face recognition process closely related to security. This paper presents a method of quickly and accurately recognizing faces in real time by comparing feature points extracted as input with a small number of feature points that are not overfit to multiple biases, using that various variables such as picture composition eventually take an average form.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.2
• /
• pp.141-147
• /
• 2009

This paper presents a new fast algorithm, rotation-based method (RBM), for the reconstruction of 3 dimensional image for cone beam computerized tomography (CB CT) system. The system used cone beam has less exposure time of radioactivity than fan beam. The Three-Pass Shear Matrices (TPSM) is applied, that has less transcendental functions than the one-pass shear method to decrease a time of calculations in the computer. To evaluate the quality of the 3-D images and the time for the reconstruction of the 3-D images, another 3-D images were reconstructed by the radon transform under the same condition. For the quality of the 3-D images, the images by radon transform was shown little good quality than REM. But for the time for the reconstruction of the 3-D images REM algorithm was 35 times faster than radon transform. This algorithm offered $4{\sim}5$ frames a second. It meant that it will be possible to reconstruct the 3-D dynamic images in real time.

• Korean Journal of Construction Engineering and Management
• /
• v.13 no.1
• /
• pp.118-128
• /
• 2012

As the bearing wall structure, which has been widely applied to domestic apartment buildings since the 1980s, cause many problems during remodeling of buildings, the government encourages constructors to adopt flat plate or rahmen structure through legal incentives. In line with such a trend, the green frame, an eco-friendly rahmen structure that has removed the shortcomings of previous structures, was developed to enhance structural safety, constructability, and eco-friendliness. The construction of green frame can reduce the labor cost and facilitate the composition of iron bars to reduce rebar loss through calculating the quality and establishing the bar bending schedule automatically on the precast concrete member data collected over the design phase. Therefore, the purpose of this study is to develop the algorithm to automate the calculation of iron bar volume for the green frame designed on composite precast concrete members. Automated algorithm to calculate concrete structural design information and design information. Practices through the application site should prove efficacy. The database established by the developed algorithm will automate the establishment of iron bar processing map and bar cutting list and the calculation of optimal composition and order volume to minimize the rebar loss. This will also reduce the expenses on management staff and overall construction cost through the minimization of rebar loss.

• Journal of Welding and Joining
• /
• v.26 no.3
• /
• pp.61-66
• /
• 2008

As ships become to be larger than ever, the thicker plate and the higher tensile steel plate are used in naval shipyard. Though special chemical composition is needed for high-tensile steels, recent high-tensile steels are made by the TMCP(Thermo-Mechanical control process) skill. The increase of yield stress and tensile stress of TMCP steels is induced from bainite phase which is transformed from austenite, but that increased yield stress can be vanished by another additional thermal cycle like welding and heating. As thermal deformations are deeply related by yield stress of material, the study for prediction of plate deformation by heating should reflect principle of TMCP steels. This study developed an algorithm which can calculate inherent strain. In this algorithm, not only the mechanical principles of thermal deformations, but also the predicting of the portion of initial bainite is considered when calculating inherent strain. The simulations of plate deformation by these values showed good agreements with experimental results of normalizing steels and TMCP steels in welding and heating. Finally we made an inherent strain database of steels used in Class rule.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.187-194
• /
• 2004

Shear-Warp volume rendering has many advantages such as good image Quality and fast rendering speed. However in the interactive classification environment it has low efficiency of memory access since preprocessed classification is unavailable. In this paper we present an algorithm using the spacial locality of memory access in the interactive classification environment. We propose an extension model appending a rotation matrix to the factorization of viewing transformation, it thus performs a scanline-based rendering in the object and image space. We also show causes and solutions of three problems of the proposed algorithm such as inaccurate front-to-back composition, existence of hole, increasing computational cost. This model is efficient due to the spacial locality of memory access.

• 전자공학회논문지 IE
• /
• v.43 no.2
• /
• pp.30-38
• /
• 2006

This paper is used the color space distribution HMMD model presented in MPEG-7 in order to segment and detect the wanted image parts as a real time without the user's manufacturing in the video object segmentation. Here, it is applied the wavelet morphology to remove a small part that is regarded as a noise in image and a part excepting for the face image. Also, it did the optimal composition by the rough set. In this paper, tile proposed video object detection algorithm is confirmed to be superior as detecting the face object exactly than the conventional algorithm by applying those to the different size images.put the of paper here.