Effective Recognition of Stereo Image Concealed Media of Interpolation Error with Difference Expansion

Interpolation Methods

In digital images, interpolation ensues at some stage. The process of finding the function value at a particular position lies between the samples. It occurs owing to resizing an image, or maps an image from one pixel to other. Each and every time increasing or reducing the number of pixels and remapping arise on the scenarios such as image rotation, lens distortion correction. Whenever the interpolation is performing, there might be some quality loss in the resultant image, and it can be minimized. The fundamental thought of interpolation is by knowing the data and calculates the values at some unknown point. By putting on the low pass filter over the discrete signal, the bandwidth can be reduced for a particular. The image quality can be greatly achieved based on the interpolation technique used.

The interpolation technique can be broadly divided into two categories namely statistical and deterministic interpolation technique. In the deterministic techniques, among the sample point certain variation can be considered. While in statistical method, the signal can be approximated by reducing the estimation error. When comparing to deterministic methods the statistical method are computationally inefficient. Occasionally two dimension interpolation is problematic to define. In case of gridded data n dimension interpolation function can be termed as the multiplication of n 1-dimension interpolation functions.

In the deterministic method the subsequent methods are used namely nearest neighbor, spline, and linear interpolation techniques.

Nearest Neighbor Interpolation or Pixel Replication

In this technique the nearest sample point on the input image is assigned to the corresponding output pixel. The kernel is defined in the following Equation 1,