Loading web-font TeX/Math/Italic
Ronghui Tu - IEEE Xplore Author Profile
Subscribe
ADVANCED SEARCH

Author details

< Back

Ronghui Tu

Publications
5
Citations
22
Publications by Year
20062010
Co-Authors:
Image of author Ronghui Tu

Ronghui Tu

Affiliation

School of Information Technology and Engineering
University of Ottawa
Ottawa, ONT, Canada

Publication Topics

Biography

Ronghui Tu received the B.Sc. from Northern Jiaotong University, Beijing, China, in 2001 and the M.Sc. degree in computer science from the University of Ottawa, Ottawa, ON, Canada, in 2003, where she is currently pursuing the Ph.D. degree in the School of Information Technology and Engineering (SITE).,Her current research interests are on audio processing and communications.(Based on document published on 15 January 2007).
Publications
5
Citations
22
Publications by Year
20062010
Co-Authors:
Author's Published Works

Showing 1-5 of 5 results

  • Sort

Filter Results

Show

Sort By

Results

Is SP BP?

Ronghui Tu;Yongyi Mao;Jiying Zhao

IEEE Transactions on Information Theory
Year: 2010 | Volume: 56, Issue: 6 | Journal Article |
The survey propagation (SP) algorithm for solving k-SAT problems has been shown recently as an instance of the belief propagation (BP) algorithm. In this paper, we show that for general constraint-satisfaction problems, SP may not be reducible from BP. We also establish the conditions under which such a reduction is possible. Along our development, we present a unification of the existing SP alg...Show More

Is SP BP?

Ronghui Tu;Yongyi Mao;Jiying Zhao

Year: 2010 | Volume: 56, Issue: 6 | Journal Article |

Is SP BP?

Ronghui Tu;Yongyi Mao;Jiying Zhao

2007 IEEE Information Theory Workshop
Year: 2007 | Conference Paper |
Cited by: Papers (1)
In this paper, we investigate the problem how SP may be reduced from BP under certain Markov random field formalism of general constraint-satisfaction problems. We show that unlike the case of k-SAT problems, for general constraint satisfaction problems, certain extra manipulation of BP messages as well as some condition on the structure of the problem may be needed for BP to reduce to SP.Show More

Is SP BP?

Ronghui Tu;Yongyi Mao;Jiying Zhao

Year: 2007 | Conference Paper |

On the Interpretation of Survey Propagation

Ronghui Tu;Yongyi Mao;Jiying Zhao

2007 10th Canadian Workshop on Information Theory (CWIT)
Year: 2007 | Conference Paper |
Cited by: Papers (1)
In this paper, we unify survey propagation (SP) for constraint-satisfaction problems as "probabilistic token passing" algorithms. We show that the reduction of SP from belief propagation (BP) for general problems requires a modification of the BP message-passing rule, namely, introducing what we call a state-decoupling operation on the BP messages. This raises a question mark on the recent "folk b...Show More

On the Interpretation of Survey Propagation

Ronghui Tu;Yongyi Mao;Jiying Zhao

Year: 2007 | Conference Paper |

Speech Quality Evaluation: A New Application of Digital Watermarking

Libin Cai;Ronghui Tu;Jiying Zhao;Yongyi Mao

IEEE Transactions on Instrumentation and Measurement
Year: 2007 | Volume: 56, Issue: 1 | Journal Article |
Cited by: Papers (12)
Speech quality evaluation is an important research topic. The traditional way for speech quality evaluation is using subjective tests. They are reliable, but very expensive, time consuming, and cannot be used in certain applications such as online monitoring. Objective models, based on human perception, were developed to predict the results of subjective tests. The existing objective methods requi...Show More

Speech Quality Evaluation: A New Application of Digital Watermarking

Libin Cai;Ronghui Tu;Jiying Zhao;Yongyi Mao

Year: 2007 | Volume: 56, Issue: 1 | Journal Article |

On Generalized Survey Propagation: Normal Realization and Sum-Product Interpretation

Ronghui Tu;Yongyi Mao;Jiying Zhao

2006 IEEE International Symposium on Information Theory
Year: 2006 | Conference Paper |
Cited by: Papers (8)
A celebrated algorithmic discovery in solving constraint satisfaction problems, survey propagation (SP) and its generalization have recently demonstrated their power in areas of communications and data compression. It is known that under certain Markov random field (MRF) formalism of k-SAT problems, SP may be interpreted as an instance of belief propagation (BP). In this paper, we borrow the notio...Show More

On Generalized Survey Propagation: Normal Realization and Sum-Product Interpretation

Ronghui Tu;Yongyi Mao;Jiying Zhao

Year: 2006 | Conference Paper |

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.