Sciweavers

1477 search results - page 25 / 296
» Complexity of (iterated) dominance
Sort
View
ICIP
1998
IEEE
16 years 7 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
JC
2008
77views more  JC 2008»
15 years 6 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...
VTC
2010
IEEE
140views Communications» more  VTC 2010»
15 years 4 months ago
Iterative Soft-In Soft-Out Sphere Detection for 3GPP LTE
—3GPP LTE has become a hot topic in recent years. One of its main challenges is the computationally intense task of MIMO detection. This paper investigates MIMO detection methods...
Mohammad Ali Shah, Björn Mennenga, Gerhard Fe...
VTC
2008
IEEE
16 years 14 days ago
Irregular Generic Detection Aided Iterative Downlink SDMA Systems
— When an iterative-decoding aided system is configured to operate at a near-capacity performance, an excessive complexity may be imposed by the iterative process. In this paper...
Chun-Yi Wei, Lajos Hanzo
ICIP
2002
IEEE
16 years 7 months ago
Overcomplete image coding using iterative projection-based noise shaping
Overcomplete transforms, like the Dual-Tree Complex Wavelet Transform, offer more flexible signal representations than criticallysampled transforms. Large numbers of transform coe...
Nick G. Kingsbury, Tanya Reeves