KR100829864B1 - Method for Scrap Service - Google Patents

Abstract

1. TECHNICAL FIELD OF THE INVENTION

Scrap service in digital broadcasting terminal.

2. Technical problem to be solved by the invention

Provides a scrap service that automatically scraps and plays the content the user is interested in.

3. Summary of Solution to Invention

A first step of receiving a keyword related to content from a user; A second step of searching for and scraping the segment corresponding to the keyword received in the first step in the broadcast content; A third step of generating segment metadata for the segment scraped in the second step; A fourth step of generating program metadata based on the segment metadata generated in the third step to output the segment scraped in the second step as a separate program; And a fifth step of outputting the segment scraped in the second step by using the program metadata generated in the fourth step when a user request is made.

4. Important uses of the invention

Used in digital broadcasting content playback system.

Metadata, scrap services, segments

Description

Scrap Service Method {Method for Scrap Service}

1 is a flow diagram of one embodiment of a scrap service method according to the present invention;

2A to 2C are exemplary diagrams for explaining the present invention as an interface of a digital broadcasting content reproduction system to which the present invention is applied.

3 is a conceptual diagram illustrating general content storage.

4 is a conceptual diagram illustrating generation of metadata according to the present invention.

5 is a conceptual diagram illustrating generation of segment scrap and metadata according to the present invention.

FIG. 6 is a conceptual diagram illustrating a metadata structure when a scraped segment is separately stored according to the present invention. FIG.

7 is an embodiment flow diagram illustrating how metadata of the scraped segment of FIG. 6 is provided programmatically.

8 is an embodiment flow diagram illustrating a method for providing metadata of a scraped segment to a program when only metadata of a scraped segment is used according to the present invention.

The present invention relates to a scrap service method applied to a digital broadcast content reproduction system.

Recently, as the digital broadcasting service becomes full-fledged, research on a technology for providing a customized broadcasting service in a multi-channel multimedia environment has been actively conducted. For example, TV-Anytime, a private international standard, is a standard standard for providing a service that a user can store desired content and watch at a desired time using metadata of the content.

TV-Anytime includes content-based technology and electronic program guide (EPG) information defined in MPEG-7, and allows the user to easily search and select desired content.

The metadata standard consists of two parts, A and B. Part A defines a format for describing metadata, that is, a schema, and is an MPEG-7 DDL based on XML (eXtensible Markup Language). Definition Language, ISO / IEC 15938-2). Part B relates to metadata transfer, which is binary format (MPEG-7 BiM (Binary Format for MPEG-7), ISO / IEC 15938-1), fragmentation model, encapsulation and indexing techniques. It includes.

A segment refers to each divided when the broadcast program is divided into several parts on a predetermined basis, and metadata refers to data for describing content of the broadcast program.

For example, the segment metadata may include a segment of the segment section, a character of the segment section, a section corresponding to the segment in the program, and further include the segment in the process of providing segment metadata. The overall overview of the broadcasting program may further include. Here, the summary information of the program includes the title and genre of the program, whether the program is live, whether the fragment or the series is continuous, and the number of broadcasts and themes in the case of the series.

Conventional analog broadcasting is a form of providing information to viewers unilaterally, but digital broadcasting is a form of providing unidirectional services in which a user can select a desired service if desired, and is more diverse than conventional analog broadcasting. Additional application services are possible.

A content identification scheme is defined for acquiring a specific instance of content in TV-Anytime. The characteristic of the content identification system is to separate the content identifier (CRID) and the location indicator (Locator), which is information about the physical location for actually obtaining the content. For reference.

On the other hand, it is limited to search for and obtain content desired by the user every time in various broadcast contents, and it is inconvenient to find specific content desired by the user again in the searched content range. Accordingly, there is a need for a scrap service that automatically scrapes and provides content that a user is interested in.

SUMMARY OF THE INVENTION The present invention has been proposed to meet the above demands, and an object thereof is to provide a scrap service method for automatically scraping content of interest to a user.

According to another aspect of the present invention, there is provided a scrap service method applied to a digital broadcasting content reproduction system, comprising: a first step of receiving a keyword related to content from a user; A second step of searching for and scraping the segment corresponding to the keyword received in the first step in the broadcast content; A third step of generating segment metadata for the segment scraped in the second step; A fourth step of generating program metadata based on the segment metadata generated in the third step to output the segment scraped in the second step as a separate program; And a fifth step of outputting the segment scraped in the second step by using the program metadata generated in the fourth step when a user request is made.

The above objects, features and advantages will become more apparent from the following detailed description taken in conjunction with the accompanying drawings. Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a flowchart illustrating an embodiment of a scrap service method according to the present invention.

As shown in FIG. 1, the scrap service method according to the present invention first presents keywords of interest to the user (S101). In this case, the keyword may be directly input by the user, or may be selected from a popular search word provided by the Electronic Program Guide (EPG), a list of the latest search word of the user, and the like.

Next, the content related to the keyword is searched, and the segment of the related content is scraped (s103). The related content may be a program stored in a personal digital recorder (PDR), or may be a program to be broadcasted in the future acquired through EPG metadata. Here, the segments of the program stored in the PDR and the segments of the program to be broadcasted in the future obtained through the EPG metadata are stored separately in the PDR.

Next, metadata information of the scraped segment is generated (s105). The generated metadata information may be the same as or different from the metadata information of the stored content. It will be described in detail in Figure 4 below.

Next, a segment group is generated for each program by binding the scraped segments, and a metadata is generated to bundle a program including the generated segment group and generate a program group (S107). It will be described in detail in Figure 5 below.

Next, in response to the user's request, the segment is played using the metadata information of the scraped segment (S109).

Table 1 is an example coding example showing information included in metadata of digital broadcast content.

As shown in Table 1, the metadata of the content includes CRID information, basic information, location information, segment metadata information, etc. of the corresponding program. The actual location broadcasted before now depends on the information stored in the PDR.

2A to 2C are exemplary diagrams for explaining the present invention as an interface of a digital broadcasting content reproduction system to which the present invention is applied.

As shown in FIG. 2A, the keyword may be directly input by a user or selected from a list in step S101 (eg, SearchTV).

On the other hand, as shown in Figures 2B and 2C, scraped or completed content in accordance with the present invention may be listed along with general content (e.g. AlbumTV).

When the selected content in the content list shown in FIG. 2B is scrapped content, a scrap result is reproduced and serviced, and when the specific content is a scrap in progress, a pop-up window indicating a scrap progress is output.

3 is a conceptual diagram illustrating general content storage.

As shown in FIG. 3, the content reference identifier (CRID) and segment identifier (segment ID) information are already recorded in a PDR (a news program in the present embodiment, hereinafter referred to as 'PI # 1'). Or it is included in the program to be broadcasted in the future acquired through the EPG metadata (in the present embodiment, the flexible program, hereinafter 'PI # 2').

Here, the location information before storage is, for example, the content location (Loc # 1) of the news program (PI # 1) before the storage was the broadcaster server, but the location of PI # 1 is stored in the PDR while the predetermined location (Loc) in the PDR. # 1a).

4 is a conceptual diagram illustrating generation of metadata according to the present invention.

As shown in Fig. 4, in step s103, if the entire program is content that is stored correctly ('reservation recording'), the segment locator of the program becomes information for segment reproduction and thus segment metadata. Available without change. Therefore, according to the present invention, the metadata information of the scraped segment is generated in the same manner as the existing segment metadata information.

However, if the entire program is not exactly stored content ('simultaneous recording'), the SegmentLocator cannot be information for segment playback.

 That is, in the case of reserved recording of PI # 1, since the program start time and the content storage start time are the same, the already stored metadata is used as information for segment reproduction. However, when the PI # 2 is recorded simultaneously, the content storage start time is 30ms later than the program start time, so it is necessary to change the segment metadata (for example, SI # 23 is changed to SI # 23a and the content is stored. Since the start time is delayed by 30ms, the locator information is also changed.).

Therefore, if the entire program is not the content stored correctly, the metadata information of the segment scraped according to the present invention is generated by changing the existing segment metadata information.

Table 2 is an example coding example showing the change of metadata in the case of the simultaneous recording of FIG.

As shown in Table 2, as the music program PI # 2 to be broadcasted in the future is stored, the time value of the segment metadata is changed.

5 is a conceptual diagram illustrating generation of segment scrap and metadata according to the present invention.

According to the present invention, when a keyword is presented, the content related to the keyword is searched and automatically scraped in units of segments (s103), and metadata information about the scraped segments is newly generated (s105).

In relation to the generation of the scraped metadata, the scraped segments (eg, SI # 12 and SI # 23a in FIG. 5) may be grouped programmatically, for example, in a segment group (eg, FIG. 5). , SG # 1 and SG # 2) are generated, and a program group including the scraped segment (for example, PI # 1 and PI # 2 in FIG. 5) is bundled into one program group (for example, For example, in the case of FIG. 5, G # 1) is generated.

Therefore, according to the present invention, the segment groups SG # 1 and SG # 2 generated for each program are included in a program PI # 1 and PI # 2 including the scraped segment. The metadata is generated to have a hierarchical structure included in the created program group G # 1.

Meanwhile, according to the present invention, metadata may be generated such that a new segment group (eg, SG # 3) is generated by grouping the generated segment groups SG # 1 and SG # 2. SG # 3) refers to a lower segment group SG # 1 and SG # 2 as an upper segment group.

Table 3 is an example coding example showing the result of generating the segment scrap and metadata according to the present invention.

Table 3 shows a case in which the keywords are 'Hyo-ri' in the two programs shown in Table 1, and shows a case in which the segment position information and the ID thereof are changed when the scraped segment is stored separately from the original program file. When the content related to Lee Hyo-ri is selected in this way, segments of the selected content are assigned a new segment ID and time value.

Table 4 is an example coding example showing a hierarchical structure of segments.

As shown in Table 4, two segment groups for each program (news and music) are grouped by tying scraped 'Hyo Lee' related segments (for example, SI # 12 and SI # 23a in FIG. 5). 5 is created (eg, SG # 1 and SG # 2 in FIG. 5), and a new segment group (eg, SG # 3 in FIG. 5) referencing the two segment groups (ProgramRef tag). Is generated.

The new segment group has two segment groups as a reference list (refList), and the two segment groups have a hierarchical structure having as refList a related segment found in news and music programs. That is, there is a segment group grouping segments of the program for each program, and a new segment group grouping the segment groups.

Segment information of various programs is obtained through the highest segment group. At this time, the segment referred to as refList has a start time of 0 and means a segment stored as a file separately from the original program.

FIG. 6 is a conceptual diagram illustrating a metadata structure when a scraped segment is separately stored according to the present invention.

The segment s103 scraped in accordance with the present invention may or may not be stored separately from the original program content file.

If the scraped segment is not stored separately, the PDR memory is not duplicated, but if the original program file is deleted, the scraped segment can no longer be used. However, if the scraped segments are stored as a single file separated from the original program file, the scraped segments can still be used even if the original program file is deleted.

If only the metadata of the scraped segment is used, the existing segment metadata is used, so no other process is required.

However, as shown in FIG. 6, when segments of content stored in the PDR are stored separately, modification of existing segment metadata is required.

Segments (SI # 12a and SI # 23a) of the contents stored in the PDR are stored as files separately from the original programs (PI # 1 and PI # 2), and the stored segmented split files are new files and thus assign new locations. (SI # 12b and SI # 23b). In addition, since the location of each segment is changed, the Session Identification (SID) information is also changed.

The stored segment separation files SI # 12b and SI # 23b have the same CRID as the original programs PI # 1 and PI # 2, but are stored in different files, respectively, and have different location information. Therefore, in order to find the stored segment separation files SI # 12b and SI # 23b, the stored segment separation files SI # 12b and SI # 23b may have an IMI (instance) of the original programs PI # 1 and PI # 2. metadata id) Different IMI is assigned.

 At this time, the segment groups SG # 1 and SG # 2 which bundle the stored segment separation files SI # 12b and SI # 23b play the scraped segment with reference to the changed SID information.

FIG. 7 is an embodiment flow diagram illustrating how metadata of the scraped segment of FIG. 6 is provided to the program.

As shown in FIG. 7, first, an upper segment group referring to the scraped segment is obtained (s701), and a program group including the scraped segment undergoes a location resolution process (s703). At this time, the upper segment group includes segment metadata information, SID information, and the like of the segment separation file.

Based on imi among the various locations of the program group that has undergone the location resolution process, only the segment separation file is collected instead of the original program file (S705), and the aggregated segment is separated using the information of the upper segment group obtained through step S701. The order of the files is arranged, and the collected segmented separated files are reproduced (s707).

Table 5 shows the location resolution process of a program group generated by grouping a program including a scraped segment according to the present invention.

In the content reference result, the locator containing the "Segment" part in the imi is determined as the locator for scrap, and the corresponding content is played in order in the order defined in the segmentGroup.

8 is a flow diagram of an embodiment illustrating a method for providing metadata of a scraped segment to a program when only metadata of a scraped segment is used according to the present invention.

As shown in FIG. 8, an upper segment group referring to the scraped segment is obtained (s801), and a program group including the scraped segment is subjected to a location resolution process (s803). At this time, the upper segment group includes segment metadata information, SID information, and the like of the segment.

Segments included in the program group that has undergone the location resolution process are reproduced using the information of the upper segment group obtained through step S801 (S805).

As described above, the method of the present invention may be implemented as a program and stored in a recording medium (CD-ROM, RAM, ROM, floppy disk, hard disk, magneto-optical disk, etc.) in a computer-readable form. Since this process can be easily implemented by those skilled in the art will not be described in more detail.

The present invention described above is not limited to the above-described embodiments and the accompanying drawings, and various substitutions, modifications, and changes can be made in the art without departing from the technical spirit of the present invention. It will be clear to those of ordinary knowledge.

As described above, according to the present invention, by using the TV anytime metadata, the user can conveniently obtain desired content by scraping / storing a specific part of the program related to the keyword of interest.

Claims (9)

A scrap service method applied to a digital broadcasting content reproduction system, A first step of receiving a keyword related to content from a user; A second step of searching for and scraping the segment corresponding to the keyword received in the first step in the broadcast content; A third step of generating segment metadata for the segment scraped in the second step; A fourth step of generating program metadata based on the segment metadata generated in the third step to output the segment scraped in the second step as a separate program; And A fifth step of outputting the segment scraped in the second step by using the program metadata generated in the fourth step in response to a user's request Scrap service method comprising a. The method of claim 1, If the start time when the broadcast content is broadcast in the system and the start time stored in the system is the same, the third step The metadata information of the scraped segment is generated in the same manner as the existing segment metadata information. Scrap service method. The method of claim 1, If the start time when the broadcast content is broadcast in the system and the start time stored in the system is different from the third step The metadata information of the scraped segment is generated by changing existing segment metadata information. Scrap service method. The method of claim 1, The fourth step is A sixth step of generating segment group metadata for grouping the segment scraped in the second step into broadcast program units; And A seventh step of generating program group metadata for grouping a broadcast program including the segment scraped in the second step; Scrap service method comprising a. The method of claim 4, wherein The second step is To store the scraped segment as a separate file Scrap service method. The method of claim 5, The fourth step is In the second step, to generate a new instance metadata id (IMI) for the segment stored separately Scrap service method. The method of claim 6, The fifth step is An eighth step of obtaining segment group metadata generated in the sixth step; A ninth step of collecting separately stored segments in the second step; And A tenth step of reproducing the segments collected in the ninth step based on the segment group metadata obtained in the eighth step; Scrap service method comprising a. The method of claim 7. The ninth step is An eleventh step of determining a location of a broadcast program including a segment scraped in the second step based on the program group metadata generated in the seventh step; And A twelfth step of collecting segments separately stored in the second step based on the IMI of the broadcast program positioned in the eleventh step; Scrap service method comprising a. The method of claim 4, wherein A thirteenth step of acquiring segment group metadata generated in the sixth step; Determining a location of a broadcast program including a segment scraped in the second step based on the program group metadata generated in the seventh step; And A fifteenth step of reproducing the segment scraped in the second step as a segment included in the broadcast program positioned in the fourteenth step based on the segment group metadata acquired in the thirteenth step; Scrap service method comprising a.

Images