Computational complexity lower bounds of certain discrete Radon transform approximations

01/03/2018
by   Timur M. Khanipov, et al.
0

For the computational model where only additions are allowed, the Ω(n^2 n) lower bound on operations count with respect to image size n× n is obtained for two types of the discrete Radon transform implementations: the fast Hough transform and a generic strip pattern class which includes the classical Hough transform, implying the fast Hough transform algorithm asymptotic optimality. The proofs are based on a specific result from the boolean circuits complexity theory and are generalized for the case of boolean ∨ binary operation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2019

Root-Hadamard transforms and complementary sequences

In this paper we define a new transform on (generalized) Boolean functio...
research
02/19/2018

Ensemble computation approach to the Hough transform

It is demonstrated that the classical Hough transform with shift-elevati...
research
02/17/2022

Proofs, Circuits, and Communication

We survey lower-bound results in complexity theory that have been obtain...
research
03/30/2007

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

We present algorithms for the discrete cosine transform (DCT) and discre...
research
08/31/2007

Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations

We present algorithms for the type-IV discrete cosine transform (DCT-IV)...
research
07/01/2020

Effects for Efficiency: Asymptotic Speedup with First-Class Control

We study the fundamental efficiency of delimited control. Specifically, ...
research
02/19/2020

Fast Multi-Subset Transform and Weighted Sums Over Acyclic Digraphs

The zeta and Moebius transforms over the subset lattice of n elements an...

Please sign up or login with your details

Forgot password? Click here to reset