A new particle swarm optimization-based method for phase unwrapping of MRI data (Q454660): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Wei He / rank
Normal rank
 
Property / author
 
Property / author: Wei He / rank
 
Normal rank
Property / review text
 
Summary: A new method based on discrete particle swarm optimization (dPSO) algorithm is proposed to solve the branch-cut phase unwrapping problem of MRI data. In this method, the optimal order of matching the positive residues with the negative residues is first identified by the dPSO algorithm, then the branch cuts are placed to join each pair of the opposite polarity residues, and in the last step phases are unwrapped by flood-fill algorithm. The performance of the proposed algorithm was tested on both simulated phase image and MRI wrapped phase data sets. The results demonstrated that, compared with conventionally used branch-cut phase unwrapping algorithms, the dPSO algorithm is rather robust and effective.
Property / review text: Summary: A new method based on discrete particle swarm optimization (dPSO) algorithm is proposed to solve the branch-cut phase unwrapping problem of MRI data. In this method, the optimal order of matching the positive residues with the negative residues is first identified by the dPSO algorithm, then the branch cuts are placed to join each pair of the opposite polarity residues, and in the last step phases are unwrapped by flood-fill algorithm. The performance of the proposed algorithm was tested on both simulated phase image and MRI wrapped phase data sets. The results demonstrated that, compared with conventionally used branch-cut phase unwrapping algorithms, the dPSO algorithm is rather robust and effective. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92C55 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6092368 / rank
 
Normal rank
Property / zbMATH Keywords
 
discrete particle swarm optimization
Property / zbMATH Keywords: discrete particle swarm optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
phase unwrapping problem
Property / zbMATH Keywords: phase unwrapping problem / rank
 
Normal rank
Property / zbMATH Keywords
 
MRI data
Property / zbMATH Keywords: MRI data / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q30574055 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/475745 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013796338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4493216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Particle Swarm Optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:41, 5 July 2024

scientific article
Language Label Description Also known as
English
A new particle swarm optimization-based method for phase unwrapping of MRI data
scientific article

    Statements

    A new particle swarm optimization-based method for phase unwrapping of MRI data (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2012
    0 references
    Summary: A new method based on discrete particle swarm optimization (dPSO) algorithm is proposed to solve the branch-cut phase unwrapping problem of MRI data. In this method, the optimal order of matching the positive residues with the negative residues is first identified by the dPSO algorithm, then the branch cuts are placed to join each pair of the opposite polarity residues, and in the last step phases are unwrapped by flood-fill algorithm. The performance of the proposed algorithm was tested on both simulated phase image and MRI wrapped phase data sets. The results demonstrated that, compared with conventionally used branch-cut phase unwrapping algorithms, the dPSO algorithm is rather robust and effective.
    0 references
    discrete particle swarm optimization
    0 references
    phase unwrapping problem
    0 references
    MRI data
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references