{"id":{"repo_id":"soton","oai_identifier":"oai:eprints.soton.ac.uk:142461"},"canonical_url":"https://search.dev.ndltd.org/etd/soton/oai:eprints.soton.ac.uk:142461","repository":{"repo_id":"soton","name":"University of Southampton","base_url":"https://eprints.soton.ac.uk/cgi/oai2"},"display":{"title":"Bayesian modelling of music: algorithmic advances and experimental studies of shift-invariant sparse coding","abstract":"In order to perform many signal processing tasks such as classification,<br/>pattern recognition and coding, it is helpful to specify a signal model in<br/>terms of meaningful signal structures. In general, designing such a model<br/>is complicated and for many signals it is not feasible to specify the appropriate<br/>structure. Adaptive models overcome this problem by learning<br/>structures from a set of signals. Such adaptive models need to be general<br/>enough, so that they can represent relevant structures. However, more<br/>general models often require additional constraints to guide the learning<br/>procedure.<br/><br/>In this thesis a sparse coding model is used to model time-series. Relevant<br/>features can often occur at arbitrary locations and the model has to be<br/>able to reflect this uncertainty, which is achieved using a shift-invariant<br/>sparse coding formulation. In order to learn model parameters, we use<br/>Bayesian statistical methods, however, analytic solutions to this learning<br/>problem are not available and approximations have to be introduced. In<br/>this thesis we study three approximations, one based on an analytical<br/>integral approximation and two based on Monte Carlo approximations.<br/>But even with these approximations, a solution to the learning problem<br/>is computationally too expensive for the applications under investigation.<br/>Therefore, we introduce further approximations by subset selection.<br/><br/>Music signals are highly structured time-series and offer an ideal testbed<br/>for the studied model. We show the emergence of note- and score-like features<br/>from a polyphonic piano recording and compare the results to those<br/>obtained with a different model suggested in the literature. Furthermore,<br/>we show that the model finds structures that can be assigned to an individual<br/>source in a mixture. This is shown with an example of a mixture<br/>containing guitar and vocal parts for which blind source separation can<br/>be performed based on the shift-invariant sparse coding model.","abstract_html":"In order to perform many signal processing tasks such as classification,&lt;br/&gt;pattern recognition and coding, it is helpful to specify a signal model in&lt;br/&gt;terms of meaningful signal structures. In general, designing such a model&lt;br/&gt;is complicated and for many signals it is not feasible to specify the appropriate&lt;br/&gt;structure. Adaptive models overcome this problem by learning&lt;br/&gt;structures from a set of signals. Such adaptive models need to be general&lt;br/&gt;enough, so that they can represent relevant structures. However, more&lt;br/&gt;general models often require additional constraints to guide the learning&lt;br/&gt;procedure.&lt;br/&gt;&lt;br/&gt;In this thesis a sparse coding model is used to model time-series. Relevant&lt;br/&gt;features can often occur at arbitrary locations and the model has to be&lt;br/&gt;able to reflect this uncertainty, which is achieved using a shift-invariant&lt;br/&gt;sparse coding formulation. In order to learn model parameters, we use&lt;br/&gt;Bayesian statistical methods, however, analytic solutions to this learning&lt;br/&gt;problem are not available and approximations have to be introduced. In&lt;br/&gt;this thesis we study three approximations, one based on an analytical&lt;br/&gt;integral approximation and two based on Monte Carlo approximations.&lt;br/&gt;But even with these approximations, a solution to the learning problem&lt;br/&gt;is computationally too expensive for the applications under investigation.&lt;br/&gt;Therefore, we introduce further approximations by subset selection.&lt;br/&gt;&lt;br/&gt;Music signals are highly structured time-series and offer an ideal testbed&lt;br/&gt;for the studied model. We show the emergence of note- and score-like features&lt;br/&gt;from a polyphonic piano recording and compare the results to those&lt;br/&gt;obtained with a different model suggested in the literature. Furthermore,&lt;br/&gt;we show that the model finds structures that can be assigned to an individual&lt;br/&gt;source in a mixture. This is shown with an example of a mixture&lt;br/&gt;containing guitar and vocal parts for which blind source separation can&lt;br/&gt;be performed based on the shift-invariant sparse coding model.","abstract_has_math":false,"creators":["Blumensath, Thomas"],"institution":"University College London","degree_name":"Ph.D.","degree_level":"doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Davies, Mike"],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006","date_published":"2006","updated_at":"2026-07-24T04:36:14Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Davies, Mike"]},{"key":"dc:creator","label":"Author","values":["Blumensath, Thomas"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2006"]},{"key":"dc:date.issued","label":"Date","values":["2006"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Signal Processing & Control Grp (pre 2018 reorg)","Mathematics (pre 2011 reorg)","Department of Electronic Engineering"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University College London"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://eprints.soton.ac.uk/142461/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["Ph.D."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://eprints.soton.ac.uk/142461/1/BlumensathThesis.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In order to perform many signal processing tasks such as classification,<br/>pattern recognition and coding, it is helpful to specify a signal model in<br/>terms of meaningful signal structures. In general, designing such a model<br/>is complicated and for many signals it is not feasible to specify the appropriate<br/>structure. Adaptive models overcome this problem by learning<br/>structures from a set of signals. Such adaptive models need to be general<br/>enough, so that they can represent relevant structures. However, more<br/>general models often require additional constraints to guide the learning<br/>procedure.<br/><br/>In this thesis a sparse coding model is used to model time-series. Relevant<br/>features can often occur at arbitrary locations and the model has to be<br/>able to reflect this uncertainty, which is achieved using a shift-invariant<br/>sparse coding formulation. In order to learn model parameters, we use<br/>Bayesian statistical methods, however, analytic solutions to this learning<br/>problem are not available and approximations have to be introduced. In<br/>this thesis we study three approximations, one based on an analytical<br/>integral approximation and two based on Monte Carlo approximations.<br/>But even with these approximations, a solution to the learning problem<br/>is computationally too expensive for the applications under investigation.<br/>Therefore, we introduce further approximations by subset selection.<br/><br/>Music signals are highly structured time-series and offer an ideal testbed<br/>for the studied model. We show the emergence of note- and score-like features<br/>from a polyphonic piano recording and compare the results to those<br/>obtained with a different model suggested in the literature. Furthermore,<br/>we show that the model finds structures that can be assigned to an individual<br/>source in a mixture. This is shown with an example of a mixture<br/>containing guitar and vocal parts for which blind source separation can<br/>be performed based on the shift-invariant sparse coding model."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dc:title","label":"Title","values":["Bayesian modelling of music: algorithmic advances and experimental studies of shift-invariant sparse coding"]}]}],"canonical_facts":{"dc:contributor.advisor":["Davies, Mike"],"dc:creator":["Blumensath, Thomas"],"dc:date":["2006"],"dc:date.issued":["2006"],"dc:description.abstract":["In order to perform many signal processing tasks such as classification,<br/>pattern recognition and coding, it is helpful to specify a signal model in<br/>terms of meaningful signal structures. In general, designing such a model<br/>is complicated and for many signals it is not feasible to specify the appropriate<br/>structure. Adaptive models overcome this problem by learning<br/>structures from a set of signals. Such adaptive models need to be general<br/>enough, so that they can represent relevant structures. However, more<br/>general models often require additional constraints to guide the learning<br/>procedure.<br/><br/>In this thesis a sparse coding model is used to model time-series. Relevant<br/>features can often occur at arbitrary locations and the model has to be<br/>able to reflect this uncertainty, which is achieved using a shift-invariant<br/>sparse coding formulation. In order to learn model parameters, we use<br/>Bayesian statistical methods, however, analytic solutions to this learning<br/>problem are not available and approximations have to be introduced. In<br/>this thesis we study three approximations, one based on an analytical<br/>integral approximation and two based on Monte Carlo approximations.<br/>But even with these approximations, a solution to the learning problem<br/>is computationally too expensive for the applications under investigation.<br/>Therefore, we introduce further approximations by subset selection.<br/><br/>Music signals are highly structured time-series and offer an ideal testbed<br/>for the studied model. We show the emergence of note- and score-like features<br/>from a polyphonic piano recording and compare the results to those<br/>obtained with a different model suggested in the literature. Furthermore,<br/>we show that the model finds structures that can be assigned to an individual<br/>source in a mixture. This is shown with an example of a mixture<br/>containing guitar and vocal parts for which blind source separation can<br/>be performed based on the shift-invariant sparse coding model."],"dc:format":["text"],"dc:identifier.uri":["https://eprints.soton.ac.uk/142461/1/BlumensathThesis.pdf"],"dc:publisher.department":["Signal Processing & Control Grp (pre 2018 reorg)","Mathematics (pre 2011 reorg)","Department of Electronic Engineering"],"dc:publisher.institution":["University College London"],"dc:relation.isreferencedby":["https://eprints.soton.ac.uk/142461/"],"dc:title":["Bayesian modelling of music: algorithmic advances and experimental studies of shift-invariant sparse coding"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["doctoral"],"dc:type.qualificationname":["Ph.D."]},"updated_at":"2026-07-24T04:36:14Z"}