Is de-interlacing a NP complete problem?

[Raidum226]

We can say that if we get two interlaced line, we can make up the virtual line from choose a point from upper physical line and a point from lower physical line.

We know that it will always have solution but design a algorithm to pass all video pattern is very hard.

Is de-interlacing problem the most hard P problen?(Not NP-complete)