TY - GEN

T1 - Optimal lossy segmentation encoding scheme

AU - Schuster, Guido M.

AU - Katsaggelos, Aggelos K

PY - 1996/12/1

Y1 - 1996/12/1

N2 - In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon and consider the problem of finding the polygon which can be encoded with the smallest number of bits for a given maximum distortion. To this end, we derive a fast and optimal scheme which is based on a shortest path algorithm for a weighted directed acyclic graph. We further investigate the dual problem of finding the polygonal approximation which leads to the smallest maximum distortion for a given bit rate. We present an iterative scheme which employs the above mentioned shortest path algorithm and prove that it converges to the optimal solution. We then extend the proposed algorithm to the encoding of multiple object boundaries and introduce a vertex encoding scheme which is a combination of an 8-connect chain code and a run-length code. We present results of the proposed algorithm using objects from the 'Miss America' sequence.

AB - In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon and consider the problem of finding the polygon which can be encoded with the smallest number of bits for a given maximum distortion. To this end, we derive a fast and optimal scheme which is based on a shortest path algorithm for a weighted directed acyclic graph. We further investigate the dual problem of finding the polygonal approximation which leads to the smallest maximum distortion for a given bit rate. We present an iterative scheme which employs the above mentioned shortest path algorithm and prove that it converges to the optimal solution. We then extend the proposed algorithm to the encoding of multiple object boundaries and introduce a vertex encoding scheme which is a combination of an 8-connect chain code and a run-length code. We present results of the proposed algorithm using objects from the 'Miss America' sequence.

UR - http://www.scopus.com/inward/record.url?scp=0030378182&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030378182&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030378182

SN - 0819421030

SN - 9780819421036

T3 - Proceedings of SPIE - The International Society for Optical Engineering

SP - 1050

EP - 1061

BT - Proceedings of SPIE - The International Society for Optical Engineering

T2 - Visual Communications and Image Processing'96. Part 2 (of 3)

Y2 - 17 March 1996 through 20 March 1996

ER -