• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.407-416
• /
• 2006

It is difficult for the movement detection of an object through a camera to detect exact movement because of unnecessary noises and changes of the light. It can be recognized as a background, when there is no movement after the inflow of an object. Therefore, It is necessary to fast search algorithm for tracking and extract of object that is realtime image. In this thesis, we evaluate the difference of the input vision based on initial image and replace some pixels in process of time. When there is a big difference between background image and input image, we decide it is the point of the time of the object input and then extract boundary point of it. The extracted boundary point detects precise movement of the object by creating minimum block of it and searching block that maintaining distance. The designed and embodied system shows more than 95% accuracy in the performance test.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.63-70
• /
• 2022

Although 2D Object detection has been largely improved in the past years with the advance of deep learning methods and the use of large labeled image datasets, 3D object detection from 2D imagery is a challenging problem in a variety of applications such as robotics, due to the lack of data and diversity of appearances and shapes of objects within a category. Google has just announced the launch of Objectron that has a novel data pipeline using mobile augmented reality session data. However, it also is corresponding to 2D-driven 3D object detection technique. This study explores more mature 2D object detection method, and applies its 2D projection to Objectron 3D lifting system. Most object detection methods use bounding boxes to encode and represent the object shape and location. In this work, we explore a stochastic representation of object regions using Gaussian distributions. We also present a similarity measure for the Gaussian distributions based on the Hellinger Distance, which can be viewed as a stochastic Intersection-over-Union. Our experimental results show that the proposed Gaussian representations are closer to annotated segmentation masks in available datasets. Thus, less accuracy problem that is one of several limitations of Objectron can be relaxed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.454-461
• /
• 2005

Car navigation system which is killer application fuses map management techniques into CPS techniques. Even if the existing navigation systems are designed for the shortest path, they are not able to cope efficiently with the change of the traffic flow and the bottleneck point of road. Therefore, it is necessary to find out shortest path algorithm based on time instead of distance which takes traffic information into consideration. In this paper, we propose a optimal path search algorithm based on the traffic information. More precisely. we introduce the system architecture for finding out optimal paths, and the limitations of the existing shortest path search algorithm are also analyzed. And then, we propose a new algorithm for finding out optimal path to make good use of the orientation of the collected traffic information.

• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.107-112
• /
• 2012

An active object tracking algorithm using Pan and Tilt camera based in the stepwise application of region and color information from realtime image sequences is proposed. To reduce environment noises in input sequences, Gaussian filtering is performed first. An image is divided into background and objects by using the adaptive Gaussian mixture model. Once the target object is detected, an initial search window close to an object region is set up and color information is extracted from the region. We track moving objects in realtime by using the CAMShift algorithm which enables to trace objects in active camera with the color information. The proper tracking is accomplished by controlling the amount of pan and tilt to be placed the center position of object into the middle of field of view. The experimental results show that the proposed method is more effective than the hand-operated window method.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.6
• /
• pp.15-29
• /
• 2018

This paper proposes an enhanced object tracking algorithm to compensate the lack of temporal information in existing particle swarm optimization based object trackers using the trajectory of the target object. The proposed scheme also enables the tracking and documentation of the location of an online updated set of distractions. Based on the trajectories information and the distraction set, a rule based approach with adaptive parameters is utilized for occlusion detection and determination of the target position. Compare to existing algorithms, the proposed approach provides more comprehensive use of available information and does not require manual adjustment of threshold values. Moreover, an effective weight adjustment function is proposed to alleviate the diversity loss and pre-mature convergence problem in particle swarm optimization. The proposed weight function ensures particles to search thoroughly in the frame before convergence to an optimum solution. In the existence of multiple objects with similar feature composition, this algorithm is tested to significantly reduce convergence to nearby distractions compared to the other existing swarm intelligence based object trackers.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.469-474
• /
• 2007

텍스트 애니메이션 시스템에서는 자연언어 단어로 표현된 개체들을 한정된 수의 애니메이션 모델로 나타낸다. 그러나 자연언어 단어의 수에 비해 기존의 모델DB에 있는 모델의 수가 훨씬 적은 것이 일반적이기 때문에 해당 단어에 대응되는 애니메이션 모델이 존재하지 않는 경우가 있게 된다. 이러한 경우, 해당 단어가 가지는 의미를 최대한 보존할 수 있는 대체 모델을 찾을 수 있는 방법이 필요하다. 본 논문은 애니메이션에서 캐릭터 또는 사물로 표현되어야 하는 명사에 대해, 온톨로지에서 해당 명사와 상위(hypernym), 하위(hyponym), 부분(member meronymy) 관계에 있는 다른 단어를 탐색하여 적절한 모델을 찾는 방안을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.189-191
• /
• 2000

데이터 마이닝의 방법론 중 클러스터링은 데이터베이스 객체들의 에트리뷰트 값에 근거하여 유사한 그룹으로 식별하는 기술적인 작업이다. 그러나 대부분 알고리즘들은 데이터의 차원이 증가할수록 형성된 전체 데이터 공간은 매우 방대하므로 의미있는 클러스터의 탐색이 더욱 어렵다. 따라서 효과적인 클러스터링을 위해서는 클러스터가 포함될 데이터 공간의 예측이 필요하다. 본 논문에서는 고차원 데이터에서 각 차원에 대한 점진적 프로젝션을 이용한 클러스터링 방법을 제안한다. 제안한 방법에서는 클러스터가 포함될 가능성이 있는 데이터공간의 후보영역을 결정하여, 이 영역에서 점들의 평균값을 중심으로 클러스터를 탐색한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.253-255
• /
• 2001

본 논문에서는 비디오 데이터가 지니는 움직임 객체의 움직임 경로(Moving Objects'Trajectories)를 이용한 사용자 질의에 대해 효율적인 검색을 위만 새로운 시그니쳐 기반 접근 기법을 제안한다. 제안하는 시그니쳐 기반 접근 기법은 데이터 파일을 직접 접근하기 전에 전체 시그니쳐들을 탐색하여 필터링을 수행하기 때문에, 순차 탐색에 대해 디스크 접근 횟수를 감소시켜 검색 성능을 향상시킨다. 마지막으로 성능 평가를 통해 제안하는 방법이 삽입 시간, 검색 시간, 그리고 부가 저장 공간의 검색 효율(Retrieval Efficiency) 측면에서 성능이 우수함을 보인다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.2
• /
• pp.113-121
• /
• 2011

In this paper, we proposed the method automatically to match areal feature based on similarity using spatial information. For this, we extracted candidate matching pairs intersected between two different spatial datasets, and then measured a shape similarity, which is calculated by an weight sum method of each matching criterion automatically derived from CRITIC method. In this time, matching pairs were selected when similarity is more than a threshold determined by outliers detection of adjusted boxplot from training data. After applying this method to two distinct spatial datasets: a digital topographic map and street-name address base map, we conformed that buildings were matched, that shape is similar and a large area is overlaid in visual evaluation, and F-Measure is highly 0.932 in statistical evaluation.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.255-274
• /
• 2006

Moving object boundary is very important for the accurate segmentation of moving object. We extract the moving object boundary from the moving object edge. But the object boundary shows broken boundaries so we develop a novel boundary linking algorithm to link the broken boundaries. The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundaries and searches for other terminating pixels to link in concentric circles clockwise within a search radius in the forward direction. The boundary linking algorithm guarantees the shortest distance linking. We register the background from the image sequence using the stationary background filtering. We construct two object masks, one object mask from the boundary linking and the other object mask from the initial moving object, and use these two complementary object masks to segment the moving objects. The main contribution of the proposed algorithms is the development of the novel object boundary linking algorithm for the accurate segmentation. We achieve the accurate segmentation of moving object, the segmentation of multiple moving objects, the segmentation of the object which has a hole within the object, the segmentation of thin objects, and the segmentation of moving objects in the complex background using the novel object boundary linking and the background automatically. We experiment the algorithms using standard MPEG-4 test video sequences and real video sequences of indoor and outdoor environments. The proposed algorithms are efficient and can process 70.20 QCIF frames per second and 19.7 CIF frames per second on the average on a Pentium-IV 3.4GHz personal computer for real-time object-based processing.