Matching for run-length encoded strings

Alberto Apostolico; Gad M. Landau; Steven Skiena

Matching for run-length encoded strings

Alberto Apostolico, Gad M. Landau, Steven Skiena

Research output: Contribution to conference › Paper › peer-review

Abstract

The need to approximately match run-length encoded strings emerged during development of an optical character recognition (OCR) system. This system, built in association with Data Capture Systems Inc., is designed to achieve a low substitution error-rate via fixed-front character recognition. The ith row or column of pixels in a given query character image will define a binary string containing a small number of white-black transitions. By comparing this run-length encoded string against the ith row or column of each of the character image-models, the similar can be identified. An algorithm which finds these longest common subsequences of strings X and Y in time polynomial in the size of the compressed strings is presented.

Original language	English
Pages	348-356
Number of pages	9
State	Published - 1997
Externally published	Yes
Event	Proceedings of the 1997 International Conference on Compression and Complexity of Sequences - Positano, Italy Duration: 11 Jun 1997 → 13 Jun 1997

Conference

Conference	Proceedings of the 1997 International Conference on Compression and Complexity of Sequences
City	Positano, Italy
Period	11/06/97 → 13/06/97

Bibliographical note

Funding Information:
* Work supported in part by NSF Grants CCR-9201078 and CCR-9700276, by NATO Grant CRG 900293, by British Engineering and Physical Sciences Research Council Grant GR L19362, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the EC under Contract 9072 (Project GEPPCOM). -Work supported in part by NSF Grants CCR-9305873 and CCR-9610238. This work is partially supported by ONR Award 431-0857A and NSF Grant CCR-9625669.

ASJC Scopus subject areas

General Engineering

Cite this

@conference{12cc1dc67a2b4839b34812b614f4a9f5,

title = "Matching for run-length encoded strings",

abstract = "The need to approximately match run-length encoded strings emerged during development of an optical character recognition (OCR) system. This system, built in association with Data Capture Systems Inc., is designed to achieve a low substitution error-rate via fixed-front character recognition. The ith row or column of pixels in a given query character image will define a binary string containing a small number of white-black transitions. By comparing this run-length encoded string against the ith row or column of each of the character image-models, the similar can be identified. An algorithm which finds these longest common subsequences of strings X and Y in time polynomial in the size of the compressed strings is presented.",

author = "Alberto Apostolico and Landau, {Gad M.} and Steven Skiena",

note = "Funding Information: * Work supported in part by NSF Grants CCR-9201078 and CCR-9700276, by NATO Grant CRG 900293, by British Engineering and Physical Sciences Research Council Grant GR L19362, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the EC under Contract 9072 (Project GEPPCOM). -Work supported in part by NSF Grants CCR-9305873 and CCR-9610238. This work is partially supported by ONR Award 431-0857A and NSF Grant CCR-9625669.; Proceedings of the 1997 International Conference on Compression and Complexity of Sequences ; Conference date: 11-06-1997 Through 13-06-1997",

year = "1997",

language = "English",

pages = "348--356",

}

TY - CONF

T1 - Matching for run-length encoded strings

AU - Apostolico, Alberto

AU - Landau, Gad M.

AU - Skiena, Steven

N1 - Funding Information: * Work supported in part by NSF Grants CCR-9201078 and CCR-9700276, by NATO Grant CRG 900293, by British Engineering and Physical Sciences Research Council Grant GR L19362, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the EC under Contract 9072 (Project GEPPCOM). -Work supported in part by NSF Grants CCR-9305873 and CCR-9610238. This work is partially supported by ONR Award 431-0857A and NSF Grant CCR-9625669.

PY - 1997

Y1 - 1997

N2 - The need to approximately match run-length encoded strings emerged during development of an optical character recognition (OCR) system. This system, built in association with Data Capture Systems Inc., is designed to achieve a low substitution error-rate via fixed-front character recognition. The ith row or column of pixels in a given query character image will define a binary string containing a small number of white-black transitions. By comparing this run-length encoded string against the ith row or column of each of the character image-models, the similar can be identified. An algorithm which finds these longest common subsequences of strings X and Y in time polynomial in the size of the compressed strings is presented.

AB - The need to approximately match run-length encoded strings emerged during development of an optical character recognition (OCR) system. This system, built in association with Data Capture Systems Inc., is designed to achieve a low substitution error-rate via fixed-front character recognition. The ith row or column of pixels in a given query character image will define a binary string containing a small number of white-black transitions. By comparing this run-length encoded string against the ith row or column of each of the character image-models, the similar can be identified. An algorithm which finds these longest common subsequences of strings X and Y in time polynomial in the size of the compressed strings is presented.

UR - http://www.scopus.com/inward/record.url?scp=0031385903&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0031385903

SP - 348

EP - 356

T2 - Proceedings of the 1997 International Conference on Compression and Complexity of Sequences

Y2 - 11 June 1997 through 13 June 1997

ER -

Matching for run-length encoded strings

Abstract

Conference

Bibliographical note

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this