Search

Segmentation-based tracking methods are popular in alleviating the model drift problem during online-learning of visual trackers. However, one of the limitations of those methods is that tracking results guide the process of segmentation. The model drift problem in tracking may have significant influence on segmentation. In this paper, we propose an online structured Hough Forests to address this limitation. The results of object tracking do not have significant influence on the process of segmentation. Our algorithm shows more robust results on several challenging sequences.

A key problem in visual tracking is how to effectively combine spatio-temporal visual information from throughout a video to accurately estimate the state of an object. We address this problem by incorporating Dempster-Shafer (DS) information fusion into the tracking approach. To implement this fusion task, the entire image sequence is partitioned into spatially and temporally adjacent subsequences. A support vector machine (SVM) classifier is trained for object/nonobject classification on each of these subsequences, the outputs of which act as separate data sources. To combine the discriminative information from these classifiers, we further present a spatio-temporal weighted DS (STWDS) scheme. In addition, temporally adjacent sources are likely to share discriminative information on object/nonobject classification. To use such information, an adaptive SVM learning scheme is designed to transfer discriminative information across sources. Finally, the corresponding DS belief function of the STWDS scheme is embedded into a Bayesian tracking model. Experimental results on challenging videos demonstrate the effectiveness and robustness of the proposed tracking approach.

Visual tracking usually requires an object appearance model that is robust to changing illumination, pose and other factors encountered in video. In this paper, we construct an appearance model using the 3D discrete cosine transform (3D-DCT). The 3D-DCT is based on a set of cosine basis functions, which are determined by the dimensions of the 3D signal and thus independent of the input video data. In addition, the 3D-DCT can generate a compact energy spectrum whose high-frequency coefficients are sparse if the appearance samples are similar. By discarding these high-frequency coefficients, we simultaneously obtain a compact 3D-DCT based object representation and a signal reconstruction-based similarity measure (reflecting the information loss from signal reconstruction). To efficiently update the object representation, we propose an incremental 3D-DCT algorithm, which decomposes the 3D-DCT into successive operations of the 2D discrete cosine transform (2D-DCT) and 1D discrete cosine transform (1D-DCT) on the input video data., 21 pages. Appearing in IEEE Transactions on Pattern Analysis and Machine Intelligence

It has been shown that the Universum data, which do not belong to either class of the classification problem of interest, may contain useful prior domain knowledge for training a classifier [1], [2]. In this work, we design a novel boosting algorithm that takes advantage of the available Universum data, hence the name UBoost. UBoost is a boosting implementation of Vapnik's alternative capacity concept to the large margin approach. In addition to the standard regularization term, UBoost also controls the learned model's capacity by maximizing the number of observed contradictions. Our experiments demonstrate that UBoost can deliver improved classification accuracy over standard boosting algorithms that use labeled data alone.

We propose a robust fitting framework, called Adaptive Kernel-Scale Weighted Hypotheses (AKSWH), to segment multiple-structure data even in the presence of a large number of outliers. Our framework contains a novel scale estimator called Iterative Kth Ordered Scale Estimator (IKOSE). IKOSE can accurately estimate the scale of inliers for heavily corrupted multiple-structure data and is of interest by itself since it can be used in other robust estimators. In addition to IKOSE, our framework includes several original elements based on the weighting, clustering, and fusing of hypotheses. AKSWH can provide accurate estimates of the number of model instances and the parameters and the scale of each model instance simultaneously. We demonstrate good performance in practical applications such as line fitting, circle fitting, range image segmentation, homography estimation, and two--view-based motion segmentation, using both synthetic data and real images.

Visual tracking has been typically solved as a binary classification problem. Most existing trackers only consider the pairwise interactions between samples, and thereby ignore the higher-order contextual interactions, which may lead to the sensitivity to complicated factors such as noises, outliers, background clutters and so on. In this paper, we propose a visual tracker based on support vector machines (SVMs), for which a novel graph mode-based contextual kernel is designed to effectively capture the higher-order contextual information from samples. To do so, we first create a visual graph whose similarity matrix is determined by a baseline visual kernel. Second, a set of high-order contexts are discovered in the visual graph. The problem of discovering these high-order contexts is solved by seeking modes of the visual graph. Each graph mode corresponds to a vertex community termed as a high-order context. Third, we construct a contextual kernel that effectively captures the interaction information between the high-order contexts. Finally, this contextual kernel is embedded into SVMs for robust tracking. Experimental results on challenging videos demonstrate the effectiveness and robustness of the proposed tracker.

For plate detection, we found that when the plate is disturbed by complex upright borderlines, location can be inaccurate or even missed. On the basis of this, a new vehicle license plate location algorithm based on salient feature is introduced. It makes use of the texture feature, geometric characteristics and color information. By raw location and precise location, it can quickly locate the license plate position accurately and distinguishes the color type. Our experiment results show that this algorithm has a fast, efficient performance of locating vehicle license plate under complex background.

Although there is considerable evidence that diabetes can adversely affect meiosis in mammalian oocytes, acetylation status of oocytes in a diabetic environment remains unclear. The objective was to determine acetylation or deacetylation patterns (based on immunostaining) of H3K9, H3K14, H4K5, H4K8, H4K12, and H4K16 sites at various stages during meiosis in murine oocytes from control and diabetic mice. According to quantitative real time polymerase chain reaction (qPCR), mean ± SEM relative expression of Gcn5 (1.70 ± 0.14 at metaphase [M]I and 1.27 ± 0.01 at MII, respectively), Ep300 (1.74 ± 0.04 at MI and 1.80 ± 0.001 at MII), and Pcaf (2.01 ± 0.03 at MI and 1.41 ± 0.18 at MII) mRNA in oocytes from diabetic mice were higher than those from controls (P0.05), whereas there was no difference (P0.05) during the germinal vesicle (GV) stage between the two groups (1.23 ± 0.04 for Gcn5, 0.82 ± 0.06 for Ep300, and 0.80 ± 0.07 for Pcaf). Conversely, relative mRNA expression concentrations of Hdac1, Hdac2, Hdac3, Sirt1 and Sirt2 during the germinal vesicle stage were lower in oocytes of diabetic mice (0.24 ± 0.03 for Hdac1, 0.11 ± 0.001 for Hdac2, 0.31 ± 0.03 for Hdac3, 0.28 ± 0.02 for Sirt1, and 0.55 ± 0.02 for Sirt2; P0.05). Similarly, the expression concentrations of these genes at the MI stage were lower in oocytes from diabetic mice (0.79 ± 0.12 for Hdac1, 0.72 ± 0.001 for Hdac2, 0.02 ± 0.001 for Sirt1, and 0.84 ± 0.08 for Sirt2; P0.05). Their expression concentrations at the MII stage were also lower in oocytes from diabetic mice (0.46 ± 0.03 for Hdac1, 0.93 ± 0.01 for Hdac2, 0.56 ± 0.01 for Hdac3, 0.01 ± 0.002 for Sirt1, and 0.84 ± 0.04 for Sirt2; P0.05). At the MI stage, however, there was no difference in the expression of Hdac3 between the two groups of oocytes (0.96 ± 0.03; P0.05). Taken together, diabetes altered the intracellular histone modification system, which may have contributed to changes in histone acetylation, and may be involved in the compromised maturation rate of oocytes in diabetic humans.

An effective method for retrieving 3D models is to represent and discriminate them with their 2D images projected from multiple viewpoints. Such view-based methods conform more closely to human visual recognition for 3D model retrieval, since the human retina essentially captures 2D images. However, most of the existing view-based methods do not take into account that different views have different importance even though they belong to the same object. To address this problem, we propose a novel view-based method for 3D CAD model retrieval. First, the PHOG descriptor is employed to describe the 2D images projected from a model. Then, Lagrange multipliers, vector quantization and a Support Vector Machine (SVM) are used to adaptively assign an optimal weight to each projected image. The similarity between a 3D query model and a 3D object in database is determined by the likeness of their corresponding 2D images associated with optimal weights. The effectiveness of the proposed method is shown in the experimental part.

To correctly estimate the camera motion parameters and reconstruct the structure of the surrounding tissues from endoscopic image sequences, we need not only to deal with outliers (e.g., mismatches), which may involve more than 50% of the data, but also to accurately distinguish inliers (correct matches) from outliers. In this paper, we propose a new robust estimator, Adaptive Scale Kernel Consensus (ASKC), which can tolerate more than 50 percent outliers while automatically estimating the scale of inliers. With ASKC, we develop a reliable feature tracking algorithm. This, in turn, allows us to develop a complete system for estimating endoscopic camera motion and reconstructing anatomical structures from endoscopic image sequences. Preliminary experiments on endoscopic sinus imagery have achieved promising results.

Our goal is to fit the multiple instances (or structures) of a generic model existing in data. Here we propose a novel model selection scheme to estimate the number of genuine structures present. In contrast to conventional model selection approaches, our method is driven by kernel-based learning. The input data is first clustered based on their potential to have emerged from the same structure. However the number of clusters is deliberately overestimated to obtain a set of initial model fits onto the data. We then resolve the oversegmentation via a series of kernel optimisation conducted through multiple kernel learning, and the concept of kernel-target alignment is used as a model selection criterion. Experiments on synthetic and real data show that our method outperforms previous model selection schemes. We also focus on the application of multi-body motion segmentation. In particular we demonstrate success on estimating the number of motions on sequences with more than 3 unique motions.

Spatio-temporal local feature based bag of visual words algorithm (BOVW) has shown promising results in complex human action classification. However, one key disadvantage of BOVW is geometrical unconstraint, which makes it impossible to recognize different actions with the same features but different spatial-temporal distribution of these features. In this paper, we exploit the spatio-temporal proximity distribution of local features in 3D space to characterize geometric context of action class. The obtained spatio-temporal proximity matrix models both the appearance and geometrics of human actions. Moreover, a spatio-temporal proximity distribution kernel (ST-PDK) is proposed to measure the similarity of videos, which satisfies Mercer condition and is directly incorporated into the kernel function of the SVM classifier. Our algorithm achieves the highest classification accuracy on KTH dataset, one of the most challenging and popular action datasets.

In this paper, we propose a novel method to localize (or track) a foreground object and segment the foreground object from the surrounding background with occlusions for a moving camera. We measure the likelihood of a target position by using a combination of a generative model and a discriminative model, considering not only the foreground similarity to the target model but also the dissimilarity between the foreground and the background appearances. Object segmentation is treated as a binary labeling problem. A Markov Random Field (MRF) is employed to add a spatial smooth prior on the foreground/background patterns. We demonstrate the advantages of the proposed method on several challenging videos and compare our results with the results of several other popular methods. The proposed method has achieved good results.

Filtering feature selection method (filtering method, for short) is a well-known feature selection strategy in pattern recognition and data mining. Filtering method outperforms other feature selection methods in many cases when the dimension of features is large. There are so many filtering methods proposed in previous work leading to the “selection trouble” that how to select an appropriate filtering method for a given text data set. Since to find the best filtering method is usually intractable in real application, this paper takes an alternative path. We propose a feature selection framework that fuses the results obtained by different filtering methods. In fact, deriving a better rank list from different rank lists, known as rank aggregation, is a hot topic studied in many disciplines. Based on the proposed framework and Markov chains rank aggregation techniques, in this paper, we present two new feature selection methods: FR-MC1 and FR-MC4. We also introduce a perturbation algorithm to alleviate the drawbacks of Markov chains rank aggregation techniques. Empirical evaluation on two public text data sets shows that the two new feature selection methods achieve better or comparable results than classical filtering methods, which also demonstrate the effectiveness of our framework.

In this work we generalize the plain MS trackers and attempt to overcome standard mean shift trackers' two limitations. It is well known that modeling and maintaining a representation of a target object is an important component of a successful visual tracker. However, little work has been done on building a robust template model for kernel-based MS tracking. In contrast to building a template from a single frame, we train a robust object representation model from a large amount of data. Tracking is viewed as a binary classification problem, and a discriminative classification rule is learned to distinguish between the object and background. We adopt a support vector machine (SVM) for training. The tracker is then implemented by maximizing the classification score. An iterative optimization scheme very similar to MS is derived for this purpose., Comment: 12 pages

International Journal of Computer Vision, 79 (2), ISSN:0920-5691, ISSN:1573-1405

Background Recent advances in computational image processing have made it possible to reconstruct camera motion and scene geometry from a series of monocular images. By applying these methods to endoscopic image sequences, it is possible to create detailed, quantitative anatomic reconstructions. Such anatomic reconstructions have many potential clinical uses. Our objectives in this study are to (1) develop a process flow for reconstruction from endoscopic image sequences and (2) present results supporting the hypothesis that such reconstructions can be computed. Methods We first outline the overall process flow for endoscopic reconstruction. Then, we present an instantiation of this process flow using recently developed methods in computational vision. We apply these methods to cadaverous specimens for which ground truth endoscopic motion is known. Results We are able to produce consistent estimates of endoscopic motion and dense reconstructions of the surrounding anatomy for >65% of 1373 image pairs. Conclusion Our study indicates that processing endoscopic images to produce anatomic structure is feasible. Such reconstructions have high potential clinical value for intraoperative navigation, diagnosis, and treatment planning.

In visual tracking, developing an efficient appearance model is a challenging task due to the influence of various factors, such as illumination variation, occlusion, background clutter, and so on. Existing tracking algorithms use appearance samples from previous frames to form a template set upon which target appearance models are built. However, these appearance models are data-dependent, so they may be corrupted by significant appearance variation. It is difficult to update the templates in challenging environments. In this paper, we propose a robust visual tracking algorithm with an adaptive appearance model using a point-to-set metric learning technique. To do this, we first model a target representation using a set of target templates and a regularized affine hull (RAH) spanned by the target templates. Then, we learn a point-to-set distance metric, which is incorporated into the optimization process to obtain an adaptive target representation. The RAH model covers unseen target appearances by affine combinations of the target templates. Based on the proposed target appearance model, we design an effective template update scheme by adjusting the weights of the target templates. Experimental results on challenging video sequences with comparisons to several state-of-the-art tracking algorithms demonstrate the effectiveness and robustness of the proposed tracking algorithm.

We propose a similarity measure based on a Spatial-color Mixture of Gaussians (SMOG) appearance model for particle filters. This improves on the popular similarity measure based on color histograms because it considers not only the colors in a region but also the spatial layout of the colors. Hence, the SMOG-based similarity measure is more discriminative. To efficiently compute the parameters for SMOG, we propose a new technique, with which the computational time is greatly reduced. We also extend our method by integrating multiple cues to increase the reliability and robustness. Experiments show that our method can successfully track objects in many difficult situations.

Initializing a background model requires robust statistical methods as the task should be robust against random occurrences of foreground objects, as well as against general image noise. The median has been employed for the problem of background initialization. However, the median has only a breakdown point of 50%. In this paper, we propose a new robust method which can tolerate more than 50% of noise and foreground pixels in the background initialization process. We compare our new method with five others and give quantitative evaluations on background initialization. Experiments show that the proposed method achieves very promising results in background initialization.

Statistical background modeling is a fundamental and important part of many visual tracking systems and of other computer vision applications. In this paper, we presents an effective and adaptive background modeling method for detecting foreground objects in both static and dynamic scenes. The proposed method computes SAmple CONsensus (SACON) of the background samples and estimates a statistical model per pixel. Numerous experiments on both indoor and outdoor video sequences show that the proposed method, compared with several state-of-the-art methods, can achieve very promising performance

Robust model fitting essentially requires the application of two estimators. The first is an estimator for the values of the model parameters. The second is an estimator for the scale of the noise in the (inlier) data. Indeed, we propose two novel robust techniques: the two-step scale estimator (TSSE) and the adaptive scale sample consensus (ASSC) estimator. TSSE applies nonparametric density estimation and density gradient estimation techniques, to robustly estimate the scale of the inliers. The ASSC estimator combines random sample consensus (RANSAC) and TSSE, using a modified objective function that depends upon both the number of inliers and the corresponding scale. ASSC is very robust to discontinuous signals and data with multiple structures, being able to tolerate more than 80 percent outliers. The main advantage of ASSC over RANSAC is that prior knowledge about the scale of inliers is not needed. ASSC can simultaneously estimate the parameters of a model and the scale of the inliers belonging to that model. Experiments on synthetic data show that ASSC has better robustness to heavily corrupted data than least median squares (LMedS), residual consensus (RESC), and adaptive least Kth order squares (ALKS). We also apply ASSC to two fundamental computer vision tasks: range image segmentation and robust fundamental matrix estimation. Experiments show very promising results.

Much of computer vision and image analysis involves the extraction of “meaningful” information from images using concepts akin to regression and model fitting. Applications include: robot vision, automated surveillance (civil and military) and inspection, biomedical image analysis, video coding, human-machine interface, visualization, historical film restoration etc. However, problems in computer vision often have characteristics that are distinct from those usually addressed by the statistical community. These include pseudo-outliers: in a given image, there are usually several populations of data. Some parts may correspond to one object in a scene and other parts will correspond to other, rather unrelated, objects. When attempting to fit a model to this data, one must consider all populations as outliers to other populations — the term pseudo-outlier has been coined for this situation. Thus it will rarely happen that a given population achieves the critical size of 50% of the total population and, therefore, techniques that have been touted for their high breakdown point (e.g., Least Median of Squares) are no longer reliable candidates, being limited to a 50% breakdown point.

In computer vision tasks, it frequently happens that gross noise occupies the absolute majority of the data. Most robust estimators can tolerate no more than 50% gross errors. In this article, we propose a highly robust estimator, called MDPE (maximum density power estimator), employing density estimation and density gradient estimation techniques in the residual space. This estimator can tolerate more than 85% outliers. Experiments illustrate that the MDPE has a higher breakdown point and less errors than other recently proposed similar estimators: least median of squares (LMedS), residual consensus (RESC), and adaptive least kth order squares (ALKS).

Although the least median of squares (LMedS) method and the least trimmed squares (LTS) method are said to hive a high breakdown point (50%), they can break down at unexpectedly lower percentages of outliers when those outliers are clustered. In this paper, we investigate the breakdown of LMedS and the LTS when a large percentage of clustered outliers exist in the data. We introduce the concept of symmetry distance (SD) and propose an improved method, called the least trimmed symmetry distance (LTSD). The experimental results show the LTSD gives better results than the LMedS method and the LTS method particularly when there is a large percentage of clustered outliers and/or a large standard variance in the inlier population.