Name
Abstract | ||
|---|---|---|
A partially occluded image consists of a set of objects where some may be partially occluded by others. Validating occluded images distinguishes whether a given image can be covered by the members of a finite set of objects, where both the image and the object range over identical alphabet. The algorithm presented here validates a one-dimensional image x of length n, over a given set of objects all of equal length and each composed of two parts separated by a transparent hole. |
Year | Venue | Keywords |
|---|---|---|
2009 | PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009 | valid image, approximate valid image, image decomposition |
Field | DocType | Citations |
Combinatorics,Finite set,Computer science,Alphabet | Conference | 0 |
PageRank | References | Authors |
0.34 | 7 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julien Allali | 1 | 64 | 8.16 |
| Pavlos Antoniou | 2 | 353 | 17.04 |
| Costas S. Iliopoulos | 3 | 1534 | 167.43 |
| Pascal Ferraro | 4 | 77 | 11.54 |
| Manal Mohamed | 5 | 102 | 12.62 |