• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.8
• /
• pp.579-588
• /
• 2013

This paper proposes an effective watermarking approach for copyright protection of fire video images. The proposed watermarking approach efficiently utilizes the inherent characteristics of fire data with respect to color and texture by using a gray level co-occurrence matrix (GLCM) and fuzzy c-means (FCM) clustering. GLCM is used to generate a texture feature dataset by computing energy and homogeneity properties for each candidate fire image block. FCM is used to segment color of the fire image and to select fire texture blocks for embedding watermarks. Each selected block is then decomposed into a one-level wavelet structure with four subbands [LL, LH, HL, HH] using a discrete wavelet transform (DWT), and LH subband coefficients with a gain factor are selected for embedding watermark, where the visibility of the image does not affect. Experimental results show that the proposed watermarking approach achieves about 48 dB of high peak-signal-to-noise ratio (PSNR) and 1.6 to 2.0 of low M-singular value decomposition (M-SVD) values. In addition, the proposed approach outperforms conventional image watermarking approach in terms of normalized correlation (NC) values against several image processing attacks including noise addition, filtering, cropping, and JPEG compression.

• Geophysics and Geophysical Exploration
• /
• v.5 no.2
• /
• pp.118-125
• /
• 2002

The hydrogeologic structure in the Chojung area was evaluated from a set of geological and geophysical investigations: detailed geological survey, vertical electric sounding (VES), borehole logging, and controlled-source magnetotelluric (CSMT) survey. Among these, CSMT soundings were taken for integrated interpretation to extend hydrogeologic structure with depth. The result of CSMT survey along with VES and borehole logging provides the vertical geologic boundary connected with hydrogeologic structure, and also indicates the depth of aquifer in granite basement. To interpret the geologic boundary and aquifer characteristics using CSMT data, we adopted the technique of 1-D inversion with smoothness-constrained method and 2-D continuous profiling with 1-D Bostick inversion and spatial filtering. The methodology tested and adopted in this study would be useful and required for providing a more information to the structure of fractured aquifer system.

• Geophysics and Geophysical Exploration
• /
• v.10 no.2
• /
• pp.138-146
• /
• 2007

This paper describes 2.5D induced polarization (IP) modeling and inversion algorithms using complex resistivity. The complex resistivity method has merits for acquiring more valuable information about hydraulic parameters and pore fluid than the conventional IP methods. The IP modeling and inversion algorithms are developed by allowing complex arithmetic in existing DC modeling and inversion algorithms. The IP modeling and inversion algorithms use a 2.5D DC finite-element algorithm and a damped least-squares method with smoothness constraints, respectively. The accuracy of the IP modeling algorithm is verified by comparing its responses of two synthetic models with two different approaches: linear filtering for a three-layer model and an integral equation method for a 3D model. Results from these methods are well matched to each other. The inversion algorithm is validated by a synthetic example which has two anomalous bodies, one is more conductive but non-polarizable than the background, and the other is polarizable but has the same resistivity as the background. From the inverted section, we can cleary identify each anomalous body with different locations. Furthermore, in order to verify its efficiency to the real filed example, we apply the inversion algorithm to another three-layer model which includes phase anomaly in the second layer.

• Korean Journal of Food Science and Technology
• /
• v.47 no.2
• /
• pp.145-148
• /
• 2015

According to the Korea Food Additives Code, sodium metasilicate is permitted for use as a filtering agent for edible oils and fats. Sodium metasilicate is currently used as a food additives to increase the weight of shark fins. In this study, we developed an analytical method to quantify sodium metasilicate in food. Sodium metasilicate content was estimated by measuring the moisture content, pH and silicon content of shark fins. Silicon content was analyzed using inductively coupled plasma-optical emission spectrometry (ICP-OES) following microwave-assisted digestion with $HNO_3$ (65%) and $H_2O_2$ (30%). Shark fin total silicon content was $7.17{\pm}8.92mg/kg$, while the soluble silicon content was $2.34{\pm}3.80mg/kg$. After soaking raw shark fin in an aqueous solution of sodium metasilicate, fin weight, pH and silicon content were measured. These results would be used as the basic information for shark fins safety management.

• Journal of Biomedical Engineering Research
• /
• v.25 no.6
• /
• pp.479-487
• /
• 2004

Biopotential signals have been used as command in systems using electrical stimulation of motor nerves to restore movement after an injury to the central nervous system (CNS). In order to use the voluntary EMG (electromyography) among the biopotentials as a control signal for the electrical stimulation of the same muscle for CNS injury patients, it is necessary to remove M-wave of having high magnitude from raw data. We designed an optimal filter for removing the M-wave and preserving the voluntary EMG and showed that the optimal filter is eigen filter. We also proved that the previous method using the prediction error filter(PEF) is a suboptimal filtering in the sense of preserving the voluntary EMG. On basis of the data obtained from a model for M-wave and voluntary EMG and from actual CNS injury patients, with false-positive rate analysis, the proposed adaptive filter showed a very promising performance in comparison with previous method.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.127-136
• /
• 2005

This paper measured a proper ratio of the size of demand fetch cache $L_1$ to that of prefetch cache $L_P$ by imulation when the size of $L_1$ and $L_P$ are constant which organize space-limited level 1 cache of a single microprocessor chip. The analysis of our experiment showed that in the condition of the sum of the size of $L_1$ and $L_P$ are 16 KB, the level 1 cache organization by constituting $L_P$ with 4 KB and employing OBL and FIFO as a prefetch technique and a cache replacement policy respectively resulted in the best performance. Also, this analysis showed that in the condition of the sum of the size of $L_1$ and $L_P$ are over 32 KB, employing dynamic filtering as prefetch technique of $L_P$ are more advantageous and splitting level 1 cache by constituting $L_1$ with 28 KB and $L_P$ with 4 KB in the case of 32 KB of space are available, by constituting $L_1$ with 48 KB and $L_P$ with 16 KB in the case of 64 KB elicited the best performance.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.112-122
• /
• 2009

The EPCglobal leading the development in RFID standards proposed Event Cycle Specification (ECSpec) and Event Cycle Reports (ECReports) for the standard about RFID middleware interface. ECSpec is a specification for filtering and collecting RFID tag data and is treated as a Continuous Query (CQ) processed during fixed time intervals repeatedly. ECReport is a specification for describing the results after ECSpec is processed. Thus, it is efficient to apply Query Indexing technique designed for the continuous query processing. This query index processes ECSpecs as data and tag events as queries for efficiency. In logistics environment, the similar or same products are transferred together. Also, when RFID tags attached to the products are acquired, the acquisition events occur massively for the short period. For these properties, it is inefficient to process the massive events one by one. In this paper, we propose a technique reducing similar search process by considering tag events which are collected by the report period in ECSpec, as a range query. For this group processing, we suggest a queuing method for collecting tag events efficiently and a structure for generating range queries in the queues. The experiments show that performance is enhanced by the proposed methods.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.247-258
• /
• 2004

Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

• Korean Journal of Applied Biomechanics
• /
• v.15 no.3
• /
• pp.143-152
• /
• 2005

The purpose of this study was to predict the failure or success of the Snatch-lifting trial as a consequence of the stand-up phase simulated in Kane's equation of motion that was effective for the dynamic analysis of multi-segment. This experiment was a case study in which one male athlete (age: 23yrs, height: 154.4cm, weight: 64.5kg) from K University was selected The system of a simulation included a multi-segment system that had one degree of freedom and one generalized coordinate for the shank segment angle. The reference frame was fixed by the Nonlinear Trans formation (NLT) method in order to set up a fixed Cartesian coordinate system in space. A weightlifter lifted a 90kg-barbell that was 75% of subject's maximum lifting capability (120kg). For this study, six cameras (Qualisys Proreflex MCU240s) and two force-plates (Kistler 9286AAs) were used for collecting data. The motion tracks of 11 land markers were attached on the major joints of the body and barbell. The sampling rates of cameras and force-plates were set up 100Hz and 1000Hz, respectively. Data were processed via the Qualisys Track manager (QTM) software. Landmark positions and force-plate amplitudes were simultaneously integrated by Qualisys system The coordinate data were filtered using a fourth-order Butterworth low pass filtering with an estimated optimum cut-off frequency of 9Hz calculated with Andrew & Yu's formula. The input data of the model were derived from experimental data processed in Matlab6.5 and the solution of a model made in Kane's method was solved in Matematica5.0. The conclusions were as follows; 1. The torque motor of the shank with 246Nm from this experiment could lift a maximum barbell weight (158.98kg) which was about 246 times as much as subject's body weight (64.5kg). 2. The torque motor with 166.5 Nm, simulated by angular displacement of the shank matched to the experimental result, could lift a maximum barbell weight (90kg) which was about 1.4 times as much as subject's body weight (64.5kg). 3. Comparing subject's maximum barbell weight (120kg) with a modeling maximum barbell weight (155.51kg) and with an experimental maximum barbell weight (90kg), the differences between these were about +35.7kg and -30kg. These results strongly suggest that if the maximum barbell weight is decided, coaches will be able to provide further knowledge and information to weightlifters for the performance improvement and then prevent injuries from training of weightlifters. It hopes to apply Kane's method to other sports skill as well as weightlifting to simulate its motion in the future study.