• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.680-688
• /
• 2010

In this paper, we present a dynamic programming(DP)-based stereo matching method using image segmentation algorithm. DP has been a classical and popular optimization method for various computer vision problems including stereo matching. However, the performance of conventional DP has not been satisfactory when it is applied to the stereo matching since the vertical correlation between scanned lines has not been properly considered. In the proposed algorithm, accurate edge information is first obtained from segmented image information then we considers the discontinuity of disparity and occlusions region based on the obtained edge information. The experimental results applied to the Middlebury stereo images demonstrate that the proposed algorithm has better performances in stereo matching than the previous DP based algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.787-797
• /
• 2008

In this paper, we propose a fast disparity estimation method considering temporal and spatial redundancy based on a dynamic programming for stereo matching. For the first step, the dynamic programming is performed to estimate disparity vectors with correlation between neighboring pixels in an image. Next, we efficiently compensate regions, which disparity vectors are not allocated, with neighboring disparity vectors assuming that disparity vectors in same object are quite similar. Moreover, in case of video sequence, we can decrease a complexity with temporal redundancy between neighboring frames. For performance comparison, we generate an intermediate-view image using the estimated disparity vector. Test results show that the proposed algorithm gives $0.8{\sim}2.4dB$-increased PSNR(peak signal to noise ratio) compared to a conventional block matching algorithm, and the proposed algorithm also gives approximately 0.1dB-increased PSNR and $48{\sim}68%$-lower complexity compared to the disparity estimation method based on general dynamic programming.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1217-1230
• /
• 2010

The dynamic programming based methods, a kind of globally optimizing stereo matching methods, has the inherent advantage that the occlusion regions can be found during the process. But it also has a serious drawback of streaking phenomena. This paper focuses on reducing the streaking phenomena by adjusting the penalties in calculating the cost matrix and re-establishing the optimal path in the back-tracing process using the boundary information of the image. Especially we use a pixel expansion method in re-establishing the path, which is the results from expanding the pixel information of the ones just left the boundaries. Experiments with the four image pairs provided by the Middlebury site showed the results that the proposed method has the disparity error ratio of 6.33% and the rank is 29, which is competitive to the best method among the previously published dynamic programming based methods.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.363-366
• /
• 2009

변이영상은 두 스테레오 영상의 시차에 의해 발생하는 각 화소의 변위를 수록한 영상이다. 이 영상은 깊이영상을 생성하여 시점 간 가상영상을 생성하는데 사용된다. 따라서 변이영상은 다시점 비디오 서비스와 직접적인 연관이 있다. 본 논문에서는 유일성(uniqueness)제약과 순차성(ordering) 제약을 사용하여 기준영상과 참조영상 사이의 관계를 이용하여 생성한 변이 공간 영상(DSI : disparity space image)으로부터 비용 행렬을 계산하여 최적의 변이 경로를 찾아가는 다이내믹 프로그래밍을 분석 하였다. 다이내믹 프로그래밍은 정밀한 변이 맵을 얻을 수 있고, 다른 방식들에 비해 연산 속도가 빠르다는 장점을 가지고 있지만, 영상의 화소값의 변화가 없는 영역에서 이전의 경로를 계속 유지하려는 성질에 때문에 발생 하는 오류확산과 가려진 (occluded) 영역에 의한 오차로 인해 정확한 경로를 찾을 수 없는 경우가 빈번히 발생 하여 에러율이 높아지는 단점을 가지고 있다. 이러한 이론을 토대로 기존의 기법들에 비하여 정확도가 우수한 기법들을 제안하였다. 개선된 역 추적 과정을 이용하여 기존의 다이내믹 프로그래밍 기반의 스테레오 정합 기법들보다 우수성이 뛰어난 결과들을 나타내었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.15-18
• /
• 2005

A ribonucleic acid (RNA) is one of the two types of nucleic acids found in living organisms. An RNA molecule represents a long chain of monomers called nucleotides. The sequence of nucleotides of an RNA molecule constitutes its primary structure, and the pattern of pairing between nucleotides determines the secondary structure of an RNA. Non-coding RNA genes produce transcripts that exert their function without ever producing proteins. Predicting the secondary structure of non-coding RNAs is very important for understanding their functions. We focus on Nussinov's algorithm as useful techniques for predicting RNA secondary structures. We introduce a new traceback matrix and scoring table to improve above algorithm. And the improved prediction algorithm provides better levels of performance than the originals.

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

In wavelength-routed all-optical networks, signals are transmitted on a direct optical path, or a lightpath, in a single-hop manner without opto-electronic/electro-optic(OE/EO) conversion at intermediate nodes. However, due to the physical constraints of optical elements such as ASE noise and crosstalk signals can be degraded un a long path. To establish a connection under such impairments, the optical signal may need to be regenerated at intermediate nodes, dividing a lightpath into two or more fragments. However, since signal regeneration at intermediate nodes requires additional network resources, the selection of these nodes should be made carefully to minimize blocking of other lightpaths. In this paper, we deal with the problem of establishing a lightpath in a multihop manner under physical constraints. We provide both minimal-cost and heuristic algorithms for locating signal regeneration nodes(SRNs). For a minimal-cost algorithm, we formulate the problem using dynamic programming(DP) such that blocking of other lightpaths due to the lack of transmitters/receivers(TXs/RXs) and wavelengths is minimized throughout the network.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.383-390
• /
• 2004

This paper propose a method that controls facial expression of 3D avatar by having the user select a sequence of facial expressions in the space of facial expressions. And we setup its system. The space of expression is created from about 2400 frames consist of motion captured data of facial expressions. To represent the state of each expression, we use the distance matrix that represents the distances between pairs of feature points on the face. The set of distance matrices is used as the space of expressions. But this space is not such a space where one state can go to another state via the straight trajectory between them. We derive trajectories between two states from the captured set of expressions in an approximate manner. First, two states are regarded adjacent if the distance between their distance matrices is below a given threshold. Any two states are considered to have a trajectory between them If there is a sequence of adjacent states between them. It is assumed . that one states goes to another state via the shortest trajectory between them. The shortest trajectories are found by dynamic programming. The space of facial expressions, as the set of distance matrices, is multidimensional. Facial expression of 3D avatar Is controled in real time as the user navigates the space. To help this process, we visualized the space of expressions in 2D space by using the multidimensional scaling(MDS). To see how effective this system is, we had users control facial expressions of 3D avatar by using the system. As a result of that, users estimate that system is very useful to control facial expression of 3D avatar in real-time.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.171-184
• /
• 2010

In this work, we develop a novel channel power allocation method for the real-time multimedia over the wireless network environment. Since each frame has different effect on the user perceivable QoS, improving packet loss does not necessarily coincide with perceivable improvements in QoS. A new channel power control scheme is suggested based on the quantified importance of each frame in terms of user perceivable QoS. Dynamic programming formulation is used to obtain optimal transmit power which minimizes power consumption and maximizes user perceivable QoS simultaneously. The experiment is performed by using publicly available video clips. The performance is evaluated using network simulator version 2 (NS 2) and decoding engine is embedded at the client node, and calculated PSNR over the every frame transmitted. Through the semantics aware power allocation (SAPA) scheme, significant improvement on the QoS has been verified, which is the result of unequal protection to more important packets. SAPA scheme reduced the loss of I frame by upto 27% and reduced power consumption by upto 19% without degradation on the user perceivable QoS.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.109-111
• /
• 2006

본 논문은 애니메이터로 하여금 얼굴 표정들의 공간으로부터 일련의 표정을 선택하게 함으로써 3차원 아바타의 표정을 실시간적으로 제어할 수 있도록 하기 위한 표정공간의 생성방법에 관하여 기술한다. 본 시스템에서는 약 2400여개의 얼굴 표정 프레임을 이용하여 표정공간을 구성하였다. 본 기법에서는 한 표정을 표시하는 상태표현으로 얼굴특징 점들 간의 상호거리를 표시하는 거리행렬을 사용한다. 이 거리행렬의 집합을 표정공간으로 한다. 그러나 이 표정공간은 한 표정이 다른 표정까지 이동할 때 두 표정간의 직선경로를 통해 이동할 수 있는 그런 공간이 아니다. 본 기법에서는 한 표정에서 다른 표정까지 거쳐 갈 수 있는 경로를 캡쳐된 표정 데이터로부터 근사적으로 유추한다. 우선, 각 표정상태를 표현하는 거리행렬간의 거리가 일정 값 이하인 경우 두 표정을 인접해 있다고 간주한다. 임의의 두 표정 상태가 일련의 인접표정들의 집합으로 연결되어 있으면 두 표정간에 경로가 존재한다고 간주한다. 한 표정에서 다른 표정으로 변화할 때 두 표정간의 최단경로를 통해 이동한다고 가정한다. 두 표정간의 최단거리를 구하기 위해 다이내믹 프로그래밍 기법을 이용한다. 이 거리행렬의 집합인 표정공간은 다차원 공간이다. 3차원 아바타의 얼굴 표정 제어는 애니메이터들이 표정공간을 항해할 때 실시간적으로 수행된다. 이를 도와주기 위해 표정공간을 차원 스케일링 기법을 이용하여 2차원 공간으로 가시화하였고, 애니메이터들로 하여금 본 시스템을 사용하여 실시간 표정 제어를 수행하게 했는데, 본 논문은 그 결과를 평가한다.참여하는 빈들 간의 관계를 분석하여 워크플로우에 대한 성능 측정이 가능하도록 한다. 또한 제안된 메트릭을 통하여 EJB 어플리케이션의 성능 향상을 도모할 수 있도록 한다.로 표면 위로 자라났고, 부종은 창상 밑 조직까지 감소하였으며, 육아조직은 교원질 섬유로 대체되었다. 창상 유발 21일 후, 다른 창상에 비해, HG 처치창은 유의적으로 창상 표면이 거의 재생성 상피로 덮였으며, 육아조직은 창상 유발 14일 후와 비교해서 유의적으로 교원질 섬유로 대체되었다. 위의 모든 결과에서 보듯이, 개에서 전층피부 창상의 처치 시 HG의 사용은 HC와 생리 식염수에 비해 창상치유 복구기의 치유 속도를 촉진하는 것으로 사료된다.시범학교의 자녀를 들 부모들은 환경관련문제에 대한 의식 및 환경관련 제품에 대한 구매행동의 변화가 두드러지게 나타났다.EX>$d^{2+}$ + SA처리구는 두 화합물의 이중 효과에 의해 전반적인 생리 활성을 억제하여, 결국에는 식물의 고사를 유도하는 것으로 사료된다.목에 대한 보안'이 가장 중요한 것으로 나타났다. 본 연구에서는 솔루션 선정요인에 관한 중요도를 e-마켓플레이스의 유형과 산업 별로 평가해보았는데, 여기에서 밝혀진 중요도를 통해 e 마켓플레이스를 구축하고 자 하는 기업은 솔루션을 자체 개발하거나 구입할 때 올바른 의사결정을 할 수 있다. 그리고 솔루션을 제공하려는 기업측면에서는 e-마켓플레이스를 구축하고자 하는 기업에게 유형과 산업별로 적절한 솔루션을 제공할 수 있다.순환이 뇌대사 및 수술 후 신경학적 결과에 보다 유익한 효과를 제공해 줄 수 있음