• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1778-1784
• /
• 2016

we improved the performance by parallelizing lane detection algorithms. Lane detection, as a intellectual assisting system, helps drivers make an alarm sound or revise the handle in response of lane departure. Four kinds of algorithms are implemented in order as following, Gaussian filtering algorithm so as to remove the interferences, gray conversion algorithm to simplify images, sobel edge detection algorithm to find out the regions of lanes, and hough transform algorithm to detect straight lines. Among parallelized methods, the data level parallelism algorithm is easy to design, yet still problem with the bottleneck. The high-speed data level parallelism is suggested to reduce this bottleneck, which resulted in noticeable performance improvement. In the result of applying actual road video of black-box on our parallel algorithm, the measurement, in the case of single-core, is approximately 30 Frames/sec. Furthermore, in the case of octa-core parallelism, the data level performance is approximately 100 Frames/sec and the highest performance comes close to 150 Frames/sec.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4C
• /
• pp.254-264
• /
• 2011

In this paper, we propose two algorithm for improving the performance of wireless localization(Trilateration and Least Square) based on the range based approach method in indoor environment using RSSI for ranging distance. we propose a method to discriminate the case that has relatively large estimation errors in trilateration using Heron''s formula for the volume of a tetrahedron. And we propose the algorithm to process the discriminated types of distance using the absolute value calculated by Heron''s formula. In addition, we propose another algorithm for the case of which the number of anchor nodes larger than three. In this case, Residual Weighting Factor(RWGH) improves the performance of Least Square. However, RWGH requires many number of calculations. In this paper, we propose Iterative Weighted Centroid Algorithm(IWCA) that has better performance and less calculation than RWGH. We show the improvement of performance for two algorithms and the combination of these algorithm by using simulation results.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.167-173
• /
• 2016

Compressed Sensing(CS) is the theory that can recover signals which are sampled below the Nyquist sampling rate to original analog signals. In this paper, we propose the estimation algorithm of ultrasonic attenuation coefficients in the frequency domain using CS. While most estimation algorithms transform the time-domain signals into the frequency-domain using the Fourier transform, the proposed method directly utilize the spectral information in the recovery process by the basis matrix without the completely recovered signals in the time domain. We apply three transform bases for sparsifying and estimate the attenuation coefficients using the Centroid Downshift method with Dual-reference diffraction compensation technique. The estimation accuracy and execution time are compared for each basis matrix. Computer simulation results show that the DCT basis matrix exhibits less than 0.35% estimation error for the compressive ratio of 50% and about 6% average error for the compressive ratio of 70%. The proposed method which directly extracts frequency information from the CS signals can be extended to estimating for other ultrasonic parameters in the Quantitative Ultrasound (QUS) Analysis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.423-428
• /
• 2017

These days, various and tons of education information are rapidly increasing and spreading due to Internet and smart devices usage. Recently, as e-Learning usage increasing, many instructors and students (learners) need to set a goal to maximize learners' result of education and education system efficiency based on big data analytics via online recorded education historical data. In this paper, the author applied Word2Vec algorithm (neural network algorithm) to find similarity among education words and classification by clustering algorithm in order to objectively recognize and analyze online recorded education historical data. When the author applied the Word2Vec algorithm to education words, related-meaning words can be found, classified and get a similar vector values via learning repetition. In addition, through experimental results, the author proved the part of speech (noun, verb, adjective and adverb) have same shortest distance from the centroid by using clustering algorithm.

• Korean Journal of Remote Sensing
• /
• v.21 no.2
• /
• pp.163-171
• /
• 2005

I have developed a processor for synthetic aperture radar (SAR) raw data compression using range-doppler algorithm for educational purpose. The program realized a generic SAR focusing algorithm so that it can deal with any SAR system if the specification is known. It can run efficiently on a low-cost computer by selecting minimum size out of a whole dataset, and can produce intermediate images during the process. Especially, the program is designed for educational purpose in such a way that Doppler centroid and azimuth ambiguity can be determined graphically by the user. By distributing the source code and the algorithm to public, I intend to maximize the educational effect on understanding and utilizing SAR data. This paper introduces the principle of SAR focusing algorithm embedded on the eSAR processor and shows an example of data processing using ERS-1 raw data.

• KIISE Transactions on Computing Practices
• /
• v.21 no.6
• /
• pp.436-441
• /
• 2015

There are many types of clustering algorithms such as centroid, hierarchical, or density-based methods. Each algorithm has unique data grouping principles, which creates different varieties of clusters. Ordering Points To Identify the Clustering Structure (OPTICS) is a well-known density-based algorithm to analyze arbitrary shaped and varying density clusters, but the obtained clusters only correlate loosely. Hierarchical agglomerative clustering (HAC) reveals a hierarchical structure of clusters, but is unable to clearly find non-convex shaped clusters. In this paper, we provide a novel hierarchy generation framework and application which can aid users by combining the advantages of the two clustering methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.761-765
• /
• 2009

This research aims an optimal placement of Mobile Base Station (MBS) under HAP based network configurations with the restrictions of HAP capabilities. With clustering algorithm based on BIRCH, mobile ground nodes are clustered and the centroid of the clusters will be the location of MBS. The hierarchical structure of BIRCH enables mobile node management by CF tree and the restrictions of maximum nodes per MBS and maximum radio coverage are accomplished by splitting and merging clusters. Mobility models based on Jeju island are used for simulations and such restrictions are met with proper placement of MBS.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.279-286
• /
• 2006

Classification method used in this paper is applied for the first time to Korean traditional music. Among the frequency distribution vectors, average peak value is suggested and proved effective comparing to previous classification success rate. Mean, variance, spectral centroid, average peak value and ZCR are used to classify Korean traditional musical instruments. To achieve Korean traditional instruments automatic classification, Spectral analysis is used. For the spectral domain, Various functions are introduced to extract features from the data files. k-NN classification algorithm is applied to experiments. Taegum, gayagum and violin are classified in accuracy of 94.44% which is higher than previous success rate 87%.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.210-216
• /
• 2006

In the rule based modeling, data partitioning plays crucial role be cause partitioned sub data set implies particular information of the given data set or system. In this paper, we present an empirical study result of the data pattern estimation to find underlying data patterns of the given data. Presented method performs crisp type clustering with given n number of data samples by means of the sequential agglomerative hierarchical nested model (SAHN). In each sequence, the average value of the sum of all inter-distance between centroid and data point. In the sequel, compute the derivation of the weighted average distance to observe a pattern distribution. For the final step, after overall clustering process is completed, weighted average distance value is applied to estimate range of the number of clusters in given dataset. The proposed estimation method and its result are considered with the use of FCM demo data set in MATLAB fuzzy logic toolbox and Box and Jenkins's gas furnace data.

• Journal of Magnetics
• /
• v.18 no.3
• /
• pp.311-316
• /
• 2013

Digital image processing has increasingly been implemented in nanostructural analysis and would be an ideal tool to characterize the morphology and position of self-assembled magnetic nanoparticles for high density recording. In this work, magnetic nanoparticles were synthesized by the modified polyol process using $Fe(acac)_3$ and $Pt(acac)_2$ as starting materials. Transmission electron microscope (TEM) images of as-synthesized products were inspected using an image processing procedure. Grayscale images ($800{\times}800$ pixels, 72 dot per inch) were converted to binary images by using Otsu's thresholding. Each particle was then detected by using the closing algorithm with disk structuring elements of 2 pixels, the Canny edge detection, and edge linking algorithm. Their centroid, diameter and area were subsequently evaluated. The degree of polydispersity of magnetic nanoparticles can then be compared using the size distribution from this image processing procedure.