• 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.

• 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.

• Resources Recycling
• /
• v.22 no.3
• /
• pp.73-80
• /
• 2013

Metal prices are rapidly rising due to increasing demand of metals and limited available resources according to the industrial requirement. As a result, securing a stable supply of these metal resources has been recognized as a core element of national competitiveness and sustained economic growth. In the case of magnesium and its alloys which are entirely depending on import, low-grade magnesium scraps from end-of-life vehicles and 3C(Camera, Computer, Communication) parts and magnesium wastes such as sludge and dross generated during melting process are hardly recycled. Accordingly, the development and commercialization of recycling technology of low-grade magnesium scrap is desperately needed to improve efficiency of resource circulation and to establish the required proprietary of resource metal supply and demand. In this study, papers and patents on recycling technologies of waste magnesium were analyzed. The range of search was limited in the open patents of USA (US), European Union (EP), Japan (JP), Korea (KR) and SCI journals from 1974 to 2012. Patents and journals were collected using key-words searching and filtered by filtering criteria. The trends of the patents and journals was analyzed by the years, countries, companies, and technologies.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.33 no.6
• /
• pp.475-482
• /
• 2020

For electronic paper displays using electrophoresis, the response time and reflectivity of the image panel fabricated by filtering are analyzed. For the filtering process, a square wave and ramp wave are applied to white charged particles with a unique q/m value. We divide the sample panels into #1 to #4 according to the applied waveform in the filtering process. Step waves comprising two steps are used to drive the panel; therefore, we divide the driving conditions into D1~D4. The applied voltage at the first stage of the half cycle of the driving waveform moves the charged particles attached via the image force from the electrode, and the applied voltage at the second stage moves the floating charged particles by detaching. As mentioned, four types of driving conditions (D1 to D4) classified according to the half cycle of the driving waveform are applied to the samples #1 to #4), which are classified according to four types of filtering process. When driving condition D1 is applied to the four types of sample panels, the rise time of #1 is 1.59s, #2 is 1.706s, #3 is 1.853s, and #4 is 1.235s, resulting in #4 being relatively faster compared with other sample panels, and showing the same trend in other driving conditions. As a result, we confirm that applying the driving condition D1 causes abrupt movement of the white charged particles injected into the cell. When the same driving waveform (D1) is applied to each sample, reflectivities of 32.1% for #1, 31.4% for #2, 27.9% for #3, and 63.4% for #4 are measured. From the experiment, we confirm that the driving condition D1 (1s of 3.5 V, 9s of 3.0 V) and ramp wave #4 in filtering are desirable for good reflectivity and response time. Our research is expected to contribute to the improvement of the filtering process and optimization of the driving waveform.

• Journal of Korea Water Resources Association
• /
• v.38 no.8 s.157
• /
• pp.617-629
• /
• 2005

In this paper, a hypothesis is tested that division of non-monotonic time series into monotonic parts will improve the estimation of trends through increased homogeneity in direction of time-variation using LOWESS smoothing and seasonal Kendall test. From the trend analysis of generated time series and water temperature, discharge, air temperature and solar radiation of Lake Daechung, it is shown that the hypothesis is supported by improved estimation of trends and slopes. Also, characteristics in homogeneity variation of seasonal changes seems to be more clearly manifested as homogeneity in direction of time-variation is increased. And this will help understand the effects of human intervention on natural processes and seems to warrant more in-depth study on this subject. The proposed method can be used for trend analysis to detect monotonic trends and it is expected to improve understanding of long-term changes in natural environment.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.23 no.3
• /
• pp.227-236
• /
• 2003

Leaks in underground pipelines can cause social, environmental and economical problems. One of relevant countermeasures against leaks is to find and repair of leak points of the pipes. Leak noise is a good source to identify the location of leak points of the pipelines. Although there have been several methods to detect the leak location with leak noise, such as listening rods, hydrophones or ground microphones, they have not been so efficient tools. In this paper, acoustic emission (AE) sensors and accelermeters are used to detect leak locations which could provide all easier and move efficient method. Filtering, signal processing and algorithm of raw input data from sensors for the detection of leak location are described. A 120m-long pipeline system for experiment is installed and the results with the system show that the algorithm with the AE sensors and accelerometers offers accurate pinpointing of leaks. Theoretical analysis of sound wave propagation speed of water in underground pipes, which is critically important in leak locating, is also described.

• Journal of Biomedical Engineering Research
• /
• v.21 no.4
• /
• pp.333-338
• /
• 2000

In this paper, an automated segmentation algorithm is proposed for MR brain images using T1-weighted, T2-weighted, and PD images complementarily. The proposed segmentation algorithm is composed of 3 step. In the first step, cerebrum images are extracted by putting a cerebrum mask upon the three input images. In the second step, outstanding clusters that represent inner tissues of the cerebrum are chosen among 3-dimensional(3D) clusters. 3D clusters are determined by intersecting densely distributed parts of 2D histogram in the 3D space formed with three optimal scale images. Optimal scale image is made up of applying scale space filtering to each 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram. In the final step, cerebrum images are segmented using FCM algorithm with its initial centroid value as the outstanding clusters centroid value. The proposed cluster's centroid accurately. And also can get better segmentation results from the proposed segmentation algorithm with multi spectral analysis than the method of single spectral analysis.

• Journal of Korea Multimedia Society
• /
• v.14 no.4
• /
• pp.529-537
• /
• 2011

In this paper, we propose a stable scale adaptive tracking method that uses centroids of the target colors. Most scale adaptive tracking methods have utilized histograms to determine target window sizes. However, in certain cases, histograms fail to provide good estimates of target sizes, for example, in the case of occlusion or the appearance of colors in the background that are similar to the target colors. This is due to the fact that histograms are related to the numbers of pixels that correspond to the target colors. Therefore, we propose the use of centroids that correspond to the target colors in the scale adaptation algorithm, since centroids are less sensitive to changes in the number of pixels that correspond to the target colors. Due to the spatial information inherent in centroids, a direct relationship can be established between centroids and the scale of target regions. Generally, after the zooming factors that correspond to all the target colors are calculated, the unreliable zooming factors are filtered out to produce a reliable zooming factor that determines the new scale of the target. Combined with the centroid based tracking algorithm, the proposed scale adaptation method results in a stable scale adaptive tracking algorithm. It tracks objects in a stable way, even when the background colors are similar to the colors of the object.

• Journal of Information Management
• /
• v.41 no.4
• /
• pp.227-249
• /
• 2010

Scholarly information has increased tremendously according to the development of IT, especially the Internet. However, simultaneously, people have to spend more time and exert more effort because of information overload. There have been many research efforts in the field of expert systems, data mining, and information retrieval, concerning a system that recommends user-expected information items through presumption. Recently, the hybrid system combining a content-based recommendation system and collaborative filtering or combining recommendation systems in other domains has been developed. In this paper we resolved the problem of the current recommendation system and suggested a new system combining collaborative filtering and Naive Bayes Classification. In this way, we resolved the over-specialization problem through collaborative filtering and lack of assessment information or recommendation of new contents through Naive Bayes Classification. For verification, we applied the new model in NDSL's paper service of KISTI, especially papers from journals about Sitology and Electronics, and witnessed high satisfaction from 4 experimental participants.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.612-624
• /
• 2005

In this paper, we propose a surface-based registration using a gaussian weighted distance map for PET-CT brain image fusion. Our method is composed of three main steps: the extraction of feature points, the generation of gaussian weighted distance map, and the measure of similarities based on weight. First, we segment head using the inverse region growing and remove noise segmented with head using region growing-based labeling in PET and CT images, respectively. And then, we extract the feature points of the head using sharpening filter. Second, a gaussian weighted distance map is generated from the feature points in CT images. Thus it leads feature points to robustly converge on the optimal location in a large geometrical displacement. Third, weight-based cross-correlation searches for the optimal location using a gaussian weighted distance map of CT images corresponding to the feature points extracted from PET images. In our experiment, we generate software phantom dataset for evaluating accuracy and robustness of our method, and use clinical dataset for computation time and visual inspection. The accuracy test is performed by evaluating root-mean-square-error using arbitrary transformed software phantom dataset. The robustness test is evaluated whether weight-based cross-correlation achieves maximum at optimal location in software phantom dataset with a large geometrical displacement and noise. Experimental results showed that our method gives more accuracy and robust convergence than the conventional surface-based registration.