In this paper, we propose a framework for learning the parameters of registration cost functions--such as the tradeoff between the regularization and image similiarity term--with respect to a specific task. Assuming the existence of labeled training data, we specialize the framework for the task of localizing hidden labels via image registration. We learn the parameters of the weighted sum of s...

In this paper we present a method to estimate in real-time the position and orientation of a previously viewed planar patch. The algorithm is based on minimising the sum of squared differences between a previously stored image of the patch and the current image of it. First a linear model for projectively tracking a planar patch is introduced, then, a method to compute the 3D position and orien...

e o When errors are clearly visible, the blockiness of some artifacts distinguishes them from th riginal image content, suggesting a way of reducing these artifacts. Presumably, the human viewer k e identifies the artifacts by assuming the image does not have 8-pixel by 8-pixel block features. Bloc dge variance, the sum of squared differences between adjacent block edge pixels, is one simple s ...

In many computer vision algorithms, the well known Euclidean or SSD (sum of the squared differences) metric is prevalent and justified from a maximum likelihood perspective when the additive noise is Gaussian. However, Gaussian noise distribution assumption is often invalid. Previous research has found that other metrics such as double exponential metric or Cauchy metric provide better results,...

Optimal binary codes for pixel values are designed for accurate block matching in the fast motion estimation. The conventional binary block matching techniques reduce the computational complexity and the memory bandwidth for the motion estimation, but they degrade the matching accuracy. We find the optimal mapping function between the set of decimal numbers for uniformly quantized pixel values ...

A new fast full search algorithm for block motion estimation is presented, which is based on convolution theorem and number theoretic transforms. It can be used with common video coding standards such as H.263 and MPEG. The algorithm applies the sum of squared differences (SSD) criterion, and the encoded video quality is equivalent or even better than what is achieved with conventional methods,...

The Pearson-Fisher chi-squared test can be used to evaluate the goodnessof-fit of categorized continuous data with known bin endpoints compared to a continuous distribution, in the presence of unknown (nuisance) distribution parameters. Rayner and McAlevey [11] and Rayner and Best [9],[10] demonstrate that in this case, component tests of the Pearson-Fisher chi-squared test statistic can be obt...

the complexation reactions of some transition metal ions and 2-aminopyridine (2-ampy) were studied potentiometrically in aqueous solution at µ=0.1 m and 25 °c. the overall stability constants log β’s of all species are obtained by computer refinement of ph-volume data with using the best computer program. several models were tested and the best one accepted according to the least sum of squared...

Bio-medical Image Registration has greater impact on image analysis. Image Registration technique helps to align two images, which uses intensity of pixels as prime factor for registration. The images used for registration can be either mono-modal or multi-modal. The degradation of image is frequently observed during image acquisition itself, which affects registration considerably. The perform...

This paper presents the performance analysis of space-time trellis codes in orthogonal frequency division multiplexing system (STTC-OFDM) over quasi-static frequency selective fading channels by considering the effect of channel delay distributions on the code performance. The analysis shows that various channel delay distributions do affect the code performance. It also shows that a better cod...