|
1.IntroductionIn any efficient transmission system there must be visual data of low-cost transmission that enter into a prioritization protocol and are used up. The available low-cost bit streams cannot be increased. In the long run, the limited availability of these exhaustible bit streams would begin to act as a constraint on the performance of the transmission system. Within such a system, the “rent” component of profit for the transmission of visual data at present time can be defined as the difference between profit and transmission cost. It reflects the opportunity cost of transmitting a unit of visual information at time rather than conserving it for the future bit allocation. Thus, the time path of this rent has strong implications for the transmission. Of course, the exhaustibility of bit streams with low-cost transmission could restrict the efficiency at higher bit rates.1, 2, 3 Hence there is a concern for this problem and understanding its implications is essential to attaining efficiency in intertemporal models of progressive transmission. In fact, the issue of depletion in low-cost bit resources forces us to think about bit allocation over time: The more we allocate low-cost visual data for transmission at this time, the less that will be available at higher bit rates. For example, assuming that the rent component received from progressive transmission would steadily decrease as the low-cost bit resource is depleted, the system should prefer to transmit data at this time over conserving them for the future. The danger is that if the trends in rent component of profit shift from declining to rising at least temporarily over time, heavy losses may be incurred in the form of foregone transmission opportunities in the future. Therefore, it would be too risky to rely on predictions of a monotonic time path of the rent component for bit resources from models that predict steadily rising rents or steadily declining rents. Following Ref. 4, here we show the difficulty of predicting the rent component of profit. It warns us not to base long-term bit allocation decisions on extrapolations of the rent component of profit during a transitory phase of the oscillatory long-term path. For example, a progressive transmission scheme seeks the largest distortion reduction by ordering the coefficients by magnitude and transmitting the most significant bits first; whereas zero trees are used to the prediction of insignificant coefficients across scales to be efficiently represented as part of exponentially growing trees.5 It assumes therefore a declining rent component since the distortion reduction decreases over time and it becomes increasingly difficult to expect zero trees to occur, even though it is possible that the rent component shifts from declining to rising at least temporarily due to the complexity of the visual data. 2.Present Satisfaction Derived from Progressive Transmission over the FutureConsider a transmission system that chooses a rate of transmission at time given by bit allocation . This system takes as the profit that would be obtained by at , where is the unit profit derived from the transmission at time . Because, in general, most of the coding gain is at lower bit rates, an exponentially decaying factor , with , will be introduced in the analysis to be able to compute the discounted value of profit from transmission at future times using higher bit rates, with being the discount rate. It diminishes the weight given to future profits (at higher bit rates) in the summation of the satisfaction over all the bit rates to form a total score. The smaller the weight, the larger the discount rate . Within this model of transmission, the center is given by this intertemporal conflict between present and future bit use and its profits. Also, we assume that the total cost of transmission at time is given by a twice continuously differentiable function with being the cumulative bit streams transmitted by time : ; and is an index of the state of prioritization and transmission technologies at time , with measuring its incremental improvement over time due to optimal exploratory activity to build a knowledge base.6 For a given condition of prioritization and transmission technologies, the total transmission cost increases with the transmission rate at the present time as well as the cumulative bit streams transmitted by time . That is, we have that and . There is also a cost-reducing effect of exploratory activity to increase the knowledge level for prioritization and transmission, and so we have that . Then, the transmission system must simultaneously determine transmission rates that balance total profit from bit allocation with transmission costs. The objective is to maximize the present value of the satisfaction (value function) derived from progressive transmission over the future withand subject to constraints imposed by the initial conditions and the prioritization and transmission technologiesand given thatPontryagin’s maximum principle7 provides a solution to this optimization problem where the variable of control is the rate of transmission through which we expect to characterize the optimal transmission plan, and the variable of state is the cumulative bit streams transmitted by time . Thus, we can form the Hamiltonian of this optimization problem, using the equation of motion 2 We can derive the necessary conditions for solving this problem and then use them to establish the behavior of the rent component of profit. The canonical equation of the Pontryagin’s maximum principle,7 for the control variable is . Hence, maximizing with respect to the control variable , we obtain the necessary condition with .For the state and costate variables, we have the condition . Hence, differentiating with respect to the state variable gives the dynamic equation for with and . The key to understanding our interpretation of optimal control theory is the shadow value of the cumulative bit resources transmitted by time . The very definition of the shadow value originates from one of the relationships between the maximum principle and dynamic programming, namely, the shadow value (costate variable) is the rate of change of the satisfaction measure (value function) with respect to the change of the cumulative bit resource prioritized by time (state variable). Seen from a different vantage point, is just the shadow value of an unexploited unit of bit resource still available at time , or simply, the shadow value of the rent component of profit at time .For an interior optimum, , we must have that where represents the upper limit of the cumulative transmission.By solving the differential equation 6, we have that Thus, it follows that the shadow rent component of profit measures the discounted sum of the incremental transmission costs that an additional unit of bit resources transmitted at brings about in that period and over all future periods by increasing cumulative bit streams transmitted by time with .Following Ref. 4, we have that, on the optimal transmission path, the profit for the transmission at any time should cover the marginal transmission cost plus the shadow rent component of profit where and similarly .We can now examine the change of the rent component of profit and the optimal path of bit depletion for the transmission of visual data by differentiating Eq. 5 with respect to time and using Eq. 6 with and . It follows that the rent component of profit changes at a rate equal to the discount rate minus the ratio between and , which, in general, varies with time.Consider that and . From Eq. 8, it follows that Using L’Hôpital’s rule for , it follows that if , then , so we have that the limit of iswhich gives the behavior of over time.Substituting Eq. 8 into Eq. 6 and integrating by parts, it follows that with3.Behavior of the Rent Component of ProfitFrom Eqs. 8, 12, 13, it is evident that the shadow rent component of profit is complex, because it depends on the shape of and its rate of change with time. Thus can increase monotonically, monotonically decrease, remain constant, or change nonmonotically over time, depending on how the incremental cost of cumulative transmission varies with time, , and not the current marginal transmission cost at time . The optimal path of the rent component of profit does not need to have any particular relationship with movements in the marginal transmission cost . If increases (respectively, decreases) monotonically over time, (respectively, ), then from Eq. 13, it follows that increases (respectively, decreases) monotonically. In the case that takes a nonmonotonic form, then there exists a such that and in some interval of . From Eq. 12, and the continuity of and on , it follows that because by taking limit of Eq. 6 as and using Eq. 12. Then by Eqs. 13, 14, we have that there exits some for which . Hence it follows that will be nonmonotonic.Because some state of the art models seem to assume a declining rent component without any consideration to the behavior of the incremental cost of cumulative transmission , an interesting question is whether there exist special cases where the rent component of profit falls monotonically to zero regardless of the incremental cost of cumulative transmission. Effectively, assuming in the exponentially decaying factor that was used to compute the discounted value of profit from transmission at future times (i.e., we do not diminish the weight given to future profits), we have that Eq. 12 reduces to Then, since , we have thatand differentiating with respect to Thus it follows that, if we do not diminish the weight given to future profits in the summation of the satisfaction over all the bit rates to form a total score, then the rent component of profit falls monotonically to zero regardless of the shape of the incremental cost of cumulative transmission. However, in this special case, the underlying assumption (regarding the intertemporal conflict between present and future bit use and its profits) fails to note that, in general, most of the coding gain is at lower bit rates.Using Eq. 8, the path of the rent component of profit for particular definitions of the incremental cost of cumulative transmission can be seen:
4.ConclusionUnder the assumption of either oscillatory or increasing behavior of rent component of profit over time, heavy losses may be incurred in the form of foregone transmission opportunities in the future if the transmission system prefers to transmit data at this time over conserving (at least a part of them) for the future. It calls for a saving rate and an accumulation of low-cost bits at the present time than would be necessary in the case of a steadily declining rent component of profit. The system would then modify the transmission condition accordingly to render it dynamically efficient over time. AcknowledgmentsThis research was sponsored by the Spanish Board for Science and Technology (CICYT) under Grant No. TIC2003-00473. The authors thank Michael Bove for suggesting improvements to the original manuscript. ReferencesH. Wang,
G. M. Schuster, and
A. K. Katsaggelos,
“Rate-distortion optimal bit allocation for object-based video coding,”
IEEE Trans. Circuits Syst. Video Technol., 15
(9), 1113
–1123
(2005). 1051-8215 Google Scholar
C. Jianfei,
H. Zhihai, and
W. C. Chang,
“A novel frame-level bit allocation based on two-pass video encoding for low bit rate video streaming applications,”
J. Visual Commun. Image Represent, 17 783
–798
(2006). 1047-3203 Google Scholar
L. Zhijun and
D. G. Nicolas,
“An accurate bit-rate control algorithm for video transcoding,”
J. Visual Commun. Image Represent, 14 321
–339
(2003). https://doi.org/10.1016/S1047-3203(03)00018-X 1047-3203 Google Scholar
Y. H. Farzin,
“The time path of scarcity rent in the theory of exhaustible resources,”
Econom. J., 102 813
–830
(1992). 0013-0133 Google Scholar
B.-J. Kim,
Z. Xiong, and
W. A. Pearlman,
“Low bit-rate scalable video coding with 3D set partitioning in hierarchical trees (3D-SPIHT),”
IEEE Trans. Circuits Syst. Video Technol., 10 1374
–1387
(2000). https://doi.org/10.1109/76.889025 1051-8215 Google Scholar
J. A. Garcia,
R. Rodriguez-Sanchez, and
J. Fdez-Valdivia,
“Optimal exploratory effort to build knowledge for video transmission,”
Opt. Eng., 46
(2007)
(0091-3286) Google Scholar
L. S. Pontryagin,
V. G. Boltayanskii,
R. V. Gamkrelidze, and
E. F. Mishchenko,
“The mathematical theory of optimal processes,”
Wiley, Hoboken, NJ
(1962). Google Scholar
|