We propose a novel tracking scheme that jointly employs point feature correspondences and object appearance similarity. For selecting point correspondences, we use a subset of scale-invariant point features from SIFT ...
详细信息
We propose a novel tracking scheme that jointly employs point feature correspondences and object appearance similarity. For selecting point correspondences, we use a subset of scale-invariant point features from SIFT that agree with a pre-defined affine transformation. The selected consensus points are then used for pre-selecting candidate regions. For appearance similarity based tracking, we employ an existing anisotropic mean shift, from which the formula for estimating bounding box parameters (width, height, orientation and center) are derived. A switching criterion is utilized to handle the situation where only a small number of point correspondences is found. Experiments and evaluation are performed on tracking moving objects on videos where objects may contain partial occlusions, intersection, deformation and pose changes among other transforms. Our comparisons with two existing methods have shown that the proposed scheme has yielded marked improvement, especially in terms of reducing tracking drifts, of robustness to occlusions, and of tightness and accuracy of tracked bounding box.
This paper addresses the problem of transmitting space-time interleaved coded signals over multiple-input multiple-output (MIMO) block fading channels with intersymbol interference (ISI). At the receiver, we investiga...
详细信息
This paper addresses the problem of transmitting space-time interleaved coded signals over multiple-input multiple-output (MIMO) block fading channels with intersymbol interference (ISI). At the receiver, we investigate a cooperative approach in which data detection, decoding, and channel estimation are performed separately and iteratively. Computationally efficient methods based on the expectation-maximization (EM) algorithm are developed for multiple path gain estimation
Summary form only given, as follows. A method is proposed for improving estimates of radioactivity distributions obtained with PET (positron emission tomography) by utilizing anatomical information derived from MRI (m...
详细信息
Summary form only given, as follows. A method is proposed for improving estimates of radioactivity distributions obtained with PET (positron emission tomography) by utilizing anatomical information derived from MRI (magnetic resonance imaging) or X-ray CT (computered tomography). An algorithm is identified for computing regularized maximum-likelihood (ML) estimates of radioactivity distributions, subject to the constraint that a region of the image with known boundaries contains an unknown but constant intensity of radioactivity. Regularized ML estimates are computed using an expectation-maximization algorithm. A regularization method with spatially varying sieve and resolution kernels is used to prevent artifacts while preserving sharp boundaries where appropriate. The method is evaluated using a simulation and found to produce more accurate estimates than filtered backprojection or the usual ML algorithm. The variance of the constrained estimator is also studied.< >
A hierarchical blur identification method which is able to identify severe blurs having a relatively large support size is proposed. The method is based on the expectation-maximization algorithm and begins by identify...
详细信息
A hierarchical blur identification method which is able to identify severe blurs having a relatively large support size is proposed. The method is based on the expectation-maximization algorithm and begins by identifying a low-pass version of the point-spread function (PSF) from a reduced-resolution version of the blurred image. The result is used to initialize the identification of the PSF from a higher-resolution image. By repeating this process, the support size and resolution of the identified PSF are gradually increased, achieving an efficient identification of large PSFs.< >
We address the problem of articulated posture estimation in its general form. Namely, the recovery of full 3D articulated posture parameters from an uncontrolled scene. Stochastic modeling of low-level segmented image...
详细信息
We address the problem of articulated posture estimation in its general form. Namely, the recovery of full 3D articulated posture parameters from an uncontrolled scene. Stochastic modeling of low-level segmented image data is unified with models of object kinematic structure through a constrained mixture of observation processes. A modified expectation-maximization algorithm is proposed for this purpose. Early experiments qualitatively demonstrate the efficacy of our approach, and provide a context for integration for more sophisticated image cues.
Image mosaicing is an effective means of constructing a single panoramic image from a series of snapshots taken in different viewing angles. However, in the case of congested traffic scenes with a cluttered environmen...
详细信息
Image mosaicing is an effective means of constructing a single panoramic image from a series of snapshots taken in different viewing angles. However, in the case of congested traffic scenes with a cluttered environment including vehicles or pedestrians, there are severe difficulties in aligning a pair of snapshots. In such cases, some objects would be taken only in one of the image pair, thereby resulting in failure in stitching the pair of images. This paper deals with three types of techniques for performing an image mosaicing: Homography estimation for determining geometrical relationships between the image pair, expectation-maximization algorithm for removing inconsistent overlapping region, and graph cuts for seamless stitching and background estimation. Experimental results indicate that the proposed technique is effective to synthesize a panoramic image from a series of narrow-field-of-view snapshots.
We introduce a semiparametric block model for graphs, where the within- and between-cluster edge probabilities are not constants within the blocks but are described by logistic type models, reminiscent of the 50-year-...
详细信息
We introduce a semiparametric block model for graphs, where the within- and between-cluster edge probabilities are not constants within the blocks but are described by logistic type models, reminiscent of the 50-year-old Rasch model and the newly introduced alpha-beta models. Our purpose is to give a partition of the vertices of an observed graph so that the induced subgraphs and bipartite graphs obey these models, where their strongly interlaced parameters give multiscale evaluation of the vertices at the same time. In this way, a profoundly heterogeneous version of the stochastic block model is built via mixtures of the above submodels, while the parameters are estimated with a special EM iteration.
We consider the problem of modelling count data with excess zeros using Zero-Inflated Poisson (ZIP) regression. Recently, various regularization methods have been developed for variable selection in ZIP models. Among ...
详细信息
We consider the problem of modelling count data with excess zeros using Zero-Inflated Poisson (ZIP) regression. Recently, various regularization methods have been developed for variable selection in ZIP models. Among these, EM LASSO is a popular method for simultaneous variable selection and parameter estimation. However, EM LASSO suffers from estimation inefficiency and selection inconsistency. To remedy these problems, we propose a set of EM adaptive LASSO methods using a variety of data-adaptive weights. We show theoretically that the new methods are able to identify the true model consistently, and the resulting estimators can be as efficient as oracle. The methods are further evaluated through extensive synthetic experiments and applied to a German health care demand dataset.
In this paper we propose a novel framework for the construction of sparsity-inducing priors. In particular, we define such priors as a mixture of exponential power distributions with a generalized inverse Gaussian den...
详细信息
In this paper we propose a novel framework for the construction of sparsity-inducing priors. In particular, we define such priors as a mixture of exponential power distributions with a generalized inverse Gaussian density (EP-GIG). EP-GIG is a variant of generalized hyperbolic distributions, and the special cases include Gaussian scale mixtures and Laplace scale mixtures. Furthermore, Laplace scale mixtures can subserve a Bayesian framework for sparse learning with nonconvex penalization. The densities of EP-GIG can be explicitly expressed. Moreover, the corresponding posterior distribution also follows a generalized inverse Gaussian distribution. We exploit these properties to develop EM algorithms for sparse empirical Bayesian learning. We also show that these algorithms bear an interesting resemblance to iteratively reweighted l 2 or l 1 methods. Finally, we present two extensions for grouped variable selection and logistic regression.
暂无评论