• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.828-831
• /
• 2005

In feature-based multi-resolution modeling, the features are rearranged according to a criterion for the levels of detail (LOD) of multi-resolution models. In this paper, two different LOD criteria are investigated and discussed. The one is the volumes of subtractive features, together with the precedence of additive features over subtractive features. The other is the volumes of features, regardless of whether the feature types are subtractive or additive. In addition, the algorithms to define and extract the LOD models based on the criteria are also described. The criterion of the volumes of features can be used for a wide range of applications in CAD and CAE in virtue of its generality.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.2
• /
• pp.121-130
• /
• 2002

The concept of Level Of Detail (LOD) was introduced and has been used to enhance display performance and to carry out certain engineering analysis effectively. We would like to use an adequate complexity level for each geometric model depending on specific engineering needs and purposes. Solid modeling systems are widely used in industry, and are applied to advanced applications such as virtual assembly. In addition, as the demand to share these engineering tasks through networks is emerging, the problem of building a solid model of an appropriate resolution to a given application becomes a matter of great necessity. However, current researches are mostly focused on triangular mesh models and various operators to reduce the number of triangles. So we are working on the multi-resolution of the solid model itself, rather than that of the triangular mesh model. In this paper, we propose multi-resolution representation of B-rep model by reordering and converting design features into an enclosing volume and subtractive features.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.945-952
• /
• 2013

The R wave of QRS complex is the most prominent feature in ECG because of its specific shape; therefore it is taken as a reference in ECG feature extraction. But R wave detection suffers from the fact that frequency bands of the noise/other components such as P/T waves overlap with that of QRS complex. ECG signal processing must consider efficiency for hardware and software resources available in processing for miniaturization and low power. In other words, the design of algorithm that exactly detects QRS region using minimal computation by analyzing the person's physical condition and/or environment is needed. Therefore, efficient QRS detection based on SOM(Subtractive Operation Method) is presented in this paper. For this purpose, we detected R wave through the preprocessing method using morphological filter, empirical threshold, and subtractive signal. Also, we applied dynamic backward searching method for efficient detection. The performance of R wave detection is evaluated by using MIT-BIH arrhythmia database. The achieved scores indicate the average of 99.41% in R wave detection.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.5
• /
• pp.199-206
• /
• 2007

In this paper we propose a new clustering algorithm that performs clustering the feature vectors for the speaker identification. Unlike typical clustering approaches, the proposed method performs the clustering without the initial guesses of locations of the cluster centers and a priori information about the number of clusters. Cluster centers are obtained incrementally by adding one cluster center at a time through the boundary subtractive clustering algorithm. The number of clusters is obtained from investigating the mutual relationship between clusters. The experimental results for artificial datum and TIMIT DB show the effectiveness of the proposed algorithm as compared with the conventional methods.

• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.558-566
• /
• 2005

We propose a feature-based multi-resolution representation of B-rep solid models using history-based Boolean operations based on the merge-and-select algorithm. Because union and subtraction are commutative in the history-based Boolean operations, the integrity of the models at various levels of detail (LOD) is guaranteed for the reordered features regardless of whether the features are subtractive or additive. The multi-resolution solid representation proposed in this paper includes a non-manifold topological merged-set model of all feature primitives as well as a feature-modeling tree reordered consistently with a given LOD criterion. As a result, a B-rep solid model for a given LOD can be provided quickly, because the boundary of the model is evaluated without any geometric calculation and extracted from the merged set by selecting the entities contributing to the LOD model shape.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.2
• /
• pp.47-52
• /
• 2016

The used digital images in the smart device and small displayer has been a downscaled image. In this paper, the detection of the downscaling image forgery is proposed using the feature vector according to the pixel value's gradients. In the proposed algorithm, AR (Autoregressive) coefficients are computed from pixel value's gradients of the image. These coefficients as the feature vectors are used in the learning of a SVM (Support Vector Machine) classification for the downscaling image forgery detector. On the performance of the proposed algorithm, it is excellent at the downscaling 90% image forgery compare to MFR (Median Filter Residual) scheme that had the same 10-Dim. feature vectors and 686-Dim. SPAM (Subtractive Pixel Adjacency Matrix) scheme. In averaging filtering ($3{\times}3$) and median filtering ($3{\times}3$) images, it has a higher detection ratio. Especially, the measured performances of all items in averaging and median filtering ($3{\times}3$), AUC (Area Under Curve) by the sensitivity and 1-specificity is approached to 1. Thus, it is confirmed that the grade evaluation of the proposed algorithm is 'Excellent (A)'.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.6
• /
• pp.444-454
• /
• 2005

Recently, the requirements of multi-resolution models of a solid model, which represent an object at multiple levels of feature detail, are increasing for engineering tasks such as analysis, network-based collaborative design, and virtual prototyping and manufacturing. The research on this area has focused on several topics: topological frameworks for representing multi-resolution solid models, criteria for the level of detail (LOD), and generation of valid models after rearrangement of features. As a solution to the feature rearrangement problem, the new concept of the effective zone of a feature is introduced in the former part of the paper. In this paper, we propose a feature-based non-manifold modeling system to provide multi-resolution models of a feature-based solid or non-manifold model on the basis of the effective feature zones. To facilitate the implementation, we introduce the class of the multi-resolution feature whose attributes contain all necessary information to build a multi-resolution solid model and extract LOD models from it. In addition, two methods are introduced to accelerate the extraction of LOD models from the multi-resolution modeling database: the one is using an NMT model, known as a merged set, to represent multi-resolution models, and the other is storing differences between adjacent LOD models to accelerate the transition to the other LOD. We also suggest the volume of the feature, regardless of feature type, as a criterion for the LOD. This criterion can be used in a wide range of applications, since there is no distinction between additive and subtractive features unlike the previous method.

• ETRI Journal
• /
• v.32 no.3
• /
• pp.490-492
• /
• 2010

This letter proposes a robust feature extraction method using a spatially normalized mean for temporal ordinal measurement. Before computing a rank matrix from the mean values of non-overlapped blocks, each block mean is normalized so that it obeys the invariance property against linear additive and subtractive noise effects and is insensitive against multiplied and divided noise effects. Then, the temporal ordinal measures of spatially normalized mean values are computed for the feature matching. The performance of the proposed method showed about 95% accuracy in both precision and recall rates on various distortion environments, which represents the 2.7% higher performance on average compared to the temporal ordinal measurement.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.5
• /
• pp.42-47
• /
• 2017

In the distribution of digital image, the median filtering is used for a forgery. This paper proposed the algorithm of a image forensics detection for the classification of median filtering. For the solution of this grave problem, the feature vector is composed of 42-Dim. The detected quantity 32, 64 and 128 of forgery image edges, respectively, which are processed by the Hough transform, then it extracted from the start-end point coordinates of the Hough Lines. Also, the Hough Peaks of the Angle-Distance plane are extracted. Subsequently, both of the feature vectors are composed of the proposed scheme. The defined 42-Dim. feature vector is trained in SVM (Support Vector Machine) classifier for the MF classification of the forged images. The experimental results of the proposed MF detection algorithm is compared between the 10-Dim. MFR and the 686-Dim. SPAM. It confirmed that the MF forensic classification ratio of the evaluated performance is 99% above with the whole test image types: the unaltered, the average filtering ($3{\times}3$), the JPEG (QF=90 and 70)) compression, the Gaussian filtered ($3{\times}3$ and $5{\times}5$) images, respectively.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.10
• /
• pp.1305-1313
• /
• 2013

In this study, a method to apply feature-based simplification to boundary representation models is proposed. For feature-based simplification, a volume decomposition tree is created from a boundary representation model. The volume decomposition tree is represented by regularized Boolean operations of additive volumes, subtractive volumes, and fillet/round/chamfer volumes, and it is generated by stepwise volume decomposition, which consists of fillet/round/chamfer decomposition, wrap-around decomposition, volume split decomposition, and cell-based decomposition. After the volume decomposition tree is transformed to an infix expression, the CAD model can be simplified by reordering the volumes. To verify the proposed method, a prototype system was implemented, and experiments on test cases were conducted. From the results of the experiments, it is verified that the proposed method is useful for simplifying CAD models based on boundary representation.