• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.591-600
• /
• 2013

This paper addresses a feature-based robust watermarking scheme for digital images using a local invariant features of SURF (Speeded-Up Robust Feature) descriptor. In general, the feature invariance is exploited to achieve robustness in watermarking schemes, but the leakage of information about hidden watermarks from publicly known locations and sizes of features are not considered carefully in security perspective. We propose embedding and detection methods where the watermark is bound with circular areas and inserted into extracted circular feature regions. These methods enhance the robustness since the circular watermark is inserted into the selected non-overlapping feature regions instead of entire image contents. The evaluation results for repeatability measures of SURF descriptor and robustness measures present the proposed scheme can tolerate various attacks, including signal processing and geometric distortions.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.9
• /
• pp.40-51
• /
• 1995

The assemblability was determined by the structure of product and the relationship between composing parts and machining parts. In this paper, the bolt was divided into bolt-head, -shaft, -thread and -end. For the better assemblability in bolting process, the geometric and technological characteristics of bolts in terms of pre- and in-assembly process were analyzed. And this paper presents assemblability evaluation for bolt feature design alternatives. For this evaluation system, we considered systematically eight factors for assemblability, but introduced two factores for the stability of laying and for the handlability of parts. And AutoCAC system is interfaced with the evaluation system written in C-language.

• Journal of the Korea Safety Management & Science
• /
• v.8 no.2
• /
• pp.51-59
• /
• 2006

So far, there is no technique of quantitative evaluation on danger related to industrial accidents. Therefore, as an endeavor for obtaining technique of quantitative evaluation, this study presents feature analysis of industrial accidents in manufacturing field using QUEST algorithm. In order to analyze feature of industrial accidents, a retrospective analysis was performed in 10,536 subjects (10,313 injured people, 223 deaths). The sample for this work chosen from data related to manufacturing businesses during three years $(2002\sim2004)$ in Korea. The analysis results were very informative since those enable us to know the most important variables such as occurrence type, company size, and occurrence time which can affect injured people. Also, it is found that classification using QUEST algorithm which was performed in this study is very reliable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3086-3103
• /
• 2017

Video images captured by vehicle cameras often contain blurry or dithering frames due to inadvertent motion from bumps in the road or by insufficient illumination during the morning or evening, which greatly reduces the perception of objects expression and recognition from the records. Therefore, a real-time electronic stabilization method to correct fuzzy video from driving recorders has been proposed. In the first stage of feature detection, a coarse-to-fine inspection policy and a scale nonlinear diffusion filter are proposed to provide more accurate keypoints. Second, a new antiblurry binary descriptor and a feature point selection strategy for unintentional estimation are proposed, which brought more discriminative power. In addition, a new evaluation criterion for affine region detectors is presented based on the percentage interval of repeatability. The experiments show that the proposed method exhibits improvement in detecting blurry corner points. Moreover, it improves the performance of the algorithm and guarantees high processing speed at the same time.

• Phonetics and Speech Sciences
• /
• v.7 no.1
• /
• pp.3-10
• /
• 2015

In this paper, different frequency scales in cepstral feature extraction are evaluated for the text-independent speaker recognition. To this end, mel-frequency cepstral coefficients (MFCCs), linear frequency cepstral coefficients (LFCCs), and bilinear warped frequency cepstral coefficients (BWFCCs) are applied to the speaker recognition experiment. In addition, the spectro-temporal features extracted by the cepstral-time matrix (CTM) are examined as an alternative to the delta and delta-delta features. Experiments on the NIST speaker recognition evaluation (SRE) 2004 task are carried out using the Gaussian mixture model-universal background model (GMM-UBM) method and the joint factor analysis (JFA) method, both based on the ALIZE 3.0 toolkit. Experimental results using both the methods show that BWFCC with appropriate warping factor yields better performance than MFCC and LFCC. It is also shown that the feature set including the spectro-temporal information based on the CTM outperforms the conventional feature set including the delta and delta-delta features.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.210-218
• /
• 2011

Battiti's mutual information feature selector (MIFS) and its variant algorithms are used for many classification applications. Since they ignore feature synergy, MIFS and its variants may cause a big bias when features are combined to cooperate together. Besides, MIFS and its variants estimate feature redundancy regardless of the corresponding classification task. In this paper, we propose an automated greedy feature selection algorithm called conditional mutual information-based feature selection (CMIFS). Based on the link between interaction information and conditional mutual information, CMIFS takes account of both redundancy and synergy interactions of features and identifies discriminative features. In addition, CMIFS combines feature redundancy evaluation with classification tasks. It can decrease the probability of mistaking important features as redundant features in searching process. The experimental results show that CMIFS can achieve higher best-classification-accuracy than MIFS and its variants, with the same or less (nearly 50%) number of features.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1293-1308
• /
• 2020

In fine-tuning-based transfer learning, the size of the dataset may affect learning accuracy. When a dataset scale is small, fine-tuning-based transfer-learning methods use high computing costs, similar to a large-scale dataset. We propose a mid-level feature extractor that retrains only the mid-level convolutional layers, resulting in increased efficiency and reduced computing costs. This mid-level feature extractor is likely to provide an effective alternative in training a small-scale medical image dataset. The performance of the mid-level feature extractor is compared with the performance of low- and high-level feature extractors, as well as the fine-tuning method. First, the mid-level feature extractor takes a shorter time to converge than other methods do. Second, it shows good accuracy in validation loss evaluation. Third, it obtains an area under the ROC curve (AUC) of 0.87 in an untrained test dataset that is very different from the training dataset. Fourth, it extracts more clear feature maps about shape and part of the chest in the X-ray than fine-tuning method.

• Journal of International Society for Simulation Surgery
• /
• v.2 no.2
• /
• pp.64-66
• /
• 2015

Purpose : In this paper we proposed cascade feature filter and projection method for rapid human face recognition for the large-scale high-dimensional face database. Materials and Methods : The relevant features are selected from the large feature set using Fast Correlation-Based Filter method. After feature selection, project them into discriminant using Principal Component Analysis or Linear Discriminant Analysis. Their cascade method reduces the time-complexity without significant degradation of the performance. Results : In our experiments, the ORL database and the extended Yale face database b were used for evaluation. On the ORL database, the processing time was approximately 30-times faster than typical approach with recognition rate 94.22% and on the extended Yale face database b, the processing time was approximately 300-times faster than typical approach with recognition rate 98.74 %. Conclusion : The recognition rate and time-complexity of the proposed method is suitable for real-time face recognition system on the large-scale high-dimensional face database.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2003.04a
• /
• pp.434-440
• /
• 2003

The exchange of model design date among heterogeneous CAD systems is a difficult task because each system has different data structures suitable for its own functions. STEP has been able to represent product information as a common computer-interpretable form that is required to remain complete and consistent when the product informant is needed to be exchanged among different computer system. However, STEP has difficult architecture in is representing point, line, curve and vectors of element, more over it can't represent geometry data of feature based models. In this study, a structure of XML document that represents geometry data of feature based models as neutral format has been developed. To use the developed XML document, a Converter has also been developed to exchange modules so that it can exchange feature based data models among heterogeneous CAD systems. Aa for evaluation of the developed XML document and Converter, Solidworks and SolidEdge are selected.

• Journal of Information Processing Systems
• /
• v.18 no.6
• /
• pp.794-802
• /
• 2022

The recovery of reasonable depth information from different scenes is a popular topic in the field of computer vision. For generating depth maps with better details, we present an efficacious monocular depth prediction framework with coordinate attention and feature fusion. Specifically, the proposed framework contains attention, multi-scale and feature fusion modules. The attention module improves features based on coordinate attention to enhance the predicted effect, whereas the multi-scale module integrates useful low- and high-level contextual features with higher resolution. Moreover, we developed a feature fusion module to combine the heterogeneous features to generate high-quality depth outputs. We also designed a hybrid loss function that measures prediction errors from the perspective of depth and scale-invariant gradients, which contribute to preserving rich details. We conducted the experiments on public RGBD datasets, and the evaluation results show that the proposed scheme can considerably enhance the accuracy of depth prediction, achieving 0.051 for log10 and 0.992 for δ<1.25³ on the NYUv2 dataset.