• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.280-298
• /
• 2008

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.197-209
• /
• 2002

If we reduce the number of vertexes to decrease bit rate in polygon-based shape coding, the distortion of approximated contour increases rapidly. On the other hand, if we reduce the distortion, the number of vertexes increases rapidly and many bits are required to encode the vertexes. To improve this problem, in this paper we propose the approximation vertex search method. The encoder in the proposed method searches the type of distortion patterns that is the most similar to the shape which polygon edge and contour segment form and then encodes it. And then, the decoder mathematically finds the approximated vertexes from decoded distortion pattern information. Therefore, the proposed algorithm results in encoding many vertexes at a low bit rate and having the smoother shape than conventional method. As shown in computer simulation, the proposed method has less distortion than conventional method. It costs less bit rate by $10{\sim}20%$ than conventional algorithm in same distortion.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.763-765
• /
• 2005

In the area of remote sensing, an immense number of images are continuously generated by various remote sensing systems. These images must then be managed by a database system efficient storage and retrieval. There are many types of image database systems, among which the content-based image retrieval (CBIR) system is the most advanced. CBIR utilizes the metadata of images including the feature data for indexing and searching images. Therefore, the performance of image retrieval is significantly affected by the storage method of the image metadata. There are many features of images such as color, texture, and shape. We mainly consider the shape feature because shape can be identified in any remote sensing while color does not always necessarily appear in some remote sensing. In this paper, we propose a metadata representation and storage method for image search based on shape features. First, we extend MPEG-7 to describe the shape features which are not defined in the MPEG-7 standard. Second, we design a storage schema for storing images and their metadata in a relational database system. Then, we propose an efficient storage method for managing the shape feature data using a Wavelet technique. Finally, we provide the performance results of our proposed storage method.

• Journal of computational fluids engineering
• /
• v.17 no.4
• /
• pp.32-40
• /
• 2012

Efficient Global Optimization (EGO) method is a global optimization technique which can select the next sample point automatically by infill sampling criteria (ISC) and search for the global minimum with less samples than what the conventional global optimization method needs. ISC function consists of the predictor and mean square error (MSE) provided from the kriging model which is a stochastic metamodel. Also the constrained EGO method can minimize the objective function dealing with the constraints under EGO concept. In this study the constrained EGO method applied to the RAE2822 airfoil shape design formulated with the constraint. But the noisy CFD data caused the kriging model to fail to depict the true function. The distorted kriging model would make the EGO deviate from the correct search. This distortion of kriging model can be handled with the interpolation(p=free) kriging model. With the interpolation(p=free) kriging model, however, the search of EGO solution was stalled in the narrow feasible region without the chance to update the objective and constraint functions. Then the accuracy of EGO solution was not good enough. So the three-step search method was proposed to obtain the accurate global minimum as well as prevent from the distortion of kriging model for the noisy constrained CFD problem.

• Wind and Structures
• /
• v.18 no.2
• /
• pp.195-213
• /
• 2014

Recently, the horizontal axis rotor performance optimizer (HARP_Opt) tool was developed in the National Renewable Energy Laboratory, USA. This innovative tool is becoming more popular in the wind turbine industry and in the field of academic research. HARP_Optwas developed on the basis of two fundamental modules, namely, WT_Perf, a performance evaluator computer code using the blade element momentum theory; and a genetic algorithm module, which is used as an optimizer. A pattern search algorithm was more recently incorporated to enhance the optimization capability, especially the calculation time and consistency of the solutions. The blade optimization is an aspect that is highly dependent on experience and requires significant consideration on rotor control strategies, wind data, and generator type. In this study, the effects of rotor control strategies including fixed speed and fixed pitch, variable speed and fixed pitch, fixed speed and variable pitch, and variable speed and variable pitch algorithms on optimal blade shapes and rotor performance are investigated using optimized blade designs. The effects of environmental wind data and the objective functions used for optimization are also quantitatively evaluated using the HARP_Opt tool. Performance indices such as annual energy production, thrust, torque, and roof-flap moment forces are compared.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.95-102
• /
• 2004

In this paper, we proposed multi-resolution search method based on edge information that can be search a partial input pattern and detect a difference of minute shape information in effectively. The proposed method utilizes the small shape differences among objects as much as possible to distinguish an object from similar shaped objects. It consists of the GHT based candidate generation and top-down candidate verfication. The test results show that it can retrieve the correct object even with a part of object in reasonable time.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.19 no.5
• /
• pp.482-490
• /
• 2009

In this paper, the author proposes a new method for acoustic radiation optimum design to minimize noise from a vibrating panel-like structure using a collaborative population-based search method called the particle swarm optimization algorithm(PSOA). The PSOA is a parallel evolutionary computation technique initially developed by Kennedy and Eberhart. The acoustic radiation optimization method based on the PSOA consists of two processes. In the first process, the acoustic radiation analysis by an integrated p-version FEM/BEM, which was developed by using MATLAB, is performed to evaluate the exterior acoustic radiation field of the panel. The second process is to search the optimum design variables: 1) Shape of Bezier curves and 2) Shape and position of ribs, to minimize noise from the panel using the PSOA. The optimization method based on the PSOA is compared to that based on the steady state genetic algorithm(SSGA) in order to verify the effectiveness and validity of the optimal solution by PSOA. Finally, it is shown that the optimal designs of the panel obtained by using the PSOA can achieve effective reductions in radiated sound power.

• Steel and Composite Structures
• /
• v.36 no.1
• /
• pp.31-45
• /
• 2020

The purpose of this study is to develop an effective iterative two-stage method (ITSM) for structural damage identification of offshore platform structures. In each iteration, a new damage index, Modal Energy-Based Damage Index (MEBI), is proposed to help effectively locate the potential damage elements in the first stage. Then, in the second stage, the beetle antenna search (BAS) algorithm is used to estimate the damage severity of these elements. Compared with the well-known particle swarm optimization (PSO) algorithm and genetic algorithm (GA), this algorithm has lower computational cost. A modal energy based objective function for the optimization process is proposed. Using numerical and experimental data, the efficiency and accuracy of the ITSM are studied. The effects of measurement noise and spatial incompleteness of mode shape are both considered. All the obtained results show that under these influences, the ITSM can accurately identify the true location and severity of damage. The results also show that the objective function based on modal energy is most suitable for the ITSM compared with that based on flexibility and weighted natural frequency-mode shape.

• Journal of Integrative Natural Science
• /
• v.12 no.2
• /
• pp.35-43
• /
• 2019

In the content-based image search properties, form information is simple because only the contours of objects are available, and although it can effectively extract the characteristics of the objects, it is sensitive to external noise. The radial distortion, one of these noises, is most prominent in the eyewear and, due to the structural characteristics of the imaging equipment, radiative distortion occurs in almost all imaging equipment. It is very important to determine the similarity of the objects in the images in which these distortions occurred to the actual objects. In order to improve this problem, we propose a strong image search technique for formative noise and radiative distortion using regularization phase angles and moments. Through simulation using Wang DB, the proposed algorithm proved excellent performance for radiation distortion that occurs in general. In addition, a system optimized for database can be implemented by making appropriate changes to the threshold values, enabling image retrieval with the desired level of confidence in various systems. The algorithm proposed in this paper is expected to be utilized as an optimal imaging system by extracting morphological form information of multimedia data.