Title of Invention

A PROCESS FOR SCREENING AUDIOVISUAL PROGRAMMES AND A RECEIVER THEREFOR

Abstract A process for screening audiovisual programmes transmitted by a centre and received by a television receiver, programmes of a first type being broadcast on a first broadcasting service and being selectable by the user. The process comprising at the receiver level, the steps of screening a programme of a second type extracted from a second broadcasting service selected by the receiver. Screening at least one programme of a first type commencing at a first moment specified by the centre. Screening of a filler programme, said filler programme being screened following the screening of the second type programme and stopping at the start of the screening of the first type programme.
Full Text Method of receiving and of screening sequences of topic-
based audiovisual programmes, and receiver for
implementing the method.
The invention relates to a method of receiving and of screening
audiovisual programmes broadcast by a transmitter to receivers and more
especially when the programmes are selectable as a function of a specified
criterion. The invention also relates to the receivers for implementing the
method.
The invention applies more particularly to digital television
receivers/decoders. The network broadcasts audiovisual programmes more
commonly referred to as "events" and data intended for referencing them.
These data are for example defined in the DVE3-SI specifications ("Digital
Video Broadcast - specification for Service Information") EN 300 468 V1.3.1
(published by the ETSI). They take the form of tables and of descriptors
which describe the objects transmitted on the broadcasting network. A
service is an uninterrupted series of events broadcast on a specified stream.
The DVB-SI standard defines in particular the format of following
tables such as: NIT. SDT, EIT and possibly BAT. The NIT table gives the
general structure of the network and indicates the list of transport streams
and services broadcast. The SDT table gives additional information relating
to the services, for example the unencrypted name of a service. The EIT
table indicates a list of events for each service, and makes it possible in
particular to indicate the events currently being broadcast. The BAT table
contains information on several services clustered together into a bouquet of
services which can be output by several broadcasting networks.
With the aid of the data contained in these tables, the receiver knows
the general content of the audiovisual programmes broadcast by the
network. The user can thus search for programmes and services as a
function of certain criteria, such as topic.

Televised programmes are often intercut with relatively short
sequences composed for example of advertising flashes, or of information
flashes, or else of a video clip, or diverse audiovisual programmes whose
durations vary from about ten seconds to several minutes. These sequences
are broadcast, either between two events, or during an event. The user can
choose the event which he watches, this is the "current" event broadcast by
the "current" service but he does not choose the content of the sequences.
The short programmes making up the sequence have no topic related to the
current event. Hence, the viewer may grow weary of these sequences whose
content is of little overall interest to him. He might be inclined to change
services. The present invention makes it possible to offer the user
sequences of more interest to him.
The subject of the invention is a process for screening audiovisual
programmes transmitted by a centre and received by a television receiver,
programmes of a first type being broadcast on a first broadcasting service
and being selectable by the user, the process comprising at the receiver
level:
- a first step of screening a programme of a second type extracted from a
second broadcasting service selected by the receiver,
- a second step of screening at least one programme of a first type
commencing at a first moment specified by the centre,
and characterized in that it comprises a third step of screening a filler
programme, the said programme being screened following the screening of
the second programme and stopping at the start of the screening of the first
programme.
It should be noted straightaway that the audiovisual programmes to
which the present invention relates may be provided either by a
unidirectional or bidirectional network. The programmes of second type are
broadcast continuously on several services each corresponding to a
particular topic. At a precise instant of the current event, the data selected for

display are switched from the current service to the service broadcasting
programmes of second type. The broadcaster specifies the duration of
screening of the programmes of the second type. When this duration has
elapsed, the receiver switches the screening onto the current service. The
receiver selects the service broadcasting the programmes of the second
type. The sequence broadcast in the current service is thus replaced with a
sequence of programmes of second type whose topics correspond better to
a criterion specific to the receiver. The broadcasting of the various
programmes of second type is not synchronized with the sequences
specified in the announcement signals, this generally entailing the untimely
curtailing of at least one programme of second type, at the start and/or at the
end of the sequence. Moreover, the switching times are not negligible and
therefore, may entail the appearance of a black screen for a few instants. To
avoid this the present invention makes provision to replace the black screen
with a filler programme, this making it possible to eliminate any
discontinuities of the audiovisual programme. The receiver displays a filler
programme at the start and/or at the end of the sequence.
According to one embodiment, this criterion for selecting the filler
programmes corresponds to the profile of the user.
The announcement signal contains a temporal indication of the start
of the sequence. According to a particularly simple embodiment, the decoder
switches from the current service to a topic-based service following the
receipt of the announcement signal.
According to a particular embodiment, the receiver is furnished with a
memory for recording audiovisual programmes for real-time storage of the
programme of second type corresponding to the criteria stored in the
receiver. The programme currently being recorded is screened at the start of
the advertising sequence.
The subject of the invention is also a receiver of audiovisual
programmes comprising a means of receiving data broadcast from a network
consisting of at least one first service broadcasting programmes of a first

type which are selectable by the user and of a plurality of second services
broadcasting programmes of a second type, of a means of switching from
one service to another service and a means for sending the programmes to
a screening facility, characterized in that it comprises a means for interposing
a filler programme between a programme of a second type and a
programme of a first type received from the network.
Other characteristics and advantages of the present invention will
emerge from the description of the exemplary embodiments which will follow.
taken by way of nonlimiting examples, with reference to the appended
figures in which:
• Figure 1 represents a receiver implementing the invention,
• Figure 2 shows an exemplary appearance of a screen for the
programming of the display mechanism,
• Figure 3 represents the diagram of the mechanism for switching
services according to the invention,
• Figures 4 represent timing diagrams of the programme and
screening of the programmes according to a preferred
embodiment,
• Figures 5 represent timing diagrams for the broadcasting, storage
and screening of programmes according to an improvement,
• Figure 6 represents an exemplary appearance of a screen for the
programming of the various topics expected by a user.
A receiver according to the invention will first of all be described,
followed, as represented in Figure 3, by the mechanism for switching to the
services broadcasting programmes of the second type. Finally,
improvements and variant embodiments will be described.

A receiver according to the invention is described in Figure 1. The
receiver is, for example, a decoder in accordance with the DVB
specifications. It uses an ISO/IEC 13818-1 transport layer.
The decoder is linked to an antenna 1, itself linked to a tuner. We
shall see subsequently that there may be two of them. The signal provided
by the tuner is demodulated by a demodulator 3. The demodulated data are
deinterlaced and corrected by an error-correcting circuit 4 and sent to a
demultiplexer 5. The latter comprises a certain number of filters programmed
by a microprocessor 23 as a function of the various applications supported
by the decoder. The microprocessor 23 is connected to a memory 12
comprising the operating system as well as the resident or downloaded
programs for implementing applications. The memory is illustrated in the
form of a single block, but physically may comprise several blocks of
different kinds; random access memory RAM, read only memory ROM,
reprogrammable memory EEPROM or FLASH. The microprocessor is also
connected to a clock circuit 27. A character generator 15 allows the
generation of control or graphics menus relating to the parameters of the
decoder or to a particular application. The video signal generated is
multiplexed with one of the video signals originating from the video decoder
17 to a SCART socket linked to a television screen 22. The multiplexing
circuit 20 is managed by the microprocessor 23. For the clarity of the
diagram, only the most important connections of the microprocessor 23 are
illustrated.
The audio or video sections or packets filtered by the demultiplexer
are stored in predefined areas of a buffer memory 6. The decoder may also
comprise a hard disk 25 linked to the microprocessor with the aid of an
interface 26 allowing fast transfers of information. The decoder is also
furnished with a remote control 11, linked to the microprocessor by an
infrared link.
It was stated previously that the broadcasting network may be
unidirectional (over-the-air or satellite network) or bidirectional (by wire,
cable, Internet, for example). Specifically, it is unnecessary for the receiver to

send messages to the broadcaster via the same means of communication as
the network for broadcasting the audiovisual data. The broadcasting network
transmits so-called general services, the user selects the current service
from them so as to watch the current event. The network also transmits so-
called "topic-based" services. The topic-based services continuously
broadcast short audiovisual programmes (called "flashes" subsequently in
the document) possessing the same topic for a given channel. The list of
references for accessing the topic-based services as well as the topic
associated with each service is extracted from the NIT tables. A proprietor
field contains an indicator specifying that the service is "topic-based".
The programme memory of the decoder contains a software module
for Managing the Flashes, or GF module. One of the functions of this module
consists in creating the abovementioned array. The other functions will be
described subsequently.
The GF module comprises a programming part consisting in searching
for the topics broadcast and in receiving from the user the criterion for
selecting the flashes to be screened.
First of all, the decoder analyses the NIT tables in order to determine
the number and the topic of the topic-based services currently being
broadcast. The EIT table gives in particular the description of the content of
the events (and hence of the flashes which are short events), by virtue of its
descriptors. The descriptors authorize the coding of proprietary data owned
by the broadcaster, thus making it possible to broadcast contents (the tag
content_descriptor), according to a standardized format. The present
invention introduces new fields into these descriptors, specifying therein: the
description of a flash, the topic or topics of the flash, the start of programme
(date and time coded on 40 bits), the duration (coded on 24 bits), etc. The
EIT table contains in particular a field coded on 12 bits which authorizes a
maximum length of 4093 bytes for transporting the descriptors.

These latter descriptors are used by the broadcaster to describe the
content of the event, and hence for example the topic to which it belongs.
They may be of two types:
1. the "content_descriptor" descriptors of standardized identifier: 0x54 in
hexadecimal.
2. the "user defined" descriptors of standardized identifier from 0x80 a OxFE
in hexadecimal.
If the descriptor of type "content_descriptor" is used to code the
topic or topics of an event, a size coded on 8 bits is available, and hence 256
bytes are available, this being amply sufficient.
A descriptor coding which can be recommended is the following
(described as are the descriptors in the DVB-SI standard):
broadcaster_defined_content_descriptor() {
descriptortag 8 bits uimsbf
descriptor_ength 8 bits uimsbf
for ( i=0; i descriptor_content_byte 8 bits uimsbf
}
}
with:
descriptor_tag : lies between 0x80 and OxFE,
descripto_ength : the length of the content of the descriptor which
follows the descriptorjength,
descriptor_content_byte : the coding of the topic or topics to which
the event corresponds, and which the broadcaster wishes to specify
(normally the coding must fit into a byte, but a variable size of the content
makes it possible to associate one and the same event with several topics).
By analysing the content of the descriptors contained in the EIT
tables, the decoder creates in its memory the array 1 below which contains
the list of references for accessing the topic-based services currently being
broadcast (ld-service_i) and the associated topics and subtopics.


ARRAY 1
In the example of array 1-, three main topics are offered: Information,
Advertising and Video Clips, and for this set of three topics, twelve subtopics.
In the example the network comprises twelve topic-based services.
Next, the user executes the programming part enabling him to input
the criterion for selecting the topic-based service. The menu displayed in
Figure 2 then appears, its content is formulated directly on the basis of
array 1. The user navigates around this menu with the aid of the four
direction keys of his remote control. The element pointed at is picked out by
either emboldening its outline, with the aid of the highlighted or flashing title,
or any other graphical distinguishing means. The first list indicates the topic,
each topic affords access to a second particular list of subtopics. In the
example of Figure 2, the "Advertising" topic is selected and the "Fashion"
subtopic is picked out. The user currently has the choice of selecting or
otherwise this criterion. The " ? " and " ?" keys are used to go between

the two lists. The " OK " key makes it possible to select what causes the "X "
symbol to appear on the left of the subtopic thus signalling its selection. In
order to no longer select it, it is sufficient to press the "OK" key again. The
" enter" key enters the selection as a whole and quits the programming part
of the GF module.
If the user selects nothing, the GF module will not be operational, the
sequences of flashes initially provided by the broadcaster will not be
replaced. Otherwise, following the execution of the programming part of the
GF module, the decoder programmes its demultiplexer and its second tuner
if it has one. so as to receive the data of the service corresponding to the first
subtopic selected. If subsequently this service ceases to transmit, the
decoder goes to another selected service.
The general principle of the GF module during operation is shown in
Figure 3. An event extracted from the current service is screened. At a
certain moment, the broadcaster transmits in the data of this service and
between two blocks of audiovisual data, an announcement signal specifying
that a sequence of a certain duration will soon be broadcast. At the moment
specified in the announcement signal, the decoder programmes its
demultiplexer so as to receive the data of the service broadcasting flashes
corresponding to the criteria defined by the user. For example, the user
preferring advertisements relating to fashion, the demultiplexer selects the
service broadcasting flashes having "Fashion" as topic. If the user has
chosen several topics, the services broadcasting them are successively
selected by the GF module. When all have been screened once, the first is
selected again. This selection is performed with the aid of a pointer
addressing in the array 1 the services whose topics are chosen by the user.
At the end of the duration specified in the announcement signal, the
demultiplexer is programmed again so as to receive the data of the current
service which are sent to the television screen.
The announcement signal comprises the following information:


Advantageously, the announcement signal is repeated several times
so as to be properly received by all the decoders. By virtue of the "Current
time" data item, the decoder resynchronizes its clock to commence at the
precise instant t1 the screening of the sequence of a duration D1.
According to a very simplified embodiment, the broadcaster sends
only a single announcement signal at the instant at which the sequence
starts. In this signal, the "Current time" and "Instant t1" fields are
unnecessary and can be eliminated.
The flashes are broadcast continuously in the topic-based services.
The start of the sequence (instant T1) does not generally coincide with the
start of a flash. So as not to switch during the broadcasting of a flash and
thereby cause a part to be missed, the decoder sends a filler event to the
screen.
Figures 4 show the timing diagram of the programmes broadcast on
the current service (Figure 4-a), the topic-based service (Figure 4-b) and the
programmes screened (Figure 4-c). They show in particular the moment of
programme of the filler event. The announcement signals transmitted
between the blocks of audiovisual data of the current event contain a data
item indicating the broadcasting at the instant t1 of a sequence. This
sequence contains flashes whose topics are diverse. It is screened when the
user does not specify any criterion or when the decoder is not furnished with
the GF module. At the same time, the topic-based service continually
transmits flashes in a loop. In the example of Figure 4-b, the topic-based
service displayed transmits 9 different flashes having the same topic.
According to a first embodiment, switching between the current
service and a topic-based service is effected directly. This first embodiment
is simple but has the drawback of cutting the flashes. The description which
will follow incorporates the improvement enabling this problem to be solved.

The instant t1 occurs at the moment of the broadcasting of the flash 4.
The flash 5 which is broadcast at the moment t2 after t1, can be screened in
full. To avoid screening just a part of the flash 4, the decoder sends a filler
event to the screen in the course of the moment delimited by t1 and t2. A
filler event possesses an audiovisual content whose duration of screening is
of no importance to the viewer. It is for example a still image enlivened by
music. It may also be a documentary about a region. The objective of a filler
event is to occupy the television screen between the moment t1 and the start
of the next flash. It also makes it possible to do away with the brief black
screen which appears when switching services. At the moment t2, the
decoder checks that the flash 5 has a sufficiently short duration for it to be
completely incorporated in the sequence. Since this is the case, the flash 5 is
screened. At the instant t3, the flash 6 is received and, after having
undergone the same check, is screened. At the instant t4, the flash 7 is
received. The du ation of this flash is greater than the remaining duration of
the sequence, there is therefore no longer enough time to screen it. The GF
module sends the screen a filler event which is screened up to the instant t5
which terminates the sequence. The current programme is then screened
again.
Advantageously, the filler event is a looped audiovisual programme in
which it is impossible to discern the start transition and end transition. The
duration of the loop must be sufficiently long for the user not to see the same
parts too often.
According to a preferred embodiment, the filler event is unique and is
recorded in a memory of the decoder. Thus, switching is fast and does not
leave any black screen appearing on the screen. The size of the memory
occupied is generally short (especially if this event is a picture with music),
the filler event can be stored in a part of the work memory, or if it is too long,
in the hard disk 25.
A variant consists in the network broadcasting in addition to the topic-
based services a so-called "filler" service permanently broadcasting a filler
event. According to this variant, the GF module searches through this service

for the filler event and stores it in memory. The broadcaster can change the
filler event, for example, once a day.
At the precise moment specified by the broadcaster in the
announcement signal, the event interrupted by the sequence must resume.
The data selected for display are then switched from the service
broadcasting programmes of second type to the current service.
An improvement of the present invention consists in using a memory
of large capacity to record at least one flash. This memory can consist of a
memory circuit of large capacity, or of a small hard disk (such as that
represented at 25 in Figure 1), or of a magnetic tape. According to the
present improvement, the decoder constantly records the flash broadcast by
the selected topic-based service, that is to say the "current flash". A new
flash received overwrites the previous one. Figures 5 show the timing
diagram of the programmes broadcast on the current service (Figure 5-a),
the topic-based service (Figure 5-b), the programme read from the memory
by the GF module (Figure 5-c) and the screened programmes (Figure 5-d).
When the sequence commences (instant t1), the GF module stops the
screening of the current event and reads the content of the flash memory at
the start of the recording of the flash currently being broadcast. The
broadcasting of this flash (4) commenced at the instant t0 and the flash is
read at the instant T1. A time shift of (t1 - tO) occurs between the receipt and
the screening of the flash 4 and of those which will be screened thereafter.
For this reason, this equipment is called a "Time Shifter". At the end of the
screening of the flash 4 (instant t2), the GF module determines whether the
next flash (flash 5) can be screened completely before the end of the
sequence. This is the case: the flash 5 is therefore sent to the screen. At the
end of the screening of the flash 5, the GF module checks whether the flash
6 can also be screened but this is not the case. The GF module completes
the remainder of the sequence to be displayed with a filler event until the
instant t4 at which screening of the current event recommences. In this way,
the screened sequence possesses the duration specified by the broadcaster.

In certain cases this improvement makes it possible to reduce the screening
time of the filler event and to add a flash to the sequence.
An improvement of the present invention consists in the user
programming the distribution of topics. For each of the topics present in the
array 1 the user specifies the proportion of display which he desires. The
proportions are advantageously indicated as a percentage, the total of the
values indicated being 100.
The array 2 below is an example of programming the distribution of
themes. In the example, the user prefers especially the flashes of video clips
of rap (he wants 50% of them), then the advertisements for the home (30%)
and finally, the sports information (20%).

ARRAY 2
The user specifies the proportions in the menu of Figure 6 by running
the programming part of the GF module and by inputting an integer from 0 to
100 with the aid of the keypad of his remote control. The icon at the bottom

left indicates to the user the percentage which he still has to assign. In the
example, he has specified 20% of sports information flashes, 30% of home
advertising flashes, he therefore still has to assign 50% of flashes over one
or more other themes. The user can obviously return to a choice with the aid
of the navigation buttons.
A variant, aimed at simplifying the inputting of the choices, consists in
the user allocating a scale, for example from 0 to 9, for each flash topic. The
GF module then converts the values input into a percentage.
The user having entered his choices, the GF module creates the
array 3 below in memory, this array possessing as many rows as there are
themes for which the user has specified a non-zero number. The array
contains four columns. The first and the second column identify the topic-
based service. The third contains the percentages programmed by the user
for each theme. The fourth contains counters for determining the number of
flashes which have already been screened. The fourth column of the array is
updated during each screening of a sequence by incrementing the value of
the counter. At the start of the displaying of a sequence and at the end of
each screening of a flash, the array is read and analysed by the GF module
during normal operation so as to determine the topic-based service in which
the decoder must search for the flash to be screened.

ARRAY 3
In the example of the above array 3, the GF module will select the
topic-based service broadcasting "Information/Sports" once, will then select
"Advertising/Home" twice and finally will select "Video Clips/Rap" four times.

In a simple manner, the selection is performed by chronological scanning of
the array.
A first manner of proceeding consists in updating the counters with the
values programmed by the user and in decrementing them during each
screening. When all the counters are at 0, they are reupdated with the
programmed values. A first manner of working consists in the counters
counting a number of screened flashes. Another method consists in counting
the screening time for each topic. In the latter case, seconds are counted by
adding up in each counter the durations (in seconds) of the flashes for each
topic.
A variant consists in requiring that the minimum value of each topic be
equal to 1, including in respect of those which the user announces to be of no
interest and for which he programmes a zero value. This variant allows the
broadcaster to ensure that each topic will be seen at least once after a
certain time, doing so while complying with the expected display proportions
if the values for the topics of high interest to the user have sufficiently large
values. This variant requires that the array 3 contain as many rows as there
are broadcast topics and hence topic-based services.
Another variant consists in using a geometrical series to alter the
starting value of the counters. In this variant the starting value of a counter is
equal to k times (k > 1) the value of the counter for the topic of immediately
lower interest. The user therefore provides an ordering of the topics offered
to him. This ordering is for example, from the most interesting to the least
interesting. This gives:
- for p[j] the weight of the j-th topic (0 is the index of the least interesting topic
and n-1 the index of the most interesting topic, for n possible topics), and for
k > 1 we choose:
p[i] = k*p[i-1], with p[0]= 1 .
First of all, a counter, initialized at the start with the successive values
of the series p[i], is associated with each topic by associating p[0] with the
least preferred topic and p[n-1] with the most preferred topic. The associated

counter is then decremented by 1 each time a topic is displayed. Thus the
desired function is indeed achieved.
In this manner, the broadcaster has perfect control over the
probabilities of display of each topic. Indeed, it may be demonstrated by
recurrence that:

This shows that, for k=2 for example, the topic designated as the most
desired will be displayed around 50% of the time, the next topic 25%, the
next topic 12.5%, etc.
and for k=3, the probabilities become : 67%, 22%, 7%. etc
and for k=4 : 75%, 19%, 5%, etc
An improvement consists in assigning a priority to the flashes. To do
this, the broadcaster sets up a priority flag in each flash descriptor indicating
in a simple manner whether the latter does or does not have priority. It is
recalled that this descriptor is in an EIT table and that in this way the decoder
knows the topic, the duration and the priority of all the flashes broadcast by
all the topic-based services. The decoder receives this indicator and the GF
module processes it in the following manner: when a choice of topic-based
service is possible, the GF module chooses the service with the most
numerous priority flashes broadcast during the sequence announced. In the
example illustrated by the array 3, the GF module can in fact display either
"Information/Sports" or "Advertising/Home" or "Video Clips/Rap". According
to the improvement, it analyses the priority of the flashes transmitted by the
three topic-based services in the course of the sequence and selects the
topic-based service which possesses the largest number of priority flashes in
the course of the sequence. Advantageously for him. the broadcaster can
demand a higher price from the providers who demand a higher priority for
their flashes.
A variant of the improvement consists in assigning a priority level to
each topic rather than a flag whose value is binary. For example, this level
takes the values from 0 to 4, the value 4 being that of highest priority.

According to this variant, the GF module adds up the priority levels of the
flashes broadcast by the selectable services and in the course of the
announced sequence, and selects the one which possesses the highest
value.
Another variant of this improvement consists in assigning a weight
designated by the broadcaster to each topic, thereby enabling certain topics
to be given priority. This weight is used jointly with the weights designated by
the user (for example by adding up the two weights), and thus modifies the
values taken into account in respect of the counters at the moment of the
selecting of a topic. This variant enables the broadcaster to "force", at the
level of the receivers, the displaying of the flashes broadcast by a topic-
based service declared to have priority.
A variant consists in the receiver automatically determining the profile
of the user anc correlating this profile with the topics offered. There is
therefore no longer any need for the manual programming phase illustrated
by Figure 2. The profile can for example be determined on the basis of the
actions of the user faced with certain flash in the course of a learning phase.
For example, if he user often changes services when he sees advertising
flashes in the fashion sector, the GF module deduces therefrom that he
should no longe be presented with flashes of this topic. It then decreases
the proportion dedicated to this topic, by 10% for example. In tandem with
the screening of the sequences, the receiver refines the profile of the user.
Let us assume that flash topics relate to events, when the user asks to see
these events, the GF module increases the proportion of the corresponding
topics. For example, if a user asks to see the televised news (which is an
event) frequently, the GF module is warned and increases the proportion of
the "information" topic by 10% for example.
An improvement consists in the GF module taking several users into
account. The programming part then begins with the inputting of a user
identifier, and each user inputs his profile or the distribution of the topics

which he wishes to see appear in the flashes. The programming part of the
GF module then creates as many distribution arrays as users. During normal
execution, the users identify themselves, a single distribution array or profile
is active at a time.
If the decoder has available just a single tuner, the programmes and
the signalling must be multiplexed on one and the same channel in the form
of data packets referenced by different PIDs. "Top of the range" decoders
have available two tuners to receive signals originating from two
broadcasting channels of different frequency. In this case, an improvement
consists in programming a tuner to receive the current event and the
announcement signals, and the other the topic-based service selected by the
GF module. The data are stored in parallel in the memory as and when they
are received. Switching between the current event and the flashes then takes
place at the level of the procedure for reading the memory.
The invention is of course not limited to the embodiments just
described.

WE CLAIM:
1. A process for scrttning audiovisual programmes transmitted by a centre
and received by a television receiver, programmes of a first type being
broadcast on a first broadcasting service and being selectable by the user,
the process comprising at the receiver level, the steps of:
- screening a programme of a second type extracted from a second
broadcasting service selected by the receiver,
- screening at least one programme of a first type commencing at a
first moment specified by the centre,
- characterized by comprising a screening of a filler programme, said
filler programme being screened following the screening of the
second type programme and stopping at the start of the screening
of the first type programme .
2. Process for screening audiovisual programs as claimed in claim
1, comprising a prior step of screening a part of the programme of a first
type before the first step of screening a program of a second type, the
prior step terminating at a second moment specified by the centre,
characterized in that it comprises a fourth step of screening a filler
program, the said filler program being screened from the second moment
until the broadcasting and the screening of the second type program.
3. Process for screening audiovisual programs as claimed In claim 1 or 2,
wherein the filler program is recorded in the receiver.

4. Process for screening audiovisual programs as claimed in claim 3, wherein
the filler program is extracted from a specific broadcasting service before
being recorded.
5. Process for screening audiovisual programs as claimed in claim 4, wherein
the filler program is regularly recorded in the memory of the receiver.
6. A receiver of audiovisual programmes comprising a means for receiving
data broadcast from a network consisting of at least one first service
broadcasting programmes of a first type which are selectable by the user
and of a plurality of second services broadcasting programmes of a
second type, a means for switching from one service to another service
and a means for sending the programmes to a screening facility,
characterized comprising a means for interposing a first filler programme
between a programme of a second type and a programme of a first type
received from the network.
7. Receiver of audiovisual programs as claimed in claim 6, comprising a
second means for interposing a filler program between a part of a first
type of program received from the network and a second type of
broadcast program of the network.
8. Receiver of audiovisual programs as claimed in one of claims 6 and 7,
comprising a memory into which the filler program is stored.

9. Receiver of audiovisual programs as claimed in claim 8, comprising a
means of reception of a filler program from a specific service, the said
program being recorded after the reception.
10. Receiver of audiovisual programs as claimed in one of claims 6 and 7,
wherein the filler program is a looped audiovisual programme.
11. Receiver of audiovisual programs as claimed in one of claims 6 and 7,
wherein the filler program is a picture accompanied by a sound content.
A process for screening audiovisual programmes transmitted by a
centre and received by a television receiver, programmes of a first
type being broadcast on a first broadcasting service and being
selectable by the user. The process comprising at the receiver level,
the steps of screening a programme of a second type extracted from
a second broadcasting service selected by the receiver. Screening at
least one programme of a first type commencing at a first moment
specified by the centre. Screening of a filler programme, said filler
programme being screened following the screening of the second
type programme and stopping at the start of the screening of the
first type programme.

Documents:

in-pct-2002-1538-kol-granted-abstract.pdf

in-pct-2002-1538-kol-granted-claims.pdf

in-pct-2002-1538-kol-granted-correspondence.pdf

in-pct-2002-1538-kol-granted-description (complete).pdf

in-pct-2002-1538-kol-granted-drawings.pdf

in-pct-2002-1538-kol-granted-examination report.pdf

in-pct-2002-1538-kol-granted-form 1.pdf

in-pct-2002-1538-kol-granted-form 18.pdf

in-pct-2002-1538-kol-granted-form 2.pdf

in-pct-2002-1538-kol-granted-form 26.pdf

in-pct-2002-1538-kol-granted-form 3.pdf

in-pct-2002-1538-kol-granted-form 5.pdf

in-pct-2002-1538-kol-granted-letter patent.pdf

in-pct-2002-1538-kol-granted-priority document.pdf

in-pct-2002-1538-kol-granted-reply to examination report.pdf

in-pct-2002-1538-kol-granted-specification.pdf

in-pct-2002-1538-kol-granted-translated copy of priority document.pdf


Patent Number 215015
Indian Patent Application Number IN/PCT/2002/1538/KOL
PG Journal Number 08/2008
Publication Date 22-Feb-2008
Grant Date 20-Feb-2008
Date of Filing 17-Dec-2002
Name of Patentee THOMSON LICENSING S.A.
Applicant Address 46, QUAI ALPHONES LE GALLO, F-92100 BOULOGNE-BILLANCOURT
Inventors:
# Inventor's Name Inventor's Address
1 SCHMOUKER, PHILIPPE THOMSON MULTIMEDIA, 46, QUAI ALPHONES LE GALLO, F-92648 BOULOGNE
2 PERROT, SEBASTIEN THOMSON MULTIMEDIA, 46 QUAI ALPHONSE LE GALLO, F-92648 BOULOGNE
3 LEGALLAIS, YVON THOMSON MULTIMEDIA, 46, QUAI ALPHONSE LE GALLO, F-92648 BOULOGNE
PCT International Classification Number H 04 N 5/445
PCT International Application Number PCT/FR01/02037
PCT International Filing date 2001-06-27
PCT Conventions:
# PCT Application Number Date of Convention Priority Country
1 00/08240 2000-06-27 France