Abstract-In this work we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the desirable characteristic of being invariant with respect to photometric distortions. Since the resulting similarity measure is a nonlinear function of the warp parameters, we develop two iterative schemes for its maximization, one based on the forward additive approach and the second on the inverse compositional method. As it is customary in iterative optimization, in each iteration the nonlinear objective function is approximated by an alternative expression for which the corresponding optimization is simple. In our case we propose an efficient approximation that leads to a closed form solution (per iteration) which is of low computational complexity, the latter property being particularly strong in our inverse version. The proposed schemes are tested against the Forward Additive Lucas-Kanade and the Simultaneous Inverse Compositional algorithm through simulations. Under noisy conditions and photometric distortions our forward version achieves more accurate alignments and exhibits faster convergence whereas our inverse version has similar performance as the Simultaneous Inverse Compositional algorithm but at a lower computational complexity.

International audienceThis paper describes a probabilistic generative model and its associated algorithm to jointly register multiple point sets. The vast majority of state-of-the-art registration techniques select one of the sets as the ''model" and perform pairwise alignments between the other sets and this set. The main drawback of this mode of operation is that there is no guarantee that the model-set is free of noise and outliers, which contaminates the estimation of the registration parameters. Unlike previous work, the proposed method treats all the point sets on an equal footing: they are realizations of a Gaussian mixture (GMM) and the registration is cast into a clustering problem. We formally derive an EM algorithm that estimates both the GMM parameters and the rotations and translations that map each individual set onto the ''central" model. The mixture means play the role of the registered set of points while the variances provide rich information about the quality of the registration. We thoroughly validate the proposed method with challenging datasets, we compare it with several state-of-the-art methods, and we show its potential for fusing real depth data

The invariance of the similarity measure in photometric distortions as well as its capability in producing subpixel accuracy are two desired and often required features in most stereo vision applications. In this paper we propose a new correlation-based measure which incorporates both mentioned requirements. Specifically, by using an appropriate interpolation scheme in the candidate windows of the matching image, and using the classical zero mean normalized cross correlation function, we introduce a suitable measure. Although the proposed measure is a nonlinear function of the sub-pixel displacement parameter, its maximization results in a closed form solution, resulting in reduced complexity for its use in matching techniques. Application of the proposed measure in a number of benchmark stereo pair images reveals its superiority over existing correlation-based techniques used for sub-pixel accuracy.

No abstract

The task of objective perimetry is to scan the visual field and find an answer about the function of the visual system. Flicker-burst stimulation--a physiological sensible combination of transient and steady-state stimulation--is used to generate deterministic sinusoidal responses or visually evoked potentials (VEP's) at the visual cortex, which are derived from the electroencephalogram by a suitable electrode array. In this paper we develop a new method for the detection of VEP's. Based on the periodogram of a time-series, we test the data for the presence of hidden periodic components, which correspond to steady-state VEP's. The method is applied successfully to real data.

This paper presents a computer-aided diagnosis scheme for the detection of prostate cancer. The pattern recognition scheme proposed, utilizes fused dynamic and morphological features extracted from magnetic resonance images (MRIs). The performance of the proposed scheme has been evaluated through extensive training and testing on several patient cases, where the staging of their condition has been previously evaluated by both ultrasoundguided biopsy and radiological assessment. The classification scheme is based on Probabilistic Neural Networks (PNNs), whose parameters are estimated using the Expectation-Maximization (EM) algorithm during a training phase. Fusion of the image characteristics is performed by properly aligning the respective TI-weighted dynamic and T2-weighted morphological images, allowing accurate feature selection from both images. The proposed classification scheme as well as the effect of fusion on the extracted features is tested, with respect to the correct classification rate (CCR) of each case.

No abstract

No abstract