• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.794-801
• /
• 2000

In this paper, the efficient new performance evaluation method for digital communication channels is suggested and verified its efficiency in terms of simulation run-tim for the digital satellite broadcasting satellite TV channel. In order to solve the difficulties of the existing Importance Sampling(IS) Technics, we adopted the discrete probability mass function(PMF) in the new method for estimating the statistical characteristics of received signals from the measured Nth order central moments. From the discrete probability mass function obtained with less number of the received signal than the one required in the IS technic, continuous cumulative probability function and its inverse function are exactly estimated by using interpolation and extrapolation technic. And the overall channel is simplified with encoding block, inner channel performance degra-dation modeing block which is modeled with the Uniform Random Number Generator (URNG) and concatenated Inverse Cummulative Pr bility Distribution function, and decoding block. With the simplified channel model, the overall performance evaluation can be done within a drastically reduced time. The simulation results applied to the nonlinear digital satellite broadcasting TV channel showed the great efficiency of the alogrithm in the sense of computer run time, and demonstrated that the existing problems of IS for the nonlinear satellite channels with coding and M-dimensional memory can be completely solved.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.597-599
• /
• 2010

In this paper, by considering the real UWA channel environments, the measured channel data is used to generate the UWA channel model and calculate the relative parameters for underwater OFDM systems. Practical least square (LS) based channel estimation with linear interpolation are adopted to obtain the channel state information (CSI) at receiver side. As multi-input multi-output (MIMO) processing techniques, Alamouti code is implemented and evaluated to perform for space time block coding (STBC) and space frequency block coding (SFBC) for UWA OFDM systems with the MIMO configuration of $2{\times}1$, at the same time, $1{\times}2$ maximum ratio combining (MRC) is performed for the purpose of comparison. The simulation results show that, with perfect channel estimation, SFBC failed to work duo to the serious frequency selectivity of UWA channel environments. When the practical channel estimation is applied, in the case of STBC, the proposed 4-column pilot pattern gives better performance about 7dB than SISO system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.22-32
• /
• 2011

In this paper, we first analyze the differences of underwater acoustic (UWA) orthogonal frequency division multiplexing (OFDM) systems and conventional terrestrial OFDM system, and give a simple introduction of the backgrounds. By considering the real UWA channel environments, the measured channel data is used to generate the UWA channel model and calculate the relative parameters for underwater OFDM systems. Practical least square (LS) based channel estimation with linear interpolation are adopted to obtain the channel state information (CSI) at receiver side. As multi-input multi-output (MIMO) processing techniques, Alamouti code is implemented and evaluated to perform for space time block coding (STBC) and space frequency block coding (SFBC) for UWA OFDM systems with the MIMO configuration of $2{\times}1$, at the same time, $1{\times}2$ maximum ratio combining (MRC) is performed for the purpose of comparison. The simulation results show that, with perfect channel estimation, SFBC failed to work duo to the serious frequency selectivity of UWA channel environments. When the practical channel estimation is applied, in the case of STBC, the proposed 4-column pilot pattern gives better performance about 7dB than SISO system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10C
• /
• pp.1036-1043
• /
• 2005

In this paper, we propose a sequential motion vector recovery algorithm for H.264 video coding standard. Motion vectors of H.264 video coding standard cover relatively smaller areas than other standard, since motion estimation of H.264 takes place in the fashion of variable block size. Therefore, the correlation of motion vectors between neighboring blocks increases as the block size of motion estimation is lowered. Under the framework of sequential recovery, we introduce a motion vector recovery using $\alpha$-trimed mean filter. Experimental results show that proposed algorithm is useful in real time video delivery .with nearly comparable or better visual quality than previous approaches such as macro block boundary matching and Lagrage interpolation.

• Journal of Biomedical Engineering Research
• /
• v.19 no.4
• /
• pp.361-367
• /
• 1998

We student tow image characteristics, the smoothness and the similarity, which give rise to local and global redundancy in image representation. The smoothness means that the gray level values within a given block vary gradually rather than abruptly. The similarity means that any patterns in an image repeat itself anywhere in the rest of the image. In this sense, we proposed a lossless medical image compression scheme which exploits both types of redundancy. The proposed method segments the image into variable size blocks and encodes them depending on characteristics of the blocks. The proposed compression schemes works better 10~40[%] than other compression scheme such as the Huffman, the arithmetic, the Lempel-Ziv, HINT(Hierachical Interpolation) and the lossless scheme of JPEG with one predictor.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.446-454
• /
• 2004

With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.93-103
• /
• 2005

In this paper, we propose a RST resistant robust logo embedding technique for multimedia copyright protection Geometric manipulations are challenging attacks in that they do not introduce the quality degradation very much but make the detection process very complex and difficult. Watermark embedding in the normalized image directly suffers from smoothing effect due to the interpolation during the image normalization. This can be avoided by estimating the transform parameters using an image normalization technique, instead of embedding in the normalized image. Conventional RST resistant schemes that use full frame transform suffer from the absence of effective perceptual masking methods. Thus, we adopt $8\times8$ block DCT and calculate masking using a spatio-frequency localization of the $8\times8$ block DCT coefficients. Simulation results show that the proposed algorithm is robust against various signal processing techniques, compression and geometrical manipulations.

• Journal of the Society of Naval Architects of Korea
• /
• v.55 no.1
• /
• pp.66-74
• /
• 2018

In order to evaluate the precision degree of the blocks on the dock, the shipyards recently started to use the point cloud approaches using the 3D scanners. However, they hesitate to use it due to the limited time, cost, and elaborative effects for the post-works. Although it is somewhat traditional instead, they have still used the electro-optical wave devices which have a characteristic of having less dense point set (usually 1 point per meter) around the contact section of two blocks. This paper tried to expand the usage of point sets. Our approach can estimate the rework time to weld between the Pre-Erected(PE) Block and Erected(ER) block as well as the precision of block construction. In detail, two algorithms were applied to increase the efficiency of estimation process. The first one is K-mean clustering algorithm which is used to separate only the related contact point set from others not related with welding sections. The second one is the Concave hull algorithm which also separates the inner point of the contact section used for the delayed outfitting and stiffeners section, and constructs the concave outline of contact section as the primary objects to estimate the rework time of welding. The main purpose of this paper is that the rework cost for welding is able to be obtained easily and precisely with the defective point set. The point set on the blocks' outline are challenging to get the approximated mathematical curves, owing to the lots of orthogonal parts and lack of number of point. To solve this problems we compared the Radial based function-Multi-Layer(RBF-ML) and Akima interpolation method. Collecting the proposed methods, the paper suggested the noble point matching method for minimizing the rework time of block-welding on the dock, differently the previous approach which had paid the attention of only the degree of accuracy.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.54-65
• /
• 1992

A huge amount of multiplications is required for 2-D filtering on the image data, making it difficult to implement a real-time quincuncial interpolator. In this paper, efficient design technique and VLSI structures for 2-D multipleierless filter are presented. In the filter design, by introducing an efficient scheme for discretizing the frequency response of the prototype filter, it is shown that a significant amount of the computational burden required in the conventional techniques, such as local search, branch and bound techniques, could be saved. In the case of 5$\times$5 filter, it is found that the design technique described in this paper could save about 80% of the computation time, compared to the conventional methods, while providing a comparable performance. For a hardware implementation, two different VLSI structures for 2-D multiplierless filter are also introduced in the paper : One is for block parallel processing and the other for scan-line parallel processing. In both structure, the AP(area-period) figure improves over Wu's structure[4].

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.7
• /
• pp.611-617
• /
• 2004

This paper presents a simple method of rotational motion estimation and correction for roll axis stabilization of an image. The scheme first computes the rotation center by taking least squares of selected local velocity vectors, and the rotational angle is found from special subset of motion vectors. Roll motion correction is then performed by the nearest neighbor interpolation technique. To show the effectiveness of our approach, the synthetic and real images are evaluated, resulting in better performance than the previous ones.