Motion compensated film restoration

Motion picture films are susceptible to local degradations such as dust spots. Other deteriorations are global such as intensity and spatial jitter. It is obvious that motion needs to be compensated for before the detection/correction of such local and dynamic defects. Therefore, we propose a hierarchical motion estimation method ideally suited for high resolution film sequences. This recursive block-based motion estimator relies on an adaptive search strategy and Radon projections to improve processing speed. The localization of dust particles then becomes straightforward. Thus, it is achieved by simple inter-frame differences between the current image and motion compensated successive and preceding frames. However, the detection of spatial and intensity jitter requires a specific process taking advantage of the high temporal correlation in the image sequence. In this paper, we present our motion compensation-based algorithms for removing dust spots, spatial and intensity jitter in degraded motion pictures. Experimental results are presented showing the usefulness of our motion estimator for film restoration at reasonable computational costs. Received: 9 July 2000 / Accepted: 13 January 2002 Correspondence to:S. Boukir     

基于Legendre多项式的随机连续系统的Markov参数估计

本文在讨论连续Ｗｉｓｅｎｒ过程的Ｌｅｇｅｎｄｒｅ多项式逼近值的相关性和Ｗｉｅｎｅｒ过程扰动下连续线性系统基于该正交多项的最小二乘估计有偏性后，提出了无偏一致的且数估计误差方差最小的Ｍａｒｋｏｖ估计（最小方差估计）算法，并给出本文方法的仿真结果。     

Ranking with uncertain labels and its applications

The techniques for image analysis and classification generally consider the image sample labels fixed and without uncertainties. The rank regression problem studied in this paper is based on the training samples with uncertain labels, which often is the case for the manual estimated image labels. A core ranking model is designed first as the bilinear fusing of multiple candidate kernels. Then, the parameters for feature selection and kernel selection are learned simultaneously by maximum a posteriori for given samples and uncertain labels. The provable convergency Expectation Maximization (EM) method is used for inferring these parameters in an iterative manner. The effectiveness of the proposed algorithm is finally validated by the extensive experiments on age ranking task and human tracking task. The popular FG-NET and the large scale Yamaha aging database are used for the age estimation experiments, and our algorithm outperforms those state-of-the-art algorithms ever reported by other interrelated literatures significantly. The experiment result of human tracking task also validates its advantage over conventional linear regression algorithm. A short version of this paper appeared in ICME07.     

注塑件/模具成本评估方法研究综述

对注塑模成本评估领域的主要研究方法进行了分析 ,指出了相关的几个成本评估流派。着重对成本评估的CEF方法进行了总结 ,并对当前国际上流行的派别的优缺点进行了总结。文末 ,给出了我们的研究思路大体概述     

Explosive Random‐Coefficient AR(1) Processes and Related Asymptotics for Least‐Squares Estimation

Abstract. Large sample properties of the least‐squares and weighted least‐squares estimates of the autoregressive parameter of the explosive random‐coefficient AR(1) process are discussed. It is shown that, contrary to the standard AR(1) case, the least‐squares estimator is inconsistent whereas the weighted least‐squares estimator is consistent and asymptotically normal even when the error process is not necessarily Gaussian. Conditional asymptotics on the event that a certain limiting random variable is non‐zero is also discussed.     

A region-based selective optical flow back-projection for genuine motion vector estimation

Motion vector plays one significant feature in moving object segmentation. However, the motion vector in this application is required to represent the actual motion displacement, rather than regions of visually significant similarity. In this paper, region-based selective optical flow back-projection (RSOFB) which back-projects optical flows in a region to restore the region's motion vector from gradient-based optical flows, is proposed to obtain genuine motion displacement. The back-projection is performed based on minimizing the projection mean square errors of the motion vector on gradient directions. As optical flows of various magnitudes and directions provide various degrees of reliability in the genuine motion restoration, the optical flows to be used in the RSOFB are optimally selected based on their sensitivity to noises and their tendency in causing motion estimation errors. In this paper a deterministic solution is also derived for performing the minimization and obtaining the genuine motion magnitude and motion direction.     

Surface and normal ensembles for surface reconstruction

The majority of the existing techniques for surface reconstruction and the closely related problem of normal reconstruction are deterministic. Their main advantages are the speed and, given a reasonably good initial input, the high quality of the reconstructed surfaces. Nevertheless, their deterministic nature may hinder them from effectively handling incomplete data with noise and outliers. An ensemble is a statistical technique which can improve the performance of deterministic algorithms by putting them into a statistics based probabilistic setting. In this paper, we study the suitability of ensembles in normal and surface reconstruction. We experimented with a widely used normal reconstruction technique [Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W. Surface reconstruction from unorganized points. Computer Graphics 1992;71-8] and Multi-level Partitions of Unity implicits for surface reconstruction [Ohtake Y, Belyaev A, Alexa M, Turk G, Seidel H-P. Multi-level partition of unity implicits. ACM Transactions on Graphics 2003;22(3):463-70], showing that normal and surface ensembles can successfully be combined to handle noisy point sets.     

Information cut for clustering using a gradient descent approach

We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between probability density functions. We propose to optimize the Information Cut using a gradient descent-based approach. Our algorithm has several advantages compared to many other graph-based methods in terms of determining an appropriate affinity measure, computational complexity, memory requirements and coping with different data scales. We show that our method may produce clustering and image segmentation results comparable or better than the state-of-the art graph-based methods.     

Consistency of robust estimators in multi-structural visual data segmentation

A theoretical framework is presented to study the consistency of robust estimators used in vision problems involving extraction of fine details. A strong correlation between asymptotic performance of a robust estimator and the asymptotic bias of its scale estimate is mathematically demonstrated where the structures are assumed to be linear corrupted by Gaussian noise. A new measure for the inconsistency of scale estimators is defined and formulated by deriving the functional forms of four recent high-breakdown robust estimators. For each estimator, the inconsistency measures are numerically evaluated for a range of mutual distances between structures and inlier ratios, and the minimum mutual distance between the structures, for which each estimator returns a non-bridging fit, is calculated.     

Nonlinear black-box modeling in system identification: a unified overview

A nonlinear black-box structure for a dynamical system is a model structure that is prepared to describe virtually any nonlinear dynamics. There has been considerable recent interest in this area, with structures based on neural networks, radial basis networks, wavelet networks and hinging hyperplanes, as well as wavelet-transform-based methods and models based on fuzzy sets and fuzzy rules. This paper describes all these approaches in a common framework, from a user's perspective. It focuses on what are the common features in the different approaches, the choices that have to be made and what considerations are relevant for a successful system-identification application of these techniques. It is pointed out that the nonlinear structures can be seen as a concatenation of a mapping form observed data to a regression vector and a nonlinear mapping from the regressor space to the output space. These mappings are discussed separately. The latter mapping is usually formed as a basis function expansion. The basis functions are typically formed from one simple scalar function, which is modified in terms of scale and location. The expansion from the scalar argument to the regressor space is achieved by a radial- or a ridge-type approach. Basic techniques for estimating the parameters in the structures are criterion minimization, as well as two-step procedures, where first the relevant basis functions are determined, using data, and then a linear least-squares step to determine the coordinates of the function approximation. A particular problem is to deal with the large number of potentially necessary parameters. This is handled by making the number of ‘used’ parameters considerably less than the number of ‘offered’ parameters, by regularization, shrinking, pruning or regressor selection.