• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.680-681
• /
• 2015

This study develops an algorithm that automatically performs reverse engineering on three-dimensional (3D) sweeping shapes using a user's pre-defined feature templates and 3D point cloud data (PCD) of sweeping shapes. Existing methods extract 3D sweeping shapes by extracting points on a PCD cross section together with the center point in order to perform curve fitting and connect the center points. However, a drawback of existing methods is the difficulty of creating a 3D sweeping shape in which the user's preferred feature center points and parameters are applied. This study extracts shape features from cross-sectional points extracted automatically from the PCD and compared with pre-defined feature templates for similarities, thereby acquiring the most similar template cross-section. Fitting the most similar template cross-section to sweeping shape modeling makes the reverse engineering process automatic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9C
• /
• pp.876-883
• /
• 2003

In this paper, we propose an algorithm for organ recognition in ultrasound images using log power spectrum. The main procedure of the algorithm consists of feature extraction and feature classification. In the feature extraction, as a translation invariant feature, log power spectrum is used for extracting the information on echo of the organs tissue from a preprocessed input image. In the feature classification, Mahalanobis distance is used as a measure of the similarity between the feature of an input image and the representative feature of each class. Experimental results for real ultrasound images show that the proposed algorithm yields the improvement of maximum 30% recognition rate than the recognition algorithm using power spectrum and Euclidean distance, and results in better recognition rate of 10-40% than the recognition algorithm using weighted quefrency complex cepstrum.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.117-137
• /
• 2002

A CBR(Case-Based Reasoning) system solves the new problems by adapting the solutions that were used to solve the old problems. Past cases are retained in the case base, each in a specific form that is determined by features. Features are selected for the purpose of representing the case in the best way. Similar cases are retrieved by comparing the feature values and calculating the similarity scores. Therefore, the performance of CBR depends on the selected feature subsets. In this research, we measured the Selection Effect and the Elimination Effect of each feature. The Selection Effect is measured by performing the CBR with only one feature, and the Elimination Effect is measured by performing the CBR without only one feature. Based on these measurements, the feature subsets are selected. The resulting CBR showed better performance in terms of accuracy and efficiency than the CBR with all features.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.894-907
• /
• 2022

The features extracted by convolutional neural networks are more descriptive of images than traditional features, and their convolutional layers are more suitable for retrieving images than are fully connected layers. The convolutional layer features will consume considerable time and memory if used directly to match an image. Therefore, this paper proposes a feature weighting and region integration method for convolutional layer features to form global feature vectors and subsequently use them for image matching. First, the 3D feature of the last convolutional layer is extracted, and the convolutional feature is subsequently weighted again to highlight the edge information and position information of the image. Next, we integrate several regional eigenvectors that are processed by sliding windows into a global eigenvector. Finally, the initial ranking of the retrieval is obtained by measuring the similarity of the query image and the test image using the cosine distance, and the final mean Average Precision (mAP) is obtained by using the extended query method for rearrangement. We conduct experiments using the Oxford5k and Paris6k datasets and their extended datasets, Paris106k and Oxford105k. These experimental results indicate that the global feature extracted by the new method can better describe an image.

• Journal of KIISE:Software and Applications
• /
• v.34 no.3
• /
• pp.196-211
• /
• 2007

In the Product Line Engineering (PLE), current studies about an analysis of the feature have uncertain and ad-hoc criteria of analysis based on developer’s intuition or domain expert’s heuristic approach and difficulty to extract explicit features from a product in a product line because the stakeholders lack comprehensive understanding of the features in feature modeling. Therefore, this paper proposes a model of the analyzing commonality and variability of the feature based on the Ontology. The proposed model in this paper suggests two approaches in order to solve the problems mentioned above: First, the model explicitly expresses the feature by making an individual feature attribute list based on the meta feature modeling to understand common feature. Second, the model projects an analysis model of commonality and variability using the semantic similarity between features based on the Ontology to the stakeholders. The main contribution of this paper is to improve the reusability of distinguished features on developing products of same line henceforth.

• Journal of the Korean Society of Industry Convergence
• /
• v.3 no.3
• /
• pp.229-236
• /
• 2000

This paper proposes on the Hanguel character CAI system using image processing. For this, firstly, the characters written by elementary school students or foreigners arc captured by CCD camera. Secondly, Recognition is accomplished by pre-processing, thinning and recognition processes. Thirdly, strokes are separated and beauty evaluation is done by matching feature value of the input image from the similarity measure function. In particular, this paper describe to define the similarity measuring function using extracted factor values after getting the beauty evaluation factor values of the consonant in the entire CAI system. Finally, the effectiveness of the proposed system is demonstrated by experiments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.116-121
• /
• 2008

This paper introduces a selection operator which utilized similarity and fitness of individuals based on fuzzy inference. Adding similarity feature to fitness, proposed selector obtained the decrease of premature convergence and better performances than other selectors. Moreover, an adoption of steady-state evolution provided enhancement of performances additionally. Experiments of proposed method for deceptive problems were tested and showed better performances than conventional methods.

• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1108-1118
• /
• 2019

Non-local means (NLM) algorithm is an effective and successful denoising method, but it is computationally heavy. To deal with this obstacle, we propose a novel NLM algorithm with fuzzy metric (FM-NLM) for image denoising in this paper. A new feature metric of visual features with fuzzy metric is utilized to measure the similarity between image pixels in the presence of Gaussian noise. Similarity measures of luminance and structure information are calculated using a fuzzy metric. A smooth kernel is constructed with the proposed fuzzy metric instead of the Gaussian weighted L2 norm kernel. The fuzzy metric and smooth kernel computationally simplify the NLM algorithm and avoid the filter parameters. Meanwhile, the proposed FM-NLM using visual structure preferably preserves the original undistorted image structures. The performance of the improved method is visually and quantitatively comparable with or better than that of the current state-of-the-art NLM-based denoising algorithms.

• Journal of Information Processing Systems
• /
• v.19 no.6
• /
• pp.778-790
• /
• 2023

Although density peak clustering can often easily yield excellent results, there is still room for improvement when dealing with complex, high-dimensional datasets. One of the main limitations of this algorithm is its reliance on geometric distance as the sole similarity measurement. To address this limitation, we draw inspiration from the information bottleneck theory, and propose a novel density peak clustering algorithm that incorporates this theory as a similarity measure. Specifically, our algorithm utilizes the joint probability distribution between data objects and feature information, and employs the loss of mutual information as the measurement standard. This approach not only eliminates the potential for subjective error in selecting similarity method, but also enhances performance on datasets with multiple centers and high dimensionality. To evaluate the effectiveness of our algorithm, we conducted experiments using ten carefully selected datasets and compared the results with three other algorithms. The experimental results demonstrate that our information bottleneck-based density peaks clustering (IBDPC) algorithm consistently achieves high levels of accuracy, highlighting its potential as a valuable tool for data clustering tasks.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.370-380
• /
• 2002

This paper proposes an ATR (Automatic Target Recognition) algorithm for identifying non-occluded and occluded military vehicles in natural FLIR (Forward Looking InfraRed) images. After segmenting a target, a radial function is defined from the target boundary to extract global shape features. Also, to extract local shape features of upper region of a target, a distance function is defined from boundary points and a line between two extreme points. From two functions and target contour, four global and four local shape features are proposed. They are much more invariant to translation, rotation and scale transform than traditional feature sets. In the experiments, we show that the proposed feature set is superior to the traditional feature sets with respect to the similarity-transform invariance and recognition performance.