2016 IEEE Statistical Signal Processing Workshop (SSP) 2016
DOI: 10.1109/ssp.2016.7551850
|View full text |Cite
|
Sign up to set email alerts
|

Weakly-supervised analysis dictionary learning with cardinality constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(6 citation statements)
references
References 15 publications
0
6
0
Order By: Relevance
“…In our preliminary work [16], a convolutive analysis dictionary learning approach under weak-supervision has been proposed. Here, we expand on the approach of [16]. We simplify the previous graphical model and re-derive all formulations.…”
Section: Discriminative Dictionary Learningmentioning
confidence: 99%
See 4 more Smart Citations
“…In our preliminary work [16], a convolutive analysis dictionary learning approach under weak-supervision has been proposed. Here, we expand on the approach of [16]. We simplify the previous graphical model and re-derive all formulations.…”
Section: Discriminative Dictionary Learningmentioning
confidence: 99%
“…Due to the deterministic rule between (Y j−1 nt , N j−1 nt ) and (Y j n(2t−1) , N j n(2t−1) ), (Y j n(2t) , N j n(2t) ) as proposed in (15) and (16), P (Y j−1 nt , N j−1 nt |Y j n(2t−1) , N j n(2t−1) , Y j n(2t) , N j n(2t) ) = I(Y j−1 nt = j n(2t−1) ∪Y j n(2t) )I(N j−1 nt = N j n(2t−1) + N j n(2t) ). Combining the above the equations, we obtain the update rule of the forward message passing on tree as:…”
Section: Appendix G Derivation Of Forward Message Passing On Treementioning
confidence: 99%
See 3 more Smart Citations