• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2270-2277
• /
• 2016

In modern society, creation and distribution of multimedia contents is being actively conducted. These multimedia information have come out the enormous amount daily, the amount of data is also large enough it can't be compared with past text information. Since it has been increased for a need of the method to efficiently store multimedia information and to easily search the information, various methods associated therewith have been actively studied. In particular, image search methods for finding what you want from the video database or multiple sequential images, have attracted attention as a new field of image processing. Image retrieval method to be implemented in this paper, utilizes the attribute of corner patches based on the corner points of the object, for providing a new method of efficient and robust image search. After detecting the edge of the object within the image, the straight lines using a Hough transformation is extracted. A corner patches is formed by defining the extracted intersection of the straight line as a corner point. After configuring the feature vectors with patches rearranged, the similarity between images in the database is measured. Finally, for an accurate comparison between the proposed algorithm and existing algorithms, the recall precision rate, which has been widely used in content-based image retrieval was used to measure the performance evaluation. For the image used in the experiment, it was confirmed that the image is detected more accurately in the proposed method than the conventional image retrieval methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.7
• /
• pp.943-948
• /
• 2018

In this paper, we propose a hybrid approach of combining $A^*$ and Genetic algorithm in the path search problem. In $A^*$, the cost from a start node to the intermediate node is optimized in principle but the path from that intermediate node to the goal node is generated and tested based on the cumulated cost and the next node in a priority queue is chosen to be tested. In that process, we adopt the genetic algorithm principle in that the group of nodes to generate the next node from an intermediate node is tested by its fitness function. Top two nodes are selected to use crossover or mutation operation to generate the next generation. If generated nodes are qualified, those nodes are inserted to the priority queue. The proposed method is compared with the original sequential selection and the random selection of the next searching path in $A^*$ algorithm and the result verifies the superiority of the proposed method.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.155-162
• /
• 2008

Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1993.06a
• /
• pp.280-287
• /
• 1993

Code Excited Linear Prediction(CELP) speech coders exhibit good performance at data rates as low as 4800bps. The major drawback to CELP type paper, a comparative performance study of three pitch searching algorithms for the CELP vocoder was conducted. For each of the algorithms, a standard pitch searching algorithm was used by the sequential pitch searching algorithm that was implimented in the QCELP vocoder. The algorithms used in this study were 1) using the skip table(TABLE), 2) using the symmetrical property of the autocorrelation(SYMMT), and 3) using the preprocessing autocorrelation(PREPC). Performance scores are presented for each of the three pitch searching algorithms based on computation speed and on pitch prediction error.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.215-220
• /
• 2014

We consider quantization optimized for distributed estimation, where a set of sensors at different sites collect measurements on the parameter of interest, quantize them, and transmit the quantized data to a fusion node, which then estimates the parameter. Here, we propose an iterative quantizer design algorithm with a weighted distance rule that allows us to reduce a system-wide metric such as the estimation error by constructing quantization partitions with their optimal weights. We show that the search for the weights, the most expensive computational step in the algorithm, can be conducted in a sequential manner without deviating from convergence, leading to a significant reduction in design complexity. Our experments demonstrate that the proposed algorithm achieves improved performance over traditional quantizer designs. The benefit of the proposed technique is further illustrated by the experiments providing similar estimation performance with much lower complexity as compared to the recently published novel algorithms.

• The KSFM Journal of Fluid Machinery
• /
• v.12 no.3
• /
• pp.7-12
• /
• 2009

In this paper, shape optimization based on three-dimensional flow analysis has been performed for impeller design of centrifugal compressor. To evaluate the objective function of an isentropic efficiency, Reynolds-averaged Navier-Stokes equations are solved with SST (Shear Stress Transport) turbulence model. The governing equations are discretized by finite volume approximations. The optimization techniques based on the radial basis neural network method are used for the optimization. Latin hypercube sampling as design of experiments is used to generate thirty design points within design space. Sequential quadratic programming is used to search the optimal point based on the radial basis neural network model. Four geometrical variables concerning impeller shape are selected as design variables. The results show that the isentropic efficiency is enhanced effectively from the shape optimization by the radial basis neural network method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.5
• /
• pp.479-486
• /
• 2012

In this paper, a ranging system is proposed that is able to measure 360 degree omnidirectional distances to environment objects. The ranging system is based on the structured light imaging system with catadioptric omnidirectional mirror. In order to make the ranging system robust against environmental illumination, efficient structured light image processing algorithms are developed; sequential integration of difference images with modulated structured light and radial search based on Bresenham line drawing algorithm. A dedicated FPGA image processor is developed to speed up the overall image processing. Also the distance equation is derived in the omnidirectional imaging system with a hyperbolic mirror. It is expected that the omnidirectional ranging system is useful for mapping and localization of mobile robot. Experiments are carried out to verify the performance of the proposed ranging system.

• Journal of Mechanical Science and Technology
• /
• v.17 no.12
• /
• pp.1938-1948
• /
• 2003

This paper represents that an enhanced genetic algorithm (EGA) is applied to optimal design of a squeeze film damper (SFD) to minimize the maximum transmitted load between the bearing and foundation in the operational speed range. A general genetic algorithm (GA) is well known as a useful global optimization technique for complex and nonlinear optimization problems. The EGA consists of the GA to optimize multi-modal functions and the simplex method to search intensively the candidate solutions by the GA for optimal solutions. The performance of the EGA with a benchmark function is compared to them by the IGA (Immune-Genetic Algorithm) and SQP (Sequential Quadratic Programming). The radius, length and radial clearance of the SFD are defined as the design parameters. The objective function is the minimization of a maximum transmitted load of a flexible rotor system with the nonlinear SFDs in the operating speed range. The effectiveness of the EGA for the optimal design of the SFD is discussed from a numerical example.

• Structural Engineering and Mechanics
• /
• v.9 no.2
• /
• pp.169-180
• /
• 2000

An optimization procedure has been prescribed for the minimum weight design of symmetrical parabolic arches subjected to arbitrary loading. The cross section is assumed to be a symmetrical box section with variable depth and flange areas. The webs are unstiffened and have constant thickness. The proposed sequential, iterative search technique determines the optimum geometrical configuration of the parabolic arch which includes the optimum depth profile and the optimum lengths and areas of the required flange plates corresponding to the prescribed number of curtailments. The study shows that the optimum value of rise to span ratio (h/L) of a parabolic arch is maximum at 0.41 for uniformly distributed loading over the entire span. For any other loading, the optimum value of h/L is less than 0.41.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2005.03a
• /
• pp.521-528
• /
• 2005

In our previous study, we have developed a preliminary design procedure of MR dampers for controlling seismic response of building structures. In this paper, the effectiveness the proposed method is verified through the numerical analysis of the structures with various period and story number, and twenty earthquake loads are used for statistical assessment. The comparison between the proposed method and simplified sequential search algorithm indicates that the capacity, number and the placement of the MR damper which can achieve the given performance objective are reasonably determined using the proposed design procedure.