Touched Human Object Segmentation Based on Mean Shift Algorithm

In this paper, a Mean Shift algorithm based on Least Square prediction is proposed. Based on the continuity of target's trace, the Least Square Mean Shift (LSMS) algorithm uses the result of Least Square prediction as the initial search center of Mean Shift algorithm. Then, Mean Shift is applied to get the final target position. The computational complexity is reduced by limiting the number of iterations of Mean shift. Experimental results show that, compared with traditional Mean Shift algorithm, the proposed algorithm improves the real-time realization. Meanwhile, it has better performance on fast moving targets and non-linear moving targets.

A sufficient condition for the convergence of the mean shift algorithm with Gaussian kernel

Nowadays object tracking is a challenge in the fields of computer vision, many algorithms are put forward to overcome the issues such as noisy, colored background, and occlusion of object and also illusion which is low and sudden changes in real-time videos, trackers cannot perform well in real-time environment. An efficient algorithm is needed for effective tracing of an object because of variation in position under various conditions. Here, the MS algorithm is used due to its efficiency and performance. MS tracking algorithm is used to obtain the position of an object by using a Kalman filter, therefore, the performance of tracking an object for different videos is evaluated but it does not improve the target localization. The advanced version is developed for tracking and representing the object in different video sequences are MS and CBWH MS using Kalman filter. Therefore, the proposed method is better than the traditional MS track, which results in the constant tracking of an object throughout the video. It does not get influenced by occlusions and less subjected to background cluttering.

In the era of big data, text as an information reserve database is very important, in all walks of life. From humanities research to government decision-making, from precision medicine to quantitative finance, from customer management to marketing, massive text, as one of the most important information carriers, plays an important role everywhere. The text data generated in these practical problems of humanities research, financial industry, marketing, and other fields often has obvious domain characteristics, often containing the professional vocabulary and unique language patterns in these fields and often accompanied by a variety of “noise.” Dealing with such texts is a great challenge for the current technical conditions, especially for Chinese texts. A clustering algorithm provides a better solution for text big data information processing. Clustering algorithm is the main body of cluster analysis, K-means algorithm with its implementation principle is simple, low time complexity is widely used in the field of cluster analysis, but its K value needs to be preset, initial clustering center random selection into local optimal solution, other clustering algorithm, such as mean drift clustering, K-means clustering in mining text big data. In view of the problems of the above algorithm, this paper first extracts and analyzes the text big data and then does experiments with the clustering algorithm. Experimental conclusion: by analyzing large-scale text data limited to large-scale and simple data set, the traditional K-means algorithm has low efficiency and reduced accuracy, and the K-means algorithm is susceptible to the influence of initial center and abnormal data. According to the above problems, the K-means cluster analysis algorithm for data sets with large data volumes is analyzed and improved to improve its execution efficiency and accuracy on data sets with large data volume set. Mean shift clustering can be regarded as making many random centers move towards the direction of maximum density gradually, that is, moving their mean centroid continuously according to the probability density of data and finally obtaining multiple maximum density centers. It can also be said that mean shift clustering is a kernel density estimation algorithm.

In order to solve the problems of motion blur and fast motion, a new robust object tracking algorithm using the Kernelized Correlation Filters (KCF) and the Mean Shift (MS) algorithm, called KCFMS is presented in this paper. The object tracking process can be described as: First, we give the initial position and size of the object and use the Mean Shift algorithm to obtain the position of the object. Second, the Kernelized Correlation Filtering algorithm is used to obtain the position of the object in the same frame. Third, we use the cross update strategy to update the object models. In order to improve the tracking speed as much as possible, our object tracking algorithm works only over one layer. This hybrid algorithm has a good tracking effect on the target fast motion and motion blur. We present extensive experimental results on a number of challenging sequences in terms of efficiency, accuracy and robustness.

An improved mean shift segmentation method featuring adaptive parameter selection is presented in this paper. We associate the bandwidths and weight for each point in a spatial-range feature space with boundary information in an image plane. Varying weight and bandwidth for each pixel are assigned according to a boundary map, which is obtained by learning multiple edge cues. We consider two groups of edge cues and two regressing modules, approach the cue combination as a supervised learning problem from the ground truth data (manually sketched boundary maps). From our preliminary results, the provided method can combine the top-down information got from regression models with the mean shift process and constrain over-clustering of pixels belonging different land objects.

A mean shift algorithm has gained special attention in recent years due to its simplicity to enable real-time tracking. However, the traditional mean shift tracking algorithm can fail to track target under occlusions. In this paper we propose a novel technique which alleviates the limitation of mean shift tracking. Our algorithm employs the Kalman filter to estimate the target dynamics information. Moreover, the proposed algorithm performs the background check process to calculate the similarity which expresses how similar to target the background is. We then find the exact target position combining the motion estimation by Kalman filter and the color based estimation by the mean shift algorithm based on the similarity value. Therefore, the proposed algorithm can robustly track targets under several types of occlusion, while the mean shift and mean shift-Kalman filter algorithms fail.

A new segmentation method based on mean shift and fuzzy integral algorithm is proposed to overcome the problems of hyperspectral image processing.A hyperspectral image is grouped into several hand subset images according to their correlation relationship.Then,the dimension of each subset band image is reduced by principle component analysis.To segment each subset hand image quickly,the mean shift algorithm is employed to find the cluster centers.And,the segmentation results are fused by fuzzy integral.Simulation results show the effectiveness of this method.

A Mean shift algorithm is a clustering & unsupervised algorithm. It is also called as “Mode seeking Algorithm”. A mean-shift algorithm used for image processing and also in computer vision. It doesn't require specified clusters like k-mean. Basically it has two types BMS & MS. By studying these two, it looks like BMS is slightly better than MS because it changes the dataset in each iteration with computed value. It's nonparametric algorithm and it can control no. of the cluster because the mean shift is much slower and much time complex and output depend on windows size. (Windows size is trivial). The BMS is an accelerated version which uses the original data only in the first step, then re-smoothes previous estimates. A BMS does not predefined shape on data cluster. To overcome such a situation, we can use the BMS and K-Medoid algorithm because k-medoid is partitioning technique of a cluster. It has better scalability for the larger datasets and much efficient so using these two we can build mean shift algorithm faster than before.

Forests are the main part of the terrestrial ecosystem. Airborne LiDAR is fast, comprehensive, penetrating, and contactless and can depict 3D canopy information with a high efficiency and accuracy. Therefore, it plays an important role in forest ecological protection, tree species recognition, carbon sink calculation, etc. Accurate recognition of individual trees in forests is a key step to various application. In real practice, however, the accuracy of individual tree segmentation (ITS) is often compromised by under-segmentation due to the diverse species, obstruction and understory trees typical of a high-density multistoried mixed forest area. Therefore, this paper proposes an ITS optimization method based on Gaussian mixture model for airborne LiDAR data. First, the mean shift (MS) algorithm is used for the initial ITS of the pre-processed airborne LiDAR data. Next, under-segmented samples are extracted by integrated learning, normally segmented samples are classified by morphological approximation, and the approximate distribution uncertainty of the normal samples is described with a covariance matrix. Finally, the class composition among the under-segmented samples is determined, and the under-segmented samples are re-segmented using Gaussian mixture model (GMM) clustering, in light of the optimal covariance matrix of the corresponding categories. Experiments with two datasets, Trento and Qingdao, resulted in ITS recall of 94% and 96%, accuracy of 82% and 91%, and F-scores of 0.87 and 0.93. Compared with the MS algorithm, our method is more accurate and less likely to under-segment individual trees in many cases. It can provide data support for the management and conservation of high-density multistoried mixed forest areas.

Digital image processing is an important field in pattern recognition and computer vision, where the process of separating an object with the background acts as one of the crucial roles in executing image processing. This research will talk about mean shift algorithm implementation in processing a set of undersea images to see its effectiveness in separating the background with the object automatically based on pixel distribution and color intensity. How the mean shift algorithm works is by doing a reading process to find the center of a pixel cluster in an image before this algorithm starts to cluster or group pixels with similar characteristics. In this research, a set of image input will be used as a test under mean shift algorithm to give output of an optimal pixel segmentation or grouping, leading to a proof that the mean shift algorithm has the capability to separate a main object from the background, especially in images with intense and high contrast. Even so, in images with less intense and lower contrast, the segmentation is not as accurate. The image input will have to undergo some more pre-processing before the mean shift segmentation is implemented. This research outcome is that the mean shift algorithm is effective for segmenting marine animal images based on colors without having to initialize how many clusters as the conclusion where this method is applicable in many computer vision programs such as object detection or image pattern recognition.

A novel layered object tracking algorithm for FLIR imagery is proposed based on mean shift algorithm and feature matching. First, infrared object is modeled by kernel histogram. Bhattacharyya coefficient is used to measure the similarity between object model and candidate model. The object is then localized by mean shift algorithm rapidly and efficiently. Because of the low contrast between infrared object and background, low dynamic range of gray level, however, the mean shift tracking results may bring some errors. So, feature matching is employed to eliminate the tracking errors. Feature points are extracted in template object and candidate area by Harris detector. Finally, the accurate localization of infrared object is realized by matching the feature points with the measurement of improved Hausdorff distance. Experiment results verify the effectives and robustness of this tracking algorithm which can improve the tracking performance efficiently.

Mean shift algorithm has attracted much attention in computer vision and has recently shown promising performance in the challenging problem of visual tracking, but it is difficult to deal with occlusion. In this paper, a timely occlusion object detection based on mean shift is proposed. By analyzing occlusion process, it is evident to find that occluded size is increasing and occlusion patch lies to edge of objects at the beginning. So object model is divided into several parts. In order to reduce computation, only edge patches is considered. If Bhattacharyya coefficient of one patch decreases greatly and other patches change faintly, it means that object is occluded in this area. In this method, object model is divided into two parts, one is occlusion part, the other is no occlusion part, the no occlusion part of the object can be obtained to track object continuatively until object is occluded totally. Experiments show that compared with whole object model judges, it is timely to detect occlusion and deals with occlusion successfully.

The vision sensor network is expected to achieve a contact-free wide-area location system without any additional burden on users in intelligent environments. In this article, a tracking algorithm for a location system in an intelligent environment is described. A modified color tracker based on a Kalman filter and a mean shift procedure is proposed in order to improve the robustness for occlusion and rapid movement. To handle the sudden change in object movement, we propose a hybrid tracking algorithm, including an adaptive feedback loop, based on the statistics of color histogram models after the mean-shift process. Experimental results showed that the proposed method achieves more robust tracking of multiple objects than the conventional method.

In practical application scenarios like video surveillance and human-computer interaction, human body movements are uncertain because the human body is a non-rigid object. Based on the fact that the head-shoulder part of human body can be less affected by the movement, and will seldom be obscured by other objects, in human detection and recognition, a head-shoulder model with its stable characteristics can be applied as a detection feature to describe the human body. In order to extract the head-shoulder contour accurately, a head-shoulder model establish method with combination of edge detection and the mean-shift algorithm in image clustering has been proposed in this paper. First, an adaptive method of mixture Gaussian background update has been used to extract targets from the video sequence. Second, edge detection has been used to extract the contour of moving objects, and the mean-shift algorithm has been combined to cluster parts of target’s contour. Third, the head-shoulder model can be established, according to the width and height ratio of human head-shoulder combined with the projection histogram of the binary image, and the eigenvectors of the head-shoulder contour can be acquired. Finally, the relationship between head-shoulder contour eigenvectors and the moving objects will be formed by the training of back-propagation (BP) neural network classifier, and the human head-shoulder model can be clustered for human detection and recognition. Experiments have shown that the method combined with edge detection and mean-shift algorithm proposed in this paper can extract the complete head-shoulder contour, with low calculating complexity and high efficiency.