Fetching the paper…
Reading the bibliography…
The design of methods for inference from time sequences has traditionally relied on statistical models that describe the relation between a latent desired sequence and the observed one.
A. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inf. Theory , vol. 13, no. 2, pp. 260–269, 1967
1967
Earlier work this paper cites.
L. E. Baum, T. Petrie, G. Soules, and N. Weiss, “A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains,” The Annals of Mathematical Statistics , vol. 41, no. 1, pp. 164–171, 1970
1970
Earlier work this paper cites.
G. D. Forney, “The Viterbi algorithm,” Proc. IEEE , vol. 61, no. 3, pp. 268–278, 1973
1973
Earlier work this paper cites.
L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inf. Theory , vol. 20, no. 2, pp. 284–287, 1974
1974
Earlier work this paper cites.
J. Pearl, “Fusion, propagation, and structuring in belief networks,” Artificial Intelligence , vol. 29, no. 3, pp. 241–288, 1986
1986
Earlier work this paper cites.
C. M. Bishop, “Mixture density networks,” 1994. [Online]. Available: http://publications.aston.ac.uk/id/eprint/373/
1994
Earlier work this paper cites.
H.-L. Lou, “Implementing the Viterbi algorithm,” IEEE Signal Process. Mag. , vol. 12, no. 5, pp. 42–52, 1995
1995
Earlier work this paper cites.
S. M. Aji and R. J. McEliece, “The generalized distributive law,” IEEE Trans. Inf. Theory , vol. 46, no. 2, pp. 325–343, 2000
2000
Earlier work this paper cites.
G. D. Forney, “Codes on graphs: Normal realizations,” IEEE Trans. Inf. Theory , vol. 47, no. 2, pp. 520–548, 2001
2001
Earlier work this paper cites.
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans. Inf. Theory , vol. 47, no. 2, pp. 498–519, 2001
2001
Earlier work this paper cites.
Y. Weiss and W. T. Freeman, “On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs,” IEEE Trans. Inf. Theory , vol. 47, no. 2, pp. 736–744, 2001
2001
Earlier work this paper cites.
H.-A. Loeliger, “An introduction to factor graphs,” IEEE Signal Process. Mag. , vol. 21, no. 1, pp. 28–41, 2004
2004
Earlier work this paper cites.
G. McLachlan and D. Peel, Finite Mixture Models . John Wiley & Sons, 2004
2004
Earlier work this paper cites.
X. Lingyun and D. Limin, “Efficient viterbi beam search algorithm using dynamic pruning,” in Proc. International Conference on Signal Processing , 2004, pp. 699–702
2004
Earlier work this paper cites.
S. S. Haykin, Adaptive filter theory . Pearson Education India, 2005
2005
Earlier work this paper cites.
A. Goldsmith, Wireless Communications . Cambridge University Press, 2005
2005
Earlier work this paper cites.
D. Tse and P. Viswanath, Fundamentals of Wireless Communication . Cambridge University Press, 2005
2005
Earlier work this paper cites.
H.-A. Loeliger, J. Dauwels, J. Hu, S. Korl, L. Ping, and F. R. Kschischang, “The factor graph approach to model-based signal processing,” Proc. IEEE , vol. 95, no. 6, pp. 1295–1322, 2007
2007
Earlier work this paper cites.
P. Sadeghi, P. O. Vontobel, and R. Shams, “Optimization of information rate upper and lower bounds for channels with memory,” IEEE Trans. Inf. Theory , vol. 55, no. 2, pp. 663–688, 2009
2009
Earlier work this paper cites.
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in Proceedings of the 27th International Conference on International Conference on Machine Learning , 2010, pp. 399–406
2010
Earlier work this paper cites.
R. Vullings, B. De Vries, and J. W. Bergmans, “An adaptive Kalman filter for ECG signal enhancement,” IEEE Trans. Biomed. Eng. , vol. 58, no. 4, pp. 1094–1103, 2010
2010
Earlier work this paper cites.
G. E. Kirkelund, C. N. Manchon, L. P. B. Christensen, E. Riegler, and B. H. Fleury, “Variational message-passing for joint channel estimation and decoding in mimo-ofdm,” in Proc. IEEE GLOBECOM , Dec 2010, pp. 1–6
2010
Earlier work this paper cites.
E. Dahlman, S. Parkvall, J. Skold, and P. Beming, 3G Evolution: HSPA and LTE for Mobile Broadband . Academic Press, 2010
2010
Earlier work this paper cites.
F. Rusek and D. Fertonani, “Bounds on the information rate of intersymbol interference channels based on mismatched receivers,” IEEE Trans. Inf. Theory , vol. 58, no. 3, pp. 1470–1482, 2012
2012
Cited alongside, same era.
S. V. Venkatakrishnan, C. A. Bouman, and B. Wohlberg, “Plug-and-play priors for model based reconstruction,” in Proc. IEEE GlobalSIP , 2013, pp. 945–948
2013
Cited alongside, same era.
2013
Cited alongside, same era.
B. Kemp, “The sleep-EDF database online,” 2013. [Online]. Available: http://www.physionet.org/physiobank/database/sleep-edf
2013
Cited alongside, same era.
C. Novak, G. Matz, and F. Hlawatsch, “Idma for the multiuser MIMO-OFDM uplink: A factor graph framework for joint data detection and channel estimation,” IEEE Trans. Signal Process. , vol. 61, no. 16, pp. 4051–4066, Aug. 2013
2019
Later among the works it cites.
K. Yoon, R. Liao, Y. Xiong, L. Zhang, E. Fetaya, R. Urtasun, R. Zemel, and X. Pitkow, “Inference in probabilistic graphical models by graph neural networks,” in 2019 53rd Asilomar Conference on Signals, Systems, and Computers . IEEE, 2019, pp. 868–875
2019
Later among the works it cites.
V. G. Satorras, Z. Akata, and M. Welling, “Combining generative and discriminative models for hybrid inference,” in Advances in Neural Information Processing Systems , 2019, pp. 13 802–13 812
2019
Later among the works it cites.
D. Jiang, Y.-n. Lu, M. Yu, and W. Yuanyuan, “Robust sleep stage classification with single-channel EEG signals using multimodal decomposition and HMM-based refinement,” Expert Systems with Applications , vol. 121, pp. 188–203, 2019
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
E. Riegler, G. E. Kirkelund, C. N. Manchon, M. A. Badiu, and B. H. Fleury, “Merging belief propagation and the mean field approximation: A free energy approach,” IEEE Trans. Inf. Theory , vol. 59, no. 1, pp. 588–602, Jan. 2013
2013
Cited alongside, same era.
2014
Cited alongside, same era.
J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference . Elsevier, 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
S. Zheng, S. Jayasumana, B. Romera-Paredes, V. Vineet, Z. Su, D. Du, C. Huang, and P. H. Torr, “Conditional random fields as recurrent neural networks,” in Proc. IEEE CVPR , 2015, pp. 1529–1537
2015
Cited alongside, same era.
G. Lin, C. Shen, I. Reid, and A. van den Hengel, “Deeply learning the messages in message passing inference,” in Advances in Neural Information Processing Systems , 2015, pp. 361–369
2015
Cited alongside, same era.
2015
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
A. I. Humayun, A. S. Sushmit, T. Hasan, and M. I. H. Bhuiyan, “End-to-end sleep staging with raw single channel EEG using deep residual convnets,” in Proc. IEEE BHI , 2019
2019
Later among the works it cites.
N. Shlezinger, N. Farsad, Y. C. Eldar, and A. J. Goldsmith, “Data-driven factor graphs for deep symbol detection,” in Proc. IEEE ISIT , 2020
2020
Closest in time.
2020
Closest in time.
R. Ahmad, C. A. Bouman, G. T. Buzzard, S. Chan, S. Liu, E. T. Reehorst, and P. Schniter, “Plug-and-play methods for magnetic resonance imaging: Using denoisers for image recovery,” IEEE Signal Process. Mag. , vol. 37, no. 1, pp. 105–116, 2020
2020
Closest in time.
Z. Zhang, F. Wu, and W. S. Lee, “Factor graph neural network,” in Advances in Neural Information Processing Systems , 2020, pp. 8577–8587
2020
Closest in time.
N. Shlezinger, N. Farsad, Y. C. Eldar, and A. J. Goldsmith, “ViterbiNet: A deep learning based Viterbi algorithm for symbol detection,” IEEE Trans. Wireless Commun. , vol. 19, no. 5, pp. 3319–3331, 2020
2020
Closest in time.
P. Knobelreiter, C. Sormann, A. Shekhovtsov, F. Fraundorfer, and T. Pock, “Belief propagation reloaded: Learning BP-layers for labeling problems,” in Proc. IEEE CVPR , 2020, pp. 7900–7909
2020
Closest in time.
J. Xia, D. Deng, and D. Fan, “A note on implementation methodologies of deep learning-based signal detection for conventional MIMO transmitters,” IEEE Trans. Broadcast. , vol. 66, no. 3, pp. 744–745, 2020
2020
Closest in time.
T. Raviv, N. Raviv, and Y. Be’ery, “Data-driven ensembles for deep and hard-decision hybrid decoding,” in Proc. IEEE ISIT , 2020, pp. 321–326
2020
Closest in time.
S. Park, H. Jang, O. Simeone, and J. Kang, “Learning to demodulate from few pilots via offline and online meta-learning,” IEEE Trans. Signal Process. , vol. 69, pp. 226–239, 2020
2020
Closest in time.
C.-F. Teng and Y.-L. Chen, “Syndrome enabled unsupervised learning for neural network based polar decoder and jointly optimized blind equalizer,” IEEE Trans. Emerg. Sel. Topics Circuits Syst. , 2020
2020
Closest in time.
V. Monga, Y. Li, and Y. C. Eldar, “Algorithm unrolling: Interpretable, efficient deep learning for signal and image processing,” IEEE Signal Process. Mag. , vol. 38, no. 2, pp. 18–44, 2021
2021
Closest in time.
V. G. Satorras and M. Welling, “Neural enhanced belief propagation on factor graphs,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2021, pp. 685–693
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
N. Shlezinger, R. Fu, and Y. C. Eldar, “DeepSIC: Deep soft interference cancellation for multiuser MIMO detection,” IEEE Trans. Wireless Commun. , vol. 20, no. 2, pp. 1349–1362, 2021
2021
Closest in time.