In this work we present an error concealment scheme for damaged spatial blocks in image/video sequences. A promising error concealment approach in such a scenario is based on the projection onto convex sets (POCS)  method. If the two convex sets intersect, this algorithm guarantees a reconstructed block that will be smoothly connected with adjacent blocks without altering the correctly received adjacent blocks. If the two sets don't intersect, the algorithm oscillates between two points that are close to both properties. The POCS method has the additional benefit of edge continuity and preservation via edge detection and adaptive filters. However, one shortcoming of the algorithm is that it assumes a damaged block is surrounded by undamaged blocks. In this work we deal with the case where damaged blocks often are contiguous or located on the boundary of the image. This has potential application in some recently proposed low-complexity video coding algorithms [2,3] that rely on the coding with side information approach  to achieve compression as opposed to conventional motion compensation based approaches. We seek to generalize the POCS algorithm to incorporate these cases. Furthermore, we are investigating various methods of providing an initial estimate of the missing block for the POCS algorithm. Simple averaging techniques have been remarkably successful for individual missing blocks, but more elaborate methods are needed as the number of contiguous missing blocks increases.