Validation and Decomposition of Partially Occluded Images

Authors:
Costas S. Iliopoulos;Manal Mohamed
Affiliations:
-;-
Venue:
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Year:
2002

Citing 8
Cited 0

C++ primer

C++ primer
String searching algorithms

String searching algorithms
Quasiperiodicity and string covering

Theoretical Computer Science
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Optimal parallel analysis and decomposition of partially occluded strings

Parallel Computing
Efficient string matching: an aid to bibliographic search

Communications of the ACM
C++ for Programmers

C++ for Programmers
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A partially occluded image is the one that consists of a number of objects that are partially obstructed by others. This study is describing implementation details and experimental results for the on-line validation algorithms that were developed by Iliopoulos and Simpson for the exact images, and Iliopoulos and Reid [4] for k-approximate images. In the k-approximate images, for some small integer k 驴 0, we allowed the presence of errors in each occluded object appearing in the input and we used the unit cost edit distance as our measure of errors. We also investigate the decomposition of a given image into the set of (perhaps partially occluded) objects occurring in it.