• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.131-139
• /
• 2007

This paper proposed a multi-resolution algorithm. Its search point and complexity were compared with those of block match algorithm. Also the speed up comparison was made with the block match algorithm. The proposed multi-resolution NTSS-3 Level algorithm was compared again with its targets, TSS-3 Level algorithm and NTSS algorithm. The comparison results showed that the NTSS-3 Level algorithm was superior in search point and speed up. Accordingly, the proposed NTSS-3 Level algorithm was two to three times better in search point and two to four times better in complexity calculation than those of the compared object, the block match algorithm. In speed up, the proposed NTSS-3 Level algorithm was two times better. Accordingly, the proposed multi-resolution NTSS-3 Level algorithm showed PSNR ration portion excellency in search point and speed up.

• Journal of Korea Game Society
• /
• v.19 no.3
• /
• pp.25-32
• /
• 2019

This paper proposes a automatic generation method of Match-3 game levels through genetic algorithm. It takes a lot of time and effort if persons have to control the level in the game. In this paper, the genetic algorithm is applied to create an appropriate block combination. We create block combination from integer DNA. Fitness is high if success probability played by computer is closer to given probability. Experiments have shown that computer-determined levels of difficulty have a significant impact on the results of game played persons.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.1013-1020
• /
• 2000

In this paper, we propose an algorithm which segments hierarchically blocks of image using discrete cosine transform(DCT) and execute finite-state vector quantization (FSVQ) for each block. Using DCT coefficient feature, image is segmented hierarchically to large smooth block and small edge block, then the block hierarchy informations are transmitted. The codebooks are respectively constructed for each hierarchical blocks, the encoder transmits codeword index using FSVQ for reducing encoded bit with hierarchical segmentation. Compared with side match VQ(SMVQ) and hierarchical FSVQ(HFSVQ) algorithm, about Zelda and Boat image, the new algorithm shows better picture quality with 1.97dB and 2.85 dB difference as to SMVQ, 1.78dB and 1.85dB diffences as to HFSVQ respectively.

• Journal of the Society of Naval Architects of Korea
• /
• v.59 no.5
• /
• pp.314-322
• /
• 2022

During the shipbuilding process, many blocks are moved between shipyard workshops by block carrying vehicles called a transporter. Because block logistics management is one of the essential factors in enhancing productivity, it is necessary to manage block information with the transporter that moves it. Currently, because a large amount of data per day are collected from sensors attached to blocks and transporters via IoT infrastructure installed in shipyards, automated methods are needed to analyze them. Therefore, in this study, we developed an algorithm that can automatically match the transporter and the working block based on the GPS sensor data. By comparing the distance between the transporter and the blocks calculated from the Haversine formula, the block is found which is moved by the transporter. In this process, since the time of the measured data of moving objects is different, the time standard for calculating the distance must be determined. The developed algorithm was verified using actual data provided by the shipyard, and the correct result was confirmed with the distance based on the moving time of the transporter.

• Smart Media Journal
• /
• v.6 no.2
• /
• pp.9-14
• /
• 2017

A packet loss in wireless environments causes a severe degradation of video quality in video communications. In this paper, a novel video error concealment algorithm is presented by combining boundary errors and a block reliability measure. The block reliability measure decides the reliability of a block by checking residual errors of a block. In the proposed approach, a motion vector of a missing unreliable block in an inter coded frame is obtained initially based on the motion vector of the same block in the reference frame. Furthermore, if the block in the reference frame is unreliable according to the reliability measure, a new motion vector is decided based on block boundary errors around the initial motion vector. According to our simulations, the proposed approach shows promising results for error concealment in error-prone wireless environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2372-2382
• /
• 1998

In this paper, we propose a new edge based finite state vector quantization method having better performance than conventional side-match finite state vector quantization. In our proposed scheme, each dCT transformed block is classified to 17 classes according to edge types. Each class has a different codebook based on its characteristis. Encoder classified each block to motion block or stationary block and constructed a merging map by using edge and motion information, and sent to decoder. We controled amoutn of bing bits transmitted with selecting modes accoridng to bandwidth of transmitting channel. Compared with conventional algorithms, H.263 and H.261 at low bit rate, our proposed algorithm shows better picture quality and good performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.6
• /
• pp.1419-1427
• /
• 2007

In this paper, we propose an algorithm which implements a multi-sided side match finite-state vector quantization(MSMVQ). After extracting the edge information from an image and classifying the image into edge blocks or non-edge blocks, we construct an edge map. We subdivide edge blocks into sixteen classes using discrete cosine transform(DCT) AC coefficients. Based on edge map information, a state codebook is made from the master codebook, and side match calculation is done for two-sided or three-sided current block of image. For reducing transmitted bits, a decision is made whether or not to encode the non-edge blocks among the pre-coded blocks by using the master codebook. Also for reducing allocation bits of codeword indices to decoder, a variable length coder is used. Considering the comparison with side match finite-state vector quantization(SMVQ) and two-sided SMVQ(TSMVQ) algorithm about Zelda, Lenna, Bridge and Peppers image, the new algorithm shows better picture quality than SMVQ and TSMVQ respectively.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.22 no.6
• /
• pp.874-887
• /
• 1998

A 2-frame PTV (particle tracking velocimetry) system using the concept of match probability between two consequent image frames has been developed to obtain instantaneous velocity fields. The overall 2-frame PTV system including image pre-processing, tracking algorithm and post-processing routine was implemented to apply to real flows. The developed 2-frame PTV system has several advantages such as high recovery ratio of velocity vectors, low error ratio and small computational time compared with the conventional 4-frame PTV and the FFT-based cross-correlation PIV technique. The 2-frame PTV system was applied to a turbulent channel flow over a rectangular block to check its reliability and usefulness. Total 96 sequential image frames have been captured and processed to get both mean and fluctuating velocity vector fields over the recirculating region. The mean velocity and turbulent intensity profiles were well agreed with hte LDV measurements in the separated region behind the block. Time-averaged reattachment length is about 6.3 times of the block height.

• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.441-447
• /
• 2000

Automatic word spacing is needed to solve the automatic indexing problem of the non-spaced documents and the space-insertion problem of the character recognition system at the end of a line. We propose a word spacing algorithm that automatically finds out word spacing positions. It is based on the recognition of Eojeol components by using the sentence partition and bidirectional longest-match algorithm. The sentence partition utilizes an extraction of Eojeol-block where the Eojeol boundary is relatively clear, and a Korean morphological analyzer is applied bidirectionally to the recognition of Eojeol components. We tested the algorithm on two sentence groups of about 4,500 Eojeols. The space-level recall ratio was 97.3% and the Eojeol-level recall ratio was 93.2%.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.339-342
• /
• 2002

동화상 압축에서 사용되는 움직임 벡터는 영상을 일정한 크기의 블록으로 나누어 이전 영상과 가장 예측 오류가 적은 곳을 지정하여 예측한다. 블록의 이동 정도는 수직. 수평의 선형적인 움직임(translational displacements)을 가정하여 사용하기 때문에 실제 화상에서 자주 나타나는 물체의 확대 또는 축소에 의한 크기 변화. 회전. 일그러짐 등의 변화에 올바르게 예측하지 못하는 문제를 가지고 있다. 본 논문은 블록의 선형적인 이동은 물론이고 4개 노드를 자유롭게 움직임일 수 있는 왜곡된 블록 정합 방식의 움직임 예측 기법에 대하여 소개하고 왜곡 블록 정합 방식에서 나타날 수 있는 기하학적인 오류를 수정하는 보정 방법에 관해 논의한다.