|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
On the Performance of Chain Codes for Quantization of Line Drawings
February 1981 (vol. 3 no. 2)
pp. 180-185
| ASCII Text | x | ||
| Jack Koplowitz, "On the Performance of Chain Codes for Quantization of Line Drawings," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 2, pp. 180-185, February, 1981. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.1981.4767075, author = {Jack Koplowitz}, title = {On the Performance of Chain Codes for Quantization of Line Drawings}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {3}, number = {2}, issn = {0162-8828}, year = {1981}, pages = {180-185}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.1981.4767075}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - On the Performance of Chain Codes for Quantization of Line Drawings IS - 2 SN - 0162-8828 SP180 EP185 EPD - 180-185 A1 - Jack Koplowitz, PY - 1981 VL - 3 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
A class of quantization schemes is presented which generalizes various existing chain coding methods. For the general case, simple expressions are derived for the probabilities of the directional elements from which we can determine the number of curve points and the length of the quantized curve. These results allow for the comparison of performance of the various encoding schemes.
Citation:
Jack Koplowitz, "On the Performance of Chain Codes for Quantization of Line Drawings," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 2, pp. 180-185, Feb. 1981, doi:10.1109/TPAMI.1981.4767075
Usage of this product signifies your acceptance of the Terms of Use.