• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1107-1115
• /
• 1997

In this paper, we propose an error concealment method to recovre damaged block-based image coding schemes. Channel errors during transmission of image data such as bit errors or cell loss result in damaged image blocks in the reconstructed images. To recover damaged blocks is to estimate them using the correctly received or undamaged neighborhood information. In the proposed method, an overcomplete basis for a large block containing a damaged block at its center is introduced and damaged blocks are recovered by sequentially projecting the known neighborhood information onto the overcomplete basis function. Computer simulations show that the proposed algorithm outperforms the conventional method in subjectie recovery qualities as well as objective ones.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.1
• /
• pp.57-66
• /
• 2018

It is known that a single-key and a related-key attacks on AES-128 are possible for at most 7 and 8 rounds, respectively. The security of CMAC, a typical block-cipher-based MAC algorithm, has very high possibility of inheriting the security of the underlying block cipher. Since the attacks on the underlying block cipher can be applied directly to the first block of CMAC, the current security margin is not sufficient compared to what the designers of AES claimed. In this paper, we consider HMAC-DM-AES-128 as an alternative to CMAC-AES-128 and analyze its security for reduced rounds of AES-128. For 2-round AES-128, HMAC-DM-AES-128 requires the precomputation phase time complexity of $2^{97}$ AES, the online phase time complexity of $2^{98.68}$ AES and the data complexity of $2^{98}$ blocks. Our work is meaningful in the point that it is the first security analysis of MAC based on hash modes of AES.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.815-826
• /
• 2020

We propose a two-dimensional (2D) scattering-center-extraction (SCE) method using sparse recovery based on the compressive-sensing theory, even with data missing from the received radar cross-section (RCS) dataset. First, using the proposed method, we generate a 2D grid via adaptive discretization that has a considerably smaller size than a fully sampled fine grid. Subsequently, the coarse estimation of 2D scattering centers is performed using both the method of iteratively reweighted least square and a general peak-finding algorithm. Finally, the fine estimation of 2D scattering centers is performed using the orthogonal matching pursuit (OMP) procedure from an adaptively sampled Fourier dictionary. The measured RCS data, as well as simulation data using the point-scatterer model, are used to evaluate the 2D SCE accuracy of the proposed method. The results indicate that the proposed method can achieve higher SCE accuracy for an incomplete RCS dataset with missing data than that achieved by the conventional OMP, basis pursuit, smoothed L0, and existing discrete spectral estimation techniques.

• Current Optics and Photonics
• /
• v.6 no.5
• /
• pp.473-478
• /
• 2022

To overcome the capture-range problem in phase-diversity phase retrieval (PDPR), a geometrical-optics initial-estimate method is proposed to avoid a local minimum and to improve the accuracy of laser-wavefront measurement. We calculate the low-order aberrations through the geometrical-optics model, which is based on the two spot images in the propagation path of the laser, and provide it as a starting guess for the PDPR algorithm. Simulations show that this improves the accuracy of wavefront recovery by 62.17% compared to other initial values, and the iteration time with our method is reduced by 28.96%. That is, this approach can solve the capture-range problem.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.82-83
• /
• 2022

Ad-hoc On-demand Distance Vector (AODV), is one of well-designed routing protocols in mobile ad hoc networks. It supports the functionality of node mobility modules through multiple control messages to create and maintain paths for data transfer. Even though a number of studies have been conducted to achieve rapid discovery of paths across the network, but few have focused on impact of control messages. This paper proposes a method to adjust the transmission time of messages used in path recovery according to their individual characteristics. Simulation results show the improved performance of the proposed algorithm rather than traditional AODV routing protocol.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.240-242
• /
• 2022

양자 컴퓨터의 발전과 양자 알고리즘의 등장이 암호 시스템의 위협을 야기함에 따라 양자 알고리즘을 활용하여 기존 암호의 공격 비용을 추정하는 연구가 꾸준히 증가하고 있다. 대칭키 암호에 자주 사용되던 Grover 암고리즘이 가진 단순 양자 완전 탐색의 한계를 보완하기 위하여 최근 Simon 기반의 알고리즘 관련 연구가 등장하였다. 본 논문에서는 두 가지 Simon 기반 알고리즘과 해당 알고리즘을 적용하여 단순한 구조의 암호 키를 복구한 사례에 대해 살펴본다.

• Journal of Platform Technology
• /
• v.11 no.6
• /
• pp.3-12
• /
• 2023

In today's system operation, it is difficult to detect failures and take immediate action in the case of a shortage of manpower compared to the number of equipment or failures in vulnerable time zones, which can lead to delays in failure recovery. In addition, various algorithms exist to detect abnormal symptom data, and it is important to select an appropriate algorithm for each problem. In this paper, an ensemble-based isolation forest model was used to efficiently detect multivariate point anomalies that deviated from the mean distribution in the data set generated to predict system failure and minimize service interruption. And since significant changes in memory space usage are observed together with changes in CPU usage, the problem is solved by using LSTM-Auto Encoder for a collective anomaly in which another feature exhibits an abnormal pattern according to a change in one by comparing two or more features. did In addition, evaluation indicators are set for the performance evaluation of the model presented in this study, and then AI model evaluation is performed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.840-848
• /
• 2007

A multiple description coding (MDC) scheme for 3-D Data is presented. First, a plane-based 3-D data is split into two descriptions, each of which has identical contribution in 3-D surface reconstruction. In order to maximize the visual quality of reconstructed 3-D data, then, plane parameters are modified according to channel error condition. Finally, these descriptions are compressed and transmitted over distinct channels. In decoder, if two descriptions are available, we reconstruct a high quality 3-D data. If only one description is transmitted, however, 3-D surface recovery scheme reduces artifacts on erroneous 3-D surface, yielding a smooth 3-D surface. Therefore, the proposed algorithm guarantees acceptable quality reconstruction of 3-D data even though one channel is totally lost.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.345-354
• /
• 2003

IP Multicast is required of more little network resources than one in unicast. Furthermore, reliable multicast has been researched for supporting reliability at IP Multicast mechanism. Although these studies are carried out, they only have focused on general data. In other words, in case that realtime packet, they can not support reliability since they do not consider realtime properties such as dependency of interframe and playback in time. Besides, we also request to support scalability because we are based on Mobile IP network together with internet. Thus, we need a mechanism to guarantee reliability and scalability of realtime stream data. In this paper, we propose PER (Preceding Error Recovery) that reflect characteristics of the realtime data, especially for H.323. PER provides scalable reliability because it is based on tree-based multicast basically and helps to support scalable relibility as reducing control packet and recovers stream buffer space from underflow status as soon as possible. PER shows much better scalable and reliable than existing works.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.21 no.5
• /
• pp.396-403
• /
• 2016

Usually, large-sized buses and trucks have a very high load. In addition, frequent braking during downhill or long-distance driving, causes the conventional method using the brake friction to have a problem in safety because of brake fade and brake burst phenomenon. Auxiliary brakes dividing the braking load is essential. Hence, environment-friendly auxiliary brakes, such as contactless brake rather than the engine auxiliary brake system are needed. A study aimed at improving the energy efficiency by recharging electric energy with changing mechanical to electrical energy that occurs when braking is actively in progress. In this paper, the voltage control method is utilized to recover the electric energy generated in the electromagnetic retarder instead of the eddy current. To regenerate the braking energy into the electrical energy, the resonant L-C circuit is configured in the retarder. The voltage generated in the retarder is simply modeled as a transformer. However, retarder voltage control in this paper is simulated by modeling the induction generator because this induction generator modeling is more practical than transformer modeling. The changes in the voltage of the resonance circuit, which depends on the switch pulse duration of the control device, were analyzed. A PI controller algorithm to control this voltage is proposed. The feasibility of modeling retarder and voltage controller are shown by using MATLAB Simulink in this paper.