• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1128-1145
• /
• 2022

Owing to the rapid development of information science, data analysis based on machine learning has become an interdisciplinary and strategic area. Marine predators algorithm (MPA) is a novel metaheuristic algorithm inspired by the foraging strategies of marine organisms. Considering the randomness of these strategies, an improved algorithm called co-evolutionary cultural mechanism-based marine predators algorithm (CECMPA) is proposed. Through this mechanism, search agents in different spaces can share knowledge and experience to improve the performance of the native algorithm. More specifically, CECMPA has a higher probability of avoiding local optimum and can search the global optimum quickly. In this paper, it is the first to use CECMPA to perform feature subset selection and optimize hyperparameters in support vector machine (SVM) simultaneously. For performance evaluation the proposed method, it is tested on twelve datasets from the university of California Irvine (UCI) repository. Moreover, the coronavirus disease 2019 (COVID-19) can be a real-world application and is spreading in many countries. CECMPA is also applied to a COVID-19 dataset. The experimental results and statistical analysis demonstrate that CECMPA is superior to other compared methods in the literature in terms of several evaluation metrics. The proposed method has strong competitive abilities and promising prospects.

• Earthquakes and Structures
• /
• v.20 no.4
• /
• pp.405-415
• /
• 2021

Following the dynamic property analysis and elaboration, linear response spectrum analysis (RSA) and response history analysis (RHA) were conducted on a representative hyperbolic cooling towers (HCT) in present study. The seismic responses in tower shell were illustrated in detail, including the internal force amplitude, modal contribution, influence from damping ratio, comparison of results got from RSA and RHA and especially the latitude distributions of internal forces. The results show that the eigenmodes could be classified in a new method into four types according to their mode shapes and only the lateral bending modes and vertical stretching modes are meaningful for horizontal and vertical earthquake correspondingly. The bending modes and seismic deformation display the same feature which is global lateral bending accompanied by minute circular flow displacement of section. This feature also decides the latitude distributions of internal forces as sine or cosine. Moreover, the following method is also proposed for approximate estimation of internal force amplitudes without time-consuming response history analysis: getting the response spectrums of the selected ground accelerations and then comparing values of response spectrums at the natural period of first lateral bending mode because it is always prime dominant for horizontal seismic responses.

• Journal of Korea Multimedia Society
• /
• v.14 no.6
• /
• pp.742-751
• /
• 2011

This paper presents a robust 3D model hashing dependent on key and parameter by using heat kernel signature (HKS), which is special shape feature descriptor, In the proposed hashing, we calculate HKS coefficients of local and global time scales from eigenvalue and eigenvector of Mesh Laplace operator and cluster pairs of HKS coefficients to 2D square cells and calculate feature coefficients by the distance weights of pairs of HKS coefficients on each cell. Then we generate the binary hash through binarizing the intermediate hash that is the combination of the feature coefficients and the random coefficients. In our experiment, we evaluated the robustness against geometrical and topological attacks and the uniqueness of key and model and also evaluated the model space by estimating the attack intensity that can authenticate 3D model. Experimental results verified that the proposed scheme has more the improved performance than the conventional hashing on the robustness, uniqueness, model space.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.401-408
• /
• 2006

In this paper, we propose a new class of segmentation technique for feature extraction based on the statistical and regional classification at each vertical or horizontal line of digital image data. Data is processed and clustered at each line, different from the point or space process. They are designed to segment gray-scale sectional images using a horizontal and vertical line process due to their statistical and property differences, and to extract the feature. The techniques presented here show efficient results in case of the gray level overlap and not having threshold image. Such images are also not easy to be segmented by the global or local threshold methods. Line pixels inform us the sectionable data, and can be set according to cluster quality due to the differences of histogram and statistical data. The total segmentation on line clusters can be obtained by adaptive extension onto the horizontal axis. Each processed region has its own pixel value, resulting in feature extraction. The advantage and effectiveness of the line-cluster approach are both shown theoretically and demonstrated through the region-segmental carotid artery medical image processing.

• Journal of Korea Multimedia Society
• /
• v.5 no.2
• /
• pp.158-166
• /
• 2002

In this paper, we proposed a contour shape description method which use the CFR(contour fluctuation ratio) feature. The CFR is the ratio of the line length to the curve length of a contour segment. The line length means the distance of two end points on a contour segment, and the curve length means the sum of distance of all adjacent two points on a contour segment. We should acquire rotation and scale invariant contour segments because each CFR is computed from contour segments. By using the interleaved contour segment of which length is proportion to the entire contour length and which is generated from all the points on contour, we could acquire rotation and scale invariant contour segments. The CFR can describes the local or global feature of contour shape according to the unit length of contour segment. Therefore we describe the shape of objects with the feature vector which represents the distribution of CFRs, and calculate the similarity by comparing the feature vector of corresponding unit length segments. We implemented the proposed method and experimented with rotated and scaled 165 fish images of fifteen types. The experimental result shows that the proposed method is not only invariant to rotation and scale but also superior to NCCH and TRP method in the clustering power.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.319-322
• /
• 2013

Image retrieval research activity has moved its focus from global descriptors to local descriptors of feature point such as SIFT. MPEG is Currently working on standardization of effective coding of location and local descriptors of feature point in the context mobile based image search driven application in the name of MPEG-7 CDVS (Compact Descriptor for Visual Search). The extracted feature points consist of two parts, location information and Descriptor. For efficient image retrieval, we proposed a novel method that is gradual block-based efficient lossy location coding to compress location information according to distribution in images. From experimental result, the number of average bits per feature point reduce 5~6% and the accuracy rate keep compared to state of the art TM 3.0.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.102-112
• /
• 2012

In this paper, we propose a texture classification using wavelet-domain BDIP (block difference of inverse probabilities) and BVLC (block variance of local correlation coefficients) features with WPCA (whitened principal component analysis) classifier. In the proposed method, the wavelet transform is first applied to a query image. The BDIP and BVLC operators are next applied to the wavelet subbands. Global moments for each subband of BDIP and BVLC are then computed and fused into a feature vector. In classification, the WPCA classifier, which is usually adopted in the face identification, searches the training feature vector most similar to the query feature vector. Experimental results show that the proposed method yields excellent texture classification with low feature dimension for test texture image DBs.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3514-3522
• /
• 1999

While the method of information collection and visual interface technique have been researched actively on web information retrieval, a study on structured modeling for effective classification of a wide collective information leaves to be desired. In this paper, we represent information feature based on structured information model. It aims at carrying out effectively the user's retrieval environment through visualization technique with analyzing the information feature. We propose a information classification method using Facet units and we construct the object model, table model, SQL code to define the relation of the information, and represent the information feature based on a wide range of views. After users gain a better global understanding of the information feature, retrieve more easily through their information. Conventional information retrieval is user-oriented to be what user want, but proposed technique it data-oriented which helps users to understand what exist in database by showing information feature.

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.415-425
• /
• 2002

In this paper, we present a content-based image retrieval method which is based on the feature extraction in the wavelet transform domain. In order to overcome the drawbacks of the feature vector making up methods which use the global wavelet coefficients in subbands, we utilize the energy value of wavelet coefficients, and the shape-based retrieval of objects is processed by moment which is invariant in translation, scaling, rotation of the objects The proposed methods reduce feature vector size, and make progress performance of classification retrieval which provides fast retrievals times. To offer the abilities of region-based image retrieval, we discussed the image segmentation method which can reduce the effect of an irregular light sources. The image segmentation method uses a region-merging, and candidate regions which are merged were selected by the energy values of high frequency bands in discrete wavelet transform. The region-based image retrieval is executed by using the segmented region information, and the images are retrieved by a color, texture, shape feature vector.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.825-832
• /
• 2010

This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.