• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.126-134
• /
• 1998

In this paper, we consider the problem of reconstructing a two-dimensional signal from its Fourier intensity and the Fourier intensities of two windowed signals: one by a window w(m,n) and the other by its complementary window [1-w(m,n)]. We develop several conditions under which a signal can be uniquely specified to within several trivial ambiguities such as sign, translation,and time-reversal from the given conditions. We present two possible reconstruction algorithms derived from the Gerchberg-Saxton algorithm.

• Journal of Information Processing Systems
• /
• v.8 no.1
• /
• pp.145-158
• /
• 2012

Hyperelliptic Curve Cryptosystem (HECC) is well suited for all kinds of embedded processor architectures, where resources such as storage, time, or power are constrained due to short operand sizes. We can construct genus 3 HECC on 54-bit finite fields in order to achieve the same security level as 160-bit ECC or 1024-bit RSA due to the algebraic structure of Hyperelliptic Curve. This paper explores various possible attacks to the discrete logarithm in the Jacobian of a Hyperelliptic Curve (HEC) and addition and doubling of the divisor using explicit formula to speed up the scalar multiplication. Our aim is to develop a cryptosystem that can sign and authenticate documents and encrypt / decrypt messages efficiently for constrained devices in wireless networks. The performance of our proposed cryptosystem is comparable with that of ECC and the security analysis shows that it can resist the major attacks in wireless networks.

• Convergence Security Journal
• /
• v.2 no.1
• /
• pp.35-47
• /
• 2002

In this paper, we will provide an overview of the motion picture watermarking techniques. We will see previously proposed algorithms such as compressed domain watermarking, non-compressed domain watermarking and algorithms for realtime applications etc. We will see test results for signature embedding in motion picture. By spread spectrum method, we embed a signature in each frames. The quality of watermarked motion picture is measured by PSNR(peak signal to noise ratio) about several strengths of watermark. In watermark detection the sign of the correlation sum is the estimated embedded signature bits. We will see different mean PSNR with visual shape of the detected signature.

• Journal of the Korean Magnetics Society
• /
• v.5 no.5
• /
• pp.589-596
• /
• 1995

In the present paper some of the magnetic properties of the nanocrystalline Fe-based magnets produced by an appropriate annealing of their metallic glass precursors are reviewed. These properties are discussed on the grounds of their characteristics measured at the elevated temperatures. It is shown that the effective magnetostriction these magnets display, results from the competition among two contributions of the opposite sign originating from the individual magnetic phases, crystalline phase and the residual glassy matrix in which the nanocrystallites are embedded. It is also shown that at certain conditions the magnets considered expose superparamagnetic behavior and that their isothermal magnetization characteristics can successfully be used to calculate the distribution of the particle volumes. Application of the recently invented new genetic algorithm method, a powerful tool to calculate these distributions is, finally, presented.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.3
• /
• pp.123-131
• /
• 2019

In recent years, a non-contact respiration and heart rates monitoring via IR-UWB radar has been paid much attention to in various applications - patient monitoring, occupancy detection, survivor exploring in disaster area, etc. In this paper, we address a novel approach of real time heart rate estimation using IR-UWB radar. We apply sine fitting and peak detection method for estimating respiration rate and heart rate, respectively. We also deploy two techniques to mitigate the error caused by wrong estimation of respiration rate: a moving average filter and finding the frequency of the highest occurrence. Experimental results show that the algorithm can estimate heart rate in real time when respiration rate is presumed to be estimated accurately.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.352-368
• /
• 2021

Sign-in point of interest (POI) are extremely sparse in location-based social networks, hindering recommendation systems from capturing users' deep-level preferences. To solve this problem, we propose a content-aware POI recommendation algorithm based on a convolutional neural network. First, using convolutional neural networks to process comment text information, we model location POI and user latent factors. Subsequently, the objective function is constructed by fusing users' geographical information and obtaining the emotional category information. In addition, the objective function comprises matrix decomposition and maximisation of the probability objective function. Finally, we solve the objective function efficiently. The prediction rate and F1 value on the Instagram-NewYork dataset are 78.32% and 76.37%, respectively, and those on the Instagram-Chicago dataset are 85.16% and 83.29%, respectively. Comparative experiments show that the proposed method can obtain a higher precision rate than several other newer recommended methods.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.814-818
• /
• 2004

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic and timing information besides has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing For off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods which effectively extracts skeleton through conditional test mask considering running time and quality. of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Watershed image conversion uses prewitt operator for gradient image conversion, extracts local minima considering 8-neighborhood pixel. And methods by using difference of mean value is used in region merging step, Converted watershed image by means of this methods separates effectively character region and background region applying to segmentation function. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.1
• /
• pp.101-106
• /
• 2020

This paper relates with the VS-QE-MMA (Varying Stepsize-Quantized Error-MMA) based on the varying stepsize for improving the equalization performance in the QE-MMA adaptive equalization algorithm that is possible to reducing the intersymbol interference occurred at channel. The SE-MMA use the high-order statistics of transmitted signal and sign of error signal. The QE-MMA was appeared for the H/W implementation easiness substitutes the multiplication and substraction into the shift and substraction in the updating the tap coefficient based on the power-of-two operation of error signal magnitude. The QE-MMA gives degradation of equalization performance due to the such simplification of arithmetic operation. For improving this problem, the propose algorithm, namely VS-QE-MMA, applies the varying stepsize of the nonlinear transformation of error signal. It was confirmed by simulation that the VS-QE-MMA gives better performance than current QE-MMA in the same channel and signal to noise ratio. As a result of simulation, the VS-QE-MMA has more better performance in the every performance index, and it was also confirmed that the varying stepsize effect can be obtained in the greater than 10dB of signal to noise ratio.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.5
• /
• pp.1141-1151
• /
• 2018

In an APT attack, the communication stage between infected hosts and C&C(Command and Control) server is the key stage for intrusion into the attack target. Attackers can control multiple infected hosts by the C&C Server and direct intrusion and exploitation. If the C&C Server is exposed at this stage, the attack will fail. Therefore, in recent years, the Domain Generation Algorithm (DGA) has replaced DNS in C&C Server with a short time interval for making detection difficult. In particular, it is very difficult to verify and detect all the newly registered DNS more than 5 million times a day. To solve these problems, this paper proposes a model to judge DGA-DNS detection by the morphological similarity analysis of normal DNS and DGA-DNS, and to determine the sign of APT attack through it, then we verify its validity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1892-1897
• /
• 2012

In this paper, efficient CNU(Check Node Update) algorithms are analyzed for high speed LDPC decoding in DVB-S2 standard. In aspect to CNU methods, there are some kinds of CNU methods. Among of them, MP (Min Product) method is quite often used in LDPC decoding. However MP needs LUT (Look Up Table) that is critical path in LDPC decoding speed. A new SC-NMS (Self-Corrected Normalized Min-Sum) method is proposed in the paper. NMS needs only normalized scaling factor instead of LUT and compensates the overestimation of MP approximation. In addition, SC method is proposed. It gives a faster convergence toward a decoded codeword. If a message change its sign between two iterations, it is not reliable and to avoid to propagate noisy information, its module is set to 0. The performance of SC-NMS has a little degrade compare to MP by 0.1 dB, however considering computational complexity and decoding speed, SC-NMS algorithm is optimal method for CNU algorithm.