Transmission of compressed video through a data network may involve loss of data owing to channel errors and/or congestion. To conceal the effect of such errors in perceived video quality, concealment schemes happen to be an important choice in terms of their pertinence to encoder-decoder models. This paper focuses on the scenario where error bursts do not extend to more than one frame of digital video. For this, there exist block-based and pixel-based concealment techniques and their applicability is often ruled by a trade-off between perceived video quality and computational complexity. The paper proposes a variable complexity concealment technique and compares the results with existing schemes qualitatively and quantitatively for a range of MPEG test sequences and macroblock loss rates.