JP2016111625A - Server device, program, and information processing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To efficiently execute processing of media data in a filter graph.SOLUTION: A server device which generates a filter graph including the order of executing a plurality of filters where processing is executed by filter, and executes processing of the filters in accordance with the execution order includes: a detection section which detects a pair of a first filter and a second filter for executing inverse processing of the first filter, in the filters included in the filter graph; a determination section which determines whether a filter included in the filter graph and to be executed between the first filter and the second filter performs data change processing; and a processing section which performs bypass processing where data input to the first filter is output from the second filter when the filter to be executed between the first and second filters does not perform data change processing, and discards the data input to the second filter.SELECTED DRAWING: Figure 8

Description

  The present invention relates to a server device, a program, and an information processing method.

  In speech recognition processing used in a terminal device such as a smartphone, for example, the terminal device transmits media data such as speech to the server device, and the server device performs predetermined processing (hereinafter referred to as “media”) on the media data. The process is also referred to as “process” and is returned to the terminal device (see, for example, Patent Document 1).

  As the amount of media data transmitted from the terminal device increases, it becomes more important for the server device to improve processing efficiency in order to respond to the request. Therefore, a filter graph generation technique has been proposed in which single-function processing such as codec conversion and multiplexer is combined with a modularized “filter” so that it can be easily reused, and media processing is sequentially executed in units of filters ( For example, see Patent Document 2). The server device processes the input media data for each filter in the order of execution of the connection order of the filters in the filter graph.

JP 2009-49905 A US Pat. No. 5,931,038 Japanese Patent Laid-Open No. 06-338802

  However, if the connection order of the filters in the filter graph is not appropriate, unnecessary filter processing is automatically inserted, and the efficiency of media data processing in the filter graph may be reduced.

  Accordingly, in one aspect, an object of the present invention is to efficiently execute media data processing in a filter graph.

  In one proposal, a server device that generates a filter graph that defines an execution order of a plurality of filters for which processing for each filter is executed, and executes the processing of the plurality of filters according to the execution order, the filter graph Of the first filter and the second filter that performs a reverse process of the processing of the first filter, and the first of the filters included in the filter graph. A determination unit for determining whether a filter executed between one filter and the second filter performs data change processing; and a filter executed between the first filter and the second filter Does not perform data change processing, performs bypass processing using the input data to the first filter as output data from the second filter, and the second filter Server device is provided with a discarding processing unit input data.

  According to one aspect, the present invention can efficiently execute processing of media data in a filter graph.

The figure which shows an example of the whole structure of the media processing system concerning one Embodiment. The figure for demonstrating an example of a filter graph. The figure for demonstrating the automatic insertion of a filter. The figure which shows an example of a function structure of the server apparatus concerning 1st and 2nd embodiment. The figure which shows an example of the reverse conversion management database concerning one Embodiment. The figure which shows an example of the data change filter table concerning one Embodiment. The flowchart which shows an example of the bypass addition process concerning 1st Embodiment. The figure for demonstrating the bypass concerning 1st Embodiment. 6 is a flowchart illustrating an example of filter processing according to the first embodiment. The flowchart which shows an example of the bypass addition process concerning 2nd Embodiment. The figure for demonstrating the bypass concerning 2nd Embodiment. The figure which shows an example of a function structure of the server apparatus concerning 3rd Embodiment. The figure which shows an example of the change presence detection data table concerning one Embodiment. The flowchart which shows an example of the bypass addition process concerning 3rd Embodiment. The flowchart which shows an example of the filter process concerning 3rd Embodiment. The figure which shows an example of the hardware constitutions of the server apparatus concerning one Embodiment.

  Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. In addition, in this specification and drawing, about the component which has the substantially same function structure, the duplicate description is abbreviate | omitted by attaching | subjecting the same code | symbol.

[Entire configuration of media processing system]
First, the configuration of a media processing system 1 according to an embodiment of the present invention will be described with reference to FIG. The media processing system 1 according to an embodiment includes a terminal device 10 and a server device 20. The terminal device 10 and the server device 20 are connected by a network 30.

  Examples of the terminal device 10 include a smartphone, a tablet terminal, and a personal computer. However, the terminal device 10 is not limited to this, and may be a terminal device having a communication function such as a mobile phone, a portable information terminal (PDA), a portable music device, a game device, or the like.

  The server device 20 receives media data transmitted from the terminal device 10, executes media processing such as voice recognition processing requested from the terminal device 10, and returns the processed media data to the terminal device 10. The server device 20 may be a cloud server connected to the terminal device 10.

(Filter graph)
The server device 20 generates a filter graph that defines the execution order of a plurality of filters that are processed in units of filters, and executes the plurality of filters in the order of filters (connection order). Specifically, as shown in FIG. 2, the filter graph is a combination of “filters” obtained by modularizing single-function processes such as codec conversion and multiplexers so that they can be easily reused. The server device 20 sequentially processes the input media data from the upstream filter toward the downstream filter for each filter in accordance with the filter combination order of the filter graph, and outputs the processed media data from the most downstream filter.

  In FIG. 2, the server device 20 receives image data captured by the camera, and performs codec conversion processing in units of filters. Moreover, the server apparatus 20 inputs the audio | voice data which the microphone acquired, and performs the process of a multiplexer per filter. The processed media data output to the filter is input to the next filter or transferred to the terminal device 10.

  In the filter graph, a plurality of filters may not be generated in an optimal execution order. In particular, when input media data is used by a plurality of developers of filter graphs, it may be difficult to generate them in an optimal execution order.

  If the filter graph is not generated in the optimal execution order, unnecessary filters may be automatically inserted depending on the execution order of the plurality of filters defined in the filter graph. For example, in FIG. 3, it is assumed that the filter graph is created in the connection order (execution order) of filter 40 → filter 42 → filter 44. In this case, it is determined that the filter 41 that converts the sampling rate from 8 kHz to 16 kHz is necessary, and is automatically inserted between the filter 40 and the filter 42. Further, it is determined that the filter 43 that converts the sampling rate from 16 kHz to 8 kHz is necessary, and is automatically inserted between the filter 42 and the filter 44.

  On the other hand, if the filter graph is designed at a position where the filter 44 is directly connected to the filter 40, the filter 41 and the filter 43 are unnecessary and are not automatically inserted. That is, the filter graph of FIG. 3 is an example in which unnecessary filters are automatically inserted because the connection order of the filters is not appropriate.

  As described above, when the connection order of the filters based on the generated filter graph is not appropriate, unnecessary filter processing is automatically inserted, and the efficiency of media processing may be lowered. Therefore, in the media processing system 1 according to the first to third embodiments described below, processing of media data in the generated filter graph is efficiently executed.

[Function configuration]
First, an example of a functional configuration of the server device 20 according to the first and second embodiments will be described with reference to FIG. The server device 20 includes a filter graph generation unit 21, a detection unit 22, a storage unit 23, a determination unit 24, a bypass grant unit 25, and a filter processing unit 26.

  The filter graph generation unit 21 connects a plurality of filters that are executed in units of filters based on the filter connection relationship specified in advance, and generates a filter graph that defines the execution order.

  The detection unit 22 detects a pair of a first filter and a second filter that performs an inverse process of the process of the first filter among the filters included in the filter graph. For example, the filter 41 and the filter 43 in FIG. 3 are a pair of inverse transforms, the upstream filter 41 is an example of a first filter, and the downstream filter 43 is an example of a second filter. is there.

  The determination unit 24 determines whether a filter executed between a pair of inverse transforms of the first filter and the second filter among the filters included in the filter graph performs the data change process.

  When it is determined that the data change process is not performed by the filter executed between the first filter and the second filter, the bypass grant unit 25 outputs the data input to the first filter to the second filter A bypass route for data output from is assigned.

  The filter processing unit 26 receives media data such as images and sounds from the terminal device 10 and executes filter processing according to the filter graph. However, when the bypass is provided, the filter processing unit 26 performs a bypass process of outputting the input data to the first filter from the second filter, executes the filter process according to the filter graph, and executes the second filter. The data input to is discarded.

  The storage unit 23 includes an inverse conversion management database (DB) 27 and a data change filter table 28. An example of the reverse conversion management DB 27 is shown in FIG. The inverse conversion management DB 27 includes items of a filter type ID 271, a filter name 272, an inverse conversion filter ID 273, a comparison parameter 1 (P 1) 274, and a comparison parameter 2 (P 2) 275.

  When the filter type ID 271 and the inverse transform filter ID 273 have different values, the two filters are inverse transform pairs. When the filter type ID 271 and the inverse transform filter ID 273 have the same value, the comparison parameter 1 (P1) 274 and the comparison parameter 2 (P2) 275 are set. When the comparison parameter 1 (P1) 274 of the filter A and the comparison parameter 2 (P2) 275 of the filter B and the comparison parameter 2 (P2) 275 of the filter A and the comparison parameter 1 (P1) 274 of the filter B are equal, Filters A and B are inverse transform pairs. The filter name 272 indicates the name of the filter identified by the filter type ID 271.

  An example of the data change filter table 28 is shown in FIG. The data change filter table 28 includes items of a filter type ID 281, a filter name 282, and data change information 283. The filter name 282 indicates the name of the filter identified by the filter type ID 281. The data change information 283 indicates “present” when the data change is set to “1”, and indicates “no” when the data change is set to “0”. For example, if the filter type 292 is “6” and the filter name 293 is “volume extraction”, the sound change process is performed and the data change is not performed, so the data change information 283 is “0”. .

[Operation]
<First Embodiment>
Next, operation | movement of the server apparatus 20 which has this function structure is demonstrated in order of 1st Embodiment and 2nd Embodiment. FIG. 7 is a flowchart illustrating an example of bypass addition processing according to the first embodiment. FIG. 8 is a flowchart illustrating an example of the filter processing according to the first embodiment. FIG. 9 is a diagram for explaining a bypass according to the first embodiment.

(Bypass additional processing)
First, the bypass addition process of FIG. 7 will be described with reference to FIG. When the filter graph generation unit 21 receives an instruction to add or delete a filter (step S10), the filter graph generation unit 21 generates or changes a predetermined filter graph (step S12).

  Next, the filter graph generation unit 21 deletes all existing bypasses (step S14). Next, the detection unit 22 refers to the data in the inverse transformation management DB 27 set in advance, and extracts inverse transformation pairs from all the filters of the filter graph (step S16).

  When the detection unit 22 finds another filter having the inverse conversion filter ID 273 corresponding to the filter type ID 271 of the one filter, the detection unit 22 determines that the two filters are an inverse conversion pair. However, when the filter type ID 271 of one filter and the corresponding inverse transform filter ID 273 have the same value, the comparison parameter 1 (P1) 274 of one filter, the comparison parameter 2 (P2) 275 of another filter, and the one filter Only when the comparison parameter 2 (P2) 275 and the comparison parameter 1 (P1) 274 of the other filters are equal to each other, it is determined that one filter and the other filter are an inverse transformation pair.

  Next, the detection unit 22 determines whether one or more pairs of inverse transforms have been extracted (step S18). When the detection unit 22 determines that the inverse transform pair has not been extracted, the process ends. On the other hand, if the detection unit 22 determines that one or more pairs of inverse transforms have been extracted, the detection unit 22 extracts a filter sandwiched between the pairs of inverse transforms for each pair (step S20).

  For example, in the case of the filter graph shown in FIG. 8, media data is received by the filter 50 that performs data reception processing, processed in the order of filter 51 → filter 52 → filter 53, and output. Therefore, first, the detection unit 22 checks the filter graph of FIG. 8 to confirm that the filter 51 of the process A and the filter 53 of the process a are connected, and the process a performs the inverse conversion process of the process A. Extract as a pair of inverse transforms. Next, the detection unit 22 extracts a filter sandwiched between the extracted inverse transformation pairs. In FIG. 8, the filter 52 sandwiched between the process 51 filter 51 and the process a filter 53 is extracted. The filters 51 and 53 are a pair of inverse transforms, the filter 51 is an example of a first filter (upstream (input side) filter), and the filter 53 is a second filter (downstream (output side) filter). It is an example. The filter 52 is an example of a filter that is executed between the first filter and the second filter.

  The determination unit 24 refers to the data stored in the preset data change filter table 28 and checks whether there is a filter whose data is changed in the filter sandwiched between the filters of the inverse transform pair (step S22). ). Based on the data change information 283 corresponding to the filter type ID 281, it can be determined whether the data change is performed by the filter sandwiched between the filters of the inverse conversion pair.

  The determination unit 24 determines whether there is a filter whose data is changed (step S24), and when it is determined that there is a filter whose data is changed, the process proceeds to step S28. On the other hand, when the determination unit 24 determines that there is no filter on which data is changed, the bypass grant unit 25 adds a path in which the data bypasses the extracted filters of the inverse transformation pair to the filter graph (step S1). S26), the process proceeds to step S28.

  For example, as shown in FIG. 8, the data changing process is not performed in the filter 52 sandwiched between the filters 51 and 53 of the pair of inverse transforms. In this case, the determination unit 24 determines that there is no filter in which data change is performed between the filters 51 and 53 of the inverse transform pair, and the bypass providing unit 25 sets the extracted filters 51 and 53 of the inverse transform pair. A path that bypasses data (hereinafter also referred to as “bypass route R1”) is added to the filter graph.

  Returning to FIG. 7, next, the determination unit 24 determines whether or not the checks in steps S20 to S26 have been performed on all the extracted inverse transform pairs in step S28. If the determination unit 24 determines that all the extracted inverse transformation pairs have been checked, the process ends. On the other hand, if the determination unit 24 determines that all of the extracted inverse transform pairs are not checked, the determination unit 24 returns to step S20 and repeats the processing after step S20.

  According to the bypass addition process described above, when the filter executed between the filters of the inverse transform pair does not perform the data change process, the data input to the upstream filter of the inverse transform pair is converted to the downstream of the inverse transform pair. A bypass route R1 output from the side filter is formed. As a result, media data processing in the filter graph can be efficiently executed by forming an appropriate data bypass without changing the order of the filter graph.

(Filter processing)
Next, the filter processing (including bypass processing) of FIG. 9 will be described with reference to FIG. First, when receiving the media data transmitted from the terminal device 10 (step S30), the filter processing unit 26 acquires the next filter from the generated filter graph (step S32). The next filter is specified according to the connection order of the filter graph.

  Next, the filter processing unit 26 determines whether there is a next filter (step S34). If the filter processing unit 26 determines that there is no next filter, the process ends. On the other hand, if it is determined that there is a next filter, the filter processing unit 26 transmits data to the next filter (step S36), and executes the next filter processing (step S38). As a result, transmission data is created.

  For example, in FIG. 8, when the next filter is the filter 51 of the process A, the data received by the filter 50 is input to the filter 51 in accordance with the execution order of the filter graph (hereinafter also referred to as “regular route R2”). Process A is executed. In addition, the data input to the filter 51 is output as it is from the filter 53 using the bypass route R1.

  Returning to FIG. 7, next, the filter processing unit 26 discards the data input to the downstream filter (second filter) of the inverse transformation pair from the normal route R2 (step S40), and returns to step S32.

  For example, when the next filter is the filter 53 shown in FIG. 8, since the filter 53 is a filter on the downstream side of the inverse transformation pair, the data input to the filter 53 from the normal route R2 is discarded.

As described above, according to the server device 20 according to the first embodiment, the data input by the upstream filter of the inverse transformation pair is output as it is from the downstream filter using the bypass route R1. . Further, data input to the downstream filter from the regular route R2 is discarded. Thereby, the media data processing in the filter graph can be executed efficiently.
Second Embodiment
Next, operation | movement of the server apparatus 20 concerning 2nd Embodiment is demonstrated with reference to FIG. FIG. 10 is a flowchart illustrating an example of bypass addition processing according to the second embodiment. The difference from the first embodiment is that step S50 is added, and this bypass function can be applied to a filter graph in which a plurality of inverse transformation pairs are connected in multiple.

(Bypass additional processing)
First, similarly to the first embodiment, the processes of steps S10 to S24 are executed. In step S22, the determination unit 24 checks whether there is a filter whose data is changed among the filters executed between the extracted inverse transform pair filters (step S22). Based on the result, the determination unit 24 determines whether there is a filter whose data is changed (step S24). As a result, when it is determined that there is a filter whose data is changed, it is determined whether the filter whose data is changed is only another pair among a plurality of inverse transform pairs multiplexed (step S50). ).

  When it is determined that the filter whose data is changed is only another inverse transform pair, the bypass adding unit 25 adds a path that bypasses the extracted pair to the filter graph (step S26), and proceeds to step S28. . If it is determined in step S50 that the filter whose data is to be changed is not only another inverse transform pair, the process proceeds directly to step S28.

  For example, as shown in FIG. 11, a filter graph in which two pairs of inverse transform filters exist will be described. The filter 61 for process A and the filter 65 for process a are the first inverse pair, and the filter 62 for process B and the filter 64 for process b are the second pair of inverse transforms. The filter 63 is a filter that is executed between the filters of two inverse transform pairs. In the process C performed by the filter 63, the data is not changed.

  In the case of the first pair of inverse transforms, if “Yes” is determined in step S24, the determination unit 24 is sandwiched between the filters 61 and 65 of the first pair of inverse transforms in step S50. For the filters 62, 63, 64, it is determined whether there is a filter whose data is changed. Here, the filters 62 and 64 are filters in which data is changed. The filters 62 and 64 are another inverse transformation pair. Therefore, in this case, the determination unit 24 determines “Yes” in step S50, and adds a path (bypass route R1) through which the data bypasses the extracted filters 61 and 65 of the inverse transformation pair to the filter graph.

  Further, the determination unit 24 determines whether or not the data change is performed on the filter 63 sandwiched between the filters 62 and 64 of the second inverse conversion pair (step S24). Here, the filter 63 executes only a process that does not change the data. Therefore, in this case, the determination unit 24 determines “No” in step S24, and adds a path in which data bypasses the extracted filters 62 and 64 of the inverse transformation pair to the filter graph.

  However, the data input to the filter 65 using a path in which data bypasses the filters 62 and 64 of the inverse transform pair is discarded because it is the data input to the downstream filter 65 in step S40 of FIG. Is done. Similarly, data input to the downstream filter 64 is discarded.

As described above, according to the server device 20 according to the second embodiment, even when there are a plurality of inverse transform pair filters, each set is input to the upstream filter of the inverse transform pair. A bypass of data that can output the processed data as it is from the downstream filter is formed. As a result, even when there are multiple inverse transform pairs of filters, it is possible to efficiently process media data in the filter graph by forming an appropriate data bypass without changing the order of the filter graph. Can be executed.
<Third Embodiment>
In the server device 20 according to the third embodiment, the presence / absence of data change processing of each filter is automatically estimated at a predetermined interval to reduce the burden on the user. Specifically, input data and output data are periodically compared for each filter to determine whether or not they match. When it is confirmed that there is no change over a predetermined number of times, a flag (hereinafter, also referred to as “filter setting change flag”) indicating whether the filter performs data change processing is set to “0”. Therefore, when the filter setting change flag is “0”, it is indicated that the filter between the pairs does not perform data change processing, and when the filter setting change flag is “1”, the filter between the pairs performs data change processing. Is shown.

  As illustrated in FIG. 12, the storage unit 23 of the server device 20 according to the third embodiment stores a change presence / absence detection data table 29 in addition to the reverse conversion management DB 27 and the data change filter table 28.

  FIG. 13 shows an example of the change presence / absence detection data table 29. The change presence / absence detection data table 29 includes items of a filter instance ID 291, a filter type ID 292, a received data number 293, and an unchanged data number 294. The filter instance ID 291 is assigned “1”, “2”, “3”... In order, and the filter type ID 292 is associated with each filter instance ID 291. For each filter type ID 292, the number of received data 293 and the number of unchanged data 294 are stored.

[Operation]
Next, the operation of the server device 20 according to the third embodiment described above will be described. FIG. 14 is a flowchart illustrating an example of bypass addition processing according to the third embodiment. FIG. 15 is a flowchart illustrating an example of the filter processing according to the third embodiment.

(Bypass additional processing)
First, similarly to the first embodiment, the processes in steps S10 to S22 are executed. In step S22, it is checked whether there is a filter whose data is changed among the filters sandwiched between the extracted filters of the inverse transform pair (step S22). Based on the result, the determination unit 24 determines whether or not there is a filter whose presence / absence of data change is unknown (hereinafter also referred to as “data change presence / absence unknown filter”) (step S60).

  When determining that the data change presence / absence unknown filter exists, the determination unit 24 determines whether or not the data change presence / absence unknown filter is not registered in the change presence / absence detection data table 29 (step S62). Whether the data change presence / absence unknown filter is not registered in the change presence / absence detection data table 29 may be determined by comparing the ID of the data change presence / absence unknown filter with the filter type ID 292 of the change presence / absence detection data table 29. When it is determined that the data change presence / absence unknown filter is not registered in the change presence / absence detection data table 29, the storage unit 23 adds the data change presence / absence unknown filter to the change presence / absence detection data table 29, and the process proceeds to step S28.

  On the other hand, when determining that there is no data change presence / absence unknown filter, the determination unit 24 determines whether there is a filter in which data change is performed among the filters executed between the filters of the inverse transform pair (step S24). ). If it is determined that there is a filter whose data is changed, the process proceeds to step S28. On the other hand, when the determination unit 24 determines that there is no filter on which data is changed, the bypass grant unit 25 adds a path in which the data bypasses between the extracted filters of the inverse transform pair to the filter graph (step S26), the process proceeds to step S28.

  Next, in step S <b> 28, the determination unit 24 determines whether all of the extracted inverse transform pairs have been checked in steps S <b> 20 to S <b> 26, S <b> 60, and S <b> 62. If the determination unit 24 determines that all the extracted inverse transformation pairs have been checked, the process ends. On the other hand, if the determination unit 24 determines that the check has not been completed for all the extracted pairs of inverse transforms, the determination unit 24 returns to step S20 and repeats the processes after step S20.

  According to the bypass addition process described above, it is determined whether any of the filters between the filters of the inverse transform pair performs the data change process. As a result of the determination, when the filter executed between the filters of the inverse transform pair does not perform the data change process, data bypass using the input data to the upstream filter of the inverse transform pair as the output data of the downstream filter is performed. It is formed. As a result, media data processing in the filter graph can be efficiently executed by forming an appropriate data bypass without changing the order of the filter graph.

(Filtering / automatic estimation of filter data change)
In the filter process of FIG. 15 (including an automatic estimation process of filter data change), first, when the filter processing unit 26 receives media data transmitted from the terminal device 10 (step S30), the filter setting change flag indicates “ "0" is set (step S70). Next, the filter processing unit 26 acquires the next filter from the generated filter graph (step S32).

  Next, the filter processing unit 26 determines whether there is a next filter (step S34). If it is determined that there is no next filter, the filter processing unit 26 determines whether “1” is set in the filter setting change flag (step S72). When the filter processing unit 26 determines that “1” is not set in the filter setting change flag, it determines that the filter executed between the filters of the inverse transform pair does not perform the data change process, and performs this process. finish.

  On the other hand, if the filter processing unit 26 determines that “1” is set in the filter setting change flag, it determines that the filter executed between the filters of the inverse transform pair performs the data change process, and FIG. The process proceeds to step S14 shown in (1).

  If it is determined in step S34 that there is a next filter, data (including data transmission to bypass) is transmitted to the next filter (step S36). Next, based on the ID of the next filter and the filter type ID 292 of the change presence / absence detection data table 29, the filter processing unit 26 determines whether the next filter is registered in the change presence / absence detection data table 29 (step S74). . When it is determined that the next filter is registered in the change presence / absence detection data table 29, the filter processing unit 26 adds “1” to the received data count 293 of the change presence / absence detection data table 29 corresponding to the next filter. (Step S76).

  Next, the filter processing unit 26 determines whether the received data number 293 corresponding to the next filter is a multiple of 100 (step S78). When the filter processing unit 26 determines that the received data number 293 corresponding to the next filter is a multiple of 100, the storage unit 23 stores the received data of the next filter in the storage unit 23 (step S80). Proceed to step S38.

  If the filter processing unit 26 determines that the received data number 293 corresponding to the next filter is not a multiple of 100, the process proceeds to step S38. Here, the condition is that the number of received data is a multiple of 100, but the condition is not limited to this, and may be a multiple of other numerical values.

  In step S38, the filter processing unit 26 executes the next filter processing (including bypass processing) in units of filters (step S38). As a result, transmission data is created.

  Next, the filter processing unit 26 compares the transmission data of the next filter with the reception data stored in the storage unit 23 (step S82), and whether there is a change between the transmission data of the next filter and the stored reception data. Is determined (step S84). When the filter processing unit 26 determines that there is a change in the transmission data of the next filter and the stored reception data, the data change information 283 corresponding to the next filter in the data change filter table 28 indicates “1 (data changed). ) "Is set (step S86).

  Next, the filter processing unit 26 sets “1” in the filter setting change flag (step S88). Next, the filter processing unit 26 deletes the registration of the next filter based on the filter type ID 292 of the change presence / absence detection data table 29 (step S90), returns to step S32, and repeats the processing after step S32.

  On the other hand, in step S84, if the filter processing unit 26 determines that there is no change between the transmission data of the next filter and the stored reception data, the number of unchanged data 294 corresponding to the filter type ID of the next filter is set to “ 1 "is added (step S92).

  Next, the filter processing unit 26 determines whether the number of unchanged data 294 in the change presence / absence detection data table 29 is greater than 10 (step S94). When the number of unchanged data 294 is 10 or less, the filter processing unit 26 returns to step S32 and repeats the processing after step S32.

  On the other hand, when the number of unchanged data 294 is greater than 10, the filter processing unit 26 sets “0 (no data change)” to the data change information 283 corresponding to the filter type ID of the next filter in the data change filter table 28. Set (step S96). Next, the filter processing unit 26 sets “1” in the filter setting change flag (step S88). Next, the filter processing unit 26 deletes the registration of the next filter based on the filter type ID 292 of the change presence / absence detection data table 29 (step S90), returns to step S32, and executes the processes after step S32.

  In this way, when the processes after step S32 are repeatedly executed, if it is determined in step S34 that there is no next filter, the process proceeds to step S72, and the filter processing unit 26 sets the filter setting change flag to “1”. It is determined whether it is set (step S72). When the filter setting change flag is set to “1”, the process proceeds to (1).

  Thereby, when the filter setting change flag is set to “1”, the process proceeds to step S14 in FIG. In step S14, when the filter setting change flag is set to “1”, it can be determined that the data change is performed by the filter sandwiched between the inverse transformation pairs. For this reason, in step S14, the filter processing unit 26 deletes all existing bypasses. Next, the filter processing unit 26 again extracts the inverse transform pair from all the filters of the filter graph (step S16). When one or more inverse transform pairs are extracted (“Yes” in step S18), the filter processing unit 26 performs the processes of steps S20, S22 to S28, S60, and S62 for the extracted inverse transform pairs. Run.

  As described above, according to the server device 20 according to the third embodiment, when there is a filter whose data change is unknown, the filter whose data change is unknown is registered in the change detection data table 29. The Then, for each filter registered in the change presence / absence detection data table 29, it is determined whether or not the transmission data matches the reception data. As a result, if the number and frequency at which the transmission data and the reception data are the same data are equal to or greater than a predetermined value (threshold), “1” is set in the filter setting change flag. Based on the filter setting change flag, it is possible to automatically determine whether or not the data is a filter to be changed. Therefore, unnecessary bypass can be deleted, and the filter graph can be automatically updated to an appropriate filter graph. As a result, various media data such as image data, audio data, and vibration data can be efficiently processed. As a result, a service using an appropriate filter graph can be provided to the user at a low cost.

  Note that the number of times transmission data and reception data match is one index of the degree to which data input to the first filter and data output from the second filter match at predetermined intervals. . If the number of times the input data of the filter of the inverse transform pair matches the output data of the other filter is equal to or greater than a predetermined threshold value, it can be determined that the data change is not performed in the filter sandwiched therebetween. In this case, the predetermined threshold value can be variably set. In addition, the sampling interval for determining whether the input data of one filter of the inverse transform pair matches the output data of another filter can be set variably.

(Hardware configuration example)
Finally, a hardware configuration example of the server device 20 according to the present embodiment will be described with reference to FIG. FIG. 16 is a diagram illustrating a hardware configuration example of the server device 20 according to the present embodiment.

  The server device 20 includes an input device 101, a display device 102, an external I / F 103, a RAM (Random Access Memory) 104, a ROM (Read Only Memory) 105, a CPU (Central Processing Unit) 106, a communication I / F 107, and an HDD ( Hard Disk Drive) 108. Each part is connected to each other by a bus B.

  The input device 101 includes a keyboard and a mouse, and is used to input each operation signal to the server device 20. The display device 102 includes a display and displays various processing results.

  The communication I / F 107 is an interface that connects the server device 20 to a network. Thereby, the server device 20 can perform data communication with the terminal device 10 such as a smartphone via the communication I / F 107.

  The HDD 108 is a non-volatile storage device that stores programs and data. The stored programs and data include basic software and application software that control the entire apparatus. For example, the HDD 108 stores various DB information, programs, and the like.

  The external I / F 103 is an interface with an external device. The external device includes a recording medium 103a. Thereby, the server apparatus 20 can read and / or write the recording medium 103a via the external I / F 103. Examples of the recording medium 103a include a CD (Compact Disk), a DVD (Digital Versatile Disk), an SD memory card, a USB memory (Universal Serial Bus memory), and the like.

  The ROM 105 is a nonvolatile semiconductor memory that can retain internal data even when the power is turned off. The ROM 105 stores programs and data such as network settings. The RAM 104 is a volatile semiconductor memory that temporarily stores programs and data. The CPU 106 reads a program and data from the storage device (for example, “HDD 108”, “ROM 105”, etc.) onto the RAM 104 and executes bypass addition processing, filtering processing, automatic data change estimation processing, etc. It is an arithmetic unit that realizes the control and mounting functions. That is, with the above hardware configuration, for example, the CPU 106 executes bypass addition processing, filtering processing, and automatic estimation of data change using data and programs stored in the ROM 105 and HDD 108. As a result, in the present embodiment, the media data processing in the filter graph can be executed efficiently. The reverse conversion management DB 27, the data change filter table 28, and the change presence / absence detection data table 29 can be stored in the RAM 104, the HDD 108, or a server on the cloud connected to the server device 20 via the network.

  The server device, the program, and the information processing method have been described in the above embodiment. However, the server device, the program, and the information processing method according to the present invention are not limited to the above embodiment, and various modifications and improvements can be made within the scope of the present invention. Moreover, the matters described in the plurality of embodiments can be combined within a consistent range. Each function of the server device 20 may be configured by hardware, may be configured by software, or may be configured by combining hardware and software.

  Further, for example, the configuration of the media processing system 1 according to the above-described embodiment is an example, and does not limit the scope of the present invention, and it goes without saying that there are various system configuration examples according to applications and purposes.

  For example, a system configuration in which a plurality of terminal devices 10 and a single server device 20 are connected via the network 30 is an aspect of the media processing system 1 according to the present embodiment, and is not limited thereto. For example, the number of server apparatuses 20 included in the media processing system 1 according to the present embodiment may be one or two or more. When a plurality of server apparatuses 20 are installed, the bypass addition process and the filter process can be distributedly processed by the plurality of server apparatuses 20. Note that these processing functions may be selectively aggregated in one server device 20 among a plurality of devices according to the purpose and purpose.

Regarding the above description, the following items are further disclosed.
(Appendix 1)
A server device that generates a filter graph that defines an execution order of a plurality of filters for which processing for each filter is executed, and executes processing of the plurality of filters according to the execution order,
A detection unit that detects a pair of a first filter and a second filter that performs an inverse process of the process of the first filter among the filters included in the filter graph;
A determination unit that determines whether a filter executed between the first filter and the second filter among the filters included in the filter graph performs a data change process;
When a filter executed between the first filter and the second filter does not perform a data change process, a bypass that uses input data to the first filter as output data from the second filter A processing unit that performs processing and discards input data to the second filter;
A server device.
(Appendix 2)
The detector is
Detecting a plurality of pairs,
The processor is
When it is determined that a filter executed between one pair of the plurality of pairs performs data change processing, and the determined filter is a filter of another pair of the plurality of pairs Performing the bypass processing of the one pair and discarding input data to the second filter of the one pair;
The server device according to attachment 1.
(Appendix 3)
The determination unit
Whether the filter executed between the first filter and the second filter performs the data change process is determined by the input data of the first filter and the output data of the second filter a predetermined number of times. Judgment based on whether or not they match,
The server device according to appendix 1 or 2.
(Appendix 4)
A program that generates a filter graph that defines the execution order of a plurality of filters for which processing for each filter is executed, and causes the computer to execute the plurality of filters according to the execution order,
Among the filters included in the filter graph, a pair of a first filter and a second filter that performs an inverse process of the process of the first filter is detected.
Determining whether a filter executed between the first filter and the second filter among the filters included in the filter graph performs a data change process;
When a filter executed between the first filter and the second filter does not perform a data change process, a bypass that uses input data to the first filter as output data from the second filter Processing and discarding the input data to the second filter;
program.
(Appendix 5)
Detecting a plurality of pairs,
When it is determined that a filter executed between one pair of the plurality of pairs performs data change processing, and the determined filter is a filter of another pair of the plurality of pairs Performing the bypass processing of the one pair and discarding input data to the second filter of the one pair;
The program according to appendix 4.
(Appendix 6)
Whether the filter executed between the first filter and the second filter performs the data change process is determined by the input data of the first filter and the output data of the second filter a predetermined number of times. Judgment based on whether or not they match,
The program according to appendix 4 or 5.
(Appendix 7)
An information processing method for generating a filter graph that defines an execution order of a plurality of filters in which processing for each filter is executed, and for causing the computer to execute the plurality of filters according to the execution order,
Among the filters included in the filter graph, a pair of a first filter and a second filter that performs an inverse process of the process of the first filter is detected.
Determining whether a filter executed between the first filter and the second filter among the filters included in the filter graph performs a data change process;
When a filter executed between the first filter and the second filter does not perform a data change process, a bypass that uses input data to the first filter as output data from the second filter Processing and discarding the input data to the second filter;
Information processing method.
(Appendix 8)
Detecting a plurality of pairs,
When it is determined that a filter executed between one pair of the plurality of pairs performs data change processing, and the determined filter is a filter of another pair of the plurality of pairs Performing the bypass processing of the one pair and discarding input data to the second filter of the one pair;
The information processing method according to attachment 7.
(Appendix 9)
Whether the filter executed between the first filter and the second filter performs the data change process is determined by the input data of the first filter and the output data of the second filter a predetermined number of times. Judgment based on whether or not they match,
The information processing method according to appendix 7 or 8.

1: Media processing system 10: Terminal device 20: Server device 21: Filter graph generation unit 21
22: Detection unit 23: Storage unit 24: Determination unit 25: Bypass provision unit 26: Filter processing unit 27: Inverse conversion management DB
28: Data change filter table 29: Change presence / absence detection data table

Claims (5)

A server device that generates a filter graph that defines an execution order of a plurality of filters for which processing for each filter is executed, and executes processing of the plurality of filters according to the execution order,
A detection unit that detects a pair of a first filter and a second filter that performs an inverse process of the process of the first filter among the filters included in the filter graph;
A determination unit that determines whether a filter executed between the first filter and the second filter among the filters included in the filter graph performs a data change process;
When a filter executed between the first filter and the second filter does not perform a data change process, a bypass that uses input data to the first filter as output data from the second filter A processing unit that performs processing and discards input data to the second filter;
A server device. The detector is
Detecting a plurality of pairs,
The processor is
When it is determined that a filter executed between one pair of the plurality of pairs performs data change processing, and the determined filter is a filter of another pair of the plurality of pairs Performing the bypass processing of the one pair and discarding input data to the second filter of the one pair;
The server device according to claim 1. The determination unit
Whether the filter executed between the first filter and the second filter performs the data change process is determined by the input data of the first filter and the output data of the second filter a predetermined number of times. Judgment based on whether or not they match,
The server device according to claim 1 or 2. A program that generates a filter graph that defines the execution order of a plurality of filters for which processing for each filter is executed, and causes the computer to execute the plurality of filters according to the execution order,
Among the filters included in the filter graph, a pair of a first filter and a second filter that performs an inverse process of the process of the first filter is detected.
Determining whether a filter executed between the first filter and the second filter among the filters included in the filter graph performs a data change process;
When a filter executed between the first filter and the second filter does not perform a data change process, a bypass that uses input data to the first filter as output data from the second filter Processing and discarding the input data to the second filter;
program. An information processing method for generating a filter graph that defines an execution order of a plurality of filters in which processing for each filter is executed, and for causing the computer to execute the plurality of filters according to the execution order,
Among the filters included in the filter graph, a pair of a first filter and a second filter that performs an inverse process of the process of the first filter is detected.
Determining whether a filter executed between the first filter and the second filter among the filters included in the filter graph performs a data change process;
When a filter executed between the first filter and the second filter does not perform a data change process, a bypass that uses input data to the first filter as output data from the second filter Processing and discarding the input data to the second filter;
Information processing method.

Images