In this paper we propose a novel approach for incorporating measures of spatial uncertainty, which are derived from non-rigid registration, into spatially normalised statistics. Current approaches to spatially normalised statistical analysis use point-estimates of the registration parameters. This is limiting as the registration will rarely be completely accurate, and therefore data smoothing i...

Smoothing filter is the method of choice for image preprocessing and pattern recognition. We present a new concurrent method for smoothing 2D object in binary case. Proposed method provides a parallel computation while preserving the topology by using homotopic transformations. We introduce an adapted parallelization strategy called split, distribute and merge (SDM) strategy which allows effici...

Iterative solvers in combination with multi-grid have been used extensively to solve large algebraic systems. One of the best known is the Runge-Kutta iteration. Previously [4] we reformulated the Runge-Kutta scheme and established a model of a complete V-cycle which was used to optimize the coefficients of the multi-stage scheme and resulted in a better overall performance. We now look into as...

A novel technique for multi-scale smoothing of a free-form 3-D surface is presented. Complete triangulated models of 3-D objects are constructed automatically and using a local parametrization technique, are then smoothed using a 2-D Gaussian filter. Our method for local parametrization makes use of semigeodesic coordinates as a natural and efficient way of sampling the local surface shape. The...

Change detection scheme based on guided contrasting was previously proposed. Guided contrasting filter takes two images (test and sample) as input and forms the output as filtered version of test image. Such filter preserves the similar details and smooths the nonsimilar details of test image with respect to sample image. Due to this the difference between test image and its filtered version (d...

We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digital filter. This framework, which minimizes a loss function plus a regularization term, is parameterized by a weight function defined as a similarity measure. It is applicable to several problems in image processing, da...

State estimation problems for linear time-invariant systems with noisy inputs and outputs are considered. An efficient recursive algorithm for the smoothing problem is presented. The equivalence between the optimal filter and an appropriately modified Kalman filter is established. The optimal estimate of the input signal is derived from the optimal state estimate. The result shows that the nois...

This paper investigates the use of statistical linearization to improve iterative non-linear least squares estimators. In particular, we look at improving long range stereo by filtering feature tracks from sequences of stereo pairs. A novel filter called the Iterated Sigma Point Kalman Filter (ISPKF) is developed from first principles; this filter is shown to achieve superior performance in ter...

We present a performance analysis for image registration with gradient descent methods. We consider a typical multiscale registration setting where the global 2-D translation between a pair of images is estimated by smoothing the images and minimizing the distance between them with gradient descent. Our study particularly concentrates on the effect of noise and low-pass filtering on the alignme...

In this paper a weighted guided image filter (WGIF) is being proposed incorporating an edge-aware weighting technique into the guided image filter (GIF). The WGIF preserves sharp edges as well as existing global filters, and the intricacy of the WGIF is O(N) for an image with N pixels which is almost the same as the GIF. As WGIF is simple, it has numerous applications in the fields of computati...