• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2005.11a
• /
• pp.169-172
• /
• 2005

크기조절 트랜스코딩에서 움직임 벡터 재 예측 과정은 많은 연산량을 필요로 하기 때문에, 실시간 처리를 위해서는 이 과정의 연산량을 줄이는 것이 필요하다. 본 논문에서는 여러 영상에 대해 예측 움직임 벡터를 산출하는 방법을 적응적으로 수행함으로써, 기존 방법에 비해 화질열화 없이 연산량을 줄이는 방법을 제안한다. 전체 움직임의 크기와 움직임 벡터들의 균일성(homogeneity)을 이용하여 움직임이 작을 때는 움직임 벡터 재산출 과정 없이 예측 움직임 벡터 성분을 0으로, 움직임이 크면 움직임 벡터들의 균일성의 정도에 따라 평균값 또는 중간값을 예측 움직임 벡터 성분으로 적응적으로 선택하였다. 그리고 좀 더 효율적인 움직임 벡터 수행을 위해 제안된 과정을 수평, 수직 성분에 각각 따로 적용하였다. 가중치를 부여하여 평균값을 취하는 가중평균 방법과 비효 실험한 결과, 같은 PSNR을 유지하는 조건에서 움직임 벡터 재산출 과정의 덧셈과 곱셈 연산의 수가 평균적으로 각각 96%, 42% 정도 감소하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.46-48
• /
• 2011

기존의 참조 소프트웨어인 MPEG-2, MPEG-4, H.264/AVC에서는 움직임 벡터를 찾을 때 항상 고정된 해상도를 사용하였으며 다른 참조 소프트웨어인 KTA에서는 움직임 벡터를 찾을 때 움직임벡터의 해상도를 슬라이스 단위로 성능이 가장 높은 해상도를 선택해서 사용하였다. 하지만 움직임 벡터의 해상도는 블록마다 서로 다르기 때문에 블록별로 서로 다른 해상도를 적응적으로 사용할 필요가 있다. 적응적인 움직임 벡터 해상도 부호화 방법은 이러한 점을 이용하여 블록 별로 현재 블록의 움직임 벡터가 1/4 해상도인지 1/8 해상도인지에 판단하고 그에 대한 정보를 복호기에 전송해준다. 제안하는 알고리즘은 적응적 움직임 벡터 해상도를 사용하여 부호화 할 때 1/8 해상도 움직임 벡터가 성능이 없다고 판단되는 곳에선 적응적 움직임 벡터 해상도 방식을 사용하지 않고 1/4 해상도로만 움직임 벡터를 찾는다. 이러한 경우 해상도 정보를 복호기에 전송하지 않아 부호화 효율을 높일 수 있고 또한 1/8 해상도에 대한 움직임 예측을 하지 않기 때문에 부호화기 복잡도를 낮출 수 있다. 실험결과 평균 0.2%의 성능을 얻을 수 있었으며 부호화기 복잡도는 4% 감소하였다.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.145-150
• /
• 2008

This thesis explores the problem of reconstructing a three-dimensional(3D) scene given a set of images or image sequences of the scene. It describes efficient methods for the 3D reconstruction of static and dynamic scenes from stereo images, stereo image sequences, and images captured from multiple viewpoints. Novel methods for image-based and volumetric modelling approaches to 3D reconstruction are presented, with an emphasis on the development of efficient algorithm which produce high quality and accurate reconstructions. For image-based 3D reconstruction a novel energy minimisation scheme, Iterated Dynamic Programming, is presented for the efficient computation of strong local minima of discontinuity preserving energyy functions. Coupled with a novel morphological decomposition method and subregioning schemes for the efficient computation of a narrowband matching cost volume. the minimisation framework is applied to solve problems in stereo matching, stereo-temporal reconstruction, motion estimation, 2D image registration and 3D image registration. This thesis establishes Iterated Dynamic Programming as an efficient and effective energy minimisation scheme suitable for computer vision problems which involve finding correspondences across images. For 3D reconstruction from multiple view images with arbitrary camera placement, a novel volumetric modelling technique, Embedded Voxel Colouring, is presented that efficiently embeds all reconstructions of a 3D scene into a single output in a single scan of the volumetric space under exact visibility. An adaptive thresholding framework is also introduced for the computation of the optimal set of thresholds to obtain high quality 3D reconstructions. This thesis establishes the Embedded Voxel Colouring framework as a fast, efficient and effective method for 3D reconstruction from multiple view images.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.343-346
• /
• 2003

본 논문에서는 최신 동영상 압축 표준 규격 H.264에서 화면 간 예측 부호화시 참조 화면 수가 제한되어 있을 때 부호화 효율을 최대화할 수 있는 적웅적 참조 화면 선택 기법을 제안하였다. 참조 화면 선택 시 시간적인 거리를 우선시 하는 현재 방식은 부호화 효율 측면에서 최적의 선택과는 거리가 있다. 따라서 참조 화면 선택에 있어서 실시간 온라인 상황을 가정하고 부가적인 계산을 최소화하는 것을 조건으로 했을 때 대표 화면과의 간접 비교를 통하여 현재 참조 화면들 간 상호 유사성이 가장 큰 화면을 제외하는 방법을 통해 문제를 해결하고자 하였다. 화면 간 예측 부호화 시 참조 화면 간 중복되는 요소를 최대한 줄이는 방향으로 참조 화면을 선택해 나감으로서 참조되는 샘플들을 다양화할 수 있다. 참조 화면 간 상호 유사성 판별은 대표 화면과 각 참조 화면 간 움직임 정보를 고려해 화면 간 부호화시 계산되는 8*8 블록의 R-D 비용함수 값을 사용하였다. 실험 결과 기존의 슬라이딩 윈도우 방식을 이용한 참조 화면 선택 방법에 비해 부가적인 계산이 거의 없이 부호화 효율의 개선이 있었으며 그 개선 정도는 기존의 방식에서 참조 화면을 $1{\sim}2$장 더 사용한 결과와 같았다. 이는 기존의 방법에 의해 참조 화면을 선택할 경우 나타나는 참조 화면 간 중복성을 줄였기 때문이다.

• Proceedings of the KWS Conference
• /
• 1996.10a
• /
• pp.139-141
• /
• 1996

Among various welding parameters, the welding current which is inversely proportional to the tip-to-workpiece distance in GMAW is an essential parameter to monitor the GMAW process of horizontal fillet joints. For the case of weld defect such as overlap in horizontal fillet welding, therefore, the signal processing for process monitoring or automatic seam tracking should be modified by considering the weld pool surface geometry including the corresponding weld defect. In other words, the adequate signal processing algorithm is indispensible to improve the performance of the arc sensor. However, arc sensor algorithm already developed usually focus on weld seam tracing but do not considering the weld qualities. In this paper, various experiments were carried out to investigate the tendencies of the weld defects when weaving motion is added, and the experimental method based on 2$^n$ factorial design was proposed for deriving the mathematical model between the leg length and the various welding conditions. Moreover, a signal processing method based on the artificial neural network(Adaptive Resonance Theory) was proposed far discriminating the current signal of sound weld beads from that of weld beads with overlap. Finally, the algorithm for weld seam tracking combined with the mathematical modeling and the signal processing method was carried out to track the weld line in conjunction with the improvement of the weld qualities. The reliability of the proposed algorithms were evaluated through various experiments, which showed that the proposed algorithms could be effectively used for arc welding automation.

• Journal of Biomedical Engineering Research
• /
• v.17 no.1
• /
• pp.109-120
• /
• 1996

Cardiac function is evaluated quantitatively using angiographic images via the analysis of the shape change or the heart wall boundaries. To kin with, boundary defection or ESLV(End Systolic Lert Ventricular) and EDLV(End Diastolic Left Ventricular) is essential for the quantitative analysis of cardiac function. The boundary detection methods proposed in the past were almost semi-automatic. Intervention by a knowledgeable human operator was still required Of con, manual tracing of the boundaries is currently used for subsequent analysis and diagnosis. This method would not cut excessive time, labor, and subjectivity associated with manual intervention by a human operator. EDLV images have noncontiguous and ambiguous edge signal on some boundary regions. In this paper, we propose a new method for automated detection of boundaries in noncontiguous and ambiguous EDLV images. The boundary detection scheme which based on a priori knowledge information is divided into two steps. The first step is to detect the candidate edge points of EDLV using ESLV boundaries. The second step is to correct detected boundaries of EDLV using the LV shape. We developed the algorithm of modifying EDLV boundaries defined adaptive modifier. We experimented the method proposed in this paper and compared our proposed method with the manual method in detecting boundaries of EDLV. In the areas within estimated boundaries of EDLV, the percentage of error was about 1.4%. We verified the useflilness and obtained the satisfying results througll the experiments of the proposed method.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.91-97
• /
• 2004

Difference image scheme is widely used for motion estimation in moving object tracking system. This scheme contains a binarization step which segments image into background and moving object regions, referring to threshold value. In this paper, we propose a decision algorithm of tracking the threshold value with a differential image. The key idea is analyzing the histogram of the differential image. In addition we evaluate the performance of this method in comparison with conventional scheme. As an experimental result with 60 images, it is found that threshold by the proposed algorithm is very close to optimal threshold selected manually.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.1063-1075
• /
• 2000

This paper proposes an adaptive error concealment technique for compressed video. Since redundancy is extracted out during compression process, compressed video is vulnerable to errors which occur during transmission of video over error prone networks such as wireless channels and Internet. Error concealment is a process of reconstructing video out of damaged video bit stream. We proved that scalable encoding is very useful for error concealment. Analysis of experiments shows that some part of image is better concealed by using base layer information and other part of image is better concealed by using previous frame information. We developed a technique which enables to decide which methodology is more effective, adaptively, based on motion vectors and regional spatial activity. We used H.263v2 for scalable encoding, but, our approach could be applied to all DCT based video codec.

• ETRI Journal
• /
• v.30 no.4
• /
• pp.506-515
• /
• 2008

The H.264/AVC standard has adopted new coding tools such as intra-prediction, variable block size, motion estimation with quarter-pixel-accuracy, loop filter, and so on. The adoption of these tools enables an H.264/AVC-coded bitstream to have more information than was possible with previous standards. In this paper, we propose an effective spatial error concealment method with low complexity in H.264/AVC intra-frame. From information included in an H.264/AVC-coded bitstream, we use prediction modes of intra-blocks to recover a damaged block. This is because the prediction direction in each prediction mode is highly correlated to the edge direction. We first estimate the edge direction of a damaged block using the prediction modes of the intra-blocks adjacent to a damaged block and classify the area inside the damaged block into edge and flat areas. Our method then recovers pixel values in the edge area using edge-directed interpolation, and recovers pixel values in the flat area using weighted interpolation. Simulation results show that the proposed method yields better video quality than conventional approaches.

• Journal of the Optical Society of Korea
• /
• v.20 no.6
• /
• pp.745-751
• /
• 2016

A detection algorithm, based on the combined local-global (CLG) optical-flow model and Gaussian pyramid for a moving target appearing against a dynamic background, can compensate for the inadaptability of the classic Horn-Schunck algorithm to illumination changes and reduce the number of needed calculations. Incorporating the hypothesis of gradient conservation into the traditional CLG optical-flow model and combining structure and texture decomposition enable this algorithm to minimize the impact of illumination changes on optical-flow estimates. Further, calculating optical-flow with the Gaussian pyramid by layers and computing optical-flow at other points using an optical-flow iterative with higher gray-level points together reduce the number of calculations required to improve detection efficiency. Finally, this proposed method achieves the detection of a moving target against a dynamic background, according to the background motion vector determined by the displacement and magnitude of the optical-flow. Simulation results indicate that this algorithm, in comparison to the traditional Horn-Schunck optical-flow algorithm, accurately detects a moving target undergoing illumination changes against a dynamic background and simultaneously demonstrates a significant reduction in the number of computations needed to improve detection efficiency.