完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChing, YTen_US
dc.contributor.authorChang, CLen_US
dc.date.accessioned2019-04-03T06:47:14Z-
dc.date.available2019-04-03T06:47:14Z-
dc.date.issued2000-01-01en_US
dc.identifier.isbn0-8194-3599-6en_US
dc.identifier.issn0277-786Xen_US
dc.identifier.urihttp://dx.doi.org/10.1117/12.382248en_US
dc.identifier.urihttp://hdl.handle.net/11536/19201-
dc.description.abstractCardiac boundary extraction on echocardiographic images is essential for quantification of cardiac function. Tracing the endocardial boundaries on the end-diastolic and end-systolic images allows the computation of clinically important measures such as ejection rate. It is a clinical need for automatically detecting the borders. In this paper, we proposed a new approach for cardiac boundary extraction on echocardiographic images by directed graph. In this approach, we spread the cardiac image in the circular direction. The spread image is mapping to a directed graph. The shortest path is found by the dynamic programming algorithm. From the implemented results, we can obtain pretty good approximation for cardiac boundary extraction.en_US
dc.language.isoen_USen_US
dc.subjectechocardiographic imageen_US
dc.subjectedge detectionen_US
dc.subjectdirected graphen_US
dc.subjectshortest pathen_US
dc.titleCardiac boundary extraction on echocardiographic images using directed graphen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1117/12.382248en_US
dc.identifier.journalMEDICAL IMAGING 2000: ULTRASONIC IMAGING AND SIGNAL PROCESSINGen_US
dc.citation.volume3982en_US
dc.citation.spage379en_US
dc.citation.epage386en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000087812200044en_US
dc.citation.woscount0en_US
顯示於類別:會議論文


文件中的檔案:

  1. f8ba5ad17d848d39c1820bd914645d20.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。