DocumentCode :
3216505
Title :
Segmentation by minimum length encoding
Author :
Keren, Daniel ; Marcus, Ruth ; Werman, Michael ; Peleg, Shmuel
Author_Institution :
Dept. of Comput. Sci., Hebrew Univ. of Jerusalem, Israel
Volume :
i
fYear :
1990
fDate :
16-21 Jun 1990
Firstpage :
681
Abstract :
A digitized waveform is approximated by segments whose total description length is minimal for a given error bound. This approximation can be computed efficiently and can be used for segmentation. Some applications involving the use of one-dimensional methods to segment two-dimensional gray-scale and range images are shown
Keywords :
encoding; pattern recognition; digitized waveform; error bound; minimum length encoding; one-dimensional methods; range images; segmentation; two-dimensional gray-scale images; Computer errors; Computer science; Costs; Encoding; Image coding; Image segmentation; Polynomials; Probability; Robustness; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pattern Recognition, 1990. Proceedings., 10th International Conference on
Conference_Location :
Atlantic City, NJ
Print_ISBN :
0-8186-2062-5
Type :
conf
DOI :
10.1109/ICPR.1990.118191
Filename :
118191
Link To Document :
بازگشت