CONVERTING RUN CODE TO CHAIN CODE

Citations Over TimeTop 25% of 1981 papers

Abstract

Abstract The run code is easy to generate on-line from a video signal but the chain code is often more useful. A simple, fast algorithm is presented for constructing chain code from run code. The algorithm defines the order of preference of the next move for a “bug,” given its most recent move. The task for this bug is to travel right around the outermost edge elements of the object whose silhouette appears in the binary image. It is assumed that there is only one such object which may contain holes, although these are not coded by this simple algorithm. The algorithm generates a 4-value code whereas it is more usual to use an 8-value chain code which can be created by a simple method described by Freeman in his definitive work on the chain code.

Related Papers

• → Extending and analysis of X-Code(2011)4 cited
• → CONVERTING RUN CODE TO CHAIN CODE(1981)7 cited
• Dynamic Code Generation with the E-Code Language(2005)
• A Simple and a Retargetable Code Generator for TCGS(1995)
• → Code Optimisation(1979)