.png){kind=icon}
Return
Classification of run-length encoded binary data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2006.05.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In classification of binary featured data, distance computation is carried out by considering each feature. We represent the given binary data as run-length encoded data. This would lead to a compact or compressed representation of data. Further, we propose an algorithm to directly compute the Manhattan distance between two such binary encoded patterns. We show that classification of data in such compressed form would improve the computation time by a factor of 5 on large handwritten data. The scheme is useful in large data clustering and classification which depend on distance measures. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keywords:
non-lossy compression
classification of compressed data
run-length
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
.png){kind=icon}
