{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/10480"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/10480","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"A Semi-Definite, Nonlinear Model for Optimizing k-Space Sample Separation in Parallel Magnetic Resonance Imaging","abstract":"<p>Parallel MRI, in which k-space is regularly or irregularly undersampled, is critical for imaging speed acceleration. In this thesis, we show how to optimize a regular undersampling pattern for three-dimensional Cartesian imaging in order to achieve faster data acquisition and/or higher signal to noise ratio (SNR) by using nonlinear optimization. A new sensitivity profiling approach is proposed to produce better sensitivity maps, required for the sampling optimization. This design approach is easily adapted to calculate sensitivities for arbitrary planes and volumes. The use of a semi-definite, linearly constrained model to optimize a parallel MRI undersampling pattern is novel. To solve this problem, an iterative trust-region is applied. When tested on real coil data, the optimal solution presents a significant theoretical improvement in accelerating data acquisition speed and eliminating noise.</p>","abstract_html":"&lt;p&gt;Parallel MRI, in which k-space is regularly or irregularly undersampled, is critical for imaging speed acceleration. In this thesis, we show how to optimize a regular undersampling pattern for three-dimensional Cartesian imaging in order to achieve faster data acquisition and/or higher signal to noise ratio (SNR) by using nonlinear optimization. A new sensitivity profiling approach is proposed to produce better sensitivity maps, required for the sampling optimization. This design approach is easily adapted to calculate sensitivities for arbitrary planes and volumes. The use of a semi-definite, linearly constrained model to optimize a parallel MRI undersampling pattern is novel. To solve this problem, an iterative trust-region is applied. When tested on real coil data, the optimal solution presents a significant theoretical improvement in accelerating data acquisition speed and eliminating noise.&lt;/p&gt;","abstract_has_math":false,"creators":["Wu, Qiong"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Biomedical Engineering","school":null,"contributors":[],"advisors":["Anand, Christopher","Alex Bain, Michael Noseworthy"],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-10","date_published":"2011-10","updated_at":"2026-11-18T19:39:49Z","subjects":["semi-definite problem","optimization","parallel imaging","sensitivity profiling","Biological Engineering","Computational Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/24089"],"render_values":[{"text":"https://doi.org/10.71548/24089","href":"https://doi.org/10.71548/24089","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/5524","6518","2111501"],"render_values":[{"text":"opendissertations/5524","href":null,"code":true},{"text":"6518","href":null,"code":true},{"text":"2111501","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/10480","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/10480","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F10480","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Anand, Christopher","Alex Bain, Michael Noseworthy"]},{"key":"dc:contributor.department","label":"Department","values":["Biomedical Engineering"]},{"key":"dc:creator","label":"Author","values":["Wu, Qiong"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:51:31Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:51:31Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2011-07-21"]},{"key":"dc:date.issued","label":"Date","values":["2011-10"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["semi-definite problem","optimization","parallel imaging","sensitivity profiling","Biological Engineering","Computational Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/5524","6518","2111501"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/10480","https://doi.org/10.71548/24089"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>Parallel MRI, in which k-space is regularly or irregularly undersampled, is critical for imaging speed acceleration. In this thesis, we show how to optimize a regular undersampling pattern for three-dimensional Cartesian imaging in order to achieve faster data acquisition and/or higher signal to noise ratio (SNR) by using nonlinear optimization. A new sensitivity profiling approach is proposed to produce better sensitivity maps, required for the sampling optimization. This design approach is easily adapted to calculate sensitivities for arbitrary planes and volumes. The use of a semi-definite, linearly constrained model to optimize a parallel MRI undersampling pattern is novel. To solve this problem, an iterative trust-region is applied. When tested on real coil data, the optimal solution presents a significant theoretical improvement in accelerating data acquisition speed and eliminating noise.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Applied Science (MASc)"]},{"key":"dc:title","label":"Title","values":["A Semi-Definite, Nonlinear Model for Optimizing k-Space Sample Separation in Parallel Magnetic Resonance Imaging"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Anand, Christopher","Alex Bain, Michael Noseworthy"],"dc:contributor.department":["Biomedical Engineering"],"dc:creator":["Wu, Qiong"],"dc:date.accessioned":["2014-06-18T16:51:31Z"],"dc:date.available":["2014-06-18T16:51:31Z"],"dc:date.created":["2011-07-21"],"dc:date.issued":["2011-10"],"dc:description.abstract":["<p>Parallel MRI, in which k-space is regularly or irregularly undersampled, is critical for imaging speed acceleration. In this thesis, we show how to optimize a regular undersampling pattern for three-dimensional Cartesian imaging in order to achieve faster data acquisition and/or higher signal to noise ratio (SNR) by using nonlinear optimization. A new sensitivity profiling approach is proposed to produce better sensitivity maps, required for the sampling optimization. This design approach is easily adapted to calculate sensitivities for arbitrary planes and volumes. The use of a semi-definite, linearly constrained model to optimize a parallel MRI undersampling pattern is novel. To solve this problem, an iterative trust-region is applied. When tested on real coil data, the optimal solution presents a significant theoretical improvement in accelerating data acquisition speed and eliminating noise.</p>"],"dc:description.degree":["Master of Applied Science (MASc)"],"dc:identifier.other":["opendissertations/5524","6518","2111501"],"dc:identifier.uri":["http://hdl.handle.net/11375/10480","https://doi.org/10.71548/24089"],"dc:subject":["semi-definite problem","optimization","parallel imaging","sensitivity profiling","Biological Engineering","Computational Engineering"],"dc:title":["A Semi-Definite, Nonlinear Model for Optimizing k-Space Sample Separation in Parallel Magnetic Resonance Imaging"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:39:49Z"}