Pith. sign in

REVIEW 2 cited by

Convolutional Dictionary Learning: A Comparative Review and New Algorithms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1709.02893 v5 pith:BONF7VUH submitted 2017-09-09 cs.LG eess.IVstat.ML

classification cs.LGeess.IVstat.ML
keywords convolutionaldictionarysparsealgorithmsapproachesbeencomparisonseffective
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Convolutional sparse representations are a form of sparse representation with a dictionary that has a structure that is equivalent to convolution with a set of linear filters. While effective algorithms have recently been developed for the convolutional sparse coding problem, the corresponding dictionary learning problem is substantially more challenging. Furthermore, although a number of different approaches have been proposed, the absence of thorough comparisons between them makes it difficult to determine which of them represents the current state of the art. The present work both addresses this deficiency and proposes some new approaches that outperform existing ones in certain contexts. A thorough set of performance comparisons indicates a very wide range of performance differences among the existing and proposed methods, and clearly identifies those that are the most effective.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multivariate Convolutional Sparse Coding with Low Rank Tensor

    stat.ML 2019-08 conditional novelty 6.0 of 10

    A CP-low-rank convolutional sparse coding model for tensors is equivalent to Kruskal regression and is solved by an alternating algorithm that reconstructs signals with fewer nonzero activations than unconstrained ADMM.

  2. Blind Sparse Estimation of Intermittent Sources over Unknown Fading Channels

    eess.SP 2019-08 conditional novelty 6.0 of 10

    A two-stage dictionary-learning plus hidden-Markov-filtering method improves detection and recovery of intermittent sources over unknown flat-fading channels in simulations.

Pith tools