Edge-shrinking interpolation for medical images
A new algorithm for interpolating the missing data between two adjacent medical images is presented. Our method is useful for solving the interpolation of any region-represented images of an object to be reconstructed, even when the object is stretched abruptly, branched or hollow, as often occurs i...
Gespeichert in:
Veröffentlicht in: | Computerized medical imaging and graphics 1997-03, Vol.21 (2), p.91-101 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A new algorithm for interpolating the missing data between two adjacent medical images is presented. Our method is useful for solving the interpolation of any region-represented images of an object to be reconstructed, even when the object is stretched abruptly, branched or hollow, as often occurs in medical images, which cases can not be handled well by existing methods. When this algorithm is applied, the nonoverlapped regions of the same object in the two base images are first extracted and encoded by chamfer distance code on every pixel in these regions. Then, the outer edges of the nonoverlapping regions are shrunk inward simultaneously so that the stretched edges reach the edges of the overlapping regions at the same time. The distance codes in nonoverlapping regions are used to limit the shrinking of these edges in the interpolation process. The proposed method also provides object centralization and enlargement operations to obtain stable and reasonable results in complicated case. The experimental results show that the proposed method is more effective and efficient in resolving general interpolation tasks than the existing methods (S. P. Raya and J. K. Udupa, IEEE Trans. Med. Imag. 9, 32–42, 1990; G. T. Herman
et al., IEEE Comput. Graph. Appl. 12, 69–79, 1992; J. F. Guo
et al., Comput. Med. Imag. Graph. 19, 267–279, 1995). |
---|---|
ISSN: | 0895-6111 1879-0771 |
DOI: | 10.1016/S0895-6111(96)00063-8 |