Testing Connectedness of Images

We investigate algorithms for testing whether an image is connected. Given a proximity parameter ϵ ∈ ( 0 , 1 ) and query access to a black-and-white image represented by an n × n matrix of Boolean pixel values, a (1-sided error) connectedness tester accepts if the image is connected and rejects with...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 86; číslo 11; s. 3496 - 3517
Hlavní autoři: Berman, Piotr, Murzabulatov, Meiram, Raskhodnikova, Sofya, Ristache, Dragos-Florian
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2024
Springer Nature B.V
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Mathematics of Computing
Queries
Theory of Computation
Computational geometry
Sublinear algorithms
Property testing
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We investigate algorithms for testing whether an image is connected. Given a proximity parameter ϵ ∈ ( 0 , 1 ) and query access to a black-and-white image represented by an n × n matrix of Boolean pixel values, a (1-sided error) connectedness tester accepts if the image is connected and rejects with probability at least 2/3 if the image is ϵ -far from connected. We show that connectedness can be tested nonadaptively with O ( 1 ϵ 2 ) queries and adaptively with O ( 1 ϵ 3 / 2 log 1 ϵ ) queries. The best connectedness tester to date, by Berman, Raskhodnikova, and Yaroslavtsev (STOC 2014) had query complexity O ( 1 ϵ 2 log 1 ϵ ) and was adaptive. We also prove that every nonadaptive, 1-sided error tester for connectedness must make Ω ( 1 ϵ log 1 ϵ ) queries.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-024-01248-x