English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Hough transform is a popular low-level computer vision algorithm. Itscomputationally effective modification, Fast Hough transform (FHT), makes useof special subsets of image matrix to approximate geometric lines on it.Because of their special structure, these subset are called dyadic patterns.  In this paper various properties of dyadic patterns are investigated. Exactupper bounds on approximation error are derived. In a simplest case, this errorproves to be equal to $\frac{1}{6} log(n)$ for $n \times n$ sized images, aswas conjectured previously by Goetz et al.

Fast Hough Transform and approximation properties of dyadic patterns