• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.555-576
• /
• 2016

In the conventional clustering algorithms, an object could be assigned to only one group. However, this is sometimes not the case in reality, there are cases where the data do not belong to one group. As against, the fuzzy clustering takes into consideration the degree of fuzzy membership of each pixel relative to different classes. In order to overcome some shortcoming with traditional clustering methods, such as slow convergence and their sensitivity to initialization values, we have used the Harmony Search algorithm. It is based on the population metaheuristic algorithm, imitating the musical improvisation process. The major thrust of this algorithm lies in its ability to integrate the key components of population-based methods and local search-based methods in a simple optimization model. We propose in this paper a new unsupervised clustering method called the Fuzzy Harmony Search-Fourier Transform (FHS-FT). It is based on hybridization fuzzy clustering and the harmony search algorithm to increase its exploitation process and to further improve the generated solution, while the Fourier transform to increase the size of the image's data. The results show that the proposed method is able to provide viable solutions as compared to previous work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1817-1827
• /
• 2014

As a new type of wireless network, Ad hoc network does not depend on any pre-founded infrastructure, and it has no centralized control unit. The computation and transmission capability of each node are limited. In this paper, a self-updating one-time password mutual authentication protocol for Ad hoc network is proposed. The most significant feature is that a hash chain can update by itself smoothly and securely through capturing the secure bit of the tip. The updating process does not need any additional protocol or re-initialization process and can be continued indefinitely to give rise to an infinite length hash chain, that is, the times of authentication is unlimited without reconstructing a new hash chain. Besides, two random variable are added into the messages interacted during the mutual authentication, enabling the protocol to resist man-in-the-middle attack. Also, the user's identity information is introduced into the seed of hash chain, so the scheme achieves anonymity and traceability at the same time.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.02a
• /
• pp.47-54
• /
• 2004

In order to meet the users demand, who needs faster and more accurate data in geographic information it is necessary to obtain and process the data more effectively. Now more effective data obtainment about geographic information is possible through the development of unified technology, which is applied to the field of geographic information, as well as through the development of hardware and software engineering. With the fast and precise correction and update, the development of unified technology can bring the reduction of the time and money. For the obtainment of geographic information which can meet the demand of the users, the unified technology has been applied to various fields, and in Aerial Photogrammetry field, many are doing researches actively for the GPS/INS unified system. To obtain fast and precise geographic information using Aerial Photogrammetry method, it is necessary to develop Airborne GPS/INS unified system, which makes GCP to the minimum. For this reason, this study has tried to develop a system which could unite and process both GPS and INS data. For this matter, code-processing module for DGPS and OTF initialization module, which can decide integer ambiguity even in motion, have been developed. And also, continuous kinematic carrier-processing module has been developed to calculate the location at the moment of filming. In addition, this study suggests a possibility of using a module, which can unite GPS and INS, using Kalman filtering, and also shows the INS navigation theory.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.468-474
• /
• 2020

This paper describes the hardware implementation of SPECK, a lightweight block cipher algorithm developed for the security of applications with limited resources such as IoT and wireless sensor networks. The block cipher SPECK crypto-core supports 8 block/key sizes, and the internal data-path was designed with 16-bit for small gate counts. The final round key to be used for decryption is pre-generated through the key initialization process and stored with the initial key, enabling the encryption/decryption for consecutive blocks. It was also designed to process round operations and key scheduling independently to increase throughput. The hardware operation of the SPECK crypto-core was validated through FPGA verification, and it was implemented with 1,503 slices on the Virtex-5 FPGA device, and the maximum operating frequency was estimated to be 98 MHz. When it was synthesized with a 180 nm process, the maximum operating frequency was estimated to be 163 MHz, and the estimated throughput was in the range of 154 ~ 238 Mbps depending on the block/key sizes.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.25-28
• /
• 2001

RBFN has some problem that because the basis function isn't orthogonal to each others the number of used basis function goes to big. In this reason, the Wavelet Neural Network which uses the orthogonal basis function in the hidden node appears. In this paper, we propose the composition method of the actual function in hidden layer with the scaling function which can represent the region by which the several wavelet can be represented. In this method, we can decrease the size of the network with the pure several wavelet function. In addition to, when we determine the parameters of the scaling function we can process rough approximation and then the network becomes more stable. The other wavelets can be determined by the global solutions which is suitable for the suggested problem using the genetic algorithm and also, we use the back-propagation algorithm in the learning of the weights. In this step, we approximate the target function with fine tuning level. The complex neural network suggested In this paper is a new structure and important simultaneously in the point of handling the determination problem in the wavelet initialization.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1496-1504
• /
• 2004

In this paper, we propose an algorithm for initializing a target vehicle detection, tracking the vehicle and estimating the distance from it on the stereo images acquired from a forward-looking stereo camera mounted on a road driving vehicle. The process of vehicle detection extracts road region using lane recognition and searches vehicle feature from road region. The distance of tracking vehicle is estimated by TSS correlogram matching from stereo Images. Through the simulation, this paper shows that the proposed method segments, matches and tracks vehicles robustly from image sequences obtained by moving stereo camera.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.2
• /
• pp.90-103
• /
• 2006

There are many file systems in various operating systems. Those are usually designed for server environments, where the common cases are usually 'multiple active users', 'great many small files' And they assume a big main memory to be used as buffer cache. So the existing file systems are not suitable for resource hungry embedded systems that process multimedia data streams. In this study, we designed and implemented a new file system which efficiently stores and retrieves multimedia data steams. The proposed file system has a very simple disk layout, which guarantees a quick disk initialization and file system recovery. And we introduced a new indexing-scheme, called the time-based indexing scheme, with the file system. With the indexing scheme, the file system maintains the relation between time and the location for all the multimedia streams. The scheme is useful in searching and playing the compressed multimedia streams by locating exact frame position with given time, resulting in reduction of CPU processing and power consumption. The proposed file system and its APIs utilizing the time-based indexing schemes were implemented firstly on a Linux environment, though it is operating system independent. In the performance evaluation on a real DVR system, which measured the execution time of multi-threaded reading and writing, we found the proposed file system is maximum 38.7% faster than EXT2 file system.

• Journal of IKEEE
• /
• v.3 no.2 s.5
• /
• pp.305-313
• /
• 1999

To demodulate the received OFDM signal, symbol timing detection which finds symbol start in the received sample stream is required in the system initialization. In this paper, we analyze the effect of symbol timing offset and propose a new symbol timing detection algorithm, which is using the guard interval. The proposed algorithm requires low computational process and small memory size, and dose not be affected by frequency offset and phase offset. In addition, We apply this algorithm to European digital TV broadcasting model based on OFDM to evaluate the performance in AWGN and multipath fading channel by the computer simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.976-990
• /
• 2020

The k-means algorithm is widely used in academia and industry due to easy and simple implementation, enabling fast learning for complex datasets. However, k-means struggles to classify datasets without prior knowledge of specific domains. We proposed the repulsive k-means (RK-means) algorithm in a previous study to improve the k-means algorithm, using the repulsive force concept, which allows deleting unnecessary cluster centroids. Accordingly, the RK-means enables to classifying of a dataset without domain knowledge. However, three main problems remain. The RK-means algorithm includes a cluster repulsive force offset, for clusters confined in other clusters, which can cause cluster locking; we were unable to prove RK-means provided optimal convergence in the previous study; and RK-means shown better performance only normalize term and weight. Therefore, this paper proposes the advanced RK-means (ARK-means) algorithm to resolve the RK-means problems. We establish an initialization strategy for deploying cluster centroids and define a metric for the ARK-means algorithm. Finally, we redefine the mass and normalize terms to close to the general dataset. We show ARK-means feasibility experimentally using blob and iris datasets. Experiment results verify the proposed ARK-means algorithm provides better performance than k-means, k'-means, and RK-means.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.6
• /
• pp.88-95
• /
• 2003

This paper presents the measurement and correction method of PCB alignment errors for PCB screen printer. Electronic equipment is getting smaller and yet must satisfy high performance standard. Therefore, there is a great demand for PCB with high density. However conventional PCB screen printer doesn't have enough accuracy to accommodate the demand fur high-resolution circuit pattern and high-density mounting capacity of electronic chips. It is because the alignment errors of PCB occur when it is loaded to the screen printer. Therefore, this study focuses on the development of the system which is able to measure and correct alignment errors with high-accuracy. An automatic optical inspection part measures the PCB alignment errors using machine vision, and the high-accuracy 3-axis stage makes correction for these errors. This system used two CCD cameras to get images of two fiducial marks of PCB. The geometrical relationship between PCB, cameras, and xy$\theta$ stage is derived, and analytical equations for alignment errors are also obtained. The unknown parameters including camera declining angles and etc. can be obtained by initialization process. Finally, the proposed algorithm is verified by experiments by using test bench.