Broadcast programming method based on song music quantization attribute

Abstract

The invention discloses a broadcast programming method based on song music quantification attributes. The broadcast programming method comprises the following steps: step 1, carrying out music attribute quantification calibration on all songs in a broadcast digital system; step 2, constructing a song library, then storing quantized song information in the song library, each song having a corresponding quantized attribute tag; 3, according to the demand of the broadcast program, presetting a plurality of arrangement strategies based on the song information and songs in the song library in the step 2; 4, in the arrangement process, song information and an arrangement strategy are read into a high-speed cache in advance, so that the arrangement efficiency is improved; and 5, according to the arrangement strategy, intelligently extracting songs meeting the strategy from the song library, and carrying out programming. According to the broadcast programming method based on the quantitative attribute of the song music, a new technical means is provided for broadcast programming through quantitative analysis of the music attribute.

Description

Technical Field

[0001] The present invention relates to a method for arranging broadcast programs, and more particularly to a method for arranging broadcast programs based on the quantitative attributes of song music. Background Art

[0002] Traditional radio program arrangement relies on manual selection and judgment, which is inefficient and difficult to ensure the diversity and continuity of programs. With the development of music informatics, the quantitative analysis of music attributes provides a new technical means for radio program arrangement.

[0003] Therefore, in the prior art, there is a patent numbered 201510155821.7, entitled A method for playing music and a music player, which discloses that the method obtains the songs input by the user, analyzes the style of the songs described in the songs, and then obtains songs of the same style from a music database to achieve the effect of automatically generating a playlist. However, this method is only applicable to the automation of personal music playback and cannot be applied to the automatic arrangement of broadcast songs. Summary of the invention

[0004] In view of the deficiencies in the prior art, the object of the present invention is to provide a radio program arrangement method based on the quantitative attributes of song music, which can realize automatic arrangement of radio tracks.

[0005] To achieve the above object, the present invention provides the following technical solution: a method for arranging radio programs based on the quantitative attributes of song music, characterized in that it includes the following steps:

[0006] Step 1: Quantify and calibrate the music attributes of all songs in the broadcast digital system, including emotion, rhythm, energy, and saturation, and quantify and grade them from 1 to 9 according to the severity of the attributes;

[0007] Step 2: Build a song library, and then store the quantized song information in the song library. Each song has a corresponding quantized attribute label.

[0008] Step 3, according to the needs of the broadcast program, multiple arrangement strategies are preset based on the song information and songs in the song library in step 2;

[0009] Step 4: During the arrangement process, the song information and arrangement strategy are read into the cache in advance to improve the arrangement efficiency;

[0010] Step 5: According to the arrangement strategy, songs that meet the strategy are intelligently extracted from the song library to arrange the program. As a further improvement of the present invention, the arrangement strategy in step 3 includes:

[0011] The connection smoothing strategy focuses on the multiple mathematical relationships between the consecutively arranged programs and quantifies the multiple mathematical relationships between the attributes;

[0012] Range restriction strategy, which limits the arrangement location and the quantitative range of a certain attribute allowed for arrangement;

[0013] The conflict restriction strategy limits the conflict relationship between two consecutive arrangement positions and does not allow a certain attribute of the arrangement to conflict;

[0014] The time limit strategy limits the time relationship between multiple scheduling time points of the same program.

[0015] As a further improvement of the present invention, the smooth connection strategy specifically includes:

[0016] a. Scope limitation

[0017] Restriction algorithm: Sum(R 1 ,R 2 ,R x )∈[R min ,R max ]

[0018] R 1 A quantitative attribute value (such as emotional quantitative value) of the first program in a continuous program arrangement

[0019] R 2 A quantitative attribute value (such as emotional quantitative value) of the second program in a continuous program arrangement

[0020] R x A quantitative attribute value (such as emotional quantitative value) of the third program to be arranged. During the arrangement process, programs that meet other restrictions are taken from the program pool and enter the algorithm calculation one by one. If the attached algorithm requires it, it means that the program meets the restriction strategy and can be arranged in this position

[0021] Sum() sums three consecutive attribute values ​​to ensure that the range of the specified attribute values ​​of the subsequent programs added does not exceed the specified range in the process of editing one by one. min ,R max ]scope

[0022] R min ,R max The minimum and maximum values ​​allowed for the sum of the three specified quantitative attributes

[0023] b. Change restrictions

[0024] Restriction algorithm: abs(R x -R 1 )∈[R min ,R max ]

[0025] R 1 It is a quantitative attribute value (such as emotional quantification value) of the first program in a continuous arrangement, usually the program before the location to be arranged.

[0026] R x It is a quantitative attribute value of the program to be arranged (such as the emotional quantitative value). During the arrangement process, the programs that meet other restrictions are taken from the program pool and enter the algorithm calculation one by one. If they meet the algorithm requirements, it means that the program meets the restriction strategy and can be arranged in this position.

[0027] abs() takes the absolute value of the attribute difference. After taking the absolute value, the difference range [R min ,R max ], if it is within the range, it meets the restriction algorithm and the program can arrange the position

[0028] R min ,R max The minimum and maximum values ​​allowed for the difference between the two specified quantitative attributes.

[0029] As a further improvement of the present invention, the range limitation strategy specifically includes:

[0030] R x ∈[R min ,R max ]

[0031] R x is a quantitative attribute value of the program to be arranged. During the arrangement process, programs that meet other restrictions are taken from the program pool and enter the algorithm calculation one by one. If the quantitative attribute value of the program is within the required [R min ,R max ] range, it means that the program complies with the restriction strategy and can be placed in this position.

[0032] As a further improvement of the present invention, the conflict limitation strategy specifically includes:

[0033] CD(R x ,R 1 )

[0034] R 1 It is a quantitative attribute value of the first program in a continuous arrangement, generally the program before the position to be arranged;

[0035] R xis a quantitative attribute value of the program to be scheduled. During the scheduling process, programs that meet other restrictions are taken from the program pool and enter the algorithm calculation one by one. If the calculation result is 0, it means that the program meets the restriction strategy and can be arranged in this position; the calculation result 1 indicates that there is a conflict and it cannot be arranged; CD() is a conflict detection function, which performs conflict detection calculation according to the conflict parameters set by the strategy. If there is a conflict, it returns 1, otherwise it returns 0.

[0036] As a further improvement of the present invention, the time limit strategy specifically includes:

[0037] a. Interval Limitation

[0038] Limiting algorithm: Tx-T 1 >T min

[0039] T 1 The time when the program was last scheduled to be broadcast;

[0040] Tx is the broadcast time point of the current scheduled position of the program;

[0041] The difference between the broadcast time of two scheduling positions needs to be greater than the set minimum interval T min ,This strategy ensures that the same program is not broadcast too often;

[0042] b. Staggered restrictions

[0043] Limit algorithm: min(abs(Tx-T n -N*24*60*60))>T min

[0044] T n It is a certain broadcast time point of the program in multiple scheduling positions N days ago. If there are multiple scheduling positions in one day, there will be multiple time points;

[0045] Tx is the broadcast time point of the current scheduled position of the program;

[0046] N is the number of days to be staggered, and the value is generally [1,7], and N*24*60*60 is the number of seconds for the length of N days;

[0047] abs() takes the absolute value;

[0048] min() takes the minimum value among multiple results;

[0049] The minimum time difference between the current scheduling position and multiple scheduling positions of the same program N days ago needs to be greater than the set minimum interval T min ,This strategy ensures that the same program is not broadcast frequently in the same time slot on different days.

[0050] The beneficial effects of the present invention are that, through the settings of steps 1 to 5, the automation and intelligence of broadcast program arrangement can be effectively realized, and the advantages are as follows:

[0051] Improved orchestration efficiency and reduced manual intervention;

[0052] Ensures diversity and continuity of programs;

[0053] Through fine control of quantitative attributes, the personalization and accuracy of program scheduling are improved. DETAILED DESCRIPTION

[0054] The present invention will be further described in detail with reference to the given embodiments below.

[0055] A method for arranging a broadcast program based on the quantitative attributes of song music in this embodiment includes the following steps:

[0056] Music attribute quantitative cataloging: Quantify the music attributes of all songs in the broadcast digital system, including mood, rhythm, energy, saturation, etc., and quantify and grade them from 1 to 9 according to the severity of the attribute. The attributes are graded as follows:

[0057] The emotional quantification classification is defined as follows:

[0058] 1 sad, 2 sad, 3 helpless, 4 calm, 5 powerful, 6 relaxed, 7 cheerful, 8 lively, 9 noisy.

[0059] The rhythm quantization classification is defined as follows:

[0060] 1 is the fastest, 2 is faster, 3 is faster, 4 is slightly faster, 5 is medium, 6 is slightly slower, 7 is slower, 8 is slower, and 9 is the slowest.

[0061] The energy and saturation quantification classifications are defined as follows:

[0062] 1 is the highest, 2 is higher, 3 is high, 4 is slightly higher, 5 is medium, 6 is slightly lower, 7 is low, 8 is lower, and 9 is the lowest.

[0063] Song library construction: The quantified song information is stored in the song library, and each song has a corresponding quantized attribute label.

[0064] Scheduling strategy setting: According to the needs of broadcast programs, a variety of scheduling strategies are preset, and the restriction strategies include connection smoothing strategy, range restriction strategy, conflict restriction strategy, time restriction strategy, etc.

[0065] Smooth connection strategy: Focus on the multiple mathematical relationships between the consecutively arranged programs and quantify the attributes, including:

[0066] a. Scope limitation

[0067] Restriction algorithm: Sum(R 1 ,R 2 ,R x )∈[R min ,R max ]

[0068] R 1 A quantitative attribute value (such as emotional quantitative value) of the first program in a continuous program arrangement

[0069] R 2 A quantitative attribute value (such as emotional quantitative value) of the second program in a continuous program arrangement

[0070] R x For a quantitative attribute value (such as an emotional quantization value) of the third program to be arranged, during the arrangement process, programs that meet other restriction conditions are taken out from the program pool and enter the algorithm calculation one by one. If the attached algorithm requires it, it means that the program meets the restriction strategy and can be arranged in this position.

[0071] Sum() sums three consecutive attribute values ​​to ensure that the range of the specified attribute values ​​of the subsequent programs added does not exceed the specified range in the process of editing one by one. min ,R max ]scope.

[0072] R min ,R max The minimum and maximum values ​​allowed for the sum of the three specified quantitative attributes.

[0073] b. Change restrictions

[0074] Restriction algorithm: abs(R x -R 1 )∈[R min ,R max ]

[0075] R 1 It is a quantitative attribute value (such as a quantitative value of emotion) of the first program in a certain continuously arranged program, generally the program before the position to be arranged.

[0076] R x It is a quantitative attribute value of the program to be arranged (such as the emotional quantitative value). During the arrangement process, the programs that meet other restrictions are taken from the program pool and enter the algorithm calculation one by one. If they meet the algorithm requirements, it means that the program meets the restriction strategy and can be arranged in this position.

[0077] abs() takes the absolute value of the attribute difference. After taking the absolute value, the difference range [R min ,R max] is compared. If it is within the range, it complies with the restriction algorithm and the program can be scheduled to that position.

[0078] R min ,R max The minimum and maximum values ​​allowed for the difference between the two specified quantitative attributes

[0079] Range restriction strategy: restrict the arrangement position, and allow a quantitative range of a certain attribute to be arranged, such as only allowing programs with calm emotions (4) to be arranged. Restriction algorithm:

[0080] R x ∈[R min ,R max ]

[0081] R x is a quantitative attribute value (such as emotional quantization value) of the program to be arranged. During the arrangement process, programs that meet other restrictions are taken from the program pool and enter the algorithm calculation one by one. If the quantitative attribute value of the program is within the required [R min ,R max ] range, it means that the program complies with the restriction strategy and can be placed in this position.

[0082] Conflict restriction strategy: restrict two consecutive arrangement positions, and do not allow conflicting relationship restrictions on a certain attribute of the arrangement. For example, it is not allowed to arrange the previous position with the emotion of sadness (1) and the next position with the emotion of happiness (7). The restriction algorithm is as follows:

[0083] CD(R x ,R 1 )

[0084] R 1 It is a quantitative attribute value (such as a quantitative value of emotion) of the first program in a certain continuously arranged program, generally the program before the position to be arranged.

[0085] R x It is a quantitative attribute value of the program to be arranged (such as the quantitative value of emotion). During the arrangement process, programs that meet other restrictions are taken out from the program pool and enter the algorithm calculation one by one. If the calculation result is 0, it means that the program meets the restriction strategy and can be arranged in this position; the calculation result is 1, which means there is a conflict and it cannot be arranged.

[0086] CD() is a conflict detection function, which performs conflict detection calculations based on the conflict parameters set by the strategy. If there is a conflict, it returns 1, and if there is no conflict, it returns 0. The emotional conflict detection parameter configuration is shown in the following table:

[0087] 1 2 3 4 5 6 7 8 9 1 X X X X 2 X X X 3 X X 4 X 5 A 6 X 7 X X 8 X X X 9 X X X X

[0088] The columns are the quantitative attribute values ​​of the previous program, and the rows are the attribute values ​​of the next program. The intersection of the columns and rows is the conflict situation. For example, if an X is marked at position A, it means that when the emotion of the previous program is 3, the emotion of the next program is not allowed to be 5.

[0089] Time restriction strategy: restrict the time relationship between multiple scheduling time points of the same program, including:

[0090] c. Interval Limitation

[0091] Limiting algorithm: Tx-T 1 >T min

[0092] T 1 The time when the program was last scheduled to be broadcast

[0093] Tx is the broadcast time point of the current scheduled position of the program

[0094] The difference between the broadcast time of two scheduling positions (in seconds) must be greater than the set minimum interval T min ,This strategy ensures that the same program will not be broadcast ,frequently.

[0095] d. Stagger restrictions

[0096] Limit algorithm: min(abs(Tx-T n -N*24*60*60))>T min

[0097] T n It is a certain broadcast time point of the program in multiple scheduling positions N days ago. If there are multiple scheduling positions in one day, there will be multiple time points.

[0098] Tx is the broadcast time point of the current scheduled position of the program

[0099] N is the number of days to be staggered, and the value is usually [1,7], and N*24*60*60 is the number of seconds for the length of N days.

[0100] abs() takes the absolute value

[0101] min() takes the minimum value among multiple results

[0102] The minimum time difference (in seconds) between the current arrangement position and multiple arrangement positions of the same program N days ago needs to be greater than the set minimum interval T min ,This strategy ensures that the same program is not broadcast frequently in the same time slot on different days.

[0103] Cache pre-reading: During the arrangement process, the song information and arrangement strategy are read into the cache in advance to improve the arrangement efficiency.

[0104] Intelligent arrangement execution: According to the arrangement strategy, songs that meet the strategy are intelligently extracted from the song library for program arrangement.

[0105] Output of programming results: Output the programmed program for broadcasting.

[0106] To sum up, the radio program arrangement method based on the quantitative music attributes of songs in the radio digitization system in this embodiment performs a quantitative analysis of the music attributes of songs in the radio digitization system, and grades them according to levels 1 to 9, constructs a song library containing quantitative attribute labels, sets arrangement strategies, such as the emotional connection smoothing strategy, selects songs with similar emotional attributes for arrangement, and before arrangement, pre-reads relevant song information and arrangement strategies into the cache, executes intelligent arrangement, extracts songs from the song library according to the arrangement strategy, forms a program list, and outputs the arrangement results for actual radio program broadcasting.

[0107] The above is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above embodiments. All technical solutions under the concept of the present invention belong to the protection scope of the present invention. It should be pointed out that for ordinary technicians in this technical field, some improvements and modifications without departing from the principle of the present invention should also be regarded as the protection scope of the present invention.

Claims

1. A method for arranging radio programs based on the quantitative attributes of song music, characterized in that: The steps include: Step 1: Quantify and calibrate the music attributes of all songs in the broadcast digital system, including emotion, rhythm, energy, and saturation, and quantify and grade them from 1 to 9 according to the severity of the attributes; Step 2: Build a song library, and then store the quantized song information in the song library. Each song has a corresponding quantized attribute label. Step 3, according to the needs of the broadcast program, multiple arrangement strategies are preset based on the song information and songs in the song library in step 2; Step 4: During the arrangement process, the song information and arrangement strategy are read into the cache in advance to improve the arrangement efficiency; Step 5: According to the arrangement strategy, songs that meet the strategy are intelligently extracted from the song library to arrange the program.

2. The method for arranging radio programs based on the quantitative attributes of song music according to claim 1, characterized in that: The orchestration strategy in step 3 includes: The connection smoothing strategy focuses on the multiple mathematical relationships between the consecutively arranged programs and quantifies the multiple mathematical relationships between the attributes; Range restriction strategy, which limits the arrangement position and the quantitative range of a certain attribute allowed for arrangement; The conflict restriction strategy limits the conflict relationship between two consecutive arrangement positions and does not allow a certain attribute of the arrangement to conflict; The time limit strategy limits the time relationship between multiple scheduling time points of the same program.

3. The method for arranging broadcast programs based on the quantitative attributes of song music according to claim 2, characterized in that: The connection smoothing strategy specifically includes: a. Scope limitation Restriction algorithm: Sum(R1,R2,R x )∈[R min ,R max ] R1 is a quantitative attribute value of the first program in a continuous arrangement (such as emotional quantitative value) R2 is a quantitative attribute value of the second program in a continuous arrangement (such as emotional quantitative value) R x A quantitative attribute value (such as emotional quantitative value) of the third program to be arranged. During the arrangement process, programs that meet other restrictions are taken from the program pool and enter the algorithm calculation one by one. If the attached algorithm requires it, it means that the program meets the restriction strategy and can be arranged in this position Sum() sums three consecutive attribute values ​​to ensure that the range of the specified attribute values ​​of the subsequent programs added does not exceed the specified range in the process of editing one by one. min ,R max ]scope R min ,R max The minimum and maximum values ​​allowed for the sum of the three specified quantitative attributes b. Change restrictions Restriction algorithm: abs(R x -R1)∈[R min ,R max ] R1 is a quantitative attribute value (such as emotional quantification value) of the first program in a continuous arrangement, usually the program before the position to be arranged. R x It is a quantitative attribute value of the program to be arranged (such as the emotional quantitative value). During the arrangement process, the programs that meet other restrictions are taken from the program pool and enter the algorithm calculation one by one. If they meet the algorithm requirements, it means that the program meets the restriction strategy and can be arranged in this position. abs() takes the absolute value of the attribute difference. After taking the absolute value, the difference range [R min ,R max ], if it is within the range, it meets the restriction algorithm and the program can arrange the position R min ,R max The minimum and maximum values ​​allowed for the difference between the two specified quantitative attributes.

4. The method for arranging broadcast programs based on the quantitative attributes of song music according to claim 2 or 3, characterized in that: The range restriction strategy specifically includes: R x ∈[R min ,R max ] R x is a quantitative attribute value of the program to be arranged. During the arrangement process, programs that meet other restrictions are taken from the program pool and enter the algorithm calculation one by one. If the quantitative attribute value of the program is within the required [R min ,R max ] range, it means that the program complies with the restriction strategy and can be placed in this position.

5. The method for arranging broadcast programs based on the quantitative attributes of song music according to claim 2 or 3, characterized in that: The conflict limitation strategy specifically includes: CD(R) x ,R1) R1 is a quantitative attribute value of the first program in a certain continuous arrangement, generally the program before the position to be arranged; R x is a quantitative attribute value of the program to be arranged. During the arrangement process, programs that meet other restriction conditions are taken from the program pool and enter the algorithm calculation one by one. If the calculation result is 0, it means that the program meets the restriction strategy and can be arranged in this position; if the calculation result is 1, it means that there is a conflict and it cannot be arranged; CD() is a conflict detection function, which performs conflict detection calculations based on the conflict parameters set by the strategy. If there is a conflict, it returns 1, otherwise it returns 0.

6. The method for arranging broadcast programs based on the quantitative attributes of song music according to claim 2 or 3, characterized in that: The time limit strategy specifically includes: a. Interval Limitation Limitation algorithm: Tx-T1>T min T1 is the broadcast time point of the previous scheduled position of the program; Tx is the broadcast time point of the current scheduled position of the program; The difference between the broadcast time of two scheduling positions needs to be greater than the set minimum interval T min ,This strategy ensures that the same program is not broadcast too often; b. Staggered restrictions Limit algorithm: min(abs(Tx-T n -N*24*60*60))>T min T n It is a certain broadcast time point of the program in multiple scheduling positions N days ago. If there are multiple scheduling positions in one day, there will be multiple time points; Tx is the broadcast time point of the current scheduled position of the program; N is the number of days to be staggered, and the value is generally [1,7], and N*24*60*60 is the number of seconds for the length of N days; abs() takes the absolute value; min() takes the minimum value among multiple results; The minimum time difference between the current scheduling position and multiple scheduling positions of the same program N days ago needs to be greater than the set minimum interval T min ,This strategy ensures that the same program is not broadcast frequently in the same time slot on different days.