{"title":"Compensated simulated annealing vs. dynamic programming used for boundary detection in intracoronary ultrasound","authors":"T. Johnson, W. Snyder, D. Herrington","doi":"10.1109/CIC.1993.378491","DOIUrl":null,"url":null,"abstract":"Intracoronary ultrasound (ICUS) is a valuable tool in the study of coronary artery disease. Accurate and robust methods using real-time automated boundary detection algorithms are needed to quantify lumen and intimal-medial areas. The authors' approach transforms ICUS boundary detection into a recirculant multilayer graph problem with local minima. Dynamic programming (DP) and simulated annealing (SA) are two fundamentally different approaches to this optimization problem which are known to converge to the global minimum. However, time to convergence for SA is impractical. The authors compare a new optimized implementation of SA called compensated simulated annealing with DP.<<ETX>>","PeriodicalId":20445,"journal":{"name":"Proceedings of Computers in Cardiology Conference","volume":"32 1","pages":"113-116"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Computers in Cardiology Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIC.1993.378491","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Intracoronary ultrasound (ICUS) is a valuable tool in the study of coronary artery disease. Accurate and robust methods using real-time automated boundary detection algorithms are needed to quantify lumen and intimal-medial areas. The authors' approach transforms ICUS boundary detection into a recirculant multilayer graph problem with local minima. Dynamic programming (DP) and simulated annealing (SA) are two fundamentally different approaches to this optimization problem which are known to converge to the global minimum. However, time to convergence for SA is impractical. The authors compare a new optimized implementation of SA called compensated simulated annealing with DP.<>