This paper describes a video compression technique which utilizes the alternating projection theorem for convex sets. The image to be transmitted is determined to be in certain convex sets and parameters defining these sets are sent. The receiver can then use the method of successive projections to locate an image which is in the intersection of the sets. If the intersection is small then the image determined should be close to the desired image. The coder can be made more robust by easily adding additional convex sets or using it in conjunction with other coding schemes such as motion compensation.