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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Krishnaiah Revuluri

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

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

Systems, architecture and hardware · 2 · 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
Image and video processing · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 50% Information theory · 50%

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

TopicWeightPapersLastEvidence papers
Image and video processing
fast transform algorithm		 0.011975
Image Data Processing by Hadamard-Haar Transform · IEEE Trans. Computers 1975
Image and video processing
image transform		 0.011975
Image Data Processing by Hadamard-Haar Transform · IEEE Trans. Computers 1975
Information theory › signal processing › signal representation
signal transform		 0.011974
Cyclic and Dyadic Shifts, Walsh-Hadamard Transform, and the H Diagram · IEEE Trans. Computers 1974
Algorithms and data structures › linear algebra › linear algebra algorithms › fast transforms
walsh-hadamard transform		 0.011974
Cyclic and Dyadic Shifts, Walsh-Hadamard Transform, and the H Diagram · IEEE Trans. Computers 1974

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

walsh-hadamard transform · 0.0spectral analysis · 0.0haar transform · 0.0graphical representation · 0.0
YearPublicationVenuePosition
1975 Image Data Processing by Hadamard-Haar Transform
abstract
A hybrid version of the Haar and Walsh-Hadamard transforms (HT and WHT) called Hadamard-Haar transform (HHT),is defined and developed. Efficient algorithms for fast computation of the (HHT), and its inverse are developed. (HHT)r is applied to digital signal and image processing and its utility and effectiveness are compared with other discrete transforms on the basis of some standard performance criteria.
Kamisetty Ramamohan Rao, M. A. Narasimhan, Krishnaiah Revuluri
 IEEE Trans. Computers3
1974 Cyclic and Dyadic Shifts, Walsh-Hadamard Transform, and the H Diagram
abstract
Cyclic and dyadic shifts of a periodic sequence are illustrated on the H diagram. Fast Walsh-Hadamard transform of the shifted (both cyclic and dyadic) sequence is represented graphically on the H diagram. The shift-invariant properties of the power spectrum are derived from these operations.
Krishnaiah Revuluri, Kamisetty Ramamohan Rao, M. A. Narasimhan, Nasir Ahmed 0001
 IEEE Trans. Computers1