• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.633-644
• /
• 2004

In this paper, we notice that the original NTSS algorithm can be proposed as the NTSS-3 Level algorithm by the multi-resolution technique. The fast block matching algorithm affects the speed by the patten combination and this paper proposes the block matching algorithm in different levels by multi-resolution technique, quite different from the original NTSS Patten. The block matching algorithm requires the multi-candidate to reduce the occurrence of low-image quality by the local minima problem. The simulation result compared to FS shows search speed 16 times quicker, and the PSNR 0.11-0.12［dB］ gets improved Image quality compared to the original fast block matching algorithm NTSS, and the speed is improved up to 0.1 times for improved image by the search point portion.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.4
• /
• pp.485-492
• /
• 2009

In the mobile service environment, patterns generated by temporal synchronization are streamed with different instance values. This paper proposed a variable clustering management method, which manages multiple data streaming dynamically, to support flexible clustering. The method manages synchronization effectively and differently with conventional streaming methods in data streaming environment and manages clustering streaming after the structural presentation level and the fitness presentation level. In the structural presentation level, the stream structure is presented using level matching and accumulation matching, and clustering management is carried out by the management of dynamic segment and static segment. The performance of the proposed method is tested by using k-means method, C/S server method, CDN method, and simulation. The test results showed that the proposed method has better performance than the other methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.863-866
• /
• 2000

본 논문에서는 비디오 코딩을 위한 적응적 블록 정합 알고리즘을 제안한다. 제안 알고리즘에서는 블록내의 움직임 정도에 따라 다단계의 블록 레벨을 설정하고, 그 블록 레벨에 따른 각기 다른 다단계의 움직임 예측을 수행한다. 이는 움직임이 적은 영역에서의 불필요한 탐색과정을 제거하여 계산적 효율성을 증대하고, 움직임 정도가 큰 부분으로 갈수록 움직임 예측 과정을 심화 시켜 예측의 정확성을 증가시킨다 본 제안된 방식을 가지고 실험한 결과 한 프레임 당 적은 수의 블록으로 고정된 크기의 블록을 가진 전역 탐색 블록 정합 알고리즘보다 적은 예측 에러를 발생시켜 1dB 정도의 PSNR 개선을 가져왔고 98% 정도의 연산량 절감 효과가 있는 것으로 나타났다.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.4
• /
• pp.229-240
• /
• 2019

3D geo-spatial model have been widely used in the field of Civil Engineering, Medical, Computer Graphics, Urban Management and many other. Especially, the demand for high quality 3D spatial information such as precise road map construction has explosively increased, MMS and UAV techniques have been actively used to acquire them more easily and conveniently in surveying and geo-spatial field. However, in order to perform 3D modeling by integrating the two data set from MMS and UAV, its so needed an proper registration method is required to efficiently correct the difference between the raw data acquisition sensor, the point cloud data generation method, and the observation accuracy occurred when the two techniques are applied. In this study, we obtained UAV point colud data in Yeouido area as the study area in order to determine the automatic registration performance between MMS and UAV point cloud data using ICP(Iterative Closet Point) method. MMS observations was then performed in the study area by dividing 4 zones according to the level of overlap ratio and observation noise with based on UAV data. After we manually registered the MMS data to the UAV data, then compared the results which automatic registered using ICP method. In conclusion, the higher the overlap ratio and the lower the noise level, can bring the more accurate results in the automatic registration using ICP method.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.98-113
• /
• 2002

In this paper, we present advanced algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced multi-level successive elimination algorithms(AMSEA) are based on the Multi-level successive elimination algorithm(MSEA)[1]. The first algorithm is that when we calculate the sum of absolute difference (SAD) between the sum norms of sub-blocks in MSEA, we use the partial distortion elimination technique. By using the first algorithm, we can reduce the computations of MSEA further. In the second algorithm, we calculate SAD adaptively from large value to small value according to the absolute difference values between pixels of blocks. By using the second algorithm, the partial distortion elimination in SAD calculation can occur early. So, the computations of MSEA can be reduced. In the third algorithm, we can estimate the elimination level of MSEA. Accordingly, the computations of the MSEA related to the level lower than the estimated level can be reduced. The fourth algorithm is a very fast block matching algorithm with nearly 100% motion estimation accuracy. Experimental results show that AMSEA are very efficient algorithms for the estimation of motion vectors.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.805-807
• /
• 2004

본 논문에서는 기존 MRMC와 다중후보와 인접블록을 이용한 시공간적 방법을 사용하여 MRMCS3와 MRMCS4를 구하여 나타내었다. 실험 결과 움직임 적은 영상에서는 4 레벨인 MRMCS4가 우수하고 움직임 큰 경우에는 3 레벨인 MRMCS3가 더 좋은 성능을 나타내었다. 제안한 다중해상도 방법이 기존방법에 비해 움직임이 적은 경우 PSNR에 있어서 0.01 - 0.35(㏈)정도 개선되었고, 또한 탐색 속도에 있어서도 10%정도 성능 향상을 나타내었다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.107-115
• /
• 2014

The reduced-bit transform based bit-plane matching algorithm (BPM) can obtain the block matching result through its simple calculation and hardware design compared to the conventional block matching algorithms (BMAs), but the block matching accuracy of BPMs is somewhat low. In this paper, reduced-bit transform based sum of the absolute difference (R-SAD) is proposed to improve the block matching accuracy in comparison with the conventional BPMs and it is shown that the matching process can be obtained using the logical operations. Firstly, this method transforms the current and the reference images into their respective 2-bit images and then a truth table is obtained from the relation between input and output 2-bit images. Next, a truth table is simplified by Karnaugh map and the absolute difference is calculated by using simple logical operations. Finally, the simulation results show that the proposed R-SAD can obtain higher accuracy in block matching results compared to the conventional BPMs through the PSNR analysis in the motion compensation experiments.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.6_2
• /
• pp.587-597
• /
• 2007

This study determines matching size for digital elevation model (DEM) production according to land cover property from IKONOS Geo-level stereo image. We applied area based matching method using correlation coefficient of pixel brightness value between the two images. After matching line (where "matching line" implies straight line that is approximated to complex non-linear epipolar geometry) is established by exterior orientation parameters to minimize search area, the matching is carried out based on this line. The experiment is performed according to land cover property, which is divided off into four areas (water, urban land, forest land and agricultural land). In each of the test areas, matching size is selected using a correlation-coefficient image and parallax image. As the results, optimum matching size of the images was selected as $81{\times}81$ pixels window, $21{\times}21$ pixels window, $119{\times}119$ pixels window and $51{\times}51$ pixels window in the water area, urban land, forest land and agricultural land, respectively.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.259-266
• /
• 2003

In this paper, we propose a multi-level block matching algorithm using motion information in blocks. In the proposed algorithm, the block-level is decided by the motion degree in the block before motion searching procedure, and then adequate motion searching performs according to the block-level. This improves computational efficiency by eliminating the unnecessary searching Process in no motion or low motion regions, and brings more accurate estimation results by deepening motion searching Process in high motion regions. Simulation results show that the proposed algorithm brings the lower estimation error about 20％ MSE reduction with the fewer blocks pet frame and the operation number was reduced to 56% compared to TSSA and 98% compared to FS -BMA with constant block size.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.2
• /
• pp.50-59
• /
• 2000

Stereo vision is a technique extracting depth information from stereo images, which are two images that view an object or a scene from different locations. The most important procedure in stereo vision, which is called stereo matching, is to find the same points in stereo images. It is difficult to match stereo images in real time because stereo matching requires heavy calculation. In this Paper we design a digital VLSI to Process stereo matching in real time, which we call stereo image match processor (SIMP). For implementation of real time stereo matching, sliding memory and minimum selection tree are presented. SIMP is designed with pipeline architecture and parallel processing. SIMP takes 64 gray level 64$\times$64 stereo images and yields 8 level 64 $\times$64 disparity map by 3 bit disparity and 12 bit address outputs. SIMP can process stereo images with process speed of 240 frames/sec.