• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.17 no.4
• /
• pp.238-266
• /
• 2013

The Interaction Picture (IP) method is a valuable alternative to Split-step methods for solving certain types of partial differential equations such as the nonlinear Schr$\ddot{o}$dinger equation or the Gross-Pitaevskii equation. Although very similar to the Symmetric Split-step (SS) method in its inner computational structure, the IP method results from a change of unknown and therefore do not involve approximation such as the one resulting from the use of a splitting formula. In its standard form the IP method such as the SS method is used in conjunction with the classical 4th order Runge-Kutta (RK) scheme. However it appears to be relevant to look for RK scheme of higher order so as to improve the accuracy of the IP method. In this paper we investigate 5th order Embedded Runge-Kutta schemes suited to be used in conjunction with the IP method and designed to deliver a local error estimation for adaptive step size control.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.3
• /
• pp.164-170
• /
• 2003

This paper proposes a novel method to detect Furon's asymmetric watermark by using a correlation detector that is mathematically tractable and simple. The performance of the proposed method is tested under various conditions. The experimental results matched the theoretical results well, showing that the correlation detector can indeed be used for the detection of asymmetric watermark. The proposed detector is aplied to both single and multiple bit embedded watermark. Bit error rate (BER), obtained from the experiment, was compared to the one obtained from the theory. As the embedded information increases, the BER of the Furon's asymmetric watermarking method also increases rapidly.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.155-165
• /
• 1999

Because the encrypted data is random, there is a possibility of threat that attacker reveals the secret data. On the other hand, as the image steganogrphy is to embed the secret data into cover image and to transmit the embedded image to receiver, an attacker could not know the existence of secret data even though he/she sees the embedded image, therefore the sender may reduce the threat of attack. In the image steganography, the secret data is embedded by modifying value of pixels as a form of noise. If the secret data is embedded into gray image, the degradation of image quality results from the modifications of image due to noise. Therefore many methods have been proposed to embed the secret data while dethering the gray image, but the existing method using error-diffusion has a problem that any patterns such as a diagonal lines or vertical take place due to embedding the secret data at the fixed interval. To solve this problem and to improve the existing method, we proposed the new method that embeds the secret data at changed point with respect to 1's run-length or at the position where has the minimum difference with the original dithered value. We evaluated the performance of the proposed method by computer simulation.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.3
• /
• pp.183-191
• /
• 2016

Recently, in rehabilitation treatment, the situation that requires a measure of the accuracy of the pose and movement of joints is being increased due to the habits and lifestyle of modern people and the environment. In particular, there is a need for active automated system that can determine itself for the matching rate of pose Basically, a method for measuring the matching rate of pose is used by extracting an image using the Kinect or extracting a silhouette using the imaging device. However, in the case of extracting a silhouette, it is difficult to set the comparison, and in the case of using the Kinect sensor, there is a disadvantages that high accumulated error rate according to movement. Therefore, In this paper, we propose a method to reduce the accumulated error of matching rate of pose getting the rotation angle of joint by measuring the real-time amount of change of 9-axis sensor. In particular, it can be measured same conditions that unrelated of the physical condition and unaffected by the data for the back and forth movement, because of it compares the current rotation angle of the joint. Finally, we show a comparative advantage results by compared with traditional method of extracting a silhouette and a method using a Kinect sensor.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.956-962
• /
• 2020

Recently, as the size of data used in an embedded system increases, the need for an ECC decoding operation to robustly receive a massive data is emphasized. In this paper, we propose a method to accelerate the execution of computations that derive syndrome vectors when ECC decoding is performed using Hamming code in an embedded system with a built-in GPU. The proposed acceleration method uses the matrix-vector multiplication of the decoding operation using the CSR format, one of the data structures representing sparse matrix, and is performed in parallel in the CUDA kernel of the GPU. We evaluated the proposed method using a target embedded board with a GPU, and the result shows that the execution time is reduced when ECC decoding operation accelerated based on the GPU than used only CPU.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.3
• /
• pp.117-124
• /
• 2023

In the machine vision inspection equipment, diameter measurement is important process in inspection of cylindrical object. However, machine vision inspection equipment requires complex algorithm processing such as camera distortion correction and perspective distortion correction, and the increase in processing time and cost required for precise diameter measurement. In this paper, we proposed the algorithm for diameter measurement of cylindrical object using the laser displacement sensor. In order to fit circle for given four input outer points, grid search algorithms using root-mean-square error and mean-absolute error are applied and compared. To solve the limitations of the grid search algorithm, we finally apply the singular-value-decomposition based circle fitting algorithm. In order to compare the performance of the algorithms, we generated the pseudo data of the outer points of the cylindrical object and applied each algorithm. As a result of the experiment, the grid search using root-mean-square error confirmed stable measurement results, but it was confirmed that real-time processing was difficult as the execution time was 10.8059 second. The execution time of mean-absolute error algorithm was greatly improved as 0.3639 second, but there was no weight according to the distance, so the result of algorithm is abnormal. On the other hand, the singular-value-decomposition method was not affected by the grid and could not only obtain precise detection results, but also confirmed a very good execution time of 0.6 millisecond.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.120-121
• /
• 2006

In this paper, We have designed a face recognition system based on the embedded Linux. This paper has an aim in embedded system to recognize the face more exactly. At first, the contrast of the face image is adjusted with lightening compensation method, the skin and lip color is founded based on YCbCr values from the compensated image. To take advantage of the method based on feature and appearance, these methods are applied to the eyes which has the most highly recognition rate of all the part of the human face. For eyes detecting, which is the most important component of the face recognition, we calculate the horizontal gradient of the face image and the maximum value. This part of the face is resized for fitting the eye image. The image, which is resized for fit to the eye image stored to be compared, is extracted to be the feature vectors using the continuous wavelet transform and these vectors are decided to be whether the same person or not with PNN, to miminize the error rate, the accuracy is analyzed due to the rotation or movement of the face. Also last part of this paper we represent many cases to prove the algorithm contains the feature vector extraction and accuracy of the comparison method.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.189-196
• /
• 2003

This paper describes an error resilient video data transmission method using information hiding. In order to localize transmission errors in receiver, video encoder embeds one bit for a macro block during encoding process. Embedded information is detected during decoding process in the receiver, and the transmission errors can be localized by comparing the original embedding data. The localized transmission errors can be easily corrected, thus the degradation in a reconstructed image can be alleviated. Futhermore, the embedded information can be applied to protect intellectual property rights of the video data. Experimental results for 3 QCIF sized video sequenced composed of 150 frames respectively show that, while degradation in video streams in which the information is embedded is negligible, especially in a noisy channel, the average PSNR of reconstructed images can be improved about 5 dB by using embedded information. Also, intellectual property rights information can be effectively obtained from reconstructed images.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.4
• /
• pp.209-215
• /
• 2022

This paper proposes a novel approach for training an unsupervised depth estimation algorithm. The objective of unsupervised depth estimation is to estimate pixel-wise distances from camera without external supervision. While most previous works focus on model architectures, loss functions, and masking methods for considering dynamic objects, this paper focuses on the training framework to effectively use depth cue. The main loss function of unsupervised depth estimation algorithms is known as the photometric error. In this paper, we claim that direct depth cue is more effective than the photometric error. To obtain the direct depth cue, we adopt the technique of knowledge distillation which is a teacher-student learning framework. We train a teacher network based on a previous unsupervised method, and its depth predictions are utilized as pseudo labels. The pseudo labels are employed to train a student network. In experiments, our proposed algorithm shows a comparable performance with the state-of-the-art algorithm, and we demonstrate that our teacher-student framework is effective in the problem of unsupervised depth estimation.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.143-150
• /
• 2003

Error concealment plays an important role in combating transmission errors. Methods of error concealment which produce better quality are generally of higher complexity, thus making some of the more sophisticated algorithms is not suitable for real-time applications. In this paper, we develop temporal and spatial error resilient video encoding and data hiding approach to facilitate the error concealment at the decoder. Block interleaving scheme is introduced to isolate erroneous blocks caused by packet losses for spatial area of error resilience. For temporal area of error resilience, data hiding is applied to the transmission of parity bits to protect motion vectors. To do error concealment quickly, a set of edge features extracted from a block is embedded imperceptibly using data hiding into the host media and transmitted to decoder. If some part of the media data is damaged during transmission, the embedded features are used for concealment of lost data at decoder. This method decreases a complexity of error concealment by reducing the estimation process of lost data from neighbor blocks. The proposed data hiding method of parity bits and block features is not influence much to the complexity of standard encoder. Experimental results show that proposed method conceals properly and effectively burst errors occurred on transmission channel like Internet.