• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.32-41
• /
• 2008

The moving object tracking in vision based observation using video uses difference method between GMM(Gaussian Mixture Model) based background and present image. In the case of racking object using binary image made by threshold, the object is merged not by object information but by Cast-Shadow. This paper proposed the method that eliminates Cast-Shadow using backpropagation Neural Network. The neural network is trained by abstracting feature value form training image of object range in 10-movies and Cast-Shadow range. The method eliminating Cast-Shadow is based on the method distinguishing shadow from binary image, its Performance is better(16.2%, 38.2%, 28.1%, 22.3%, 44.4%) than existing Cast-Shadow elimination algorithm(SNP, SP, DNM1, DNM2, CNCC).

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.1
• /
• pp.11-18
• /
• 2003

본 논문에서는 회화적 렌더링에서 칼라변환을 이용한 브러쉬 스트로크의 생성에 관한 새로운 알고리즘을 제안한다. 본 논문의 브러쉬 스트로크 생성을 위한 전체적인 구성은 다음과 같다. 첫째, 두 장의 사진(한 장의 소스 이미지와 한 장의 참조 이미지)을 입력으로 하여 칼라 변환 이론을 적용하여 색상 테이블이 바뀐 새로운 이미지를 생성한다. 이 방법은 소스 이미지의 칼라 분포 형태를 창조 이미지의 칼라 분포 형태로 변환하기 위해, 선형 히스토그램 매칭이라 불리는, 간단한 통계학적 방법을 이용한다. 둘째, 가우시안 블러링과 소벨 필터를 이용하여 에지를 검출한다. 검출된 에지는 브러쉬 스트로크 렌더링 시 에지 부분에서 스트로크를 클리핑 함으로써 이미지의 윤곽선 보존을 위해 사용된다. 셋째, 브러쉬 스트로크의 방향을 결정하기 위한 방향맵을 생성한다. 방향맵은 입력 영상에 대한 영역 분할 및 병합을 토대로 만들어진다. 영역별 각 픽셀들에 대해 이미지 그래디언트에 기초한 일정한 방향을 부여함으로써 방향맵을 구성한다. 넷째, 구성된 방향맵을 참조하여 브러쉬 스트로크 생성의 기초가 되는 베지어 곡선(Bezier Curve)의 제어점(Control point)을 설정한다. 실제 회화작품에서 사용되는 브러쉬 스트로크는 일반적으로 곡선의 형태를 이루므로 곡선 표현이 가능한 베지어 곡선을 이용하여 브러쉬 스트로크를 표현하였다. 마지막으로, 생성된 브러쉬 스트로크를 에지부문에서 클리핑하고 배경색을 참조하여 블렌딩하거나 퐁 조명 모델을 이용하여 이미지에 적용하게 된다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.606-615
• /
• 1997

This paper proposes an dffcient method for test pattern generation.Current test pattern genration systems generate a test vester for fault $F_{i+l}$ independently of the computation previously done for faults F1,F2...,Fi The proposed algorithm generates a test vector for fault $F_{i+l}$ by inheriting the test vector for fault Fi. A new test vector is grnerated from inherited values by gradually changing the inhderited values .The inherited values may partially activate a fauog and propagate the fault signal,Normally,this reduses the number of decision steps and backtracks in the second search.Experimental results for well-Known benchmark circuts show that the proposed algorithm is very efficient with small backtrack kimit;in combination eith other algorithms,it is very efficient for arbitrary backtrack limits.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.710-720
• /
• 2004

As XML documents have much richer information than plain texts, we can perform very elaborated, fine-grained search which was difficult in past years. However, as the cost of finer grained element level search is very high, the processing overhead has become a new challenge. We propose an inverted index structure called PIX, which reduces the number of elements processed by partitioning elements according to their match potentiality. We choose a base level and partition elements according to whether they have possibility of having a common ancestor higher than the level. We also propose partition merging technique by which we can get same results as unpartitioned case. Our experimental results show that the index partitioning strategy can reduce processing time considerably.

• KSCI Review
• /
• v.14 no.1
• /
• pp.255-264
• /
• 2006

Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with ${\chi}^2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.297-298
• /
• 2018

증강현실 콘텐츠에서 가려짐 표현은 사실감을 위한 필수적이다. 가려짐이란 가상 물체의 일부가 실제 사물에 의해서 가려져서 표현되는 것을 의미한다. 이는 카메라의 트래킹 정보와 함께 현재 관찰하고 있는 실제 세계의 3차원 스캔 정보를 같이 획득해야 한다. 카메라 트래킹이란 현재 카메라가 세상의 어디에 위치해있는지, 어떤 자세로 바라보고 있는지에 대한 정보를 실시간으로 획득하는 기술이다. 3차원 스캐닝이란 실제 물체를 이루는 모든 점들의 3차원 위치 관계를 파악하는 과정이다. 가상물체의 3차원 위치와 자세가 실제물체의 위치/자세와의 관계를 통해서 가상물체의 그려야할 부분과 그리지 말아야할 부분을 판단할 수 있다. 본 논문에서는 트래킹과 스캐닝을 동시에 처리하여 가려짐 표현이 가능한 증강현실용 트래킹 기술을 제안한다. 카메라 트래킹이 실내외에서도 제약없이 동작하기 위해서 스테레오 카메라를 활용하였다. 트래킹은 카메라 프레임간 특징점들의 상호 관계를 파악하는 방법에 의해서 구하였다. 스테레오 카메라 이미징을 통해서 매 프레임마다 실세계의 3차원 깊이정보를 파악하게 되고, 이를 앞서구한 카메라 위치자세를 통해서 3차원 깊이 데이터를 병합하는 과정으로 스캐닝기술을 구현하였다.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.526-534
• /
• 2010

This paper describes an algorithm which merges two HDR pictures taken under different exposure time to display on the LDR devices such as LCD or CRT. The proposed method does not generate the radiance map, but directly merges using the weights computed from the input images. The weights are firstly produced on the pixel basis, and then blended with a Gaussian function. This process prevents some possible sparkle noises caused by radical change of the weights and contributes to smooth connection between 2 image informations. The chrominance informations of the images are merged on the weighted averaging scheme using the deviations of RGB average and their differences. The algorithm is characterized by the feature that it represents well the unsaturated area of 2 original images and the connection of the image information is smooth. The proposed method uses only 2 input images and automatically tunes the whole internal process according to them, thus autonomous operation is possible when it is included in HDR cameras which use double shuttering scheme or double sensor cells.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.10
• /
• pp.3658-3665
• /
• 2010

As the population of elderly people and disabled people are increased, various demands for human welfare using robot system are raised. Especially autonomous rehabilitation system using robot could reduce the human effort while maintaining the its intrinsic efficacy. This study deals with mobile gait rehabilitation system which combined with BWS (Body Weight Support) for training of elderly and handicapped people who suffer the muscle force weakness of lower extremity. BWS which is designed by kinematic analysis of body lifting characteristics and walking guide system are integrated with main control system and wheeled platform. This mobile platform is operated by UCS (User Command System) and autonomous trajectory planning algorithm. Finally, through the EMG (Electromyography) signal measuring and its analysis for subject, performance and feasibility of developed system is verified.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.205-212
• /
• 2003

In this paper, we propose a simple and efficient hardware-supported antialiasing algorithm and its rendering scheme. The proposed method can efficiently reduce the required memory bandwidth as well as memory size compared to a conventional supersampling when rendering 3D models. In addition, it can provide almost the same high quality scenes as supersampling does. In this paper, we have introduced the RUF (Recently Used Fragment) buffer that stores some or whole parts of a fragment or two more the merged results of fragments that recently used in color calculation. We have also proposed a color calculation algorithm to deteriorate the image quality as referencing the RUF buffer. Because of the efficiency presented in the proposed algorithm, the more number of sampling points increases the more memory saving ratio we can gain relative to the conventional supersampling. In our simulation, the proposed method can reduce the amount of memory size by 31% and the memory bandwidth by 11% with a moderate pixel color difference of 1.3% compared to supersampling for 8 sparse sampling points.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.2
• /
• pp.893-898
• /
• 2013

It is always a dream to recreate the experience of a particular place, the Panorama Virtual Reality has been interpreted as a kind of technology to create virtual environments and the ability to maneuver angle for and select the path of view in a dynamic scene. In this paper we examined an efficient method for Image registration and stitching of captured imaged. Two approaches are studied in this paper. First, dynamic programming is used to spot the ideal key points, match these points to merge adjacent images together, later image blending is used for smooth color transitions. In second approach, FAST and SURF detection are used to find distinct features in the images and nearest neighbor algorithm is used to match corresponding features, estimate homography with matched key points using RANSAC. The paper also covers the automatically choosing (recognizing, comparing) images to stitching method.