Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l + |Y |k) time algorithm that computes their edit distance.
Classification of run-length encoded binary data
โ Scribed by T. Ravindra Babu; M. Narasimha Murty; V.K. Agrawal
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 152 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
Template-based volume rendering is a technique to accelerate volume ray casting. It does not trade off image quality for rendering speed. However, it still falls short of interactive manipulation of volume data, mainly owing to the ray-by-ray volume access pattern and the long ray path in the transp
Scaling run-length encoded binary patterns is quite useful in some instances of computer graphics, such as phototypesetting with variable-sized characters. A very simple method can be used to perform the scaling, which separates scaling along the direction of the runs and along the perpendicular. Th