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

Niall P. Hurley

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

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

Theory of computation · 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.

Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing
signal representation
0.112009
Comparing measures of sparsity · IEEE Trans. Inf. Theory 2009
Information theory › signal processing
sparse representation
0.112009
Comparing measures of sparsity · IEEE Trans. Inf. Theory 2009
Information theory › signal processing › sparse representation
sparsity measure
0.112009
Comparing measures of sparsity · IEEE Trans. Inf. Theory 2009

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

pq-mean · 0.1gini index · 0.1
YearPublicationVenuePosition
2009 Comparing measures of sparsity
abstract
Sparsity of representations of signals has been shown to be a key concept of fundamental importance in fields such as blind source separation, compression, sampling and signal analysis. The aim of this paper is to compare several commonly-used sparsity measures based on intuitive attributes. Intuitively, a sparse representation is one in which a small number of coefficients contain a large proportion of the energy. In this paper, six properties are discussed: (Robin Hood, Scaling, Rising Tide, Cloning, Bill Gates, and Babies), each of which a sparsity measure should have. The main contributions of this paper are the proofs and the associated summary table which classify commonly-used sparsity measures based on whether or not they satisfy these six propositions. Only two of these measures satisfy all six: the pq-mean with p les 1, q > 1 and the Gini index.
Niall P. Hurley, Scott T. Rickard
IEEE Trans. Inf. Theory1