• Journal of radiological science and technology
• /
• v.40 no.1
• /
• pp.57-62
• /
• 2017

The purpose of this study is to reconstruct the treatment plan by applying CBCT and DIR to dose changes according to the change of the patient's motion and breast shape in the large breast cancer patients and to compare the doses using TWF, FIF and IMRT. CT and CBCT were performed with MIM6 to create DIRCT and each treatment plan was made. The patient underwent computed tomography simulation in both prone and supine position. The homogeneity index (HI), conformity index (CI), coverage index (CVI) to the left breast as planning target volume (PTV) were determined and the doses to the lung, heart, and right breast as organ at risk (OAR) were compared by using dose-volume histogram and the unique property of each organ. The value of HI of the PTV breast increased in all treatment planning methods using DIRCT, and CVI and CI were decreased in the treatment planning methods using DIRCT.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1703-1708
• /
• 2005

This paper proposes a modified block matching algorithm which reduces an amount of matching computation by using only pixels contributing greatly to block matching. In consideration of algorithm implementation and additional informatirm, the proposed algorithm divides a matching block into sub-blocks, selects some sub-blocks using their complexities, and execute the block mating with them. Simulation results show that the proposed algorithm performs a valid block matching, diminishing computation cost.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.243-244
• /
• 2007

다양한 디지털 컨텐츠를 검색하기 위해 다양한 디스크립터(Descriptor)가 제안되어 왔다. 그 중 특징점을 기반으로 하는 디스크립터를 이용하여 원본 영상과 기하학적 변형을 포함하는 다양한 변형 영상을 서로 정확하게 정합시키기 위해서는 각 영상에서 동일한 위치에 동일한 개수의 특징점이 추출되는 것이 유리하다. 본 논문에서는 널리 사용되고 있는 해리스(Harris) 특징점 추출 방법을 기반으로 국부 최대값과 정렬을 이용하여 원하는 개수의 특징점을 선택하는 방법을 제안한다.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.927-933
• /
• 2013

Face detection algorithm of OpenCV recognizes the faces by Haar matching between input image and Haar features which are learned through a set of training images consisting of many front faces. Therefore the face detection method by Haar matching yields a high face detection rate for the front faces but not in the case of the pan and deformed faces. On the assumption that distributional characteristics of color histogram is similar even if deformed or side faces, a face detection method using the histogram pattern matching is proposed in this paper. In the case of the missed detection and false detection caused by Haar matching, the proposed face detection algorithm applies the histogram pattern matching with the correct detected face area of the previous frame so that the face region with the most similar histogram distribution is determined. The experiment for evaluating the face detection performance reveals that the face detection rate was enhanced about 8% than the conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.767-778
• /
• 1992

Is discussed. A method to extract feature points and to synthesize human facial images In 3-Dmodel-based ceding system, faciai feature points are extracted automatically using some image processing techniques and the known knowledge for human face. A wire frame model matched to human face Is transformed according to the motion of point using the extracted feature points. The synthesized Image Is produced by mapping the texture of initial front view Image onto the trarnsformed wire frame. Experinent results show that the synthesitzed image appears with little unnaturalness.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.121-124
• /
• 2006

본 논문에서는 영상 압축에 있어서 사용되는 새로운 고속 움직임 추정 기법에 대해 소개한다. 전역 탐색 블록 정합 알고리즘(FSBMA)은 최상의 PSNR을 갖는 화질로 움직임 벡터를 추정할 수 있지만 높은 계산량으로 인하여 실시간 구현에 부적합하다는 단점을 가지고 있다. 그러므로 계산량을 낮추면서 유사한 화질을 유지할 수 있는 많은 고속 탐색 기법들이 제안되어 왔다. 본 논문에서는 기존의 잘 알려진 고속 블록 정합 알고리즘을 수정 보완한 새로운 알고리즘을 제안한다. 제안한 방법에서는 움직임 추정에서의 고속 블록 정합 알고리즘에 있어 변형된 다이아몬드(Diamond) 탐색 기법을 이용하여 영상이 갖는 서로 다른 움직임 패턴에 대해 움직임의 방향성에 따라 적응적으로 탐색 방향과 패턴을 달리하면서 움직임을 예측하여 다이아몬드(Diamond)탐색 알고리즘과 유사한 화질을 유지하면서 보다 적은 계산량을 가지고 움직임 벡터를 추정학 수 있다. 또한 이를 PMVFAST(Predictive Motion Vector Field Adaptive Search Technique)와 결합함으로서 보다 좋은 화질을 가질 수 있다.

• Journal of Broadcast Engineering
• /
• v.24 no.3
• /
• pp.440-451
• /
• 2019

We propose a system that allows three dimensional manipulation of face in video. The 3D face manipulation of the proposed system overlays the 3D face model with the user 's manipulation on the face region of the video frame, and it allows 3D manipulation of the video in real time unlike existing applications or methods. To achieve this feature, first, the 3D morphable face model is registered with the image. At the same time, user's manipulation is applied to the registered model. Finally, the frame image mapped to the model as texture, and the texture-mapped and deformed model is rendered. Since this process requires lots of operations, parallel processing is adopted for real-time processing; the system is divided into modules according to functionalities, and each module runs in parallel on each thread. Experimental results show that specific parts of the face in video can be manipulated in real time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.493-495
• /
• 2002

다시점 영상 부호화와 함께, 가상물체를 지능형으로 합성하기 위해서는 정합할 위치를 강인하게 추적(tracking)하여야 한다. 기존의 특징추적기법은 시점이 확장된 시스템에서, 광원의 영향과 가려진 영역의 발생으로 인하여, 추적 할 수 없게 되거나 시각적 혼동이 발생하는 등의 많은 문제점을 유발한다. 뿐만 아니라 다시점에 의한 정보의 급격한 증가는 시점간 움직임을 추적하여 정합하는 연산량의 추가적 발생을 초래한다. 이에 본 논문은 광원이나 가려진 영역(occtusion)의 영향이 적은 형상과 정보량이 많은 텍스쳐를 동시에 고려하여 영역의 변형에 따라 발생하는 최적 움직임을 예측하는 파라미터 모델을 결정함으로써 사각영역을 추적한다. 이 때 미리 연산된 카메라 파라미터와 투영관계를 사용해 시점간에 가상 객체를 지속적으로 3차원 정합한다. 결과적으로, 제안된 알고리즘은 기존의 특징추적 알고리즘에 비해 광원의 영향과 가려진 영역에 강인하며 정합의 오류가 적고 추적 할 때 시점간의 대응을 위한 연산을 줄이기 때문에 실감 혼합현실 시스템의 구현에 매우 효율적임을 실험을 통해 증명하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.136-144
• /
• 2010

Two types of informations are used for content-based video copy detection: spatial information and temporal information. The spatial information means content-based image fingerprint. This image fingerprint must have following characteristic. First, Extraction is simple. Second, pairwise independence for random selected two images. At last, Robust for modifications. This paper proposed image fingerprint method for contents based video copy detection. Proposed method's extraction speed is fast because this method's using block average, first order differentiation and second order differentiation that can be calculated add and minus operation. And it has pairwise independence and robust against modifications. Also, proposed method feature makes binary by comparisons and using coarse to fine structure, so it's matching speed is fast. Proposed method is verified by modified image that modified by VCE7's experimental conditions in MPEG7.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.538-547
• /
• 2001

Currently, 2D real-time image coding techniques had great developments and many related products were commercially developed. However, these techniques lack the capability of handling 3D actuality, occurred by the advent of virtual reality, because they handle only the temporal transmission for 2D image. Besides, many 3D virtual reality researches have been studied in computer graphics. Since the graphical researches were limited to the application of artificial models, the 3D actuality for real scene images could not be managed also. Therefore, a new 3D model extraction method based on stereo vision, that can deal with real scene virtual reality, is proposed in this paper. The proposed method adapted a compact genetic algorithm using population-based incremental learning (PBIL) to matching environments, in order to reduce memory consumption and computational time of conventional genetic algorithms. Since the PBIL used a probability vector and competitive learning, the matching algorithm became simple and the computation load was considerably reduced. Moreover, the matching quality was superior than conventional methods. Even if the characteristics of images are changed, stable outputs were obtained without the modification of the matching algorithm.