• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.407-410
• /
• 2009

본 논문에서는 개선된 mean shift를 이용한 컬러 영상 분할을 소개한다. Mean shift는 Yizong Cheng에 의해 재조명되고 Dorin Comaniciu 등에 의해 정리되어 영상 필터링(image filtering), 영상 분할(image segmentation), 물체 추적(object tracking) 등 여러 응용 분야에 널리 활용되고 있다. 커널을 이용해 밀도를 추정하고 밀도가 가장 높은 점으로 커널을 연속적으로 이동함으로써 지역적으로 주요한 위치로 데이터 값을 갱신시킨다. 그러나 영상에 포함된 모든 화소에 대해 mean shift를 수행해야하기 때문에 연산 시간이 많이 소요되는 단점이 있다. 본 논문에서는 mean shift 필터링 과정을 분석하고 참조수렴방법과 강제수렴방법을 이용해 소요 시간을 단축시켰다. 모든 점에 대해 mean shift를 수행하는 대신 특정 조건을 만족하는 픽셀은 이웃 픽셀의 수렴 값을 참조하고, mean shift 과정에 진동 또는 미미한 이동을 계속하는 픽셀은 강제 수렴을 실시하였다. 개선된 방법과 기존의 mean shift 방식을 적용하여 영상 필터링과 영상 분할에 적용한 실험에서 결과 영상에는 차이가 적고 기존의 방법에 비해 수행 시간이 24% 정도 소요됨을 확인하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.579-582
• /
• 2015

The Mean-Shift is a robustness algorithm that can be used for tracking the object using the similarity of histogram distributions of target model and target candidate. However, Mean-shift using hue information has disadvantage of tracking a wrong target when the target and background has similar hue distributions. We then propose a robust Mean-Shift tracking algorithm using new image that combined upper 4bit-planes in hue and saturation, respectively.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.01a
• /
• pp.41-44
• /
• 2022

Mean-Shift 영상 분할은 객체 검출을 위한 영상 전처리 방법으로써, 영상 처리 및 패턴 인식 분야에서 널리 사용되는 방법이다. 영상 분할은 영역 기반과 에지 기반 방식으로 나누어지며 대표적으로 FCM, Quickshift, Felzenszwalb, SLIC 알고리즘 등 이 있다. 언급한 영상 분할 방법들은 Mean-Shift 영상 분할에 비해서 빠른 속도로 실행시킬 수 있지만, 형태적 특징이 훼손되고 하나의 객체가 여러 세그멘테이션으로 분할된다는 단점을 가지고 있다. 본 논문에서는 소형 객체를 탐지하기 위한 고속화된 Mean-Shift 영상 분할과 객체의 형태적 특징을 이용하여 객체를 탐지하는 방법을 제안한다. 하드웨어 리소스가 제한된 신호처리기에 제안하는 알고리즘을 수행하기 위하여 Mean-Shift 영상 분할에서 필터링 과정을 고속화 하였고, 적외선 영상 내 영상 전처리 수행을 통해 잡음 제거 후 Mean-Shift 영상 분할 방법을 수행함으로써, 객체의 형태적 특징을 잘 살려서 영상 분할을 할 수 있도록 하였다. 또한 각 세그멘테이션의 크기, 너비, 높이, 밝기 정보와 형태적 특징점을 이용한 객체 탐지 방법을 제안한다.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.273-282
• /
• 2005

Real-time Object tracking is an important field in developing vision applications such as surveillance systems and vision based navigation. mean-shift algerian and Condensation algorithm are widely used in robust object tracking systems. Since the mean-shift algorithm is easy to implement and is effective in object tracking computation, it is widely used, especially in real-time tracking systems. One of the drawbacks is that it always converges to a local maximum which may not be a global maximum. Therefore, in a cluttered environment, the Mean-shift algorithm does not perform well. On the other hand, since it uses multiple hypotheses, the Condensation algorithm is useful in tracking in a cluttered background. Since it requires a complex object model and many hypotheses, it contains a high computational complexity. Therefore, it is not easy to apply a Condensation algorithm in real-time systems. In this paper, by combining the merits of the Condensation algorithm and the mean-shift algorithm we propose a new model which is suitable for real-time tracking. Although it uses only a few hypotheses, the proposed method use a high-likelihood hypotheses using mean-shift algorithm. As a result, we can obtain a better result than either the result produced by the Condensation algorithm or the result produced by the mean-shift algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.59-64
• /
• 2009

Edge detection always influenced by the noise of original image, therefore need some methods to eliminate them in advance, and the Mean Shift algorithm has the smooth function which suit for this purpose, so adopt it to fade out the unimportant information and the sensitive noise portions. Above all, we use the Canny algorithm to pick up the contour of the objects we focus on. And, take tests and get better result than the former sole Canny algorithm. This combination method of Mean Shift algorithm and Canny algorithm is suitable for the edge detection processing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.195-198
• /
• 2013

Recognition and Tracking of interesting object is the significant field in Computer Vision. Mean-Shift algorithm have chronic problems that some errors are occurred when histogram of tracking area is similar to another area. in this paper, we propose to solve the problem. Each algorithm blocks skin color filtering, face detect and Mean-Shift started consecutive order assists better operation of the next algorithm. Avoid to operations of the overhead of tracking area similar to a histogram distribution areas overlap only consider the number of white pixels by running the Viola-Jones algorithm, simple arithmetic increases the convergence of the Mean-Shift. The experimental results, it comes to 78% or more of white pixels in the Mean-Shift search area, only if the recognition of the face area when it is configured to perform a Viola-Jones algorithm is tracking the object, was 100 percent successful.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.936-946
• /
• 2009

A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.4
• /
• pp.11-17
• /
• 2015

As the needs of real-time visual object tracking are increasing in various kinds of application fields such as surveillance, entertainment, etc., kernel-based mean-shift tracking has received more interests. One of major issues in kernel-based mean-shift tracking is to be robust under partial or full occlusion status. This paper presents a real-time mean-shift tracking which is robust in partial occlusion by applying multi-mode local kernel weight. In the proposed method, a kernel is divided into multiple sub-kernels and each sub-kernel has a kernel weight to be determined according to the location of the sub-kernel. The experimental results show that the proposed method is more stable than the previous methods with multi-mode kernels in partial occlusion circumstance.

• Journal of Korea Multimedia Society
• /
• v.10 no.7
• /
• pp.827-837
• /
• 2007

Conventional color-based object tracking using Mean Shift algorithm does not provide appropriate result when initial color distribution disappears. In this paper we propose a tracking algorithm that updates the object color sample when the color is changing. Mean Shift analysis is first used to derive the object candidate with maximum increase in density direction from current position. The color information of object is updated iteratively. The proposed algorithm achieves accurate tracking of objects when initial color samples are changed and finally disappeared. The validity of the effective approach is illustrated by the experimental results.

• ETRI Journal
• /
• v.31 no.3
• /
• pp.282-291
• /
• 2009

An online mean-shift object tracking algorithm, which consists of a learning stage and an estimation stage, is proposed in this work. The learning stage selects the features for tracking, and the estimation stage composes a likelihood image and applies the mean shift algorithm to it to track an object. The tracking performance depends on the quality of the likelihood image. We propose two schemes to generate and integrate likelihood images: one based on the discrete AdaBoost (DAB) and the other based on the real AdaBoost (RAB). The DAB scheme uses tuned feature values, whereas RAB estimates class probabilities, to select the features and generate the likelihood images. Experiment results show that the proposed algorithm provides more accurate and reliable tracking results than the conventional mean shift tracking algorithms.