scispace - formally typeset
Search or ask a question
Topic

Hartley transform

About: Hartley transform is a research topic. Over the lifetime, 2709 publications have been published within this topic receiving 79944 citations.


Papers
More filters
Book ChapterDOI
23 Feb 2000

11 citations

07 Apr 1992
TL;DR: A novel method of segmenting images into regions which contain linear or circular arc features is presented, based upon spectral properties, which are provided, over a range of scales, by the Multiresolution Fourier Transform.
Abstract: A novel method of segmenting images into regions which contain linear or circular arc features is presented. The feature models are based upon spectral properties, local estimates of which are provided, over a range of scales, by the Multiresolution Fourier Transform (MFT). The algorithm ensures that detected features both accurately model the data and are consistent across scale. A method of combining the primitive line and arc segments into more complex features is also considered. Some results from application of the algorithm to a number of natural and synthetic images are presented to illustrate its effectiveness in practical applications.

11 citations

Journal ArticleDOI
TL;DR: Theory and practice of an optical ambiguity processor based on space-variant joint Fourier transform holography and a different technique of implementing the matched filter correlator concept advanced by Vander Lugt are presented.
Abstract: Theory and practice of an optical ambiguity processor based on space-variant joint Fourier transform holography are presented. The approach evolves from the joint Fourier transform optical correlator concept, which represents a different technique of implementing the matched filter correlator concept advanced by Vander Lugt. Experimental demonstration using photographic film for signal recording and the thermoplastic device for hologram recording will be reported.

11 citations

Journal ArticleDOI
TL;DR: In this paper, a simple closed-form solution of the Fourier transform of a polygonal shape function is given. But this solution is restricted to a single polygon.
Abstract: The authors give a simple but creative closed-form solution of the Fourier transform of a polygonal shape function.

11 citations

Proceedings ArticleDOI
09 Sep 1997
TL;DR: A uniform algebraic framework for computing hybrid spectral transforms in an efficient manner is given, based on properties of the Kronecker product, which leads naturally to an algorithm for computing such transforms efficiently.
Abstract: We give a uniform algebraic framework for computing hybrid spectral transforms in an efficient manner. Based on properties of the Kronecker product, we derive a set of recursive equations, which leads naturally to an algorithm for computing such transforms efficiently. As a result, many applications of transforms like the Walsh transform and the Reed-Muller transform, which were previously impossible because of memory constraints, have now become feasible. The same set of recursive equations also gives a new way of explaining hybrid transform diagrams, an efficient data-structure for integer valued Boolean functions.

11 citations


Network Information
Related Topics (5)
Nonlinear system
208.1K papers, 4M citations
81% related
Image processing
229.9K papers, 3.5M citations
80% related
Optimization problem
96.4K papers, 2.1M citations
79% related
Feature extraction
111.8K papers, 2.1M citations
78% related
Matrix (mathematics)
105.5K papers, 1.9M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202311
202230
202110
202014
201915
201820