EP1794743A1 - Vorrichtung und verfahren zum gruppieren von zeitlichen segmenten eines musikstücks - Google Patents
Vorrichtung und verfahren zum gruppieren von zeitlichen segmenten eines musikstücksInfo
- Publication number
- EP1794743A1 EP1794743A1 EP05760763A EP05760763A EP1794743A1 EP 1794743 A1 EP1794743 A1 EP 1794743A1 EP 05760763 A EP05760763 A EP 05760763A EP 05760763 A EP05760763 A EP 05760763A EP 1794743 A1 EP1794743 A1 EP 1794743A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- segment
- class
- similarity
- segments
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10H—ELECTROPHONIC MUSICAL INSTRUMENTS; INSTRUMENTS IN WHICH THE TONES ARE GENERATED BY ELECTROMECHANICAL MEANS OR ELECTRONIC GENERATORS, OR IN WHICH THE TONES ARE SYNTHESISED FROM A DATA STORE
- G10H1/00—Details of electrophonic musical instruments
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10H—ELECTROPHONIC MUSICAL INSTRUMENTS; INSTRUMENTS IN WHICH THE TONES ARE GENERATED BY ELECTROMECHANICAL MEANS OR ELECTRONIC GENERATORS, OR IN WHICH THE TONES ARE SYNTHESISED FROM A DATA STORE
- G10H2210/00—Aspects or methods of musical processing having intrinsic musical character, i.e. involving musical theory or musical parameters or relying on musical knowledge, as applied in electrophonic musical tools or instruments
- G10H2210/031—Musical analysis, i.e. isolation, extraction or identification of musical elements or musical parameters from a raw acoustic signal or from an encoded audio signal
- G10H2210/061—Musical analysis, i.e. isolation, extraction or identification of musical elements or musical parameters from a raw acoustic signal or from an encoded audio signal for extraction of musical phrases, isolation of musically relevant segments, e.g. musical thumbnail generation, or for temporal structure analysis of a musical piece, e.g. determination of the movement sequence of a musical work
Definitions
- the present invention relates to the audio segmentation and in particular to the analysis of pieces of music on the individual Kleintei ⁇ contained in the pieces of music, which may occur repeatedly in the piece of music.
- Music from the rock and Popbereicri consists mostly of more or less unique segments, such as intro, verse, chorus, bridge, O ⁇ tro, etc.
- the beginning and end times of such segments to detect and the segments according to their affiliation to the most important Klas ⁇ Grouping the stanza (verse and chorus) is the goal of audio segmentation.
- Correct segmentation and also identification of the calculated segments can be usefully used in various areas. For example, pieces of music from online providers such as Amazon, Mu- sicline, etc. can be intelligently "played”.
- Another application example for the technique of audio segmentation is the integration of the segmentation / Grouping / marking algorithm into a music player.
- the information about segment beginnings and segment ends makes it possible to navigate through a piece of music. Due to the class affiliation of the segments, ie whether a segment is a verse, a chorus, etc., z. B. also jump directly to the next chorus or the next stanza.
- Such an application is of interest to large music markets, offering their customers the opportunity to listen to complete albums. As a result, the customer spares himself the annoying, searching fast-forward to characteristic points in the song, which could perhaps lead him to actually buy a piece of music in the end.
- a WAV file 500 is provided.
- a feature extraction then takes place, wherein as a feature the spectral coefficients per se or alternatively the mel frequency cepstral coefficients (MFCCs) are extracted.
- MFCCs mel frequency cepstral coefficients
- STFT short-time Fourier transform
- the MFCC features are then extracted in the spectral range.
- the extracted features are then stored in a memory 504.
- the feature extraction algorithm now has a segmentation algorithm that ends in a similarity matrix, as shown in a block 506.
- the feature matrix is read in (508), to then group feature vectors (510), to then build a similarity matrix based on the grouped feature vectors, which consists of a distance measurement between each of all features.
- all pairs of audio window pairs are compared using a quantitative similarity measure, distance.
- the music piece is represented as a stream or stream 800 of audio samples.
- the piece of audio is windowed, as has been stated, with a first window having i and a second window being j.
- the audio piece has z. B. K window.
- the similarity matrix has K rows and K columns.
- a similarity measure to each other is calculated, and the calculated similarity measure or distance measure D (i, j) is input to the row or column designated by i and j in the similarity matrix.
- One column therefore shows the similarity of the window designated by j to all other audio windows in the piece of music.
- the matrix is redundant in that it is symmetric to the diagonal, and that on the diagonal the similarity of a window is to itself, which is the trivial case of 100% similarity.
- FIG. 6 An example of a similarity matrix of a piece can be seen in FIG.
- the completely symmetrical structure of the matrix with respect to the main diagonal is recognizable, the main diagonal being visible as a light stripe.
- the main diagonal is not seen as a lighter solid line, but from Fig. 6 is only approximately recognizable.
- a kernel correlation 512 is performed on a kernel matrix 514 to obtain a novelty measure, also known as a novelty score, that could be averaged and smoothed into
- a novelty measure also known as a novelty score
- the segment boundaries are read out using the smoothed novelty value profile, for which purpose the local maxima in the smoothed novelty curve are determined and, if appropriate, must be shifted by a constant number of samples caused by the smoothing in order actually to produce the correct segment - To obtain limits of the audio piece as absolute or relative Zeitan ⁇ gift. - D
- segment similarity representation or segment similarity matrix is created.
- An example of a segment similarity matrix is shown in FIG.
- the similarity matrix in FIG. 7 is basically similar to the feature similarity matrix of FIG. 6, but now, as in FIG. 6, features from windows are no longer used, but features from a whole segment.
- a clustering is carried out, that is, an arrangement of the segments into segment classes (an arrangement of similar segments into the same
- Labeling also determines which segment class contains segments which are stanzas, which are reflections, which are intros, outros, bridges, etc. 25
- a music score is created, which is e.g. B. can be provided to a user, without redundancy of a piece only z. B. a stanza, a chorus and the intro
- the feature matrix has the dimension number of analysis windows times the number of Merkiinalskostoryen.
- the similarity matrix By the similarity matrix, the characteristic curve of a piece ⁇ n is given a two-dimensional representation. For each pairwise combination of feature vectors, the distance measure is calculated, which is kept fixed in the similarity matrix. There are various possibilities for calculating the distance measure between two vectors, for example the Euclidean distance measurement and the cosine distance measurement.
- a result D (i, j) between the two feature vectors is stored in the i, jth element of the window similarity matrix (block 506).
- the main diagonal of the similarity matrix represents the course over the entire piece. Accordingly, the elements of the Hamptdiagonalen result from the respective comparison of a window with itself and always have the value of the greatest similarity. For the cosine distance measurement this is de: r value 1, for the simple scalar difference and the Euclid distance this value is equal to 0.
- each element i, j is assigned a gray value.
- the gray values are graduated in proportion to the similarity values, so that the maximum similarity (the main diagonal) corresponds to the maximum similarity.
- the structure of a song can already be visually recognized on the basis of the matrix. Areas of similar feature expression correspond to quadrants of similar brightness along the main diagonal. Finding the boundaries between the areas is the task of the actual segmentation.
- the structure of the similarity matrix is important to the novelty measure calculated in kernel correlation 512. The measure of novelty arises from the correlation of a special kernel along the main diagonal of the similarity matrix.
- An exemplary kernel K is shown in FIG.
- this kernel matrix along the main diagonal of the similarity matrix S, and sums up all the products of the superimposed matrix elements for each time point i of the piece, then one obtains the measure of novelty, which is shown by way of example in FIG. 9 in a smoothed form .
- the kernel K in FIG. 5 is used, but an enlarged kernel, which is additionally superimposed with a Gaussian distribution, so that the edges of the matrix tend towards zero.
- the novelty measure should be smoothed with different filters, such as IIR filters or FIR filters.
- segment boundaries of a piece of music are extracted, then similar segments must be identified as such and grouped into classes.
- Foote and Cooper describe the computation of a segment-based similarity matrix using a Cullback-Leibler distance.
- individual segment feature matrices are extracted from the entire feature matrix on the basis of the segment boundaries obtained from the course of novelty, ie each of these matrices is a submatrix of the entire feature matrix.
- an automatic summary of a piece is then carried out on the basis of the segments and clusters of a piece of music. To do this, first select the two clusters with the largest x-ray values. Then, the segment with the maximum value of the corresponding cluster indicator is added to this summary. This means that the summary includes a stanza and a chorus. Alternatively, all repeated segments can also be removed to ensure that all information of the piece is provided, but always exactly once.
- a disadvantage of the known method is the fact that the singular value decomposition (SVD) for segment class formation, that is to say the assignment of segments to clusters, is very computationally intensive and is problematic in the evaluation of the results. Thus, if the singular values are nearly equal, then a possibly wrong decision is made to the effect that the two similar singular values actually represent the same segment class and not two different segment classes.
- SMD singular value decomposition
- the object of the present invention is to provide an improved and at the same time efficient concept for grouping temporal segments of a piece of music.
- the present invention is based on the finding that the assignment of a segment to a segment class is to be carried out on the basis of an adaptive similarity mean value for a segment such that the overall similarity score is taken into account by the average of the average has a segment throughout the piece. After such a similarity mean has been calculated for a segment, for the calculation of which the number of segments and the similarity values of the plurality of similarity values assigned to the segment are required, then the actual allocation of a segment becomes a segment class, ie a cluster , performed on the basis of this similarity mean.
- a similarity value of a segment to the segment just considered is above the similarity mean, for example, the segment is assigned as belonging to the segment class currently being considered. On the other hand, if the similarity value of a segment to the segment under consideration is below this similarity mean, it is not assigned to the segment class.
- the strong deviations of the similarities of segments in pieces or the frequency of the occurrence of certain segments in pieces are taken into account, whereby z. B. numerical problems and thus ambiguities and da ⁇ associated false allocations can be avoided.
- the concept according to the invention is particularly suitable for music pieces which do not consist only of stanzas and choruses, ie have the segments which belong to the segment class. have the same similarity values, but also for pieces that have other parts in addition to stanza and chorus, namely an introduction (Intro), an interlude (Bridge) or a finale (Outro).
- the calculation of the adaptive similarity mean and the assignment of a segment are performed iteratively, ignoring assigned segments at the next iteration run.
- the similarity absolute value that is to say the sum of the similarity values in a column of the similarity matrix, changes again for the next iteration run since already assigned segments have been set to 0.
- a segmentation post-correction is carried out, in such a way that after the segmentation z. B. due to the novelty value (the local maxima of novelty value) and after a subsequent assignment to segment classes relatively short segments are examined to see if they can be assigned to the predecessor segment or the successor ger segment, as segments below a minimal segment length is likely to indicate over-segmentation.
- a labeling is carried out after the final segmentation and assignment into the segment classes, specifically using a special selection algorithm in order to obtain the most correct possible labeling of the segment classes as a stanza or chorus.
- FIG. 1 shows a block diagram of the device according to the invention for grouping according to a preferred embodiment of the present invention
- FIG. 2 shows a flow chart for illustrating a preferred embodiment of the invention for iteratively assigning
- 3 is a block diagram of the operation of the segmentation correction device
- Figures 4a and 4b show a preferred embodiment of the segment class designator
- FIG. 5 shows an overall block diagram of an audio analysis tool
- FIG. 8 shows a schematic representation for illustrating the elements in a similarity matrix S
- FIG. 9 is a schematic representation of a smoothed novelty value.
- FIG. 1 shows a device for grouping temporal segments of a piece of music, which is subdivided into main parts which repeatedly appear in the piece of music, into different segment classes, one segment class being assigned to a main part.
- the present invention thus relates particularly to pieces of music which are subject to a certain structure in which similar sections appear several times and alternate with other sections.
- the Most rock and pop songs have a clear structure in terms of their main parts.
- a large shaped part of a piece is a section which has a relatively uniform character with regard to various features, eg, melody, rhythm, texture, etc. Definition applies generally in music theory.
- Intros often consist of the same chord progression as the stanza, but with different instrumentation, eg. B. without drums, without bass or distortion of the guitar in rock songs etc.
- the device according to the invention initially comprises a device 10 for providing a similarity representation for the segments, the similarity representation for each segment having an associated plurality of similarity values, the similarity values indicating how similar the segment is to each other segment.
- the similarity representation is preferably the segment similarity matrix shown in FIG. It has for each segment (in Fig. 7 segments 1-10) its own column which has the index " j ⁇ . Furthermore, the similarity representation has a separate line for each segment, one line being designated by a line index i. This will be referred to below with reference to the exemplary segment 5.
- the element (5, 5) in the main diagonal of the matrix of FIG. 7 is the similarity value of the segment 5 with itself, ie the maximum similarity value.
- segment 5 is still medium-le to the segment no. 6, as it is denoted by the element (6,5) or by the element (5,6) of the matrix in Fig. 7. Moreover, the segment 5 is still similar to the segments 2 and 3 as shown by elements (2, 5) or (3, 5) or (5, 5) or (5, 3) in FIG. 7. To the other segments 1, 4, 7, 8, 9, 10, the segment No. 5 has a similarity, which is no longer visible in Fig. 7.
- a plurality of similarity values assigned to the segment is, for example, a column or a row of the segment similarity matrix in FIG. 7, this column or row indicating by its column / row index which segment it refers to, namely, for example, to the fifth segment, and where this row / column includes the similarities of the fifth segment to each other segment in the piece.
- the plurality of similarity values is, for example, a row of the similarity matrix or, alternatively, a column of the similarity matrix of FIG. 7.
- the device for grouping temporal segments of the piece of music further comprises means 12 for calculating a similarity mean value for a segment, using the segments and the similarity values of the segment Segment associated with a plurality of similarity values.
- the device 12 is designed to z. For example, to calculate a similarity mean for column 5 in FIG. If the arithmetic mean value is used in a preferred exemplary embodiment, the device 12 will add the similarity values in the column and divide them by the total number of segments. To eliminate the self - similarity, could of the. As a result of addition, the similarity of the segment to itself can also be deducted, whereby, of course, a division is then no longer to be carried out by all elements, but by all elements less than one.
- the means 12 for calculating could alternatively also calculate the geometric mean value, ie each similarity value of a column for: square, in order to sum the quadrated results, in order then to calculate a root from the summation result, which is given by the number The elements in the column (or the number of elements in the column less "1) is to be divided in. Any other average values, such as the median value, etc., can be used as long as the mean value for each column is Similarity matrix is calculated adaptively, that is, a value that is calculated using the similarity values of the plurality of similarity values associated with the segment.
- the adaptively calculated similarity threshold is then provided to a segment 14 for assigning a segment to a segment class.
- the means 14 for assigning is designed to assign a segment to a segment class if the similarity value of the segment fulfills a predetermined condition with respect to the mean of similarity. For example, if the similarity mean value is such that a larger value indicates a greater similarity and a smaller value indicates a lower similarity, the predetermined relationship will be that the similarity value of a segment equal to or above the Similarity mean, in order for the segment to be assigned to a segment class.
- a segment selection device 16 In a preferred embodiment of the present invention, further devices exist to realize special embodiments, which will be discussed later. These devices are a segment selection device 16, a segment assignment conflicting device 18, a segmentation correction device 20 and a segment class designation device 22.
- the segment selector 16 in FIG. 1 is designed to first calculate an overall similarity value V (j) for each column in the matrix of FIG. 7, which is determined as follows:
- P is the number of segments.
- S ⁇ is the value of the self-similarity of a segment with itself.
- the value z. B. zero or one.
- the segment selector 16 will first: calculate the value V (j) for each segment to then find the vector element i of the maximum value vector V. In other words, this means that the column in FIG. 7 is selected, which achieves the greatest value or score when the individual similarity values in the column are added up.
- This segment could, for example, be the segment No. 5 or the column 5 of the matrix in FIG. 7, since this segment has at least a certain similarity with three other segments.
- Another candidate in which to Example of Fig. 7 also Segmen t ⁇ could be No.
- segment selection device 16 selects segment No. 7, since it has the highest similarity score on the basis of the matrix elements (1, 7), (4, 7) and (10, 7) , In other words, this means that V (7) is the component of the vector V which has the maximum value among all the components of V.
- segment similarity matrix for the seventh row or column it is checked which segment similarities are above the calculated threshold value, ie. H. with which segments the i-th segment has an above-average similarity. All these segments are now also assigned to a first segment class like the seventh segment.
- segment no. 4 and segment no. 1 are also classified in the first segment class.
- segment No. 10 is not classified in the first segment class due to the below-average similarity to segment No. 7.
- V which belong to an assigned segment, are ignored in the next maximum search in a later iteration step.
- a new maximum is now selected from the remaining elements of V, that is to say V (2), V (3), V (5), V (6), V (8), V (9) and V (IO) searched.
- the segment no. 5, ie V (5), is expected to yield the largest similarity score.
- the second segment class then obtains segments 5 and 6. Due to the fact that the similarities to segments 2 and 3 are below average, segments 2 and 3 are not placed in the second order clusters.
- the elements V (6) and V (5) are set to 0 by the vector V due to the assignment that has been made, while still the components V (2), V (3), V (8), V ⁇ 9) and V (IO) of the vector for the selection of the third-order cluster remain.
- V (IO) ie the component of V for the segment 10.
- V (IO) the component of V for the segment 10.
- Segment 10 thus comes in the third-order segment class.
- the segment 7 also has an above-average similarity to the segment 10, although the segment 7 is already identified as belonging to the first segment class.
- a simple kind of resolution could be to simply not assign the segment 7 into the third segment class and e.g. For example, instead of assigning the segment 4, if for the segment 4 would not also conflict exist.
- the similarity between 7 and 10 is taken into account in the following algorithm.
- the invention is designed not to discount the similarity between i and k. Therefore, the similarity values S s (i, k) of segment i and k are compared with the similarity value S s (i * , k), where i * is the first segment assigned to the cluster C * .
- the cluster or the segment class C * is the cluster to which segment k is already assigned on the basis of a previous examination.
- the similarity value S s (i * , k) is decisive for the fact that the segment k belongs to the cluster C * . If S s (i * , k) is greater than S s (i / k), segment k remains in cluster C * .
- S s (i * , k) is smaller than S s (i, k)
- the segment k is taken out of the cluster C * and assigned to the cluster C.
- a tendency towards the cluster i is noted for the cluster C * .
- this tendency is also noted when segment k changes cluster membership.
- a tendency of this segment to the cluster in which it was originally recorded is noted.
- the similarity value check is based on the fact that the segment 7 is the "original segment” in the first segment class, in favor of the first segment class. It will remain in the first segment class. However, this fact is taken into account by the fact that segment no. 10 in the third segment class is attested a trend towards the first segment class.
- segmentation correcting device 20 In the following, the preferred implementation of the segmentation correcting device 20 will be described in detail with reference to FIG. 3.
- the correction serves to completely eliminate segments that are too short, ie to merge with adjacent segments, and to segments that are short but not too short, ie that are short in length but longer than that Minimal lengths are still to undergo a special investigation, whether they may not yet be merged with a predecessor segment or a successor segment.
- successive segments which belong to the same segment class are always fused together. If the scenario shown in FIG. B. that the segments 2 and 3 come in the same segment class, they are automatically ver ⁇ melted together, while the segments in the first Segmentklas ⁇ se, ie the segments 7, 4, 1 are spaced apart and therefore (at least initially) can not be merged.
- FIG. 3 shows that the segments 2 and 3 come in the same segment class, they are automatically ver ⁇ melted together, while the segments in the first Segmentklas ⁇ se, ie the segments 7, 4, 1 are spaced apart and therefore (at least initially) can not be merged.
- FIG. 3 shows that the segments in the first Segmentklas ⁇ se, ie the segments 7, 4,
- Relatively short segments shorter than 11 seconds are examined at all, while later on even shorter segments (a second threshold smaller than the first) shorter than 9 seconds are examined and, later, any remaining segments which are shorter than 6 seconds (a third threshold which is shorter than the second threshold) will be treated again alternatively.
- the segment length check in block 31 is initially directed to finding the segments shorter than 11 seconds. For the segments that are longer than 11 seconds, no post processing is done, as can be recognized by a "No" at block 31. For segments which are shorter than 11 seconds, a trend check (block 32) is first of all carried out, so that at first a check is made as to whether a segment 1 has an associated trend or associated tendency In the example of Fig. 7, this would be the segment 10 which has a trend towards the segment 7 or a trend towards the first segment class the tenth segment is shorter than 11 seconds, in the example shown in FIG.
- segment no. 10 is the only segment in the third segment class. If it were shorter than 9 seconds, it is automatically assigned to the segment class to which segment No. 9 belongs. This automatically leads to a fusion of the segment 10 with the segment 9. If the segment 10 län ⁇ ger than 9 seconds, this merger is not made.
- a block 33c an examination is then made for segments shorter than 9 seconds which are not the only segment in a corresponding cluster X than in a corresponding segment group. They are subjected to a more detailed check in which a regularity in the cluster sequence is to be ascertained. At first all segments from the segment group X are searched, which are shorter than the minimum length. Subsequently, it is checked for each of these segments whether the predecessor and successor segments each belong to a uniform cluster. If all predecessor segments are from a uniform cluster, all segments that are too short from cluster X are assigned to the predecessor cluster. If, on the other hand, all successor segments are from a uniform cluster, the segments too short from cluster X are each assigned to the successor cluster.
- a novelty value check is performed by resorting to the novelty value curve shown in FIG. 9.
- the novelty curve which has arisen from the kernel correlation, is read out at the locations of the affected segment boundaries, and the maximum of these values is determined. If the maximum occurs at the beginning of a segment, the segments that are too short become the cluster of the successor assigned to ge segments. If the maximum occurs at a segment end, the segments that are too short are assigned to the cluster of the precursor segment. If the segment labeled 90 in Fig.
- This procedure according to the invention has the advantage that no elimination of parts of the piece has been carried out, ie that no simple elimination of the segments which are too short has been carried out by setting them to zero, but that the entire complete piece of music is still the one Entity of segments is represented. Due to the segmentation therefore no loss of information auf ⁇ occurs, which would be, however, if you z. B. as a reaction on over-segmentation, simply eliminating all too short segments "regardless of losses".
- FIGS. 4a and 4b a preferred implementation of the segment class designator 22 of FIG. 1 is illustrated.
- two clusters are assigned the labels "stanza” and "refrain” during labeling.
- the cluster for the second largest singular word is used as the stanza.
- each song begins with a stanza, ie that the cluster with the first segment is the stanza cluster and the other cluster is the refrain cluster.
- the cluster in the candidate selection having the last segment is called a refrain, and the other cluster is called a stanza.
- the cluster which has the segment which occurs as the last segment of the segments of the two segment groups in the song progression is checked (40) to designate the same as chorus.
- the last segment may actually be the last segment in the song or else a segment which occurs later in the song than all segments of the other segment class. If this segment is not the actual last segment in the song, this means that there is still an outro.
- all segments of this first (highest-order) segment class are referred to as a refrain, as represented by a block 41 in FIG. 4b.
- all segments of the other segment class which is to be selected are marked as "stanza", since typically one of the two candidate segment classes will have one class of the refrain and thus immediately the other class will have the strokes.
- the second segment group is designated as a stanza and the first segment group as a refrain, as indicated in a block 44
- the denomination in block 44 occurs because the probability that the second segment class will utter the chorus is quite small. If the improbability that a piece of music is introduced with a chorus, there is some evidence of a clustering error out, eg that the last considered segment was erroneously assigned to the second segment class.
- FIG. 4b shows how the stanza / refrain determination has been carried out on the basis of two available segment classes. After this stanza / refrain determination, the remaining segment classes can then be designated in a block 45, an outro possibly being the segment class which has the last segment of the piece, while an intro will be the segment class which has the first segment of a piece in itself.
- an assignment of the labels "stroke” and "refrain” is carried out in labeling, whereby one segment group is marked as a stanza segment group, while the other segment group is marked as a refrain segment group.
- this concept is based on the assumption (Al) that the two clusters (segment groups) with the highest similarity values, that is, cluster 1 and cluster 2, correspond to the regular and stanza clusters. The last of these two clusters is the refrain cluster, assuming that a verse follows a chorus.
- cluster 1 in most cases corresponds to the refrain.
- cluster 2 the assumption (Al) is often not fulfilled.
- This situation usually occurs when there is either a third, frequently repeating part in the play, eg. B. a bridge, with a high ⁇ hn ⁇ probability of intro and outro, or for the not sel ⁇ th occurring case that a segment in the piece has a high similarity to the chorus, thus also a high
- the resemblance to the chorus is not enough to be part of Cluster 1.
- the cluster or the segment group with the highest similarity value (value of the component of V which was once a maximum for the first-determined segment class, ie segment 7 in the example of FIG. 7, was ), that is, the segment group determined in the first pass of FIG. 1, is included in the stanza refrain selection as the first candidate.
- segment group will be the second participant in the verse-chorus selection.
- the most probable candidate is the second highest segment class, ie the segment class which is found on the second pass through the concept described in FIG. However, this does not always have to be this way. Therefore, firstly for the second highest segment class (segment 5 in FIG. 1) 1 , cluster 2 is checked whether this class has only a single segment or exactly two segments, one of the two segments being the first segment and the other segment being both are the last segment in the song (block 47).
- the second highest segment class for example, has at least three segments, or two segments, one of which is within the piece and not at the "edge" of the piece second segment class initially in the selection and is henceforth referred to as "Second Cluster".
- Second clusters still have to measure themselves with a third segment class (48b), which is referred to as a "third cluster" in order to ultimately survive the selection process as a candidate.
- the segment class "Third Cluster” corresponds to the cluster which occurs most frequently in the entire song, however, that the highest segment class (cluster 1) still corresponds to the segment class "second cluster", so to speak the next most frequently (often equally frequently) occurring clusters after cluster 1 and second clusters.
- the first examination in block 49a is to examine whether each segment of third cluster ne certain minimum length has, as a threshold z. B. 4% of the total song length is preferred. Other values between 2% and 10% can also lead to meaningful results.
- a block 49b it is then examined whether ThirdCluster has a greater total portion of the song than SecondCluster. For this purpose, the total time of all segments in ThirdCluster is added up and compared with the correspondingly added total number of all segments in SecondCluster, in which case ThirdCluster has a larger overall proportion of the song than Se ⁇ condCluster, if the added segments in ThirdC ⁇ luster give a larger value than the added up Segments in SecondCluster.
- ThirdCluster enters the stanza-refrain selection, but if at least one of these conditions is not met, ThirdCluster does not enter the stanza-refrain selection the stanza-refrain selection, as represented by a block 50 in Fig. 4a, completes the "candidate search" for the stanza-refrain selection, and the algorithm shown in Fig. 4b is started in the end it is determined which segment class comprises the stanzas, and which segment class comprises the chorus.
- the three conditions in blocks 49a, 49b, 49c could alternatively also be weighted, so that z.
- a no answer in block 49a is "overruled” if both the query in block 49b and the query in block 49c are answered "yes".
- it could also be a condition the three conditions are highlighted so that z.
- it only examines whether there is regularity of the sequence between the third segment class and the first segment class, while the queries in blocks 49a and 49b are not performed or are only performed if the query in block 49c reads " No answer is given, but for example a relatively large total proportion in block 49b and relatively large minimum quantities are determined in block 49a.
- the refrain possibility is to select a version of the female as a summary. This will attempt to choose a run of the Refxain that lasts between 20 and 30 seconds if possible. If a segment with such a length is not contained in the refrain cluster, then a version is chosen which has the smallest possible deviation to a length of 25 seconds. If the selected chorus is longer than 30 seconds, it is blanked out for 30 seconds in this embodiment and is shorter than 20 seconds, so that it is extended to 30 seconds with the following segment.
- Storing a medley for the second option is more like an actual summary of a piece of music.
- the third segment is selected from a cluster that has the largest total portion of the song and is not a verse or chorus.
- the selected segments are not installed in their full length in the medley.
- the length is preferably set to a fixed 10 seconds per segment, so that a total of 30 seconds is created again.
- alternative values are also readily feasible.
- a grouping of a plurality of feature vectors in block 510 is performed to save computation time by forming an average over the grouped feature vectors.
- the grouping may be the next.
- Processing step the calculation of the similarity matrix, saving computing time.
- a distance is determined between all possible combinations of j & two feature vectors. This yields n x n calculations for n vectors over the entire piece.
- a grouping factor g indicates how many; consecutive feature vectors are grouped into a vector via the averaging. This can reduce the number of calculations.
- the grouping is also a type of noise suppression r in which small changes in the feature expression of successive vectors are compensated on the average. the. This property has a positive effect on finding large song structures.
- the concept according to the invention makes it possible to navigate through the calculated segments by means of a special music player and selectively select individual segments, so that a consumer in a music shop can easily immediately return to the Re by pressing a certain key or activating a certain software command - Frain of a piece can jump to determine whether the chorus pleases him, and then perhaps listen to a stanza, so that the consumer can finally make a Kaufent ⁇ divorce. It is thus comfortably possible for a buyer to hear exactly what he is particularly interested in from a single piece, while he is, for example, interested in doing so. B. the solo or the bridge then actually save for the listening pleasure at home.
- the concept according to the invention is also of great advantage for a music shop, since the customer can listen in and thus quickly and ultimately buy, so that the customers do not have to wait long to listen in, but also quickly get their turn , This is due to the fact that a user does not have to constantly go back and forth, but receives in a targeted and rapid manner all the information of the piece that he would like to have.
- the present invention is also applicable in other applica tion scenarios, for example in advertising monitoring, ie where an advertiser wants to check whether the audio piece for which he has bought advertising time, has actually been played over the entire length.
- An audio piece may include, for example, music segments, speaker segments, and noise segments.
- the segmentation algorithm that is to say the segmentation and subsequent classification into segment groups, then makes it possible to carry out a quick and considerably less complicated check than a complete sample-wise comparison.
- the efficient checking would simply consist in a segment class statistic, ie a comparison of how many segment classes were found and how many segments are in the individual segment classes, with a specification based on the ideal advertising piece. It is thus easily possible for an advertiser to recognize whether a broadcaster or television station has actually broadcast all the main parts (sections) of the commercial signal or not.
- the present invention is further advantageous in that it can be used for searching in large music databases, for example, only to listen through the choruses of many pieces of music in order to then perform a music program selection.
- segment class marked "chorus” would be selected from many different pieces and provided by a program provider, Alternatively, there could also be an interest, for example from an artist, for all the guitar solos According to the invention, these can likewise be provided without difficulty by always having one or more segments (if present) in the range marked "Solo".
- segment class from a large number of pieces of music, for. B. assembled and provided as a file.
- inventive concept can be easily automated, since it requires at no point a user intervention. This means that users of the inventive concept by no means require special training, except for. For example, a common skill in dealing with normal software user interfaces.
- the inventive concept can be implemented in hardware or in software.
- the implementation can be carried out on a digital storage medium, in particular a floppy disk or CD with electronically readable control signals, which can cooperate with a programmable computer system in such a way that the corresponding method is executed.
- the invention thus also consists in a computer program product with a program code stored on a machine-readable carrier for carrying out the method according to the invention when the computer program product runs on a computer.
- the invention thus represents a computer program with a program code for carrying out the method when the computer program runs on a computer.
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Acoustics & Sound (AREA)
- Multimedia (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE102004047068A DE102004047068A1 (de) | 2004-09-28 | 2004-09-28 | Vorrichtung und Verfahren zum Gruppieren von zeitlichen Segmenten eines Musikstücks |
PCT/EP2005/007751 WO2006034743A1 (de) | 2004-09-28 | 2005-07-15 | Vorrichtung und verfahren zum gruppieren von zeitlichen segmenten eines musikstücks |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1794743A1 true EP1794743A1 (de) | 2007-06-13 |
EP1794743B1 EP1794743B1 (de) | 2013-04-24 |
Family
ID=35005745
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP05760763.2A Not-in-force EP1794743B1 (de) | 2004-09-28 | 2005-07-15 | Vorrichtung und verfahren zum gruppieren von zeitlichen segmenten eines musikstücks |
Country Status (4)
Country | Link |
---|---|
EP (1) | EP1794743B1 (de) |
JP (1) | JP4775380B2 (de) |
DE (1) | DE102004047068A1 (de) |
WO (1) | WO2006034743A1 (de) |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4948118B2 (ja) | 2005-10-25 | 2012-06-06 | ソニー株式会社 | 情報処理装置、情報処理方法、およびプログラム |
JP4465626B2 (ja) | 2005-11-08 | 2010-05-19 | ソニー株式会社 | 情報処理装置および方法、並びにプログラム |
JP4906565B2 (ja) * | 2007-04-06 | 2012-03-28 | アルパイン株式会社 | メロディー推定方法及びメロディー推定装置 |
JP5083951B2 (ja) * | 2007-07-13 | 2012-11-28 | 学校法人早稲田大学 | 音声処理装置およびプログラム |
EP2180463A1 (de) * | 2008-10-22 | 2010-04-28 | Stefan M. Oertl | Verfahren zur Erkennung von Notenmustern in Musikstücken |
WO2016152132A1 (ja) * | 2015-03-25 | 2016-09-29 | 日本電気株式会社 | 音声処理装置、音声処理システム、音声処理方法、および記録媒体 |
WO2017168644A1 (ja) | 2016-03-30 | 2017-10-05 | Pioneer DJ株式会社 | 楽曲展開解析装置、楽曲展開解析方法および楽曲展開解析プログラム |
JPWO2017195292A1 (ja) * | 2016-05-11 | 2019-03-07 | Pioneer DJ株式会社 | 楽曲構造解析装置、楽曲構造解析方法および楽曲構造解析プログラム |
CN109979418B (zh) * | 2019-03-06 | 2022-11-29 | 腾讯音乐娱乐科技(深圳)有限公司 | 音频处理方法、装置、电子设备及存储介质 |
Family Cites Families (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5918223A (en) * | 1996-07-22 | 1999-06-29 | Muscle Fish | Method and article of manufacture for content-based analysis, storage, retrieval, and segmentation of audio information |
US6542869B1 (en) * | 2000-05-11 | 2003-04-01 | Fuji Xerox Co., Ltd. | Method for automatic analysis of audio including music and speech |
AUPS270902A0 (en) * | 2002-05-31 | 2002-06-20 | Canon Kabushiki Kaisha | Robust detection and classification of objects in audio using limited training data |
WO2004038694A1 (ja) * | 2002-10-24 | 2004-05-06 | National Institute Of Advanced Industrial Science And Technology | 楽曲再生方法及び装置並びに音楽音響データ中のサビ区間検出方法 |
JP4243682B2 (ja) * | 2002-10-24 | 2009-03-25 | 独立行政法人産業技術総合研究所 | 音楽音響データ中のサビ区間を検出する方法及び装置並びに該方法を実行するためのプログラム |
JP4203308B2 (ja) * | 2002-12-04 | 2008-12-24 | パイオニア株式会社 | 楽曲構造検出装置及び方法 |
JP4079260B2 (ja) * | 2002-12-24 | 2008-04-23 | 独立行政法人科学技術振興機構 | 楽曲ミキシング装置、方法およびプログラム |
-
2004
- 2004-09-28 DE DE102004047068A patent/DE102004047068A1/de not_active Withdrawn
-
2005
- 2005-07-15 EP EP05760763.2A patent/EP1794743B1/de not_active Not-in-force
- 2005-07-15 WO PCT/EP2005/007751 patent/WO2006034743A1/de active Application Filing
- 2005-07-15 JP JP2007533882A patent/JP4775380B2/ja not_active Expired - Fee Related
Non-Patent Citations (1)
Title |
---|
See references of WO2006034743A1 * |
Also Published As
Publication number | Publication date |
---|---|
JP2008515012A (ja) | 2008-05-08 |
WO2006034743A1 (de) | 2006-04-06 |
DE102004047068A1 (de) | 2006-04-06 |
JP4775380B2 (ja) | 2011-09-21 |
EP1794743B1 (de) | 2013-04-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1794745B1 (de) | Vorrichtung und verfahren zum ändern einer segmentierung eines audiostücks | |
EP1774527B1 (de) | Vorrichtung und verfahren zum bezeichnen von verschiedenen segmentklassen | |
EP1794743B1 (de) | Vorrichtung und verfahren zum gruppieren von zeitlichen segmenten eines musikstücks | |
EP1523719B1 (de) | Vorrichtung und verfahren zum charakterisieren eines informationssignals | |
EP2351017B1 (de) | Verfahren zur erkennung von notenmustern in musikstücken | |
EP1745464B1 (de) | Vorrichtung und verfahren zum analysieren eines informationssignals | |
DE60120417T2 (de) | Verfahren zur suche in einer audiodatenbank | |
EP1407446B1 (de) | Verfahren und vorrichtung zum charakterisieren eines signals und zum erzeugen eines indexierten signals | |
EP1371055B1 (de) | Vorrichtung zum analysieren eines audiosignals hinsichtlich von rhythmusinformationen des audiosignals unter verwendung einer autokorrelationsfunktion | |
EP1797552B1 (de) | Verfahren und vorrichtung zur extraktion einer einem audiosignal zu grunde liegenden melodie | |
DE10123366C1 (de) | Vorrichtung zum Analysieren eines Audiosignals hinsichtlich von Rhythmusinformationen | |
WO2006039995A1 (de) | Verfahren und vorrichtung zur harmonischen aufbereitung einer melodielinie | |
DE102004028693B4 (de) | Vorrichtung und Verfahren zum Bestimmen eines Akkordtyps, der einem Testsignal zugrunde liegt | |
DE102004049478A1 (de) | Verfahren und Vorrichtung zur Glättung eines Melodieliniensegments | |
DE102004049517B4 (de) | Extraktion einer einem Audiosignal zu Grunde liegenden Melodie | |
EP1377924B1 (de) | VERFAHREN UND VORRICHTUNG ZUM EXTRAHIEREN EINER SIGNALKENNUNG, VERFAHREN UND VORRICHTUNG ZUM ERZEUGEN EINER DAZUGEHÖRIGEN DATABANK und Verfahren und Vorrichtung zum Referenzieren eines Such-Zeitsignals | |
EP1671315B1 (de) | Vorrichtung und verfahren zum charakterisieren eines tonsignals | |
WO2009013144A1 (de) | Verfahren zur bestimmung einer ähnlichkeit, vorrichtung und verwendung hierfür | |
WO2005114651A1 (de) | Vorrichtung und verfahren zum analysieren eines informationssignals |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20070301 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: GRACENOTE, INC. |
|
17Q | First examination report despatched |
Effective date: 20100729 |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SONY CORPORATION |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D Free format text: NOT ENGLISH |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 609032 Country of ref document: AT Kind code of ref document: T Effective date: 20130515 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D Free format text: LANGUAGE OF EP DOCUMENT: GERMAN |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 502005013660 Country of ref document: DE Effective date: 20130620 |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: VDEP Effective date: 20130424 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130826 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130824 Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130725 Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130804 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130724 Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 |
|
BERE | Be: lapsed |
Owner name: SONY CORP. Effective date: 20130731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20130724 |
|
26N | No opposition filed |
Effective date: 20140127 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: MM4A |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST Effective date: 20140331 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130731 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130731 Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130724 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130731 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 502005013660 Country of ref document: DE Effective date: 20140127 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130715 |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MM01 Ref document number: 609032 Country of ref document: AT Kind code of ref document: T Effective date: 20130715 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20140721 Year of fee payment: 10 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130715 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130424 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20050715 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130715 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 502005013660 Country of ref document: DE |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20160202 |