• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.63-72
• /
• 2011

Binary translation is a kind of the emulation method which converts a binary code compiled on the particular instruction set architecture to the new binary code that can be run on another one. It has been mostly used for migrating legacy systems to new architecture. In recent, binary translation is used for instrumenting programs without modifying source code, because it enables inserting additional codes dynamically, For general application, there already exists some instrumentation software using binary translation, such as dynamic binary analyzers and virtual machine monitors. On the other hand, in order to be benefited from binary translation in kernel-level, a few issues, which include system performance, memory management, privileged instructions, and synchronization, should be treated. These matters are derived from the structure of the kernel, and the difference between the kernel and user-level application. In this paper, we present a scheme to apply binary translation and dynamic instrumentation on kernel. We implement it on Linux kernel and demonstrate that kernel-level binary translation adds an insignificant overhead to performance of the system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.410-413
• /
• 2010

최근 그린 IT, 콜라우드 컴퓨팅 등이 새롭게 주목 받음에 따라 이들의 기반 기술인 가상화 기술이 더욱 활발히 연구되고 있다. 이에 따라 본 논문에서는 다양한 시스템을 손쉽게 운영할 수 있는 전가상화의 장점을 극대화하기 위해 새로운 동적 코드 변환기법에 대하여 제안한다. 이를 위해 동적 주소 변환 기법과 베이직 블록의 특성에 따라 동적 코드를 경량화하는 기법을 설계하였다. 기존의 동적 코드 변환 기법과의 성능 비교를 통해 제안한 기법의 안정성과 경량성를 확인할 수 있었다.

• Aerospace Engineering and Technology
• /
• v.8 no.2
• /
• pp.26-32
• /
• 2009

In the satellite image fusion, the most important point is to preserve both the spatial detail of panchromatic(PAN) image and the spectral information of multispectral(MS) image. Among various image fusion techniques, fusion technique using Intensity-Hue-Saturation(IHS) transform is widely used and it has advantage that computation is very simple. In this study, a fusion technique using fast IHS transform and trade-off parameter $\alpha^i$ proposed. Proposed fusion technique permits customization of the trade-off between the spectral information and spatial detail quality of the fused image through the evaluation of two quality indices: a spectral index(the spectral ERGAS) and a spatial one(the spatial ERGAS). Based on the result of experiment using IKONOS image, we confirmed the proposed fusion technique was more effective in preserving spatial detail and spectral information than existing fusion techniques using fast IHS transform.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.523-526
• /
• 2000

본 논문에서는 임의의 모양을 가지는 영상 객체(image object)에 적용 가능한 모양적응 이산변환(PSADT : Polar coordinates shape adaptive discrete transform)에 기반한 새로운 워터마킹 기법을 제안한다. 대수-극 좌표계(log-polar coordinates)와 모양적응 이산변환을 이용하여 제안된 기법은 MPEG-4의 VOP와 같은 임의의 모양을 가지는 영상 객체에 적용할 수 있을 뿐만 아니라 기존 기법에 비하여 회전과 크기 변화와 같은 기하학적인 공격에 대하여 우수한 강인성을 제공한다.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.34-37
• /
• 2003

본 논문에서는 가역변환 (reversible transform)에 기반을 둔 가역 워터마킹 기법에 관해 기술한다. 워터마크를 삽입한 후 원본 데이터에 영구적으로 남아있는 기존의 워터마킹 기법과는 달리 가역 워터마킹 기법의 경우, 컨텐츠의 인증이 이루어진 후 삽입되었던 워터마크 신호를 컨텐츠로부터 제거함으로써, 원 영상을 화소단위로 무손실 복원할 수 있는 특징이 있다. 본 논문에서는 가역 변환인 Haar 웨이블릿 변환(Haar Wavelet Transform) 이용하여 원 영상을 변환한 후 웨이블릿 계수를 이용하여 워터마크를 삽입 및 추출한다. 이러한 가역워터마킹 기법은 판사 목적의 영상 혹은 의료영상과 같은 민감한 영상신호처리가 요구되는 분야로 응용될 수 있을 것이다.

• Proceedings of the KIPE Conference
• /
• 2020.08a
• /
• pp.212-214
• /
• 2020

리튬이온 배터리를 고온의 환경에서 장시간 운용함에 따라 배터리 내부 물질의 변형 및 특성 변화가 발생하여 안전성의 문제가 발생하게 된다. 배터리의 안전성을 향상하기 위해 배터리의 고장 및 이상 상태를 진단 및 탐지하는 기법들의 연구가 진행되고 있다. 본 논문에서는 배터리의 이상 상황을 모사하기 위해 열폭주의 한 가지 방법인 고온의 환경에서 배터리의 특성 변화를 전기화학적 임피던스 분광법을 통해 분석하였으며, 등가회로 모델의 특성 인자를 활용하여 이상 상황을 탐지할 수 있는 이동 평균 추세선 기반의 이상 탐지 기법을 제안하며, 열폭주가 발생한 데이터를 통해 이상 탐지 기법을 검증한다.

• The Journal of the Korea Contents Association
• /
• v.6 no.7
• /
• pp.90-98
• /
• 2006

Digital watermarking is a technique embedding hidden information into multimedia data imperceptibly such as images and sounds. Generally an original image is transformed and coded watermark data is embedded in frequency domain watermarking models. In this paper, We propose a new color image watermarking technique using Fresnel transform. A watermark image is Fresnel - transformed and the intensity of transformed pattern is embedded into color image. In our watermarking model, an original image is converted from RGB components into YCrCb components and then the values of real number and imaginary number of a Fresnel-transformed pattern of a watermark image are embedded into Y component. The watermarking experiments were conducted to show the validity of the proposed method using PSNR value, and the results show that our method has the robustness against lossy compression like JPEG.

• Journal of KIISE
• /
• v.42 no.5
• /
• pp.652-663
• /
• 2015

Due to the popularity of location-based services, the amount of generated spatial data in daily life has been dramatically increasing. Therefore, spatial database outsourcing has become popular for data owners to reduce the spatial database management cost. The most important consideration in database outsourcing is meeting the privacy requirements and guarantying the integrity of the query result. However, most of existing database transformation techniques do not support both of the data privacy and integrity of the query result. To solve this problem, we propose a spatial data transformation scheme that utilizes the shearing transformation with rotation shifting. In addition, we described the attack models to measure the data privacy of database transformation schemes. Finally, we demonstrated through the experimental evaluations that our scheme provides high level of data protection against different kinds of attack models, compared to the existing schemes, while guaranteeing the integrity of the query result sets.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.270-285
• /
• 2005

A joint design scheme is proposed to optimize the up/down scaler and the motion vector estimation module in the transcoder system. The proposed scheme first optimizes the resolution scaler for a fixed motion vector, and then a new motion vector is estimated for the fixed scaler. These two steps are iteratively repeated until they reach a local optimum solution. In the optimization of the scaler, we derive an adaptive version of a cubic convolution interpolator to enlarge or reduce digital images by arbitrary scaling factors. The adaptation is performed at each macroblock of an image. In order to estimate the optimal motion vector, a temporary motion vector is composed from the given motion vectors. Then the motion vector is refined over a narrow search range. It is well-known that this refinement scheme provides the comparable performance compared to the full search method. Simulation results show that a jointly optimized system based on the proposed algorithms outperforms the conventional systems. We can also see that the algorithms exhibit significant improvement in the minimization of information loss compared with other techniques.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.1
• /
• pp.5-15
• /
• 2016

Power analysis attacks are techniques to analyze power signals to find out the secrets when cryptographic algorithm is performed. One of the most famous countermeasure against power analysis attacks is masking methods. Masking types are largely classified into two types which are boolean masking and arithmetic masking. For the cryptographic algorithm to be used with boolean and arithmetic masking at the same time, the converting algorithm can switch between boolean and arithmetic masking. In this paper we propose an algorithm for switching from boolean to arithmetic masking using storage size at less cost than ones. The proposed algorithm is configured to convert using the look-up table without the least significant bit(LSB), because of equal the bit of boolean and arithmetic masking. This makes it possible to design a converting algorithm compared to the previous algorithm at a lower cost without sacrificing performance. In addition, by applying the technique at the LEA it showed up to 26 percent performance improvement over existing techniques.