• Journal of Advanced Navigation Technology
• /
• v.13 no.3
• /
• pp.459-465
• /
• 2009

Digital watermarking is a technique to insert a visually imperceptible information into an image so that the information can be extracted for the purposes of ownership verification or authentication. And watermarking techniques can be classified as either fragile or robust. Robust watermarks are useful for copyright and ownership assertion purposes. They cannot be easily removed and should resist common image manipulation procedures such as rotation, scaling, cropping, etc. On the other hand, fragile watermarks are easily corrupted by any image processing procedure, it can detect any change to an image as well as localizing the areas that have been changed. In this paper, we propose a fragile watermarking algorithm using a special hierarchical structure for integrity verification of image and detection of manipulated location. In the proposed method, the image to be watermarked is divided into blocks in a multi-level hierarchy and calculating block digital signatures in this hierarchy. The proposed method thwarts the cut-and-paste attack and the experimental results to demonstrate the effectiveness of the proposed method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.3
• /
• pp.2192-2200
• /
• 2015

In this paper, we propose an efficient vehicle image compensation algorithm based on Histogram Equalization. The proposed a vehicle image compensation algorithm was elimination to the vehicle image shake using motion compensation and motion estimation. And, algorithm was calculated the histogram of pixel values from each sub-image by dividing the image as the constant size areas in order to image enhancement. Also, it had enhancement to the image by adjusting the gradient. The proposed algorithm was evaluate the difference between of performance and time, image by applied to the IP, and were confirmed the image enhancement with removing of vehicle camera image shake. In this paper, the proposed vehicle image enhancement algorithm was demonstrated effectiveness when compared to existing vehicle image stabilization, because the elimination of shake for the vehicle images used real-time processing without using a memory. And it was obtained the reduction effect of the computation time by the calculated through block matching, and obtained the better restoration result for naturalness of the image with the lowest noise.

• Journal of Practical Engineering Education
• /
• v.11 no.2
• /
• pp.167-174
• /
• 2019

In the case of Java programming education for non-major undergraduates, there are no examples of applying the physical computing education method. The advantage of physical computing education is that you can directly check the SW processing output result according to the input value of digital and analog sensor, so that you can quickly correct programming errors and improve learner's learning interest and satisfaction. In this paper, we use the microbits to combine physical computing education with basic Java programming education. In addition, according to the computational thinking process, we proposed an educational method for creating Java programs using microbits. Through block programming to control the microbits, we designed an algorithm and applied a training method to convert it into a Java program. In addition, the results of students' evaluations were analyzed in the course applying the education method, and the effectiveness of the education method using the microbit was analyzed.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1499-1506
• /
• 2004

In this paper an analysis of current video chatting situation and connection status is performed and a technical method to block the obscene contents is proposed. Methods to shut down socially degenerate Internet sites are well known, which are essentially directory or vocabulary based. For the video chatting sites. however, dynamic selectivity is required as the chatting groups in a sites are all different and even in a single group the contents of chatting may turn socially objectionable as time passes. The proposed method is based on the analysis of chatting contents and selectively blocks the sound and/or video data streams. To prove the effectiveness of the method the experiments are performed and the results are shown very satisfactioy.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.571-582
• /
• 2005

NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that dose not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read and write operations is a page. A NAND flash file system called YAFFS has been proposed. But YAFFS has several problems to be addressed. In this paper, the Reliable Flash File System(RFFS) for NAND flash memory is designed and evaluated. In designing a file system the following four issues must be considered in particular for the design: (i) to minimize a repairing time when the system fault occurs, (ii) to balance the number of block erase operations by offering wear leveling policy, and (iii) to reduce turnaround time of memory operations by reducing the amount of data written. We demonstrate and evaluate the performance of the proposed schemes.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.191-198
• /
• 2002

Recently, Usage of multimedia server is rapidly increased with expansion of internet that real-time displaying service for multimedia data, MPEG and etc. For these multimedia real-time applications, it is necessary to use a disk array as a storage system. For providing requested service to much more clients at the same time in a multimedia data storage server, considerable varied strategies in a several parts. But especially it is important feature to various parameters for disk array such as relation of striping block size as a system environment and characteristics of video data. In this paper, we implemented real environment of multimedia server which provides MPEG-1 files and evaluated the suitable storage system architectures by applying synthetically generated workloads in the various parameters for disk array.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.614-622
• /
• 2004

In this paper, we propose the frequency diversity scheme for performance improvement of a OFDM system without decreasing the spectral efficiency. In the proposed scheme, information bit is encoded to symbol by a simple procedure, and the encoded symbol is transmitted through the two lowest correlated sub-channels with the particular phase difference. At the receiver, a frequency diversity gain is obtained by a simple signal processing. We also suggest optimum phase difference value to minimize the performance degradation which resulted from a phase difference estimation error and bit/symbol mapping method to minimize BER. As results, at the point of performance improvement, the proposed scheme is excellent even though it requires a little increase of system complexity because of an additional encoding and decoding. In particular, we confirmed through computer simulation that on the same channel environment and bandwidth efficiency, the 27x/1Rx STBC-OFDM system adopting the proposed frequency diversity scheme outperforms the conventional 27x/1Rx STBC-OFDM system performance

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.149-154
• /
• 2014

The cross-correntropy concept can be expressed with inner products of two different probability density functions constructed by Gaussian-kernel density estimation methods. Blind algorithms based on the maximization of the cross-correntropy (MCC) and a symbol set of randomly generated N samples yield superior learning performance, but have a huge computational complexity in the update process at the aim of weight adjustment based on the MCC. In this paper, a method of reducing the computational complexity of the MCC algorithm that calculates recursively the gradient of the cross-correntropy is proposed. The proposed method has only O(N) operations per iteration while the conventional MCC algorithms that calculate its gradients by a block processing method has $O(N^2)$. In the simulation results, the proposed method shows the same learning performance while reducing its heavy calculation burden significantly.

• The KIPS Transactions:PartB
• /
• v.18B no.5
• /
• pp.265-270
• /
• 2011

In this paper, we propose a method for intensity correction using binarization-based region segmentation in 3D stereoscopic images. In the proposed method, 3D stereoscopic right image is segmented using binarizarion. Small regions in the segmented image are eliminated. For each region in right image, a corresponding region in left image is decided through region matching using correlation coefficient. When region-based matching, in order to prevent overlap between regions, we remove a portion of the area closed to the region boundary using morphological filter. The intensity correction in left and right image can be performed through histogram specification between the corresponding regions. Simulation results show the proposed method has the smallest matching error than the conventional method when we generate the right image from the left image using block based motion compensation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.1
• /
• pp.23-30
• /
• 2014

In this paper, we propose an efficient agent framework for host-based vulnerability assessment system by analyzing the operational concept of traditional vulnerability assessment framework and proposed vulnerability assessment agent framework in virtualization environment. A proposed agent framework have concept by using the features of virtualization technology, it copy and execute checking agent in targeted virtual machines. In order to embody a propose agent framework, we design function block of checking agent and describe a vulnerability checking scenario of proposed agent framework. Also we develop pilot system for vulnerability checking scenario. We improve the shortcomings of the traditional vulnerability assessment system, such as unnecessary system load of the agent, inefficiency due to duplication agent installation. Moreover, the proposed agent framework is maximizing the scalability of the system because there is no agent installation when adding a targeted system.