메뉴 건너뛰기




Volumn 39, Issue 10, 1991, Pages 1511-1514

Highly Efficient Coding Schemes for Contour Lines Based on Chain Code Representations

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - ENCODING; COMPUTER SIMULATION; PROBABILITY;

EID: 0026240330     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.103046     Document Type: Article
Times cited : (62)

References (12)
  • 1
    • 84976683657 scopus 로고
    • Computer processing of line drawing images
    • Mar.
    • H. Freeman, “Computer processing of line drawing images,” Comput. Surveys, vol. 6, pp. 57–97, Mar. 1974.
    • (1974) Comput. Surveys , vol.6 , pp. 57-97
    • Freeman, H.1
  • 2
    • 84909719934 scopus 로고
    • On the encoding of arbitrary geometric configurations
    • June
    • _, “On the encoding of arbitrary geometric configurations,” IRE Trans. Electron. Comput., vol. EC-10, pp. 260–268, June 1961.
    • (1961) IRE Trans. Electron. Comput. , vol.EC-10 , pp. 260-268
  • 3
    • 0018280791 scopus 로고
    • Application of the generalized chain coding scheme to map data processing
    • Chicago, IL, May
    • _, “Application of the generalized chain coding scheme to map data processing,” in Proc. IEEE Comput. Soc. Conf. Pattern Recog. Image Processing, Chicago, IL, May 1978, pp. 220–226.
    • (1978) Proc. IEEE Comput. Soc. Conf. Pattern Recog. Image Processing , pp. 220-226
  • 6
    • 0022090008 scopus 로고
    • Encoding of arbitrary curves based on chain code representation
    • July
    • T. Kaneko and M. Okudaira, “Encoding of arbitrary curves based on chain code representation,” IEEE Trans. Commun., vol. COM-33, pp. 697–707, July 1985.
    • (1985) IEEE Trans. Commun. , vol.COM-33 , pp. 697-707
    • Kaneko, T.1    Okudaira, M.2
  • 7
    • 84939697805 scopus 로고
    • Efficient differential chain coding for line drawings processed by Hilditchs thinning method
    • June paper 2G.1.
    • Y. Yasuda and T. Kimot, “Efficient differential chain coding for line drawings processed by Hilditchs thinning method,” in Proc. Int. Conf. Commun., June 1982, paper 2G.1.
    • (1982) Proc. Int. Conf. Commun.
    • Yasuda, Y.1    Kimot, T.2
  • 8
    • 84938015047 scopus 로고
    • A method for construction of minimum-redundancy codes
    • Sept.
    • D.A. Huffman, “A method for construction of minimum-redundancy codes,” Proc. IRE, vol. 40, pp. 1098–1101, Sept. 1952.
    • (1952) Proc. IRE , vol.40 , pp. 1098-1101
    • Huffman, D.A.1
  • 9
    • 0000506580 scopus 로고
    • Generalized Kraft inequality and arithmetic coding
    • also in IBM Research Rep., RJ 1591, June
    • J. Rissanen, “Generalized Kraft inequality and arithmetic coding,” IBM J. Res. Development, vol. 20, pp. 198–203, May 1976, also in IBM Research Rep., RJ 1591, June 1975.
    • (1976) IBM J. Res. Development , vol.20 , pp. 198-203
    • Rissanen, J.1
  • 10
    • 0004091209 scopus 로고
    • Source algorithms for fast data compression
    • Ph. D dissertation, Dep. Elect. Eng., Stanford Univ., Stanford, Ca, May
    • R. Pasco, “Source algorithms for fast data compression,” Ph.D dissertation, Dep. Elect. Eng., Stanford Univ., Stanford, Ca, May 1976.
    • (1976)
    • Pasco, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.