Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ronald N. Bracewell
dblp:133/1520
· DBLP profile ↗
6ranked-venue papers
5as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 5 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
3 papers |
Image and video processing · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% | |
| Computer networks
1 paper |
Physical-layer communications · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing › image transform
domain transform |
0.0 | 3 | 1994 | Affine theorem for the Hartley transform of an image · Proc. IEEE 1994 Aspects of the Hartley transform · Proc. IEEE 1994 Fast two-dimensional Hartley transform · Proc. IEEE 1986 |
Image and video processing › image transform
hartley transform |
0.0 | 3 | 1994 | Affine theorem for the Hartley transform of an image · Proc. IEEE 1994 Aspects of the Hartley transform · Proc. IEEE 1994 Fast two-dimensional Hartley transform · Proc. IEEE 1986 |
Algorithms and data structures › linear algebra › linear algebra algorithms › fast transforms
fast hartley transform |
0.0 | 1 | 1987 | A three-dimensional DFT algorithm using the fast Hartley transform · Proc. IEEE 1987 |
Algorithms and data structures › numerical algorithms
transform algorithm |
0.0 | 1 | 1987 | A three-dimensional DFT algorithm using the fast Hartley transform · Proc. IEEE 1987 |
Image and video processing
spectral analysis |
0.0 | 1 | 1994 | Affine theorem for the Hartley transform of an image · Proc. IEEE 1994 |
Image and video processing
fast fourier transform |
0.0 | 1 | 1986 | Fast two-dimensional Hartley transform · Proc. IEEE 1986 |
Methods — techniques the papers use, named apart from their topics
multidimensional transform · 0.0fourier transform · 0.0affine coordinate transformation · 0.0fast transform algorithm · 0.0cas function decomposition · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Aspects of the Hartley transformabstractKnown in the signal processing literature mainly as a computational technique, the Hartley transform has proven to possess attributes in the physical world of experiment, especially in optics and microwaves. The Fourier transform, which has constituted the standard approach to spectral analysis, is understood both in the domain of numerical analysis and in the world of natural phenomena, gaining its central significance from the ubiquity of sinusoidal natural behavior; it also gains appeal from the convenience offered by complex variable analysis, which is a basic part of technical education. Computers, however, prefer real numbers, an attribute that first opened a niche for the Hartley transform. As applications have multiplied, and others open up, it will be helpful to understand the Hartley idea from more than one point of view. Several topics, including multidimensional transforms, the complex generalization, and microwave phase measurement by amplitude measurement only, are discussed with the intention of throwing light on the numerical and physical relationships between the Hartley and Fourier transforms.> Ronald N. Bracewell |
Proc. IEEE | 1 |
| 1994 | Affine theorem for the Hartley transform of an imageabstractMany well-known theorems for the two-dimensional (2D) Hartley transform are encapsulated in the affine theorem which is presented here and illustrated by example. The mode of presentation permits ready visualization of the effect on the spectral makeup when an object is subjected to a particular distortion as specified by the six disposable parameters of the affine coordinate transformation and of the effects of progressive distortion. By contrast, 2D Fourier transform pairs for images do not lend themselves to visualization in the same way. Affine transformations possess considerable flexibility and generality of a useful kind that arises from the property that a single 2D spectral component transforms into another single component. > Ronald N. Bracewell |
Proc. IEEE | 1 |
| 1992 | Planetary influences on electrical engineeringabstractThe author describes how Maxwell's equations are indebted to observations of Mars, Jupiter, and Saturn. The electromagnetic relations were derived in terms of a medium with 'small but real density' and with the capability of yielding elastically, but the mechanical origin to which the curl and div equations trace back is a surprise to many engineering students. Maxwell developed his ability to deal with waves by starting his career with a four-year study of the rings of Saturn, which constitute a rare, elastic medium subject to internal inverse-square forces. Applying the laws of motion, Maxwell deduced that electricity and magnetism should combine to support what he called an electromagnetic wave, whose velocity in that medium he could calculate. Meanwhile, observations of Jupiter's satellites revealed that light has a finite velocity. Knowing this value, Maxwell was able to propose that light itself might be electromagnetic. These foundations of modern electrical engineering thus rest firmly on astronomical observation of Mars, Jupiter, and Saturn. Astronomy has continued to contribute to many branches of electrical engineering.> Ronald N. Bracewell |
Proc. IEEE | 1 |
| 1987 | A three-dimensional DFT algorithm using the fast Hartley transformabstractA three-dimensional (3-D) Discrete Fourier Transform (DFT) algorithm for real data using the one-dimensional Fast Hartley Transform (FHT) is introduced. It requires the same number of one-dimensional transforms as a direct FFT approach but is simpler and retains the speed advantage that is characteristic of the Hartley approach. The method utilizes a decomposition of the cas function kernel of the Hartley transform to obtain a temporary transform, which is then corrected by some additions to yield the 3-D DFT. A Fortran subroutine is available on request. Hong Hao, Ronald N. Bracewell |
Proc. IEEE | 2 |
| 1986 | Fast two-dimensional Hartley transformabstractThe fast Hartley transform algorithm introduced in 1984 offers an alternative to the fast Fourier transform, with the advantages of not requiring complex arithmetic or a sign change of i to distinguish inverse transformation from direct. A two-dimensional extension is described that speeds up Fourier transformation of real digital images. Ronald N. Bracewell, Oscar Buneman, Hong Hao, J. Villasenor |
Proc. IEEE | 1 |
| 1985 | An imaging problem: Restoration of blurred digital characters
Ronald N. Bracewell |
Comput. Vis. Graph. Image Process. | 1 |