Efficiency analysis of information theoretic measures in image registration

Voronov, S. V.; Tashlinskii, A. G.

doi:10.1134/s1054661816030226

Cited by 7 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, Zhao et al 28 adopted the Rényi entropy in place of Shannon entropy to reduce the effects of local extremes to the registration function. Voronov and Tashlinskii 29 compared the gradient of different entropies, where the probability function is described by the Gauss-Parzen window function. It is concluded that the Shannon entropy has the lowest computational complexity, while Rényi and Tsallis entropies provide a faster convergence rate and lower variance of parameter estimates.…”

Section: State Of the Artmentioning

confidence: 99%

Two-dimensional forward-looking sonar image registration by maximization of peripheral mutual information

Song

Herrmann

et al. 2017

International Journal of Advanced Robotic Systems

View full text Add to dashboard Cite

Monitoring the field of operation of an underwater vehicle is crucial during missions near the sea floor. The forwardlooking sonar is often the only available sensor for the observation of the ambient turbid water environment. Sonar image registration is not only a first step towards a panoramic mosaic but it also provides an initial motion parameter estimation for the vehicle self-localization and navigation. In this article, a peripheral mutual information (PMI) maximization method is proposed for the sonar image registration. Peripheral mutual information is inspired by regional mutual information (RMI) which makes use of the closed-form solution for the Shannon entropy by the assumption that the data vectors made of neighbouring pixels are normally distributed, an assumption that ignores correlations between the pixels in sonar images. To accommodate the fact that the neighbouring pixels show dependencies due to acoustic reverberation and dispersion, only the peripheral information in the neighbourhood of a pixel is used in peripheral mutual information for the calculation of the mutual information. Experiments show that the peripheral mutual information registration function is much smoother than that of regional mutual information. Further experiments on the two-dimensional forward-looking sonar image registration demonstrate the efficiency of peripheral mutual information.

show abstract

Section: State Of the Artmentioning

confidence: 99%

Two-dimensional forward-looking sonar image registration by maximization of peripheral mutual information

Song

Herrmann

et al. 2017

International Journal of Advanced Robotic Systems

View full text Add to dashboard Cite

show abstract

“…There are criteria allowing to identify the fragment with low error probability, such as above mentioned maximum of correlation index that can be calculated on whole image, or extremes of information-theoretical measures of images similarity [15]. But using such criteria causes large computational expenses.…”

Section: Error Probability In Case Of Searching For Multiple Fragmentsmentioning

confidence: 99%

The reliability of pattern-match searching for the fragment on image using set of pseudo-gradient procedures

Biktimirov¹,

Tashlinskii²

2017

Collection of Selected Papers of the III International Conference on Information Technology and Nanotechnology

View full text Add to dashboard Cite

The effectiveness of pattern-match searching for the fragment on image using set of pseudo-gradient procedures covering all initial image by their workplaces is studied. Procedures control is managed to reduce computational expenses and based on analysis of penalty function and giving priority of making next iteration to procedure that has minimum value of penalty. It is considered that required fragment belongs to the domain that has a procedure which is reached prescribed limit of iterations. If it is prior unknown if there is any required fragments on the initial image, the hypothesis of their absence should be tested. If the hypothesis is not confirmed than the scan for domains with fragments should be performed. Concerning there are fragments on the image the missing probabilities are found using penalty function and limit of iterations. Herein, the proposal is considered for single and multiple required fragments.

show abstract

“…With allowance for (1) the probability of demolishing of the estimates at the next iteration can be interpreted as the probability that the projection of the gradient of the SM gradient on the axis of this parameter will be negative. In [15] this characteristic was used to find the error in estimates of the parameters of inter-frame spatial deformations of images formed by relay procedures of the form (1). However, this approach can be used for recurrent procedures of other classes.…”

Section: Problem Formulationmentioning

confidence: 99%

Effectiveness of correlation and information measures for synthesis of recurrent algorithms for estimating spatial deformations of video sequences

Tashlinskiy¹,

Zhukova²

2017

Collection of Selected Papers of the III International Conference on Information Technology and Nanotechnology

View full text Add to dashboard Cite

A comparative analysis of the efficiency of correlation (cross-correlation, Tanimoto coefficient and Kendall's rank correlation coefficient) and information (mutual information of Tsallis and Shannon, F-information measure and entropy of the joint probability distribution) measures of image similarity for the synthesis of recursive estimation algorithms is presented for the problem of estimating parameters of spatial deformations of a sequence of images. Unbiased additive Gaussian noise was used as an interfering factor in the experimental studies. It is shown that the potentially high convergence rate of the estimated parameters and the smaller variance of the estimation error from the investigated correlation measures are ensured by the Tonimoto coefficient, and from the I-information of the F-information among the information measures. According to these criteria, the Kendall's rank correlation coefficient and the M-measure of F-information are inferior, respectively.

show abstract

Efficiency analysis of information theoretic measures in image registration

Cited by 7 publications

References 5 publications

Two-dimensional forward-looking sonar image registration by maximization of peripheral mutual information

Two-dimensional forward-looking sonar image registration by maximization of peripheral mutual information

The reliability of pattern-match searching for the fragment on image using set of pseudo-gradient procedures

Effectiveness of correlation and information measures for synthesis of recurrent algorithms for estimating spatial deformations of video sequences

Contact Info

Product

Resources

About