CN101313566A - Optimally selecting TV programs with time margins - Google Patents

Abstract

A system (800), apparatus (700), and method are provided to select a best set of TV programs for reception and recording by at least one tuner, said TV programs being broadcast over a set of channels during a given time period [b, e] having a beginning time b and an ending time e. Partial and entire TV programs are considered and for each partial or entire TV program a user preference value is provided for its reception and recording. Further, pre-rolls and post-rolls are included in order to insure that partial TV programs are entirely received. A minimum-cost network algorithm is used that solves the selection and viewing problem but is not necessarily optimal. Additional time is allowed, before or after reception of a part of a TV program, to ensure that the entire part of the TV program has been received.

Description

Utilize the optimal selection of time margin to TV programme

The present invention relates to a kind of system, equipment and method, its, nargin was carried out (be similar to) optimal selection to the partial TV programs that will write down with the tuner that uses limited quantity in given interval service time, and distinguish following two states: behind record first program, switch to another TV channel, and keep being tuned to same channel by forcing to have time margin under the previous state in following.Part wherein is defined as some or all TV programme.

Personal video recorder (PVRS) is used in hard disk or DVD goes up record TV program.Usually use electronic program guides (EPG) to finish establishment by clicking the TV programme that will write down simply to these PVR.In addition, also adopted recommended device (recommender), its measurable spectators are for the degree of liking of the TV programme that will play.

Along with the increase of the available television channels that connects by ground, satellite or cable, to such an extent as to spectators select TV programme can not manually handle too greatly becoming rapidly with the task of watching and writing down.Along with the appearance of Digital Television, therefrom channel quantity of Xuan Zeing and number of options therefore become more.Therefore, spectators no longer can overview all available workout contents, become more likely and spectators will miss interested TV programme.

Because each week available TV programme enormous quantity, the TV Guide of printing is heavy, and has developed electronic program guides (EPG) and solved this problem.EPG presents the obtained TV programme of a plurality of channels on video screen.But, limited TV programme quantity once only can be shown on video screen, that is, the channel quantity of the part that illustrates on screen and time interval length are very limited.This is that low resolution by the video screen that is used to present this Word message is caused.And even if sufficiently high resolution is arranged, selecting from very a large amount of obtained television contents of task also will baffle General Visitors.

In order to improve problem spectators, that in various television channels, select any partial TV programs and how to arrange viewing time, i.e. exploitation guarantees to receive fully that the specific problem of watching plan of spectators of selected partial TV programs, EPG provide a kind of and searched for (filtration) by keyword (a plurality of) but do not allow time between selection to finish the option of its reception.In this mode, EPG can be reduced to controlled quantity with the quantity by spectators shielding and the TV programme selected, is caused the imperfect of partial TV programs by switching channels but can not handle.The other method that spectators reject the uninterested TV programme of a plurality of spectators is by the recommender system of use based on artificial intelligence (AI) technology, but there is imperfect problem equally in it.These AI recommender systems are safeguarded spectators' preference profile table, and what is indicated is that spectators like and dislike, and adopt this profile to be used to each TV programme that newly provides can like this TV programme that newly provides to what degree to give a mark with regard to spectators.Then, the TV programme that score surpasses the predetermined specific tolerance of spectators highlights on EPG, or the tabulation of these TV programme is provided to spectators.But the problem of these solutions is, it is overlapping that they do not consider whether TV programme has in time, so still will work out the specific plan of the spectators of the forward partial TV programs of score to receive, and to allow to have the enough time to be used to finish reception to selected portion between program for spectators.In other words, though filter and recommended device provide the tabulation of each TV programme, but such tabulation is an incomplete solution for the spectators' that create the TV programme plan that will watch problem, particularly when channel will switch between to its reception, have no idea between selected partial TV programs, to reserve the enough time so that it is finished.

There is similar situation for recording television programs.

Need a solution to be used in given interval effective selection to partial TV programs, this scheme allows the deadline when channel must switch, and when spectators only have limited quantity M 〉=1 tuner to can be used to the selected partial TV programs of receiving/recording, the viewer preference be scheduled to of maximization.

System of the present invention, equipment and method provide efficient algorithm, to guarantee that partial TV programs is carried out (being similar to) optimal selection, described selection comprises the time margin when carrying out switching channels between two continuous partial TV programs, and utilize the tuner of limited quantity to carry out, that is the selection of the summation of the viewer preference value that approximate maximization is associated with selected partial TV programs when guaranteeing reception fully.Here suppose that these preference informations are for being known using the present invention that the recommended device that available partial TV programs is carried out first filtration is provided before making (be similar to) optimal selection for example.

Given spectators want to select the time interval of partial TV programs, at first collect all partial TV programs that fall in this interval, and obtain the value function of each collected partial TV programs.Secondly, with the beginning of each partial TV programs and the node among the definite directed graph G of termination time point, and determine to have the S set of at least one partial TV programs in given interval in beginning and the termination time point.The 3rd, creation-time 0 source node and time ∞ sink nodes, and from the source through the G continuously according to the node of time sequencing to the sink nodes figure G that draws, promptly, from source node process G each created the center timeline or the chain on border continuously according to the node of time sequencing, wherein, each border has cost ' 0 ' and capacity M, and M 〉=1st wherein can be used for the quantity of the tuner of received television program.

Then, in order to distinguish at preset time place, be the similar timeline of the partial TV programs structure channel c that on each channel c, broadcasts among the S at television channel that receives and the television channel that also do not receive.Promptly, the node in being included in the center timeline, each TV programme of broadcasting on television channel c among the S further is divided into zero or more a plurality of partial TV programs, these partial TV programs with the beginning on the timeline of center and terminal node to expression, and has a not border on this center timeline but between the node of the timeline on the channel c, so that make only to begin to receive, and make each TV programme stop to receive in its termination time or in the time started of another TV programme in its time started or in the termination time of another TV programme for each TV programme.Each partial TV programs that obtains like this is added among the S, and has by the determined viewer preference value that is associated of spectators' particular value function.Shown in following detailed description like that, this restriction does not cause lose (theorem 1 of face as follows) of optimal result.

Therefore key of the present invention is, figure G comprises the center timeline, wherein for each television channel c, be included in the timeline of channel c whole and partial TV programs border from and to this center timeline continuity, wherein boundary representation these all with the negative preference value of partial TV programs, and whole and part wherein is contained in the S set.

At last, time margin is included in model as being extended to the borderline time difference of the timeline that is used for channel from the center timeline and promptly schemes G, wherein this time margin has been eliminated the parallel boundary in the timeline that is used for channel, and is that correct expression viewer preference value is needed in the timeline of this channel.

Given this directed graph G, use the minimum cost network algorithm thereon, this algorithm has been determined for given interval, the partial TV programs subclass S ' that is similar to maximum spectators' satisfaction is provided, that is, for the S set of partial TV programs ' the total viewer preference value of approximate maximization.Selected subclass is guaranteed it is that algorithm near-optimization and that select this subclass guarantees to run in the polynomial time.

The quantity of the TV programme that provides on the time t is provided Fig. 1;

Fig. 2 shows the directed graph of the TV programme of Fig. 1;

Fig. 3 shows and comprises expander graphs partial TV programs, that be used for Fig. 1 example;

Fig. 4 shows and comprises that expander graphs partial TV programs, that be used for Fig. 1 example, described partial TV programs have compensation and the linear value function of cost with TV programme A relevant border;

Fig. 5 shows the figure that is used for Fig. 1 example, and it is used for only showing the five minutes preposition videos of content of first channel and center timeline and the situation of rearmounted video;

Fig. 6 shows the figure that is used for Fig. 1 example, and it is used in the time only will receiving complete TV programme, have the situation of preposition video and rearmounted video;

Fig. 7 show according to of the present invention, be used to carry out equipment to the method for the optimal selection of partial TV programs; And

Fig. 8 shows the system that is used to receive, write down and show the partial TV programs set of selecting according to the present invention.

System of the present invention, equipment and method provide for given interval, have determined to see The mode of many optimum television experience, this experience comprise with at least one tuner watches and remembers The TV programme of record part preference.

System of the present invention, equipment and method provide to obtaining the TV programme meter to spectators Mathematical formulae and the solution strategy of the optimum solution of the problem of drawing. System of the present invention, equipment, Comprise with the scope of method: for all available TV programme of broadcasting in the section preset time, Based on predetermined viewer preference, select any TV Festival with the available tuner of giving determined number The problem that order is watched and recorded.

At first described the problem of simplifying and set, and succeeded by establishing in order to solve more complicated problem Fixed and comprise more multifactor and be customized in detail algorithm that this simplification problem develops, to this simplification The expansion that problem is set.

In the preferred embodiment of system of the present invention, equipment and method, at first carried out several hypothesis:

1, provides preference value or mark in a plurality of candidate's TV programme each, this candidate's TV programme has been had many preferences with the indication spectators;

2, clearly provide each preference mark by spectators or recommended device instrument;

3, by being sued for peace, the linearity of the preference mark of each TV programme of being provided provides total preference mark of selected TV programme quantity; And

4, suppose that selected TV programme of watching is just viewed in the moment that it is broadcasted; If TV programme is viewed after a while, only suppose that also it is recorded during it is broadcasted.

Wherein the problem of each simplification and expansion is modeled as directed graph, so that this problem is converted into the minimum cost network flow problem.Because the minimum cost network flow problem can solve by polynomial time, select problem so can effectively find the solution corresponding TV programme.

First model uses a tuner to select complete TV programme.Select the problem definition of complete TV programme as follows.

Definition 1 (program is selected problem (PSP)).Provided the S set of TV programme s, and also stipulated time started b for each TV programme s _sWith termination time e _sIn addition, for each TV programme, provided value v _s＞0, if this value has reflected the total value when watching (intactly watching) this TV programme.Problem is to determine subclass $S^{,}\⊆S,$ So that S ' in TV programme do not conflict in time, that is, and for all s, t ∈ S ', s ≠ t

b _s＞e _t V b _t＞e _s

And make by

$\underset{s\∈S^{\′}}{\mathrm{\Σ}}{v}_s$

The total value maximization of this subclass that provides.

The value v of TV programme _sCan clearly provide by spectators, maybe can use recommended device to assess.Suppose the recommender score p of TV programme s _sBe preference density, then total value is by v _s=p _s(e _s-b _s) provide.The total value that maximizes several TV programme s then in certain time interval is corresponding to this average preference's density of maximization.

TV programme selects problem can be formulated as minimum cost flow problem as described below.The node set V of network G is provided by source node and sink nodes, node wherein be used for TV programme each begin or the termination time.So,

$V=\{0,\∞\}\∪\underset{s\∈S}{\∪}\{b_s,e_s\},$

Wherein, node 0 expression source and ∞ represent to converge.With t ₁..., t _nThe node (that is, time) of expression among the V, wherein n representative time of can incremental order arranging.Here, suppose that all time is all greater than source time t ₁=0 and less than converging time t _n=∞.

Border set E comprises two parts.At first, according to definition, for all i=1 ..., n-1 comprises node boundary (t _i, t _I+1), have the border to have zero cost from the source to the timeline that converges.Secondly, for each TV programme s ∈ S, the adding cost is-v _sBorder (b _s, e _s).All borders all suppose to have capacity one.

For the example that figure makes up, consider set of TV shows as shown in Figure 1, it has contained TV programme A in the time interval from 18:00h to 22:00h, B ..., J.Following the providing of set V of corresponding time point:

F＝{0，18:00，19:00，19:30，20:00，20:30，21:00，22:00，∞}，

And the border set provides as shown in Figure 2.

Now, determining to have peaked non-overlapped subclass S ' is one stream from the source to the capacity that converges corresponding to search what have minimum cost in G.If corresponding to the border capacity of carrying of TV programme be one stream in this minimum cost stream, this TV programme can be included in the S ' so; Otherwise just be not included in wherein.Therefore, can solve this problem by the minimum cost flow algorithm.In other words, can effectively solve PSP.

As described in above-mentioned formula, all capacity all are one, and the minimum cost flow problem is reduced to shortest route problem (from the source to converge), and wherein (negative) cost is used as boundary length.

The minimum cost flow problem: given directed graph G=(V, E).Suppose to have cost c _IjWith capacity u _Ij=1, be associated with each border ij in the E, and demand (supply) b _vBe associated with each the node v in the V.This problem is to locate the stream of the minimum cost of supply/demand constraint of satisfying each node,

b _v＝∑ _jf _vj-∑ _jf _jv

And boundary constraint is,

0≤f _ij≤u _ij。

The cost of stream is defined as,

∑ _ij∈Ec _ijf _ij。

In the present invention, according to definition, the capacity on each border is 1.In addition, b ₁=-1, b _n=1, and for i=2 ..., n-1, b _i=0.

But whenever having more than a tuner time spent, but a plurality of TV programme of parallel receive just, and the TV programme selected in addition of record.This problem also relates to two stage TV drawing up a plan, wherein at first determines to receive what TV programme, then this TV programme is stored in the permanent memory, and then determines the TV plan according to all contents that have been recorded in the permanent memory.

Definition 2 (the multi-tuner program is selected problem (MPSP)).The S set of given TV programme, and for each TV programme s, given time started b _s, termination time e _s, and value v _sIn addition, give predetermined tuner quantity M.This problem is to determine subclass $S^{,}\⊆S$ So that in institute is free, that is, and for the free x of institute

|{s∈S′|b _s≤x＜e _s}|≤M，

Selected maximum M TV programme, and so that the maximization by

The total value of this subclass that provides.

MPSP can find the solution by the mode similar to PSP, use and the network flow conversion that is equal to as implied above.Unique difference is for MPSP, border (t _i, t _I+1) capacity become M with the reflection M tuner availability; The capacity on TV programme border remains one, because do not expect that program is received repeatedly.

Then, determine from the source, and each TV programme that carries (capacity the be one) stream in the minimum cost stream solution that finds at this of the corresponding border in its figure is included in the S ' once more to the minimum cost stream of the M that converges.

Then, above-described, as to be used for complete TV programs single tuner solution is expanded to comprise and only partly watch some TV programme.Be this purpose, for each TV programme s introduces value function v _s(l, r), expression is used at the open interval of part that [l watches the value of program during r), and has b _s≤ l≤r≤e _sValue function hereto, suppose:

v _s(b _s, e _s)=v _s, v _s(l ₁, r ₁)＞v _s(l ₂, r ₂If) $[l_1,r_1)\⊃[l_2,r_2),$ And v _s(x, x)≤0

Definition 3 (partial programme is selected problem (PPSP)).The S set of given TV programme, and for each TV programme s, given time started b _sWith termination time e _sIn addition, for each TV programme, set-point function v _sThis problem is for each TV programme s ∈ S, watches the set (may be empty) at the interval of this program during determining Wherein $b_s\&le;l_1<r_1<l_2<r_2<\&CenterDot;\&CenterDot;\&CenterDot;<l_{k_s}<r_{r_s}\&le;e_s,$

So that the selected interval of TV programme is not conflict in time.This means for all s, t ∈ S ', s ≠ t, and for all [l, r) ∈ I _s, [l ', r ') ∈ I _t, we have l 〉=r ' ∨ l ' 〉=r, that is, any interval of s or be later than any interval of t, perhaps opposite.Be noted that an interval accurately starts from another identical moment that stops at interval and allows, this is because we have used semi-open interval.Target be the maximization by

$\underset{s\&Element;S}{\mathrm{\&Sigma;}}\underset{[l,r)\&Element;l_s}{\mathrm{\&Sigma;}}{v}_s(l,r)$

The total value at the selected interval that provides.

Though value function almost can be any form, it is limited to protruding value function in the following discussion, and this link is below discussed.The form (it can more effectively be handled) of a strict more restriction is the linear value function with compensation, and it also will be discussed following.

Protruding value function

Protruding value function is for all α ∈ [0,1], the value function v that meets the following conditions:

v(αl ₁+(1-α)l ₂，αr ₁+(1-α)r ₂)≤αv(l ₁，r ₁)+(1-α)v(l ₂，r ₂)。

Most of actual value functions will satisfy this condition.The example of protruding value function be linear function as:

$v_s(l,r)=v_s\frac{r-l}{e_s-b_s}$

Or chi square function as:

$v_s(l,r)=v_s{\left(\frac{r-l}{e_s-b_s}\right)}^2$

Illustrated as following theorem, one of feature of protruding value function is the minimizing that it allows to switch to from a TV programme another possible number of spots.

Theorem 1.If for all TV programme s ∈ S, v _s(l is protruding r), and so, without any optimized loss, PPSP can be limited to for all s ∈ S and [l, r) ∈ I _sSolution

l∈{b _s}∪{e _t|t∈S}(1)

r∈{e _s}∪{b _t|t∈S}(2)

In other words, TV programme only begins to receive at the termination time place of its time started or another TV programme, and it only stops to receive at the time started place of its termination time or another TV programme.

Proof.Consider the interval [l, r) the ∈ I that do not satisfy (1) of TV programme s ∈ S _sJust before time l, must use the tuner of maximum quantity, this is because otherwise might reduce l and improve this solution.Because the reception of TV programme s is to take place from time l backward, the TV programme t ∈ S that stops to receive at time l must be arranged, that is, and for this TV programme I _tInclude at interval [l ', r '), r '=l.Because 1 does not satisfy (1), so r '＜e _tConsider now two replacement schemes, one is 1 by l ₁=1-ε replaces, and r ' is by r ₁'=r '-ε=l ₁Replace, also have one to be 1 by l ₂=l+ ε replaces, and r ' is by r ₂'=r '+ε=l ₂Replace.Compare with initial scheme, the cost of first scheme has following quantitative different with the value of initial scheme:

Δ ₁＝v _s(l-ε，r)-v _s(l，r)+v _t(l′，r′-ε)-v _t(l′，r′)

And the cost of alternative plan has following quantitative difference:

Δ ₂＝v _s(l+ε，r)-v _s(l，r)+v _t(l′，r′+ε)-v _t(l′，r′)

Therefore, it is followed

$\frac{{\mathrm{\&Delta;}}_1+{\mathrm{\&Delta;}}_2}{2}=\frac{v_s(l-\mathrm{\&epsiv;},r)+v_s(l+\mathrm{\&epsiv;},r)}{2}-v_s(l,r)$

$+\frac{v_t(l^{\&prime;},r^{\&prime;}-\mathrm{\&epsiv;})+v_t(l^{\&prime;}{,r}^{\&prime;}+\mathrm{\&epsiv;})}{2}-v_t(l^{\&prime;},r^{\&prime;})$

$\&GreaterEqual;0+0=0$

A wherein back inequality is based on v _sAnd v _tProtruding attribute.Therefore, differ from Δ ₁And Δ ₂In at least one be non-negative, that is, at least one in two replacement schemes is the same with initial scheme at least good.So people can increase l and r ' becomes e until them _tOr r (under latter event, [l, r] can be from I at interval _sIn remove) till, perhaps people can reduce l and r ' becomes b until them _sOr l ' (under latter event, [and l ', r ') can be from I _tIn remove) till, and do not have the loss of optimum voltinism.

In a similar manner, provablely suppose (2) and do not have the loss of optimum voltinism.

As the result of theorem 1,, just only must consider the beginning of limited quantity and stop partly to watch the time point of TV programme if value function is protruding.Based on this, the minimum cost network of Fig. 2 can be expanded as shown in Figure 3.The cost on TV programme border is determined by the value of TV programme appropriate section.The present optimal solution of optimum stream in expander graphs corresponding to PPSP.In such stream, can use a plurality of borders of each program, this is corresponding to the reception to TV programme in a plurality of interims.For example, the optimum stream I that may in expander graphs, pass across the border ₁And I ₇Extend, this means that TV programme I selects from 19:00-19:30 with from 20:00-21:00.Because having only capacity is one stream, so identical time interval l will not twice covering.In addition, select two continuous parts at the most with select that built-up section is the same (for example selects I well ₅At least with selection I ₁And I ₂Equally good), therefore can merge adjacent spaces (and if strict better words will merge automatically).

Though the boundary number in expander graphs is greatly more than in the initial graph, it still is that boundary is fixed with the multinomial.More precisely, the boundary number of each TV programme be the different time number of spots square.In addition, because have only a tuner, the quantity on border can be restricted to only best one between every pair of time point, therefore total boundary number is restricted to 0 (n ²).

The linear value function that has compensation

In this replacement scheme, further the form with value function is restricted to the linear function that has compensation, so that have early finishing the compensation of TV programme or beginning in evening TV programme.More formally, consider the form of value function

$v_s(l,r)=v_s\&CenterDot;\frac{r-l}{e_s-b_s}-p_s^{\mathrm{fe}}\left(r\right)-p_s^{\mathrm{sl}}\left(l\right)---\left(3\right)$

Wherein

If early finish or begin to provide respectively evening the function of compensation for TV programme s.It is also noted that this value function is observed this supposition and it is protruding, this is because all be protruding (that is, penalty function is recessed) all three of the right-hand side of (3).Value function in given (3), the minimum cost network of our another expansion of definable, it is as shown in Figure 4.More formally, this figure of structure as described below.

At first, node set V comprises and is used for each time point t ₁..., t _nNode.Then, has time point b for each _s=t _iAnd e _s=t _j, wherein the TV programme of j-i＞1 can be each interlude point,, is each k=i+1 that is ..., j-1 makes up additional node t _k ^sIn Fig. 4, indicate the example of the node of the interlude point that the node of " 19:00A " comes to this.

Under being defined in of border set (all have capacity one).At first, as previously mentioned, for all i=1 ..., n-1 has border (t _i, t _I+1) it has zero cost.Secondly, consider to have time point b _s=t _iAnd e _s=t _jEach TV programme s ∈ S,, distinguish following two kinds of situations once more:

If j-i=1 adds cost so and is-v _sBorder (b _s, e _s)

If j-i＞1 is added a plurality of borders so:

(i) having cost is

Border (t _i, t _I+1 ^s),

(ii) for each k=i+1 ..., j-2 has cost to be

Border (t _k ^s, t _I+1 ^s),

(iii) having cost is

Border (t _J-1 ^s, t _j),

(iv) for each k=i+1 ..., j-1, having cost is c _s ^FeBorder (t _k ^s, t _k),

(v) for each k=i+1 ..., j-1, having cost is c _s ^SlBorder (t _k, t _k ^s).

The PPSP that utilizes now the linear value function that has compensation is one minimum cost stream corresponding to search from the source to the capacity that converges in this figure.Once more, as utilize shown in the figure of Fig. 3, can select a plurality of parts of each TV programme.

For the stream in the figure with to the corresponding relation between the selection of partial TV programs, consider the example of Fig. 4 again.If the border (18:00,19:00A) and (19:00A, 19:30) all carrying capacity is one stream, then complete selection TV programme A on the border.Under this situation, (19:00 will not be 19:00A) with (19:00A 19:00) will carry stream on the border.Cost total at these previous two borderline streams is-V just _A, it is corresponding to the selective value V of TV programme A _AThe first of only selecting A corresponding to pass the border (18:00,19:00A) and (19:00A, capacity 19:00) is one stream, the result obtains cost-2V _A/ 3+c _A ^Fe, that is, be used for the value-2V of this first _A/ 3 and early finish the compensation c of A _A ^FeThe second portion of only selecting A corresponding to pass the border (19:00,19:00A) and (19:00A, capacity 19:30) is one stream, the result obtains cost-V _A/ 3+c _A ^Sl, that is, be used for the value-V of this second portion _A/ 3 and to beginning the compensation c of A evening _A ^Sl

The node in expander graphs and the quantity on border still are subject to the size of this example with multinomial because the total quantity of node be 0 (| S|n), and the quantity on border is:

0(n+|S|+|S|n)＝0(|S|n)。

The expansion of the next one of PSP is to allow a plurality of tuners and partial TV programs, this as make a definition given.

Definition 4 (the multi-tuner partial programme is selected problem (MPPSP)).The S set of given TV programme, and for the given time started b of each program s _sWith termination time e _sIn addition, provided value function v for each program s _s, and provided a quantity m tuner.This problem is to be each TV programme S ∈ S, determine during watch or the set (may be sky) at the interval of recording television programs,

Wherein $b_s\&le;l_1<r_1<l_2<r_2<\&CenterDot;\&CenterDot;\&CenterDot;<l_{k_s}<r_{r_s}\&le;e_s,$ So that can be with m tuner received television program in selected interval, that is, for the free x of institute, we have:

|{[l，r)∈I _s|s∈S∧l≤x＜r}|≤m，

And so that maximized by following formula:

$\underset{s\&Element;S}{\mathrm{\&Sigma;}}\underset{[l,r)\&Element;l_s}{\mathrm{\&Sigma;}}{v}_s(l,r)$

The total value at the selected interval that provides.

Unfortunately be that for the protruding value function with modification capacity, the direct simple application of aforesaid expander graphs is inoperative.Its reason is, in that expander graphs, people can walk abreast and select the several sections of the same television program that will receive.For example, for the example of the Fig. 3 with three tuners, last solution may be to want received television program I and partial TV programs I ₁And I ₅, this means that the TV programme part of 19:00-19:30 will be received three times.

However, for the linear value function that has compensation, figure as shown in Figure 4 is suitable for.Unique modification is that we have to once more with border (t _i, t _I+1) capacity be increased to m from 1, and must to find from the source to the capacity that converges be the minimum cost stream of m.The reason that this figure can be reused is, for each TV programme and each time interval, has a border to cover it at most, so part is not received more than once.

With reference now to Fig. 7,, show equipment (700) and be used for from memory module (701) the selection S set (701.1) of the given set that stores N 〉=1 a TV programme s, each TV programme has time started b _sWith termination time e _s, and the viewer preference function v that provides by spectators or recommended device _sFor a tuner, this value function is selected from the group that comprises convex function and the linear function that has compensation.For more than a tuner, this value function is the linear function that has compensation.This equipment also comprises processor module (702), and this module is carried out or itself also comprised and be used to select optimal set $S^{\&prime;}\&SubsetEqual;S$ Minimum cost network algorithm module, wherein this optimal set comprises the partial TV programs that will receive and may write down by M 〉=1 tuner (703).

Preferred embodiment comprises preposition video and rearmounted video: may have some inaccuracy on time started of program and termination time.So if select program s to receive, for program receiving intactly, tuner is from time ε so _c(b _s)≤b _sUntil time λ _c(e _s) 〉=e _sTill must transfer to corresponding channel c.Here, ε _c(t) be designated as the reception plan since the content of time t, should be from how early transferring to the function of channel c, and λ _c(t) then indicate the content of planning till the time t, should transfer to channel c till many evenings in order to receive.Suppose ε _cAnd λ _cBe strictly increasing.

b _s-ε _c(b _s) amount be called the preposition video of program s, and λ _c(e _s)-e _sAmount be called the rearmounted video of program s.The preposition video of program selects the main influence of problem to be if receive two continuous programs with identical tuner with rearmounted video to program, and these programs are on different channel, so if complete program receiving, then at first segment purpose plan termination time e _sPlanned start time b with second program _sBetween some times should be arranged.Two continuous programs on same channel then do not have such situation.

In order to reflect the fact of need longer interval obtaining the value fully of the program s on the channel c, the value function that in (3), provides be redefined into:

$v_s(l,r)=v_s\&CenterDot;\frac{r-l}{{\mathrm{\&lambda;}}_c\left(e_s\right)-{\mathrm{\&epsiv;}}_c\left(b_s\right)}-p_s^{\mathrm{fe}}\left(r\right)-p_s^{\mathrm{sl}}\left(l\right),---\left(4\right)$

Wherein penalty function also be redefined into:

As selection, penalty function can be redefined into:

The penalty function of these back has reflected that compensation becomes more less, then the more time is included in outside the terminating point.Because these penalty functions remain recessed, so the value function that redefines (4) remains protruding.So, can use theorem 1, unique consideration is the starting point ε that has revised, be used to begin or stop program receiving _c(b _s) and terminating point λ _c(e _s).

Definition 5 (program that has preposition video and rearmounted video is selected problem (PSPR)).The set C of given channel is for each channel c given morning of function ε _cWith late function lambda _cIn addition, provided the S set of TV programme, provided time started b by (4) for each program s _s, termination time e _s, and (redefining) value function v _sAt last, provided quantity M 〉=1 tuner.

This problem is to watch for each program s ∈ S, during determining or the interval set (may be empty) of recorded program:

Wherein

${\mathrm{\&epsiv;}}_{C_s}\left(b_s\right)\&le;l_1<r_1<l_2<r_2<\&CenterDot;\&CenterDot;<l_{k_s}<r_{r_s}\&le;{\mathrm{\&lambda;}}_{c_s}\left(e_s\right),$

So that needn't be transferred to more than M channel in the identical time again, promptly for the free x|{c of institute _s| s ∈ S ∧ [l, r) ∈ I _s≤ x＜r}|≤M,

And so that by

$\underset{s\&Element;S}{\mathrm{\&Sigma;}}\underset{[l,r)\&Element;l_s}{\mathrm{\&Sigma;}}{v}_s(l,r)$

Total value that provide, selected interval is maximized.

For PSPR, suppose that the TV programme on special channel is not overlapping in time, that is, for all s, t ∈ S, s ≠ t, and c _s=c _t, [b _s, e _s) ∩ [b _t, e _t)=Ф.The selected interval of noting two such TV programme may be overlapping, and still utilize identical tuner to receive simultaneously.For example, for the example of Fig. 1, supposing has 5 minutes preposition video and rearmounted video, then can select to be used for program A the interval [17:55,19:35) and be used for program B the interval [19:25,20:05) because they are on same channel.

Be seen as the minimum cost flow problem, because preposition video and rearmounted video, make up one wherein for the correct modeling of cost and wherein can not to select program corresponding diagram repeatedly in the identical time interval be not inessential just.Therefore, made up figure as shown in Figure 5, but it there is following shortcoming: can not obtain all possible solution, only can guarantee correspondingly that therefore this solution will be near optimum (following will further discussing) to PSPR.Fig. 5 shows for having five minutes the preposition video and figure situation, that be used for Fig. 1 example of rearmounted video, wherein only shows the content of first channel and center timeline.At this timeline place, center, symbol ' b ' and ' represent respectively e ' be the time started or the termination time of TV programme by express time point, wherein Fu Jia subscript is represented each TV programme.Then, defined below:

On channel c all are starting point early;

The late starting point of on channel c all;

The starting point early of all on channel c not;

The late starting point of all on channel c not;

$T^b=\underset{c\&Element;C}{\&cup;}{T}_c^b=\left\{{\mathrm{\&epsiv;}}_{c_s}\left(b_s\right)\right|s\&Element;S\},$ All of TV programme in S are starting point early; And

$T^e=\underset{c\&Element;C}{\&cup;}{T}_c^e=\left\{{\mathrm{\&lambda;}}_{c_s}\left(e_s\right)\right|s\&Element;S\},$ The late starting point of all of TV programme in S.

The set of all time points is provided by following formula:

T＝{0，∞}∪T ^b∪T ^c

Once more, by t ₁..., t _n, t wherein ₁=0, t _n=∞, and for all i=1 ..., n-1, t _i＜t _I+1, represent different time points with T.This figure comprises the center timeline once more, and it comprises and is used for each time point t _i, i=1 ..., the node of n, and the border (t that is used for every pair of continuous time point _i, t _I+1), i=1 ..., n-1.The capacity on these borders is set to m, and its cost is zero.

Then, define node and the border that is associated with each television channel c ∈ C.Shown in theorem 1, be tuned to channel c should start from that program on the television channel c wherein begins otherwise another television channel on the time point that finishes of program.The set of previous time point is by T _c ^bProvide, then the set of a time point is by T _c ^eProvide.Similarly, be tuned to channel c should end at that program on the television channel c wherein stops otherwise another channel on the time point that begins of program.The set of previous time point is by T _c ^eProvide, then the set of a time point is by T _c ^bProvide.

When calling in the time of starting from $t\&Element;T_c^b\&cup;T_{\stackrel{\&OverBar;}{c}}^e$ The time, for planning from time ε _c ^-l(t) reception of the content of channel c backward must, and when calling in the time of ending at $t\&Element;T_c^e\&cup;T_{\stackrel{\&OverBar;}{c}}^b$ The time, this means for planning time λ _c ^-1The reception of the content of the channel c (t) must.Therefore, introduced set

$T_c=\left\{{\mathrm{\&epsiv;}}_c^{-1}\left(t\right)\right|t\&Element;T_c^b\&cup;T_{\stackrel{\&OverBar;}{c}}^e\}\&cup;\{{\mathrm{\&lambda;}}_c^{-1}\left(t\right)|t\&Element;T_c^e\&cup;T_{\stackrel{\&OverBar;}{c}}^b\}$

Indicate broadcasting must want the time point of received content in the works from start to end.Now, will be with incremental order at T _cIn different time points be numbered t _C1..., t _Cnc, and be each time point t _Ci, i=1 ..., n _cIntroduce node in the drawings, and for T _cIn every pair of continuous time point, the introducing capacity is one border (t _Ci, t _{C, i+1}), i=1 ..., n _c-1.

Then, we add border (all have capacity 1) between the timeline of center timeline and channel c.For this purpose, each time point from the timeline of center $t\&Element;T_c^b\&cup;T_{\stackrel{\&OverBar;}{c}}^e$ Time point ε to the timeline of channel c _c ^-l(t) drawn borders.In addition, for each time point $t\&Element;T_c^e\&cup;T_{\stackrel{\&OverBar;}{c}}^b,$ Time point λ from the timeline of channel c _c ^-1(t) to the time point t drawn borders of center timeline.

At last, be border in the timeline of channel c and the boundary definition cost of travelling to and fro between the center timeline.For this purpose, consider each the TV programme s on the channel c, that is, and c _s=c.If t _CiAnd t _CjBe beginning and the termination time of program s, that is, and t _Ci=b _sAnd t _Cj=e _s(notice that these time points are really at T _cIn).Two kinds of situations can followingly be distinguished:

If ● j-i=1, then border (t _Ci, t _Cj) be given cost-v _s

If ● j-i＞1, then

(i) border (t _Ci, t _{C, i+1}) be given cost

(ii) border (t _{C, j-1}, t _Cj) be given cost

(iii) border (t _Ck, t _{C, k+1}), k=i+1 ..., j-2 is given cost

Border (the t of (iv) any i＜k＜j _l, t _Ck) be given cost And

(border (the t of v) any i＜k＜j _Ck, t _l) be given cost

Except giving cost 0 with other borders the coboundary.

For the program A on Fig. 5 mid band c, wherein b _A=t _C1And e _A=t _C4, the example on five types border is respectively:

(i) on the border of television channel c (18:00,18:50),

(ii) on the border of television channel c (19:10,19:30),

(iii) on the border of television channel c (18:50,19:10),

(iv) the border of timeline from the center timeline to television channel c (19:05,19:10), and

(v) the border from the timeline of television channel c to the center timeline (18:50,18:55).

The scheme that solves now PSPR be in the figure of above structure, find from the source to converge, capacity is the minimum cost stream of m.Stream leaves the time point t of center timeline _i, i=1 ..., n, when indication calls in television channel begins, and stream turns back to the time point of center timeline and then indicates when call in the television channel termination.In addition, having capacity on the timeline of television channel c is that the part in the received program is indicated on the border of 1 stream.

Solve above minimum cost flow problem and provided solution to PSPR, but have a difficult problem: not every solution to PSPR all can realize.For example, if three minutes preposition video and five minutes rearmounted video are arranged, so anyly be selected as the length that the interval that is used to call in corresponding television channel was at least eight minutes.In other words, can not realize very little tuning interval, this is because preposition video and rearmounted video are always arranged.In the practice, this will not be very serious restriction.Therefore, this algorithm will be optimum under actual conditions.In addition, the figure that is proposed can improve slightly, thereby loosens this restriction.

At last, part not and have only under the situation that complete program will receive, can significantly simplify constructed figure.So, set T _cOnly be included in the beginning and the termination time point b of the TV programme on the television channel _s, e _s, and only have the situation of j-i=1 to be applicable to any TV programme.Fig. 6 shows the resultant figure for this problem-instance, and any border that wherein has program marker s all has cost-v _s

With reference now to Fig. 7,, wherein show equipment (700) and be used for from memory module (701) the selection S set (701.1) of the given set that stores n 〉=1 a TV programme s, each program all has time started b _s, termination time e _s, and be redefined so that need longer interval to obtain the value function v of whole TV programme (part) _s, the latter is provided by spectators or recommended device.For a tuner, from the group that comprises convex function and the linear function that has compensation, select this value function.For more than a tuner, this value function is the linear function that has compensation.This equipment also comprises processor module (702), and its execution or itself also comprise minimum cost network algorithm module, and this algoritic module is used to select optimal set $S^{\&prime;}\&SubsetEqual;S,$ This optimal set comprises and will receive and partial TV programs that may write down, that have time margin by M 〉=1 tuner (703).

With reference now to Fig. 8,, system (800) comprises that the equipment of Fig. 7 selects to comprise for given interval and given viewer preference the TV programme optimal set of partial TV programs, scan the television set of the broadcast singal (704) that enters for the TV programme of selecting by the equipment (700) of Fig. 7, and be shown on the TV (801) by tuner (703) the selected partial TV programs of record and with it, all these are controlled/carry out by processor (702).

Though explained and described the preferred embodiments of the present invention, but skilled person will appreciate that, as described herein, be represented as based on maximization the value function of viewer preference spectators' satisfaction, be used to select to have system, equipment and the method for optimal set of the partial TV programs of preposition video and rearmounted video, be exemplary and can carry out variations and modifications and can carry out equivalence to replace element wherein and do not break away from essential scope of the present invention.In addition, also can carry out many modifications so that teaching of the present invention is adapted to special circumstances, for example various optimization algorithms and do not break away from center range of the present invention.Therefore, the invention is not restricted to realize the disclosed special embodiment of best mode of the present invention, but the present invention includes the whole embodiment in the scope that falls into described claims with expection.

Claims (20)

1, a kind of being used for starting from time b and ending at the method for the partial TV programs set of selecting viewer preference in section preset time [b, e] of time e, may further comprise the steps:

The set C of channel c (701.1) is provided, and each channel c has function ε morning that is associated _cWith late function lambda _cTo revise the beginning and the termination time of the partial TV programs that will on this channel, receive, to comprise at least one in preposition video and the rearmounted video;

The S set (701.1) of the partial TV programs s of specified quantity N 〉=1, each partial TV programs s has value function v _s, time started b _s, termination time e _s, and each program all receives by the channel c that provides;

Provide M 〉=1 tuner (703) to receive and recording section TV programme s ∈ S;

Make up directed graph G=(V, E), it comprises corresponding to the set of the node V of the described time started of each s that will receive by channel c and termination time and has the cost that is associated and the set of the border E of capacity that described figure connects:

-the beginning and the center timeline of terminal node, morning that each node all is associated respectively and late function (501) modification to be comprising preposition video and rearmounted video,

-for each channel c, be used for the beginning of each s (502) described channel c, that will pass through this channel reception and the timeline of terminal node, and

Each node of-center timeline has the respective nodes of at least one timeline that is used for channel c (503) according to pre-defined rule; And

Apply minimum cost network flow algorithm (702.1) to described directed graph G to determine subclass $S^{\&prime;}\&SubsetEqual;S,$ So that the value function v of maximization subclass S ' _s(l r), and receives the interior partial TV programs of described S ' and not conflict during the time period [b, e] by M 〉=1 tuner.

2, method according to claim 1, wherein each partial TV programs in the S set that on specific channel c ∈ C, receives not with described same channel c on any other TV programme overlapping in time.

3, method according to claim 1, the wherein said step that applies also is included in and calculates described value function v on the subclass S ' _sThe value function calculation procedure of linear summation.

4, method according to claim 1, wherein said regulation step comprise that also spectators or recommended device stipulate the step of described S set.

5, method according to claim 1, wherein said value function are the linear functions that has for the predetermined backoff of each performance of early finishing and the late performance that begins.

6, method according to claim 1, wherein said construction step is further comprising the steps of:

From the source node of time 0, by each s ∈ S modification time started b _sWith termination time e _sThe time of advent ∞ place meeting point, arrange the node and the border of center timeline (501) with incremental order; And

For each channel c, time started by each s that receives through channel c and termination time, arrange the node and the border of the timeline that is used for channel c (502) with incremental order.

7, method according to claim 6, wherein

Each border in the timeline of center all has capacity M 〉=1 and cost 0;

The cost that each border of each channel timeline all has capacity 1 and determines according to first preset function, the Section Point of described time point to be the content of TV programme s ∈ S determine will through channel c receive from its time point that begins and the time till it; And

Each border of connection center timeline and at least one channel timeline all has capacity 1, and connect respectively by described morning function and late function be revised as at least one channel timeline in corresponding time point b _sAnd e _sThe center timeline in each node b _sWith node e _s, described border has the cost of determining according to second preset function.

8, method according to claim 7, the wherein said step that applies also is included in upward value function calculating v of described subclass S ' _sThe step of linear total value.

9, method according to claim 8, wherein said regulation step comprise that also spectators or recommended device stipulate the step of described S set.

10, method according to claim 9, described value function are the convex functions that has each predetermined backoff of carrying out in performance of early finishing and the performance that begins evening.

11, a kind of equipment (700) that is used for receiving and transmitting the TV programme (704) of viewer preference during starting from time b and ending at section preset time [b, e] of time e comprising:

Memory module (701) comprises quantity N 〉=1, is numbered s=1 ..., the S set of the TV programme of the viewer preference of n, each program all has time started b _s, termination time e _s, and value function v _s

Quantity is the tuner (703) of M 〉=1, is used for receiving the TV programme s of (and record) S; And

Processor module (702) is configured to: operating part program model formation module is carried out formulism, it is stored in the directed graph G that in the memory (701), also therefrom generates the partial TV programs with preposition video and rearmounted video with the partial programme model among the pair set S; And carry out minimum cost network algorithm module and receive and record with the subclass of the described memory of access with the figure G of the partial TV programs selecting to be generated, make that so selected partial TV programs subclass can be by a plurality of tuners receptions at [b of the described time interval, e] in do not conflict, and maximize value function on the described subclass.

12, a kind of plan is comprised by the system (800) of the television-viewing session of the partial TV programs of viewer preference:

Television set (801) is used to watch TV programme; And

Equipment according to claim 11 (700), be used for during the predetermined time interval with time started b and termination time e [b, e], selecting and receiving the TV programme of viewer preference and on TV (801), show the TV programme that receives to small part.

13, a kind of equipment (700) that is used for receiving and transmitting the TV programme (704) of viewer preference during starting from time b and ending at section preset time [b, e] of time e comprising:

Memory module (701) comprises the data of the S set of describing quantity N 〉=1 viewer preference TV programme s, and wherein each TV programme s has time started b _s, termination time e _s, and value function v _s

The set of M 〉=1 tuner (703), it is used for receiving and writing down the partial TV programs s of S; And

Processor module (702) is arranged to use data and the tuner be contained in the memory module (701), describe S set to gather the method according to claim 1 of carrying out.

14, a kind of equipment (700) that is used for receiving and transmitting the TV programme (704) of viewer preference during starting from time b and ending at section preset time [b, e] of time e comprising:

Memory module (701) comprises the data of the S set of the TV programme s that describes quantity N 〉=1 viewer preference, and wherein each TV programme s has time started b _s, termination time e _s, and value function v _s

The set of M 〉=1 tuner (703), it is used for receiving the partial TV programs s of (and record) S; And

Processor module (702) is arranged to use be contained in data and tuner in the memory module (701), that describe S set and gather the method according to claim 4 of carrying out.

15, a kind of plan is comprised by the system (800) of the television-viewing session of the partial programme of viewer preference:

Television set (801) is used to watch TV programme; And

Equipment according to claim 11 (700), be used for during the predetermined time interval with time started b and termination time e [b, e], select and receive the partial TV programs of viewer preference and on TV (801), show the TV programme that receives to small part.

16, a kind of plan is comprised by the system (800) of the television-viewing session of the partial programme of viewer preference:

Television set (801) is used to watch TV programme; And

Equipment according to claim 13 (700), be used at predetermined time interval [b with time started b and termination time e, e] during, the partial TV programs of selection and reception viewer preference also shows the TV programme that receives to small part on TV (801).

17, a kind of computer program that is stored in the memory (701), comprising: executable module is to carry out method according to claim 1 (702.1-3); And data module (701.1), it comprises the input that the method for claim 2 is arrived in channel set C and set of TV shows S conduct, and described S set comprises the partial TV programs s of quantity n 〉=1 preference, and each partial TV programs s has time started b _s, termination time e _s, and value function v _s

18, a kind of computer program that is stored in the memory (701), comprising: executable module is to carry out method according to claim 3 (702.1-3); And data module (701.1), it comprises channel set C and the set of TV shows S input as the method for claim 3, and described S set comprises the partial TV programs s of quantity n 〉=1 preference, and each partial TV programs s has time started b _s, termination time e _s, and value function V _s

19, a kind of computer program that is stored in the memory (701), comprising: executable module is to carry out method according to claim 9 (702.1-3); And data module (701.1), it comprises channel set C and the set of TV shows S input as the method for claim 4, and described S set comprises the partial TV programs s of quantity n 〉=1 preference, and each partial TV programs s has time started b _s, termination time e _s, and value function V _s

20, a kind of computer program that is stored in the memory (701), comprising: executable module is to carry out method according to claim 9 (702.1-3); And data module (701.1), it comprises channel set C and the set of TV shows S input as the method for claim 5, and described S set comprises the partial TV programs s of quantity n 〉=1 preference, and each partial TV programs s has time started b _s, termination time e _s, and value function V _s

Images