• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2087-2093
• /
• 2014

In this paper, an orthogonal matching pursuit (OMP) method combined with genetic algorithm (GA), named GAOMP, is proposed for sparse signal recovery. Some recent greedy algorithms such as SP, CoSaMP, and gOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. However they still often fail to converge to the solution because the support set could not avoid the local minimum during the iterations. Mutating the candidate support set chosen by the OMP algorithm, GAOMP is able to escape from the local minimum and hence recovers the sparse signal. Experimental results show that GAOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.92-98
• /
• 2017

Data clustering determines a group of patterns using similarity measure in a dataset and is one of the most important and difficult technique in data mining. Clustering can be formally considered as a particular kind of NP-hard grouping problem. K-means algorithm which is popular and efficient, is sensitive for initialization and has the possibility to be stuck in local optimum because of hill climbing clustering method. This method is also not computationally feasible in practice, especially for large datasets and large number of clusters. Therefore, we need a robust and efficient clustering algorithm to find the global optimum (not local optimum) especially when much data is collected from many IoT (Internet of Things) devices in these days. The objective of this paper is to propose new Hybrid Simulated Annealing (HSA) which is combined simulated annealing with K-means for non-hierarchical clustering of big data. Simulated annealing (SA) is useful for diversified search in large search space and K-means is useful for converged search in predetermined search space. Our proposed method can balance the intensification and diversification to find the global optimal solution in big data clustering. The performance of HSA is validated using Iris, Wine, Glass, and Vowel UCI machine learning repository datasets comparing to previous studies by experiment and analysis. Our proposed KSAK (K-means+SA+K-means) and SAK (SA+K-means) are better than KSA(K-means+SA), SA, and K-means in our simulations. Our method has significantly improved accuracy and efficiency to find the global optimal data clustering solution for complex, real time, and costly data mining process.

• Journal of the Korean Institute of Gas
• /
• v.19 no.1
• /
• pp.28-37
• /
• 2015

This study presents the development of a well placement optimization model, combining an artificial neural network, which enables high-speed calculation, with a simulated annealing algorithm. The conventional FDM simulator takes excessive time when used to perform a field scale reservoir simulation. In order to solve this problem, an artificial neural network was applied to the model to allow the simulation to be executed within a short time. Also by using the given result, the optimization method, SA algorithm, was implemented to automatically select the optimal location without taking any subjective experiences into consideration. By comparing the result of the developed model with the eclipse simulator, it was found that the prediction performance of the developed model has become favorable, and the speed of calculation performance has also been improved. Especially, the optimum value was estimated by performing a sensitivity analysis for the cooling rate and the initial temperature, which is the control parameter of SA algorithm. From this result, it was verified that the calculation performance has been improved, as well. Lastly, an optimization for the well placement was performed using the model, and it concluded the optimized place for the well by selecting regions with great productivity.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.75-81
• /
• 2014

In a distribution of the digital image, there is a serious problem that is distributed an illegal forgery image by pirates. For the problem solution, this paper proposes an image forensic decision algorithm using an edge energy information of forgery image. The algorithm uses SA (Streaking Artifacts) and SPAM (Subtractive Pixel Adjacency Matrix) to extract the edge energy informations of original image according to JPEG compression rate(QF=90, 70, 50 and 30) and the query image. And then it decides the forge whether or not by comparing the edge informations between the original and query image each other. According to each threshold in TCJCR (Threshold by Combination of JPEG Compression Ratios), the matching of the edge informations of original and query image is excused. Through the matching experiments, TP (True Positive) and FN (False Negative) is 87.2% and 13.8% respectively. Thus, the minimum average decision error is 0.1349. Also, it is confirmed that the performed class evaluation of the proposed algorithm is 'Excellent(A)' because of the AUROC (Area Under Receiver Operating Characteristic) curve is 0.9388 by sensitivity and 1-specificity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.5
• /
• pp.425-433
• /
• 2002

After the removal of SA (Selective Availability), horizontal accuracy of 25m(2dRMS) is easily obtained using GPS (Global Positioning System). In this paper, the error characteristics without SA are analyzed and a navigation algorithm concerns this error characteristics is proposed to further improve the accuracy. The proposed method utilizes the relationship between elevation angle and errors that are remained after ionospheric and troposheric delay compensation. The relationship is derived from real measurements and used as a weighting matrix of weighted least squares estimator. Furthermore, a RAIM (Receiver Autonomous Integrity Monitoring) technique is included to remove abnormal measurements affected by multi-path or low SNR (Signal-to-Noise Ratio). It is shown that using the proposed method, more than 4 times accurate result, which is comparable with DGPS (Differential GPS), can be obtained from experiments with real data. Besides accuracy and reliability, the proposed method reduces large jumps in position and maintains better performance than a method using mask angle to completely remove satellites below this mask angle. Thus it is expected that the proposed method can be efficiently applied to land navigation where some satellites are blocked by building or forest.

• Korean Journal of Remote Sensing
• /
• v.18 no.3
• /
• pp.147-153
• /
• 2002

The real-time reception and recording of down-link mission data from a satellite requires the highest reliability because the data lost in receiving process cannot be recovered. The data receiving and recording system has moved from a set of dedicated hardware and software components to commercial-off-the-shelf (COTS) components in order to reduce the system cost as well as to upgrade the system easily for handling other satellite data. The use of COTS hardware and middleware components prevents the system developer from correcting or modifying the internal operations of the COTS components, and hence, instant performance degradation of the COTS components which affects the reliable data acquisition must be covered by a software algorithm. This paper introduces the instant performance problem of a COTS data recording device which leads to the data loss in the real-time data reception and recording process. As a result, the requirement of the modification of the conventional data read/write technique is issued. In order to overcome the data loss problem due to the use of COTS components and the conventional software technique, a new algorithm called a software buffering technique is proposed. The experiments show that the application of the proposed technique results in reliable real-time reception and recording of high speed serial data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4372-4394
• /
• 2020

The distribution of popular videos incurs a large amount of traffic at the base stations (BS) of networks. Device-to-multi-device (D2MD) communication has emerged an efficient radio access technology for offloading BS traffic in recent years. However, traditional studies have focused on synchronous user requests whereas asynchronous user requests are more common. Hence, offloading BS traffic in case of asynchronous user requests while considering their time-varying characteristics and the quality of experience (QoE) of video request users (VRUs) is a pressing problem. This paper uses social stability (SS) and video loading duration (VLD)-tolerant property to group VRUs and seed users (SUs) to offload BS traffic. We define the average amount of data transmission (AADT) to measure the network's capacity for offloading BS traffic. Based on this, we formulate a time-varying bipartite graph matching optimization problem. We decouple the problem into two subproblems which can be solved separately in terms of time and space. Then, we propose the socially aware D2MD user selection (SA-D2MD-S) algorithm based on finite horizon optimal stopping theory, and propose the SA-D2MD user matching (SA-D2MD-M) algorithm to solve the two subproblems. The results of simulations show that our algorithms outperform prevalent algorithms.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.2
• /
• pp.93-100
• /
• 2008

In this paper, we address a novel simulated annealing(SA)-based test scheduling method for testing network-on-chip (NoC)-based systems-on-chip(SoCs), on the assumption that the test platform proposed in [1] is installed. The proposed method efficiently mixed the rectangle packing method with SA and improved the scheduling results by locally changing the test access mechanism(TAM) widths for cores and the testing orders. Experimental results using ITC'02 benchmark circuits show that the proposed algorithm can efficiently reduce the overall test time.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.7
• /
• pp.65-75
• /
• 1996

The probability distributio function (pdf) of transmitted symbols should be asymmectric for recovering the received data in the 3rd order blind equalizer system. In this paper, we hav edesigned the blind equalizer using symmetric-asymmetric (SA) and asymmetric-symmetric (AS) transforms for less computational complexities and robustness in the noisy environments. The method of SA and AS transform was peformed using natural logarithmic operation. This paper proves that the proposed in this paper can be performed as real time operation. This paper proves that the compression factor k has no effet on transmitted symbols. Also 3rd order equalization method proposed in this paper can be performed as real time operation. As a result of computer simulatio, the computational complexity of proposed algorithm is reduced to be an half of 4th order method and MSE is enhanced as 10dB at the case of 4-PAM and 15dB at the case of 8-PAM respectivley. Conclusively, we have found that 3rd order blind equalizer can be implemented when the pdf of transmitter is asymmetric.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.348-351
• /
• 1993

The simulated annealing(SA) algorithm is a stochastic strategy for search of the ground state and a powerful tool for optimization. based on the anneal ins process used for the crystallization in physical systems. It's main disadvantage is the long convergence time. Therefore, this paper shows that the new algorithm using SA can be applied to reduce the computation time. This idea has been used to solve the estimation problem of the nonlinear parameter.