• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.237-237
• /
• 2004

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1075-1081
• /
• 2008

In this paper, we propose a code acquisition algorithm using optical orthogonal code (OOC) for optical code division multiple access (CDMA) systems. Generally, a good code acquisition algorithm offers short mean acquisition time (MAT). The conventional multiple-shift (MS) algorithm consists of two stages and has shorter MAT than that of well-known serial-search (SS) algorithm. This paper proposes a novel code acquisition algorithm called enhanced multiple-shift (EMS) algorithm. By using multiple thresholds, the proposed EMS algorithm provides shorter MAT compared with that of the MS algorithm. The simulation results show that the EMS algorithm presents shorter MAT compared with the MS algorithm in both single-user and multi-user environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8C
• /
• pp.1175-1183
• /
• 2004

This paper propose a method to trace a moving object based on the information directly obtained from MPEG-2 compressed video stream without decoding process. In the proposed method, the motion flow is constructed from the motion vectors involved in compressed video and then we calculate the amount of pan, tilt, zoom associated with camera operations using generalized Hough transform. The local object motion can be extracted from the motion flow after the compensation with the parameters related to the global camera motion. The moving object is designated initially by a user via bounding box. After then automatic tracking is performed based on the mean-shift algorithm of the motion flows of the object. The proposed method can improve the computation speed because the information is directly obtained from the MPEG-2 compressed video, but the object boundary is limited by blocks rather than pixels.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.901-903
• /
• 2005

본 논문은 스테레오 카메라를 이용한 이동 카메라 환경에서 다수의 사람을 검출하여 검출된 사람을 추적하는 방법을 제안한다. 카메라가 이동하게 되면 카메라의 움직임과 검출 대상이 되는 사람의 움직임이 동시에 발생하기 때문에 카메라 움직임을 변환 모델을 사용하여 보정하고, 독립적인 움직임을 추출하여 사람을 검출 하였다. 추적은 검출된 사람 영역의 컬러 분포에 기반하여 평균 이동(Mean Shift) 알고리즘을 적용하였다. 평균 이동 알고리즘은 빠르고 안정적인 성능으로 실시간 추적에 적합하다. 그러나 객체의 컬러 정보만으로는 배경과 컬러 분포가 유사한 객체의 경우 추적에 실패할 수 있는 단점이 있다. 이점을 보완하기 위하여 본 논문에서는 변위 지도(Disparity map)를 결합하여 객체와 배경을 분리하는 깊이 마스크를 생성하였다. 변위 지도를 사용하여 다수의 사람이 등장 할 경우 발생하는 가려짐, 겹침 등 다양한 실내 환경에서 발생하는 문제도 해결 하였다. 본 논문에서 제안하는 알고리즘은 다양한 데이터에 대해서 실험한 결과 정확한 검출과 추적에 우수한 성능을 확인 할 수 있었다.

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.236-247
• /
• 2010

Recently, mean shift tracking algorithms have been proposed which use the information of color histogram together with some spatial information provided by the kernel. In spite of their fast speed, the algorithms are suffer from an inherent instability problem which is due to the use of an isotropic kernel for spatiality and the use of the Bhattacharyya coefficient as a similarity function. In this paper, we analyze how the kernel and the Bhattacharyya coefficient can arouse the instability problem. Based on the analysis, we propose a novel tracking scheme that uses a new representation of the location of the target which is constrained by the color, the area, and the spatiality information of the target in a more stable way than the mean shift algorithm. With this representation, the target localization in the next frame can be achieved by one step computation, which makes the tracking stable, even in difficult situations such as low-rate-frame environment, and partial occlusion.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.329-341
• /
• 2014

Kernel-based mean-shift object tracking has gained more interests nowadays, with the aid of its feasibility of reliable real-time implementation of object tracking. This algorithm calculates the best mean-shift vector based on the color histogram similarity between target model and target candidate models, where the color histograms are usually produced after uniform color-space quantization for the implementation of real-time tracker. However, when the image of target model has a reduced contrast, such uniform quantization produces the histogram model having large values only for a few histogram bins, resulting in a reduced accuracy of similarity comparison. To solve this problem, a non-uniform quantization algorithm has been proposed, but it is hard to apply to real-time tracking applications due to its high complexity. Therefore, this paper proposes a fast non-uniform color-space quantization method using the histogram equalization, providing an adjusted histogram distribution such that the bins of target model histogram have as many meaningful values as possible. Using the proposed method, the number of bins involved in similarity comparison has been increased, resulting in an enhanced accuracy of the proposed mean-shift tracker. Simulations with various test videos demonstrate the proposed algorithm provides similar or better tracking results to the previous non-uniform quantization scheme with significantly reduced computation complexity.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.9
• /
• pp.1319-1324
• /
• 2013

The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color histograms or kernel density estimates of the target and candidate image. However, it is sensitive to the noises due to objects or background having similar color distributions. In addition, occlusion by another object often causes a face region to change in size and position although a face region is a critical clue to perform face recognition or compute face orientation. We assume that depth and color are effective to separate a face from a background and a face from objects, respectively. From the assumption we devised a bilateral filter using color and depth and incorporate it into the mean-shift algorithm. We demonstrated the proposed method by some experiments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.358-359
• /
• 2018

In this paper, opencv and android studio are used to distinguish between objects ahead of the blind. When the movement is detected in a positive direction in connection with the camera of the smartphone, the user is informed that the part of the camera is being rabelified and continues to track using the mean shift algorithm. A C ++ program based on OpenCV-based was used for real-time motion observation and the application will be produced by android studio. As a result of the study, objects that move with Labeling are identified and the box area is specified using the mean shift algorithm to move the box along with the object to track objects in real time.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.239-248
• /
• 2010

Leukocyte in blood smear image provides significant information to doctors for diagnosis of patient health status. Therefore, it is necessary step to separate leukocyte from blood smear image among various blood cells for early disease prediction. In this paper, we present a saliency map and stepwise region merging based leukocyte segmentation method. Since leukocyte region has salient color and texture, we create a saliency map using these feature map. Saliency map is used for sub-image separation. Then, clustering is performed on each sub-image using mean-shift. After mean-shift is applied, stepwise region-merging is applied to particle clusters to obtain final leukocyte nucleus. The experimental results show that our system can indeed improve segmentation performance compared to previous researches with average accuracy rate of 71%.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.33-38
• /
• 2013

In this paper, we propose an algorithm to track multi-small targets in infrared image sequences in case of dissipation or creation of targets by using the background estimation filter, Kahnan filter and mean shift algorithm. We detect target candidates in a still image by subtracting an original image from an background estimation image, and we track multi-targets by using Kahnan filter and target selection. At last, we adjust specific position of targets by using mean shift algorithm In the experiments, we compare the performance of each background estimation filters, and verified that proposed algorithm exhibits better performance compared to classic methods.