Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Liwa Wang

dblp:53/6058 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, 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
1 paper
Audio and music processing · 50% Image and video processing · 50%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › image transform
gabor transform
0.011994
An efficient algorithm to compute the complete set of discrete Gabor coefficients · IEEE Trans. Image Process. 1994
Audio and music processing
time-frequency analysis
0.011994
An efficient algorithm to compute the complete set of discrete Gabor coefficients · IEEE Trans. Image Process. 1994
Algorithms and data structures › fourier transform
fast fourier transform
0.011994
An efficient algorithm to compute the complete set of discrete Gabor coefficients · IEEE Trans. Image Process. 1994

Methods — techniques the papers use, named apart from their topics

discrete gabor transform · 0.0FFT · 0.0
YearPublicationVenuePosition
1994 An efficient algorithm to compute the complete set of discrete Gabor coefficients
abstract
The discrete Gabor (1946) transform algorithm is introduced that provides an efficient method of calculating the complete set of discrete Gabor coefficients of a finite-duration discrete signal from finite summations and to reconstruct the original signal exactly from the computed expansion coefficients. The similarity of the formulas between the discrete Gabor transform and the discrete Fourier transform enables one to employ the FFT algorithms in the computation. The discrete 1-D Gabor transform algorithm can be extended to 2-D as well.
Liwa Wang, Chin-Tu Chen, Wei-Chung Lin
IEEE Trans. Image Process.1