2005
DOI: 10.1109/lsp.2005.843768
|View full text |Cite
|
Sign up to set email alerts
|

A linear-complexity distortion optimal scheme for the transmission of packetized progressive bitstreams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2005
2005
2010
2010

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 13 publications
0
11
0
Order By: Relevance
“…This optimization problem can be solved with an O(N L) complexity using the local search algorithm [25] or the distortion-optimal solution proposed in [26] and [24]. We have used the latter algorithm which solves L single variable optimization problems instead of solving an optimization problem with L decision variables.…”
Section: ) Modified Expected Distortion Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…This optimization problem can be solved with an O(N L) complexity using the local search algorithm [25] or the distortion-optimal solution proposed in [26] and [24]. We have used the latter algorithm which solves L single variable optimization problems instead of solving an optimization problem with L decision variables.…”
Section: ) Modified Expected Distortion Modelmentioning
confidence: 99%
“…We have used the latter algorithm which solves L single variable optimization problems instead of solving an optimization problem with L decision variables. It is shown in [26] that although the i-th optimization problem consists of i columns, only the first column has to be optimized.…”
Section: ) Modified Expected Distortion Modelmentioning
confidence: 99%
“…We refer to this algorithm as ROPT. Similarly, an optimal solution for the distortion optimization problem exists when the source has an exponential D-R curve [21]. This algorithm is referred to as DOPT.…”
Section: Coding Schemesmentioning
confidence: 99%
“…In the case of a packet erasure channel, distortion-based solutions exist that are optimal for general sources [23] and for sources with convex D-R curves [24], and it has been shown that an optimal rate-based solution is essentially an equally protected system [15]. In the case of a random bit-error channel and a source with an exponential D-R curve, efficient and optimal distortion minimization is possible [21]. Numerous other techniques can be found in the above references that find locally-optimal or suboptimal solutions with varying degrees of complexity.…”
Section: Introductionmentioning
confidence: 99%
“…Gradient-based techniques are also sensitive to the initial conditions, and may fail to find the global optimum. In [5], we introduced a linear complexity distortion minimization technique for channels that only introduce bit errors. This latter algorithm is globally optimal for sources with exponential DistortionRate (D-R) function (e.g., Gauss-Markov), and is also very effective for arbitrary progressively encoded sources.…”
Section: Introductionmentioning
confidence: 99%