A new map-based approach to video de-interlacing using Forward-Backward algorithm

De-interlacing is revisited as the problem of assigning a sequence of interpolation methods (interpolators) to a sequence of missing pixels of an interlaced frame (field). With this assumption, our algorithm undergoes transitions from one interpolator to another as it moves from one missing pixel position to the next one. We assume that the next state depends only on the current state which implies a first-order Markov-chain on the sequence of interpolators. For estimation of the optimum sequence of interpolators our algorithm introduces a novel cost function and then makes use of Forward-Backward algorithm to find the global optimum sequence of interpolators. Simulation results prove that the proposed method is superior to the well-known de-interlacing algorithms proposed in this field.