Hartley (unit)

Known as: Ban (unit), Dit (information), Dit (unit) 
The hartley (symbol Hart), earlier called a ban, or a dit (short for decimal digit), is a logarithmic unit which measures information or entropy… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1935-2018
05019352017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In this paper, a systematic method for developing a binary version of a given transform by using the Walsh-Hadamard transform… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper presents a new pipelined hardware architecture for the computation of the real-valued fast Fourier transform (RFFT… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2008
2008
A higher order scheme is presented for the optimal correction method of Kanatani [5] for triangulation from two views and is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Problems requiring accurate determination of parameters from image-based quantities arise often in computer vision. Two recent… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2003
2003
Hartley’s eight-point algorithm has maintained an important place in computer vision, notably as a means of providing an initial… (More)
  • figure 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The problems of unified efficient computations of the discrete cosine transform (DCT), discrete sine transform (DST), discrete… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1991
Highly Cited
1991
 
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The fast algorithm for the (real) Hartley transform has stimulated many publications, which are assessed in relation to the… (More)
  • figure I
  • table I
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A fast algorithm has been worked out for performing the Discrete Hartley Transform (DHT) of a data sequence of N elements in a… (More)
  • figure 1
  • table 3
  • table 1
Is this relevant?