Abstract
The recent availability of small personal digital assistants (PDAs) with a touchscreen and communication capabilities has been an influential factor in the renewed interest in telewriting, a technique for the exchange of handwritten information through telecommunications means. In this context, differential chain coding algorithms for compression of the handwritten ink are revisited. In particular, it is shown that the coding efficiency of multi-ring differential chain coding (MRDCC) is not always better when compared to single ring differential chain coding (DCC), as previously suggested. These algorithms were tested on over 300 handwritten messages using a relative compactness criterion and a per-length distortion measure. The probabilities of relative vectors in MRDCC and DCC are related, an expression for relative compactness in the MRDCC case is introduced, and the application of Freeman's criteria for the selection of the appropriate code for a family of curves is illustrated.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEE Proceedings - Vision, Image, and Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
