• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1217-1228
• /
• 2005

Recently, since DNA computing has been widely studied for various applications, DNA sequence design which is the most basic and important step for DNA computing has been highlighted. In previous works, DNA sequence design has been formulated as a multi-objective optimization task, and solved by elitist non-dominated sorting genetic algorithm (NSGA-II). However, NSGA-II needed lots of computational time. Therefore, we use an $\varepsilon$- multiobjective evolutionarv algorithm ($\varepsilon$-MOEA) to overcome the drawbacks of NSGA-II in this paper. To compare the performance of two algorithms in detail, we apply both algorithms to the DTLZ2 benchmark function. $\varepsilon$-MOEA outperformed NSGA-II in both convergence and diversity, $70\%$ and $73\%$ respectively. Especially, $\varepsilon$-MOEA finds optimal solutions using small computational time. Based on these results, we redesign the DNA sequences generated by the previous DNA sequence design tools and the DNA sequences for the 7-travelling salesman problem (TSP). The experimental results show that $\varepsilon$-MOEA outperforms the most cases. Especially, for 7-TSP, $\varepsilon$-MOEA achieves the comparative results two tines faster while finding $22\%$ improved diversity and $92\%$ improved convergence in final solutions using the same time.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.2
• /
• pp.3-8
• /
• 2011

Recently, the demand for enterprise for service map providing and portal site services of a 3D virtual city model for public users has been expanding. Also, accuracy of the data, transfer rate and the update for the update for the lapse of time emerge are considered as more impertant factors, by providing 3D information with the web or mobile devices. With the latest technology, we have seen various 3D data through the web. With the VRML progressing actively, because it can provide a virtual display of the world and all aspects of interaction with web. It offers installation of simple plug-in without extra cost on the web. LiDAR system can obtain spatial data easily and accurately, as supprted by numerous researches and applications. However, in general, LiDAR data is obtained in the form of an irregular point cloud. So, in case of using data without converting, high processor is needed for presenting 2D forms from point data composed of 3D data and the data increase. This study expresses urban LiDAR data in 3D, 2D raster data that was applied by compressing algorithm that was used for solving the problems of large storage space and processing. For expressing 3D, algorithm that converts compressed LiDAR data into code Suited to VRML was made. Finally, urban area was expressed in 3D with expressing ground and feature separately.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2149-2156
• /
• 2011

In this paper, design of a new 3-dimensional (3-D) 16-ary signal constellation with constant envelope is presented and analyzed. Unlike the conventional 16-ary constellations, all signal points of the new constellation are uniformly located on the surface of a sphere so that they have a unique amplitude level and a symmetrical structure. When average power of the constellations is normalized, the presented 16-ary constellation has around 11.4% increased minimum Euclidean distance (MED) as compared to the conventional ones that have non-constant envelope. As a result, a digital communication system which exploits the presented constellation has 1.2dB improved symbol error rate (SER). While signal points of the conventional constant-envelope constellation are not distributed uniformly on the surface of a sphere, those of the proposed constellation has a completely symmetric distribution. In addition, the new signal constellation has much lower computational complexity for practical implementation than the conventional one. Hence, the proposed 3-D 16-ary signal constellation is appropriate for the application to a communication system which strongly requires a constant-envelope characteristic.

• Journal of Broadcast Engineering
• /
• v.15 no.4
• /
• pp.474-486
• /
• 2010

In this paper, we propose a new method for detection moving object contour using spatial and temporal edge. In general, contour pixels of the moving object are likely present around pixels with high gradient value along the time axis and the spatial axis. Therefore, we can detect the contour of the moving objects by finding pixels which have high gradient value in the time axis and spatial axis. In this paper, we introduce a new computation method, termed as temporal edge, to compute an gradient value along the time axis for any pixel on an image. The temporal edge can be computed using two input gray images at time t and t-2 using the Sobel operator. Temporal edge is utilized to detect a candidate region of the moving object contour and then the detected candidate region is used to extract spatial edge information. The final contour of the moving object is detected using the combination of these two edge information, which are temporal edge and spatial edge, and then the post processing such as a morphological operation and a background edge removing procedure are applied to remove noise regions. The complexity of the proposed method is very low because it dose not use any background scene and high complex operation, therefore it can be applied to real-time applications. Experimental results show that the proposed method outperforms the conventional contour extraction methods in term of processing effort and a ghost effect which is occurred in the case of entropy method.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.509-520
• /
• 2015

A design for the merge mode of three dimensional High Efficiency Video Coding (3D-HEVC) is proposed in this paper. The proposed design can reduce the implementation complexity by removing the duplicated modules of the HEVC. For the extension codec, the implementation complexity is as crucial as coding efficiency, meaning if possible, extension codec needs to be easily implemented through by reusing the design of the legacy codec as-is. However, the existing merging process of 3D-HEVC had been built-in integrated in the inside of the HEVC merging process. Thus the duplicated merging process of HEVC had to be fully re-implemented in the 3D-HEVC. Consequently the implementation complexity of the extension codec was very high. The proposed 3D-HEVC merge mode is divided into following two stages; the process to reuse the HEVC modules without any modification; and the reprocessing process for newly added and modified merging modules in 3D-HEVC. By applying the proposed method, the re-implemented HEVC modules, which accounted for 51.4% of 3D-HEVC merge mode confirmed through the operational analysis of algorithm, can be eliminated, while maintaining the same coding efficiency and computational complexity.

• Journal of Broadcast Engineering
• /
• v.18 no.5
• /
• pp.691-701
• /
• 2013

In this paper, an early termination algorithm for merge process is proposed to reduce the computational complexity in High Efficiency Video Coding (HEVC) encoder. In the HEVC, the same candidate modes from merge candidate list (MCL) are shared to predict a merge or merge SKIP mode. This search process is performed by the number of the obtained candidates for the both of the merge and SKIP modes. This may cause some redundant search operations. To reduce this redundant search operation, we employ the neighboring blocks which have been encoded in prior, to check on the contextual information. In this study, the spatial, temporal and depth neighboring blocks have been considered to compute a correlation information. With this correlation information, an early termination algorithm for merge process is suggested. When all modes of neighboring blocks are SKIP modes, then the merge process performs only SKIP mode. Otherwise, usual merge process of HEVC is performed Through experimental results, the proposed method achieves a time-saving factor of about 21.25% on average with small loss of BD-rate, when comparing to the original HM 10.0 encoder.

• Journal of Broadcast Engineering
• /
• v.18 no.6
• /
• pp.835-849
• /
• 2013

Joint Collaborative Team on Video Coding (JCT-VC), which have founded ISO/IEC MPEG and ITU-T VCEG, has standardized High Efficiency Video Coding (HEVC). Standardization of HEVC has started with purpose of twice or more coding performance compared to H.264/AVC. However, flexible and hierarchical coding block and recursive coding structure are problems to overcome of HEVC standard. Many fast encoding algorithms for reducing computational complexity of HEVC encoder have been proposed. However, it is hard to implement a real-time HEVC encoder only with those fast encoding algorithms. In this paper, for implementation of software-based real-time HEVC encoder, data-level parallelism using SIMD instructions and CPU/GPU multi-threading methods are proposed. And we also proposed appropriate operations and functional modules to apply the proposed methods on HM 10.0 software. Evaluation of the proposed methods implemented on HM 10.0 software showed 20-30fps for $832{\times}480$ sequences and 5-10fps for $1920{\times}1080$ sequences, respectively.

• Journal of Elementary Mathematics Education in Korea
• /
• v.14 no.3
• /
• pp.885-905
• /
• 2010

This study questions that mathematical evaluations strive to memorize fragmentary knowledge and have an objective test. To solve these problems on mathematical education We did descriptive test. Through the descriptive test, students think and express their ideas freely using mathematical terms. We want to know if that procedure is correct or not, and, if they understand what was being presented. We studied this because We want to analyze where and what kinds of faults they committed, and be able to correct an error so as to establish a correct mathematical concept. The result from this study can be summarized as the following; First, the mistakes students make when solving the descriptive tests can be divided into six things: error of question understanding, error of concept principle, error of data using, error of solving procedure, error of recording procedure, and solving procedure omissions. Second, students had difficulty with the part of the descriptive test that used logical thinking defined by mathematical terms. Third, errors pattern varied as did students' ability level. For high level students, there were a lot of cases of the solving procedure being correct, but simple calculations were not correct. There were also some mistakes due to some students' lack of concept understanding. For middle level students, they couldn't understand questions well, and they analyzed questions arbitrarily. They also have a tendency to solve questions using a wrong strategy with data that only they can understand. Low level students generally had difficulty understanding questions. Even when they understood questions, they couldn't derive the answers because they have a shortage of related knowledge as well as low enthusiasm on the subject.

• Journal of Internet Computing and Services
• /
• v.20 no.6
• /
• pp.105-117
• /
• 2019

Bitcoin, which can be classified as a cryptocurrency, has attracted attention from various industries because it is an innovative digital currency and the beginning of a Blockchain system. However, as the research on Bitcoin progressed, several security vulnerabilities and possible attacks were analyzed. Among them, the security problem caused by the transparency of the Blockchain database prevents the Blockchain system from being applied to various fields. This vulnerability is further classified as the weak anonymity of participating nodes and privacy problem due to disclosure of transaction details. In recent years, several countermeasures have been developed against these vulnerabilities. In this paper, we first describe the main features of the public and private Blockchain, and explain privacy, unlinkability and anonymity. And, three public Blockchain platforms, Dash, Zcash and Monero which are derived from Bitcoin, and Hyperledger Fabric which is a private Blockchain platform, are examined. And we analyze the operating principles of the protocols applied on each platform. In addition, we classify the applied technologies into anonymity and privacy protection in detail, analyze the advantages and disadvantages, and compare the features and relative performance of the platforms based on the computational speed of the applied cryptographic mechanisms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.22-31
• /
• 2007

The proposed algorithm in this paper is based on the wavelet decomposition and the energy computation of composed blocks so the amount of calculation and complexity is minimized by adaptively replacing the DWT coefficients and managing the resources effectively. We are now living in the world of a lot. of multimedia applications for many digital electric appliances and mobile devices. Among so many multimedia applications, the digital image compression is very important technology for digital cameras to store and transmit digital images to other sites and JPEG2000 is one of the cutting edge technology to compress still images efficiently. The digital cm technology is mainly using the digital image compression features so that those images could be efficiently saved locally and transferred to other sites without any losses. JPEG2000 standard is applicable for processing the digital images usefully to keep, send and receive through wired and/or wireless networks. The discrete wavelet transform (DWT) is one of the main differences to the previous digital image compression standard such as JPEG, performing the DWT to the entire image rather than splitting into many blocks. Several digital images m tested with this method and restored to compare to the results of conventional DWT which shows that the proposed algorithm get the better result without any significant degradation in terms of MSE & PSNR and the number of zero coefficients when the energy based adaptive DWT is applied.