By Topic

Tree searched chain coding for subpixel reconstruction of planar curves

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sriraman, R. ; North West Instrum. Syst. Inc., Beaverton, OR, USA ; Koplowitz, Jack ; Mohan, S.

Coding schemes for the quantization of line drawings that outperform basic chain codes are investigated. First, subpixel accuracy reconstruction is obtained by a simple linear filtering of the chain code points, which achieves a factor-of-three to-four reduction in average reconstruction distortion for smooth curves. Second, the basic chain encoding schemes are generalized to a multipath-tree-searched encoding scheme. A variation of the (M,L)-algorithm is used to maintain M contending chain code paths in storage and choose the best path from these. Over a wide variety of source curves, tree-searched chain coding results in nearly an order of magnitude reduction in average reconstruction distortion over smoother chain codes. The performance improvement for curves is obtained with only a slight increase in bit rate over basic chain codes

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:11 ,  Issue: 1 )