Links to Exploration step
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Interactive Tele-Radiological Segmentation Systems for Treatment and Diagnosis</title>
<author><name sortKey="Zimeras, S" sort="Zimeras, S" uniqKey="Zimeras S" first="S." last="Zimeras">S. Zimeras</name>
<affiliation><nlm:aff id="I1">Department of Statistics and Actuarial-Financial Mathematics, University of the Aegean, Samos, 83200 Karlovassi, Greece</nlm:aff>
</affiliation>
</author>
<author><name sortKey="Gortzis, L G" sort="Gortzis, L G" uniqKey="Gortzis L" first="L. G." last="Gortzis">L. G. Gortzis</name>
<affiliation><nlm:aff id="I2">School of Medicine, University of Patras, Patras, Greece</nlm:aff>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">PMC</idno>
<idno type="pmid">22611384</idno>
<idno type="pmc">3352628</idno>
<idno type="url">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3352628</idno>
<idno type="RBID">PMC:3352628</idno>
<idno type="doi">10.1155/2012/713739</idno>
<date when="2012">2012</date>
<idno type="wicri:Area/Pmc/Corpus">000466</idno>
<idno type="wicri:explorRef" wicri:stream="Pmc" wicri:step="Corpus" wicri:corpus="PMC">000466</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a" type="main">Interactive Tele-Radiological Segmentation Systems for Treatment and Diagnosis</title>
<author><name sortKey="Zimeras, S" sort="Zimeras, S" uniqKey="Zimeras S" first="S." last="Zimeras">S. Zimeras</name>
<affiliation><nlm:aff id="I1">Department of Statistics and Actuarial-Financial Mathematics, University of the Aegean, Samos, 83200 Karlovassi, Greece</nlm:aff>
</affiliation>
</author>
<author><name sortKey="Gortzis, L G" sort="Gortzis, L G" uniqKey="Gortzis L" first="L. G." last="Gortzis">L. G. Gortzis</name>
<affiliation><nlm:aff id="I2">School of Medicine, University of Patras, Patras, Greece</nlm:aff>
</affiliation>
</author>
</analytic>
<series><title level="j">International Journal of Telemedicine and Applications</title>
<idno type="ISSN">1687-6415</idno>
<idno type="eISSN">1687-6423</idno>
<imprint><date when="2012">2012</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en"><p>Telehealth is the exchange of health information and the provision of health care services through electronic information and communications technology, where participants are separated by geographic, time, social and cultural barriers. The shift of telemedicine from desktop platforms to wireless and mobile technologies is likely to have a significant impact on healthcare in the future. It is therefore crucial to develop a general information exchange e-medical system to enables its users to perform online and offline medical consultations through diagnosis. During the medical diagnosis, image analysis techniques combined with doctor's opinions could be useful for final medical decisions. Quantitative analysis of digital images requires detection and segmentation of the borders of the object of interest. In medical images, segmentation has traditionally been done by human experts. Even with the aid of image processing software (computer-assisted segmentation tools), manual segmentation of 2D and 3D CT images is tedious, time-consuming, and thus impractical, especially in cases where a large number of objects must be specified. Substantial computational and storage requirements become especially acute when object orientation and scale have to be considered. Therefore automated or semi-automated segmentation techniques are essential if these software applications are ever to gain widespread clinical use. The main purpose of this work is to analyze segmentation techniques for the definition of anatomical structures under telemedical systems.</p>
</div>
</front>
<back><div1 type="bibliography"><listBibl><biblStruct><analytic><author><name sortKey="Hebert, M" uniqKey="Hebert M">M Hebert</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="De Neve, W" uniqKey="De Neve W">W De Neve</name>
</author>
<author><name sortKey="De Wagter, C" uniqKey="De Wagter C">C De Wagter</name>
</author>
<author><name sortKey="De Jaeger, K" uniqKey="De Jaeger K">K De Jaeger</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Isacsson, U" uniqKey="Isacsson U">U Isacsson</name>
</author>
<author><name sortKey="Hagberg, H" uniqKey="Hagberg H">H Hagberg</name>
</author>
<author><name sortKey="Johansson, K A" uniqKey="Johansson K">K-A Johansson</name>
</author>
<author><name sortKey="Montelius, A" uniqKey="Montelius A">A Montelius</name>
</author>
<author><name sortKey="Jung, B" uniqKey="Jung B">B Jung</name>
</author>
<author><name sortKey="Glimelius, B" uniqKey="Glimelius B">B Glimelius</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Pirzkall, A" uniqKey="Pirzkall A">A Pirzkall</name>
</author>
<author><name sortKey="Lohr, F" uniqKey="Lohr F">F Lohr</name>
</author>
<author><name sortKey="Rhein, B" uniqKey="Rhein B">B Rhein</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Powell, Aw" uniqKey="Powell A">AW Powell</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Kontaxakis, G" uniqKey="Kontaxakis G">G Kontaxakis</name>
</author>
<author><name sortKey="Walter, S" uniqKey="Walter S">S Walter</name>
</author>
<author><name sortKey="Sakas, G" uniqKey="Sakas G">G Sakas</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Sherouse, G" uniqKey="Sherouse G">G Sherouse</name>
</author>
<author><name sortKey="Mosher, C" uniqKey="Mosher C">C Mosher</name>
</author>
<author><name sortKey="Novins, K" uniqKey="Novins K">K Novins</name>
</author>
<author><name sortKey="Rosemann, J" uniqKey="Rosemann J">J Rosemann</name>
</author>
<author><name sortKey="Chaney, El" uniqKey="Chaney E">EL Chaney</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Nagata, Y" uniqKey="Nagata Y">Y Nagata</name>
</author>
<author><name sortKey="Nishidai, T" uniqKey="Nishidai T">T Nishidai</name>
</author>
<author><name sortKey="Abe, M" uniqKey="Abe M">M Abe</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Nishidai, T" uniqKey="Nishidai T">T Nishidai</name>
</author>
<author><name sortKey="Nagata, Y" uniqKey="Nagata Y">Y Nagata</name>
</author>
<author><name sortKey="Takahashi, M" uniqKey="Takahashi M">M Takahashi</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Rosenman, J" uniqKey="Rosenman J">J Rosenman</name>
</author>
<author><name sortKey="Sailer, Sl" uniqKey="Sailer S">SL Sailer</name>
</author>
<author><name sortKey="Sherouse, Gw" uniqKey="Sherouse G">GW Sherouse</name>
</author>
<author><name sortKey="Chaney, El" uniqKey="Chaney E">EL Chaney</name>
</author>
<author><name sortKey="Tepper, Je" uniqKey="Tepper J">JE Tepper</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Sherouse, Gw" uniqKey="Sherouse G">GW Sherouse</name>
</author>
<author><name sortKey="Chaney, El" uniqKey="Chaney E">EL Chaney</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Perez, Ca" uniqKey="Perez C">CA Perez</name>
</author>
<author><name sortKey="Purdy, Ja" uniqKey="Purdy J">JA Purdy</name>
</author>
<author><name sortKey="Harms, W" uniqKey="Harms W">W Harms</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Butker, Ek" uniqKey="Butker E">EK Butker</name>
</author>
<author><name sortKey="Helton, Dj" uniqKey="Helton D">DJ Helton</name>
</author>
<author><name sortKey="Keller, Jw" uniqKey="Keller J">JW Keller</name>
</author>
<author><name sortKey="Hughes, Ll" uniqKey="Hughes L">LL Hughes</name>
</author>
<author><name sortKey="Crenshaw, T" uniqKey="Crenshaw T">T Crenshaw</name>
</author>
<author><name sortKey="Davis, Lw" uniqKey="Davis L">LW Davis</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Chen, Gty" uniqKey="Chen G">GTY Chen</name>
</author>
<author><name sortKey="Pelizzari, Ca" uniqKey="Pelizzari C">CA Pelizzari</name>
</author>
<author><name sortKey="Vijayakumar, S" uniqKey="Vijayakumar S">S Vijayakumar</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Michalski, Jm" uniqKey="Michalski J">JM Michalski</name>
</author>
<author><name sortKey="Purdy, Ja" uniqKey="Purdy J">JA Purdy</name>
</author>
<author><name sortKey="Harms, W" uniqKey="Harms W">W Harms</name>
</author>
<author><name sortKey="Matthews, Jw" uniqKey="Matthews J">JW Matthews</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Sakas, G" uniqKey="Sakas G">G Sakas</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Cai, W" uniqKey="Cai W">W Cai</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Karangelis, G" uniqKey="Karangelis G">G Karangelis</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Levoy, M" uniqKey="Levoy M">M Levoy</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Max, N" uniqKey="Max N">N Max</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Haralick, Rm" uniqKey="Haralick R">RM Haralick</name>
</author>
<author><name sortKey="Shapiro, Lg" uniqKey="Shapiro L">LG Shapiro</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Carlbom, I" uniqKey="Carlbom I">I Carlbom</name>
</author>
<author><name sortKey="Terzopoulos, D" uniqKey="Terzopoulos D">D Terzopoulos</name>
</author>
<author><name sortKey="Harris, Km" uniqKey="Harris K">KM Harris</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Kuszyk, Bs" uniqKey="Kuszyk B">BS Kuszyk</name>
</author>
<author><name sortKey="Ney, Dr" uniqKey="Ney D">DR Ney</name>
</author>
<author><name sortKey="Fishman, Ek" uniqKey="Fishman E">EK Fishman</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Zimeras, S" uniqKey="Zimeras S">S Zimeras</name>
</author>
<author><name sortKey="Karangelis, G" uniqKey="Karangelis G">G Karangelis</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Karangelis, G" uniqKey="Karangelis G">G Karangelis</name>
</author>
<author><name sortKey="Zimeras, S" uniqKey="Zimeras S">S Zimeras</name>
</author>
<author><name sortKey="Firle, E" uniqKey="Firle E">E Firle</name>
</author>
<author><name sortKey="Wang, Min" uniqKey="Wang M">Min Wang</name>
</author>
<author><name sortKey="Sakas, G" uniqKey="Sakas G">G Sakas</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Zimeras, S" uniqKey="Zimeras S">S Zimeras</name>
</author>
<author><name sortKey="Karangelis, G" uniqKey="Karangelis G">G Karangelis</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Karangelis, G" uniqKey="Karangelis G">G Karangelis</name>
</author>
<author><name sortKey="Zimeras, S" uniqKey="Zimeras S">S Zimeras</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Karangelis, G" uniqKey="Karangelis G">G Karangelis</name>
</author>
<author><name sortKey="Zimeras, S" uniqKey="Zimeras S">S Zimeras</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Wolberg, G" uniqKey="Wolberg G">G Wolberg</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Gonzales, Rc" uniqKey="Gonzales R">RC Gonzales</name>
</author>
<author><name sortKey="Woods, Re" uniqKey="Woods R">RE Woods</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Karangelis, G" uniqKey="Karangelis G">G Karangelis</name>
</author>
<author><name sortKey="Zimeras, S" uniqKey="Zimeras S">S Zimeras</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Sachpazidis, Ia" uniqKey="Sachpazidis I">IA Sachpazidis</name>
</author>
<author><name sortKey="Ohl, R" uniqKey="Ohl R">R Ohl</name>
</author>
<author><name sortKey="Polanczyk, Ca" uniqKey="Polanczyk C">CA Polanczyk</name>
</author>
</analytic>
</biblStruct>
</listBibl>
</div1>
</back>
</TEI>
<pmc article-type="research-article"><pmc-dir>properties open_access</pmc-dir>
<front><journal-meta><journal-id journal-id-type="nlm-ta">Int J Telemed Appl</journal-id>
<journal-id journal-id-type="iso-abbrev">Int J Telemed Appl</journal-id>
<journal-id journal-id-type="publisher-id">IJTA</journal-id>
<journal-title-group><journal-title>International Journal of Telemedicine and Applications</journal-title>
</journal-title-group>
<issn pub-type="ppub">1687-6415</issn>
<issn pub-type="epub">1687-6423</issn>
<publisher><publisher-name>Hindawi Publishing Corporation</publisher-name>
</publisher>
</journal-meta>
<article-meta><article-id pub-id-type="pmid">22611384</article-id>
<article-id pub-id-type="pmc">3352628</article-id>
<article-id pub-id-type="doi">10.1155/2012/713739</article-id>
<article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject>
</subj-group>
</article-categories>
<title-group><article-title>Interactive Tele-Radiological Segmentation Systems for Treatment and Diagnosis</article-title>
</title-group>
<contrib-group><contrib contrib-type="author"><name><surname>Zimeras</surname>
<given-names>S.</given-names>
</name>
<xref ref-type="aff" rid="I1"><sup>1</sup>
</xref>
<xref ref-type="corresp" rid="cor1">*</xref>
</contrib>
<contrib contrib-type="author"><name><surname>Gortzis</surname>
<given-names>L. G.</given-names>
</name>
<xref ref-type="aff" rid="I2"><sup>2</sup>
</xref>
</contrib>
</contrib-group>
<aff id="I1"><sup>1</sup>
Department of Statistics and Actuarial-Financial Mathematics, University of the Aegean, Samos, 83200 Karlovassi, Greece</aff>
<aff id="I2"><sup>2</sup>
School of Medicine, University of Patras, Patras, Greece</aff>
<author-notes><corresp id="cor1">*S. Zimeras: <email>zimste@aegean.gr</email>
</corresp>
<fn fn-type="other"><p>Academic Editor: Fei Hu</p>
</fn>
</author-notes>
<pub-date pub-type="ppub"><year>2012</year>
</pub-date>
<pub-date pub-type="epub"><day>7</day>
<month>5</month>
<year>2012</year>
</pub-date>
<volume>2012</volume>
<elocation-id>713739</elocation-id>
<history><date date-type="received"><day>3</day>
<month>7</month>
<year>2011</year>
</date>
<date date-type="rev-recd"><day>11</day>
<month>1</month>
<year>2012</year>
</date>
<date date-type="accepted"><day>26</day>
<month>1</month>
<year>2012</year>
</date>
</history>
<permissions><copyright-statement>Copyright © 2012 S. Zimeras and L. G. Gortzis.</copyright-statement>
<copyright-year>2012</copyright-year>
<license license-type="open-access"><license-p>This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<abstract><p>Telehealth is the exchange of health information and the provision of health care services through electronic information and communications technology, where participants are separated by geographic, time, social and cultural barriers. The shift of telemedicine from desktop platforms to wireless and mobile technologies is likely to have a significant impact on healthcare in the future. It is therefore crucial to develop a general information exchange e-medical system to enables its users to perform online and offline medical consultations through diagnosis. During the medical diagnosis, image analysis techniques combined with doctor's opinions could be useful for final medical decisions. Quantitative analysis of digital images requires detection and segmentation of the borders of the object of interest. In medical images, segmentation has traditionally been done by human experts. Even with the aid of image processing software (computer-assisted segmentation tools), manual segmentation of 2D and 3D CT images is tedious, time-consuming, and thus impractical, especially in cases where a large number of objects must be specified. Substantial computational and storage requirements become especially acute when object orientation and scale have to be considered. Therefore automated or semi-automated segmentation techniques are essential if these software applications are ever to gain widespread clinical use. The main purpose of this work is to analyze segmentation techniques for the definition of anatomical structures under telemedical systems.</p>
</abstract>
</article-meta>
</front>
<body><sec id="sec1"><title>1. Introduction</title>
<p>Access to medical care is sometimes very difficult to be reached from people living in rural and underserved areas. The implementation of systems support different telehealth technologies as well as on evidence-based medicine. A fundamental change in the management and delivery of healthcare, by leveraging telehealth applications and solutions, is crucial to get the most cost-effective and efficient use out of available healthcare resources. It is therefore crucial to develop a general information exchanged e-medical system to enable its users to perform online and offline medical consultations. This means by consultation of additional medical experts, medical diagnosis can be stated more precisely, and certified. During the medical diagnosis, image analysis techniques combined with doctor's opinions could be useful for final medical decisions.</p>
<p>Telehealth is the exchange of health information and the provision of health care services through electronic information and communications technology, where participants are separated by geographic, time, social and cultural barriers [<xref ref-type="bibr" rid="B1">1</xref>
]. It represents a wide range of variables including clinical application, characteristics of the information being transmitted, temporal relationships of data transfer, and the organizational context [<xref ref-type="bibr" rid="B1">1</xref>
]. In quality assessment studies on information systems effectiveness, data quality, the ISO and standards and issues related to the quality of medical care exist already.</p>
<p>Over the past years, simulator-assisted training in healthcare has become increasingly important. Simulation refers to the artificial generation, representation, and interaction of a complex-real-world process. In the medical area the trainee has the ability to realistically learn a number of skills without the physical presence of a real patient. The benefits are availability and evaluation of different medical cases; clinical human performance and mastering complex or even critical situations offers a safe study environment in absence of the physical patient, especially in cases where the distance is a crucial parameter for the diagnosis and treatment. Because there is a close relation between telemedicine and medical imaging, it is essential to develop e-medical systems appropriate to provide information for the anatomical structure of the human body.</p>
<p>Moreover the online-mode gives the opportunity to communicate over far distances with a given partner in real time. In this case both partners look at the same image material and through text messages (chat window) and transfer mouse actions to the remote PC, where they can discuss interactively over a medical case.</p>
<p>Methods for providing that kind of information are based on segmentation techniques. Methods for performing segmentations vary widely depending on the specific application, imaging modality, and other factors like treatment (e.g., cancer treatment, image-guided surgery, and invasive techniques) or diagnostic imaging [<xref ref-type="bibr" rid="B2">2</xref>
–<xref ref-type="bibr" rid="B4">4</xref>
].</p>
<p>In this work we will present segmentation techniques that improve the time and interaction one needs to define one or more structures. This methodology involves interpolation methods for the volume definition (manual and semiautomatic) and methods for the semiautomatic organ shape extraction. Once an accurate segmentation is obtained, this information may be used by the doctors to compare the volume and morphology characteristics of each region against known anatomical norms, other regions in the same image set, and corresponding regions in related image sets.</p>
</sec>
<sec id="sec2"><title>2. Motivation</title>
<p>Telemedicine, and recently e-health, are the names of telecommunication tools, which are able to improve the equitable access to healthcare. The ability of telemedicine to facilitate medical care, irrespective of distance and availability of medical specialists on site, makes it attractive to the healthcare sector. Telemedicine allows better utilization of scarce medical personnel and resources. Telemedicine promises to enhance continued on-the-job medical training of doctors, nurses, and other healthcare practitioners in rural areas, and this perspective is extremely useful for all developing countries.</p>
<p>Telemedicine is defined as the practice of medicine at a distance, where a messenger carrying over a medical advice from a distant expert to the bed of a patient. Medical care can be provided through these systems almost anywhere at anytime. The physicians and health care organizations are therefore able to guarantee high-quality care, without the patient having to travel and being carried over long distances.</p>
<p>Effectiveness of the telemedical systems could be seen especially in demanding diagnostics (cancer disease) where distance is an important factor in patient treatment (radiotherapy). Radiotherapy is one of the most effective forms of cancer treatment, undergone by roughly a third of all cancer patients. Once cancer has been diagnosed, patients generally have three fundamental treatment alternatives: surgery, radiotherapy, or chemotherapy. None of these options is particularly comfortable, and they each have positive and negative aspects. Radiotherapy is the only choice in certain cases, such as fast-growing tumors, in the postoperative treatment of breast or lung cancer, some prostate types and many others, where radiotherapy is often used to prevent the regrowth of malignant tissue.</p>
<p>The scope is on the one hand the virtualization of the complete treatment planning procedure (to deal with the digital patient data rather than the real patient), on the other hand to make the virtual patient available on different sites than those of its physical location and therefore allow telematics cooperation of radiooncology centers. The first fact will mainly increase efficiency of personnel and accuracy (quality) of treatment, while the second will mainly reduce costs by allowing virtual sharing of extremely expensive devices as well as remote expert assistance/service. Although system demonstration will be based on a worldwide commercially available radiotherapy planning system which will extend its efficiency by adding telematics components, mainly based on generally available networks (Internet, ISDN, phone lines).</p>
<p>The main efforts will be entirely focused on developing the innovative telematics tasks and implementing these on existing professional and commercially available technology. Due to the availability of telematics components expensive devices such as CT (Computed Tomography) scanners will become virtually available to hospitals without such devices physically present. In addition, remote experts can generate the treatment plan of a patient and/or validate plans of their colleagues on-line (consultation conference) or off-line (desktop system).</p>
<p>Powell III [<xref ref-type="bibr" rid="B5">5</xref>
] states that telemedicine programs can help patients in remote areas being cared at their duty station, when they might otherwise have traveled for care. As a result there is an increase in appropriateness of consultation request, improved access to care, enhanced provider education, and higher customer satisfaction.</p>
</sec>
<sec id="sec3"><title>3. Telemedical Platform</title>
<p>To generate views from different anatomical structures contained in CT data sets or to perform treatment planning techniques, it is essential (1) to extract the corresponding data from the image and (2) to accurately define the target volumes as well as the organs at risk for the treatment outcome; both methods can be done via segmentation process.</p>
<p>The first fact will mainly increase efficiency of personnel and accuracy (quality) of treatment, while the second will mainly reduce costs by allowing virtual sharing of extremely expensive devices as well as remote expert assistance/service. The main efforts will be entirely focused on developing the innovative telematics tasks and implementing these on existing professional and commercially available technology.</p>
<p>In order to make possible the data transference, a telemedical platform must be implemented. Aim of the platform is the collaboration between doctors and/or citizens located in countries with different health care systems, different technology infrastructure, and different needs, in order to enhance the quality of health care services and the equal access to the health care systems. Through the platform will be possible the efficient handling of patients with chronic diseases, the early response to emergency incidents, and the reduction of human lives losses. Based on the system platform users are able to perform online and offline medical consultations. In addition to the given possibilities telemedical systems offer the following features: (1) sending and receiving of multimedia messages with text, image material, and audiomessages, over Internet, ISDN and analog phone line in offline and online mode. (2) Graphical and textual annotations and pictograms can be added to the images. (3) In the online mode interactive communication via usage of a chat window, mouse, exchanged images, and a consolidated screen view is possible. Support of the operation in a telemedicine center and consultation clients through a client-server database all image of the patient and message-information will be stored constantly. The principle of the online teleconsultations is to bring two geographically distanced doctors together in an online session. During that session, both doctors will have the same view on the images and can communicate through additional communication features like chat, annotations, and so forth. In that way, expert knowledge and advice is provided to doctors in rural and crisis situation areas, or simply to any doctor in the field, who needs help in diagnosing a clinical case and do not want or is not able to send the patient to the expert physically (<xref ref-type="fig" rid="fig1">Figure 1</xref>
). Extended examples of telemedical systems are described and illustrated in [<xref ref-type="bibr" rid="B32">6</xref>
, <xref ref-type="bibr" rid="B33">7</xref>
].</p>
<p>These systems have the ability to generate 2D and 3D images using only the original CT data of the patient. The 2D images displayed are the original axial CT, MR, or PET. Multiplanar reconstructions (MPR) can be generated in real time in the orthogonal, coronal, and sagittal directions, and any oblique direction. The 3D reconstructed images are a must in CT-Sim systems in order to simulate the patient anatomy and the images generated from the real simulator or the treatment machine. The first layout contains four windows and the displayed images are the Beam's Eye View (BEV), the Observer's Eye View (OEV) and the Room View (RM), together with the axial slices. The second layout is composed again of four windows, containing the three orthogonal slice directions and the OEV. This layout is ideal for navigation through the CT volume, for volume delineation and to observe complex radiation field arrangements. The last layout contains every image described above. This layout has six windows emphasizing the size of the BEV image, since the physicians feel comfortable working with this image. In both rendering views, OEV and BEV, the volume orientation is controlled using a mouse track ball. The important RTP imaging is the dynamic X-ray image on the Simulator monitor, which is generated from the viewpoint of the beam source, called Beam's Eye View (BEV) image, see the BEV view direction in <xref ref-type="fig" rid="fig5">Figure 5</xref>
. In the system the corresponding window, called the BEV window, displays the interactive DRR images. Through the BEV window, the physicians can investigate the patient anatomy in the DRR image as they observe it on the Simulator monitor. Observer's Eye View (OEV) window visualizes the patient from the room's eye view, which is the same view as the physicians observe the patient in the Simulator room, see the OEV view direction in <xref ref-type="fig" rid="fig5">Figure 5</xref>
. As we explained before, all of the images in both BEV and OEV windows are generated with the patient CT scan by the direct volume rendering (<xref ref-type="fig" rid="fig2">Figure 2</xref>
).</p>
<p>The system can use large amounts of data, from 40 up to 300 slices, in order to produce high-quality anatomical images. It enables reading of CT data, acquired not only with a single slice CT scanner (such as a Siemens SOMATOM Plus 4), but also multislice data ranges, acquired in this study with four slices (SOMATOM Volume Zoom). It can be connected via network directly to any CT scanner that supports DICOM protocol. The system allows the adaptation to any LINAC configuration through a machine configuration module that is designed according to the international standard for radiotherapy equipment (IEC 1217). This configuration involves limitation on movements of the mechanical component and description of the component's dimensions (e.g., multileaf collimator, or MLC).</p>
<p>Instead of the presence of the physical patient's body, a virtual patient's body as well as the VS machine is displayed, which is called the Simulator Window. Through the Simulator window, the physicians can investigate the movements of the machine as they observe it through the lead glass in their Simulator operation room; see the Sim view direction in <xref ref-type="fig" rid="fig3">Figure 3</xref>
.</p>
</sec>
<sec id="sec4"><title>4. Radiotherapy Treatment Planning (RTP)</title>
<p>The effect of the radiotherapy treatment is based on the precise delivery of high irradiation dose on the tumor site without damaging the surrounding healthy tissues. Therefore patient positioning, target volume definition, and irradiation field placement are very critical steps while planning the irradiation process. One of the significant technological advances in radiotherapy in the past 20 years is the implementation of CT or Virtual Simulators (VS), in the clinical routine. Sherouse et al. in 1987 [<xref ref-type="bibr" rid="B6">8</xref>
] first proposed the concept, often termed CT-Sim to distinguish it from Sim-CT where a simulator is modified for CT use and by the late 1990s several designs and clinical assessments of CT virtual simulators have been reported [<xref ref-type="bibr" rid="B6">8</xref>
–<xref ref-type="bibr" rid="B13">15</xref>
]. Using VS, the clinical routine is modified accordingly (<xref ref-type="fig" rid="fig4">Figure 4</xref>
) [<xref ref-type="bibr" rid="B14">16</xref>
, <xref ref-type="bibr" rid="B15">17</xref>
]. </p>
<list list-type="order"><list-item><p>Collect patient's CT data including attached aluminium markers.</p>
</list-item>
<list-item><p>Transfer CT data to VS. The physician defines the tumour volume and the organs at risk and she/he will place the necessary fields relative to the tumour volume.</p>
</list-item>
<list-item><p>The simulation plan and the CT data are transferred via DICOM (Digital image and Communication in Medicine) server to the TPS for dose calculation and final treatment plan optimization.</p>
</list-item>
<list-item><p>Verify patient position on LINAC before irradiation.</p>
</list-item>
<list-item><p>Perform treatment on the treatment machine (Linear Accelerator or LINAC).</p>
</list-item>
</list>
<p>During the images' transferring in teleradiology important factor for effective diagnosis is the exchanging time. Crucial involvement to this achieved has the volume rendering process. Volume rendering is the technique according to which a scalar field of data with discrete values, volume data, is selectively sampled in order to generation a useful image in relation to the sampled values. A volume data set is typically a set of discrete samples of one or more physical properties in a limited object space.</p>
<p>A volume data set is typically a set of discrete samples of one or more physical properties in a limited object space, <italic>V</italic>
(<italic>x</italic>
), <italic>x</italic>
∈ <italic>R</italic>
<sub><italic>n</italic>
</sub>
, in which {<italic>x</italic>
} is a set of sampling points; <italic>n</italic>
is the dimension of the sampling space, usually <italic>n</italic>
= 3, that is, 3D volume data; <italic>V</italic>
represents the sampling values, it can be a single-valued or multivalued function. According to the distribution of sampling points (i.e., the structure of <italic>x</italic>
), volume data sets are classified into structured and unstructured data sets. In medical imaging, volume data is usually a structured data set, typically organised as a stack of slices; <italic>V</italic>
can be single valued (e.g., the CT Hounsfield value) or multivalued (e.g., density, T1, T2 in MRI). The resulting data structure is an orthogonal 3D array of voxels, each representing a sampling value.</p>
<p>The rendering methods which are proposed in this work are based on the work of [<xref ref-type="bibr" rid="B16">18</xref>
]. (1) Transparent mode: Digitally Reconstructed Radiographies (DRR) with general energy exponential equation:
<disp-formula id="eq1"><label>(1)</label>
<mml:math id="M1"><mml:mi>I</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mi>s</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:msub><mml:mrow><mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mi>exp</mml:mi>
<mml:mo></mml:mo>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mo>−</mml:mo>
<mml:munderover><mml:mstyle displaystyle="true"><mml:mo>∫</mml:mo>
</mml:mstyle>
<mml:mrow><mml:mi>D</mml:mi>
</mml:mrow>
<mml:mrow></mml:mrow>
</mml:munderover>
<mml:mrow><mml:msub><mml:mrow><mml:mi>K</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>λ</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:math>
</disp-formula>
where <italic>K</italic>
<sub><italic>λ</italic>
</sub>
is the attenuation coefficient and <italic>λ</italic>
is the wavelength in distance <italic>D</italic>
[<xref ref-type="bibr" rid="B16">18</xref>
]; (2) surface reconstruction mode: isovalue, gradient [<xref ref-type="bibr" rid="B17">19</xref>
] and semitransparent with general energy form:
<disp-formula id="eq2"><label>(2)</label>
<mml:math id="M2"><mml:mi>I</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mi>s</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:munderover><mml:mstyle displaystyle="true"><mml:mo>∫</mml:mo>
</mml:mstyle>
<mml:mrow><mml:mi>D</mml:mi>
</mml:mrow>
<mml:mrow></mml:mrow>
</mml:munderover>
<mml:mrow><mml:mi>C</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>α</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mi>T</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
</mml:math>
</disp-formula>
where <italic>C</italic>
(<italic>t</italic>
) is the shading intensity at point <italic>t</italic>
, <italic>α</italic>
is the opacity, and <italic>T</italic>
(<italic>t</italic>
) is the accumulated transparency from 0 to point <italic>t</italic>
in distance <italic>D</italic>
. DRR images generated from CT digital volumes are often called using the term digitally reconstructed radiographs (DRRs) (<xref ref-type="fig" rid="fig5">Figure 5</xref>
). </p>
<p>To reconstruct a DRR the digital CT data of the patient are used. Each voxel acquired using CT has a value that is called the Hounsfield unit upon the name of the father CT. The HU can be estimated using the following formula (<xref ref-type="disp-formula" rid="EEq1">3</xref>
):</p>
<p><disp-formula id="EEq1"><label>(3)</label>
<mml:math id="M3"><mml:mtext>HU</mml:mtext>
<mml:mo>=</mml:mo>
<mml:mfrac><mml:mrow><mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:msub><mml:mrow><mml:mi>ρ</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>μ</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msub><mml:mrow><mml:mi>ρ</mml:mi>
</mml:mrow>
<mml:mrow><mml:mtext>water</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow><mml:msub><mml:mrow><mml:mi>ρ</mml:mi>
</mml:mrow>
<mml:mrow><mml:mtext>water</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mi>∗</mml:mi>
<mml:mn>1000</mml:mn>
<mml:mo>,</mml:mo>
</mml:math>
</disp-formula>
where <italic>ρ</italic>
<sub><italic>μ</italic>
</sub>
, <italic>ρ</italic>
<sub>water</sub>
are the attenuation coefficient of the material for the specific voxel and the water, respectively. When on the above equation one replaces the <italic>ρ</italic>
<sub><italic>m</italic>
</sub>
= <italic>ρ</italic>
<sub>water</sub>
, then will receive a HU<sub>water</sub>
= 0. In addition the air as material corresponds to −1000HU, since <italic>ρ</italic>
<sub>air</sub>
= 0. The Hounsfield units have no upper limit but usually for medical scanners a range between −1024 to +3071 is provided. Apparently 4096 different HU values are provided and therefore to illustrate the complete range of the HU on a volume 12-bit voxels are required.</p>
<p>Probably the most common methods for reconstructing surfaces directly from voxels are the gradient surface and isosurface model. This rendering model is widely used in almost all medical data sets to render the surface detected by the gradient operator. Levoy [<xref ref-type="bibr" rid="B19">20</xref>
] presented this concept, which is effectively used in most medical imaging applications for the last decade. Depending on the data set size and on the size of the resulting 3D image, which influence the number of rays, a 3D view image can be calculated almost in real time (0.8 sec to 2.3 sec).</p>
<p>Before applying any visualization routine the beam and block polygon are rotated and translated so as to achieve the appropriate orientation relative to the CT data. The common visualization of beam, block polygons, and the CT data is achieved using a 3D scan-line conversion algorithm. Each polygon's plane is scanned from side to side. For the 3D visualization of the polygon, the depth value of the point plane is compared with the depth information of the surface Z-buffer that is calculated by the volume-rendering pipeline. If the depth value of the point plane is closer to the spectator than the calculated surface position, then the original pixel value is mixed with the point plane color value (<xref ref-type="fig" rid="fig6">Figure 6</xref>
). If <italic>Z</italic>
<sub><italic>V</italic>
</sub>
(<italic>i</italic>
, <italic>j</italic>
) is the function during the volume rendering process. If one compares the current edge Z-depth <italic>Z</italic>
<sub><italic>P</italic>
</sub>
(<italic>i</italic>
, <italic>j</italic>
) with the value of the image Z-buffer then could make the following two assumptions [<xref ref-type="bibr" rid="B18">21</xref>
].</p>
<list list-type="roman-lower"><list-item><p>If <italic>Z</italic>
<sub><italic>P</italic>
</sub>
(<italic>i</italic>
, <italic>j</italic>
) < <italic>Z</italic>
<sub><italic>V</italic>
</sub>
(<italic>i</italic>
, <italic>j</italic>
) then the current polygon edge is behind the volume and is hidden from the viewer. In this case no value for the light mask is accumulated.</p>
</list-item>
<list-item><p>If <italic>Z</italic>
<sub><italic>P</italic>
</sub>
(<italic>i</italic>
, <italic>j</italic>
) > <italic>Z</italic>
<sub><italic>V</italic>
</sub>
(<italic>i</italic>
, <italic>j</italic>
) then the current polygon edge is in the front of the volume and is visible from the viewer. In this case one value for the light mask is accumulated.</p>
</list-item>
</list>
</sec>
<sec id="sec5"><title>5. Segmentation Techniques</title>
<p>Image segmentation is an essential step for many advanced imaging applications. Accurate segmentation is required for volume determination, 3D rendering, radiation therapy, and surgery planning. Traditionally, image segmentation denotes the technique of extraction of image entities or structures (regions or objects), so that the outlines of these structures will coincide as accurately as possible with the physical 2D object outlines [<xref ref-type="bibr" rid="B21">22</xref>
, <xref ref-type="bibr" rid="B22">23</xref>
]. An object region is a set of image pixels, which are similar with respect to a homogeneity criterion such as texture.</p>
<p>A problem that occurs is that images either over-estimated, with objects divided into parts or images are incorrectly segmented, with or without more objects segmented as one object. An obvious direction is the use of the manual methods. In this work we will present an effective semiautomatic method, based on the boundary tracking technique [<xref ref-type="bibr" rid="B23">24</xref>
], which improves the time when one or more structures are in use. The implemented algorithms can segment within a few seconds the complete volume of specific organs, for example, lungs, skin, and spine. The only interaction of the user is to select the starting point in the region of interest and the algorithm will track the object boundaries in 3 dimensions. The segmentation process might involve complicate structures and in this case usually only an expert can perform the task of the identification manually on a slice-by-slice base. Humans can perform this task using complex analysis of shape, intensity, position, texture, and proximity to surrounding structures. Of course, all these features are differently qualified depending on the experience of the user. To perform a similar procedure automatically using a computer since today has been proved a very difficult task. In other cases where simpler anatomical regions with a very distinguishable shape must be identified an algorithm can perform this task. Currently there are only dedicated algorithms for different regions of the human body. To generate a “complete,” with a general meaning of the term, segmentation application numerous tools and algorithms must be combined [<xref ref-type="bibr" rid="B24">25</xref>
].</p>
<p>Image segmentation approaches may be performed in one of three ways: (1) completely manual: an operator with proper training draws the required boundaries manually, using a mouse or other pointing devices. This requires expert knowledge of the operator and skills in drawing boundaries with available tools. Manual drawing of boundaries is difficult and time consuming. It will pose a serious problem when the size of data sets grows, (2) fully automatic: the current available techniques, such as thresholding or region growing are not sophisticated and robust enough for our application. The use of these techniques is therefore restricted to simple boundaries and requires high image quality, and (3) semiautomated: this method uses boundary finding results generated by sophisticated automatic algorithms as initial guess, and then allows an operator to edit the required boundaries manually. This method still requires expert knowledge of the operator, but reduces the time and effort needed. The differences in these types of interaction are the amount of time and effort required, as well as the amount of training required by an operator. Even automated segmentation methods typically require some interaction for specifying initial parameters that can significantly affect performance.</p>
<p><italic>Linear Interpolation</italic>
is one of the simplest methods where linear interpolation between contours is the first approach used to provide an acceleration tool for the manual contouring. The mechanism of the linear interpolation is applied when between the key contours at least one slice exists. To perform the linear interpolation we create triangles between the contour points of the key contours as described in Sakas [<xref ref-type="bibr" rid="B15">17</xref>
]. For this operation both contour's points must be rotated towards the same rotation direction. The interpolated contour points are created after calculating the intersection of each triangle side with the intermediate slice (<xref ref-type="fig" rid="fig7">Figure 7</xref>
). After the definition of the organ boundaries for a given 2D shape, a surface reconstruction of the 3D data defining anatomical structures must be defined. </p>
<p>Linear interpolation between key slices is a very common approach used in RTP process to accelerate target volume definition. To overcome the problem with local discontinuities when one contour every time is considered, a linear interpolation technique based on surface rendering is applied using information from the triangulation of the 3D shape. Surface rendering is a process in which apparent surfaces are produced from the data volume and an image of the extracted surfaces is suitably visualized. Surface contours are modelled with bidimensional primitives, as triangles or polygons, in order to represent a 3D object. The basic idea is to extract a surface from the 3D data volume as a collection of adjacent polygons and to visualize the extracted surface by appropriate algorithms. The triangulation approach is described as in <xref ref-type="fig" rid="fig7">Figure 7</xref>
: contours defined on two adjacent slices are divided into the same number of equiangular sectors. The points corresponding to sector neighbours are connected by obtaining a series of triangles that will define the surface. The marching-cube algorithm works on a 3D mask that defines the object of interest obtained by a threshold-based or a more complex segmentation algorithm (<xref ref-type="fig" rid="fig8">Figure 8</xref>
). </p>
<p><italic>Semiautomatic segmentations methods</italic>
combine the benefit of bath manual and automatic segmentation techniques. By supplying initial information about the region of interest, the user may guide an otherwise automatic segmentation procedure. Any remaining errors introduced by automatic segmentation methods may be corrected by manual editing. In this work, a boundary tracking algorithm [<xref ref-type="bibr" rid="B25">26</xref>
–<xref ref-type="bibr" rid="B29">30</xref>
] was implemented for the segmentation part.</p>
<p>Boundary tracking technique (BT) is a segmentation method that given one point along a region's boundary follows the boundary around the region until it returns to the original point. Assuming a constant boundary, this allows for considerable variation within the region without any effect on the segmentation. The advantage of the approach is that no assumptions are needed to be made a priori about the boundary shape, which may vary from a straight line too much more complex shapes which are difficult to parameterize. First let us assume that the image with regions is either binary or that regions have been labeled using a specific threshold (white for the organ of interest, black for the background). The algorithm starts with an initial point. Different starting directions are defined until a sharp edge was found. Each boundary was tracked, keeping to the right part consistently. The tracking procedure stops only when all the boundary regions have been scanned. The algorithm traces the edges with detail providing high accuracy to the description of the contour shape (<xref ref-type="fig" rid="fig9">Figure 9(a)</xref>
).</p>
<p>Image-smoothing techniques are used in image processing to reduce noise. Usually in medical imaging the noise is distributed statistically and it exists in high frequencies; therefore, it can be stated that image smoothing filters are low-pass filters. The drawback of applying a smoothing filter is the simultaneous reduction of useful information, mainly detail features, which also exist in high frequencies.</p>
<p>The basis for the filtering operation is the convolution operator, where a <italic>K</italic>
× <italic>K</italic>
matrix known as the kernel or mask is introduced by a general form:
<disp-formula id="eq3"><label>(4)</label>
<mml:math id="M4"><mml:mtable><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mrow><mml:mo>[</mml:mo>
<mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>11</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>12</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>21</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>22</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>2</mml:mn>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>k</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>k</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>k</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mrow><mml:mo>[</mml:mo>
<mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>11</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>12</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>21</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>22</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>2</mml:mn>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>⋮</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>k</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>k</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:mo>…</mml:mo>
</mml:mtd>
<mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>k</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
</disp-formula>
where <bold>f</bold>
is the original image. The convolution process is defined by <bold>g</bold>
= <bold>w</bold>
⊗ <bold>f</bold>
. The convolution filter with the mask can also be used to find contours inside an image; especially in volumetric and surface processing. It is the first step of contouring detection, where the kernel isolates the part of the image where edges appeared (large steps, rapidly changes). After segmenting the regions of interest, a 3 × 3 Sobel edge detection operator (<xref ref-type="fig" rid="fig9">Figure 9(b)</xref>
) is used to improve the appearance of the contours.</p>
<p>In the analysis of the objects in images it is essential that we can distinguish between the objects of interest and “the rest.” This latter group is also referred to as the background. The techniques that are used to find the objects of interest are usually referred to as segmentation techniques—segmenting the foreground from background. Image thresholding is a technique for converting a grayscale or color image to a binary image based upon a threshold value. If a pixel in the image has intensity less than the threshold value, the corresponding pixel in the resultant image is set to white. Otherwise, if the pixel is greater than or equal to the threshold intensity, the resulting pixel is set to black. For that purpose, a low-pass filter was used based on the rectangular window or box function based on the rule: </p>
<p><disp-formula id="eq4"><label>(5)</label>
<mml:math id="M5"><mml:mi>I</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mrow><mml:mo>{</mml:mo>
<mml:mrow><mml:mtable><mml:mtr><mml:mtd columnalign="left"><mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
</mml:mtd>
<mml:mtd columnalign="left"><mml:mtext>if</mml:mtext>
<mml:mi> </mml:mi>
<mml:mi>I</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>≥</mml:mo>
<mml:mi>T</mml:mi>
<mml:mo>⇒</mml:mo>
<mml:mtext>object</mml:mtext>
<mml:mo>,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd columnalign="left"><mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
</mml:mtd>
<mml:mtd columnalign="left"><mml:mtext>otherwise</mml:mtext>
<mml:mo>⇒</mml:mo>
<mml:mtext>background</mml:mtext>
<mml:mo>,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
where <italic>I</italic>
(<italic>i</italic>
, <italic>j</italic>
) is image matrix and <italic>T</italic>
is the appropriate threshold. The output is the label “object” or “background” which, due to its dichotomous nature, can be represented as a Boolean variable “1” or “0.” The central question in thresholding then becomes how do we choose the threshold? While there is no universal procedure for threshold selection that is guaranteed to work on all images, there are a variety of alternatives. For this case a histogram-derived threshold was chosen based on the image histogram combined with Hounsfield unit tissue values. To overcome the problem with the increasingly high number of points, that are reconstructing the contour, a point decimation algorithm (or sequence sampling algorithm) was used to reduce the number of points without loss of their general presentation. If a sequence of numbers was given, <italic>S</italic>
= {<italic>s</italic>
<sub>1</sub>
, <italic>s</italic>
<sub>2</sub>
, <italic>s</italic>
<sub>3</sub>
,…, <italic>s</italic>
<sub><italic>i</italic>
−1,</sub>
<italic>s</italic>
<sub><italic>i</italic>
,</sub>
<italic>s</italic>
<sub><italic>i</italic>
+1,</sub>
…, <italic>s</italic>
<sub><italic>n</italic>
</sub>
}, then the main idea is to construct another sequence <italic>S</italic>
*, where <italic>k</italic>
%-values would be removed from the original sequence. Summarizing the above procedures, the pseudocode for the segmentation technique is presented in <xref ref-type="fig" rid="alg1">Algorithm 1</xref>
.</p>
<p>The main drawback of the method is that it is a binary approach and hence is very sensitive to gray value variations. If the threshold value is not selected properly then the system will fail to detect the appropriate organ shape. Most of the inaccuracies of the segmentation method require the user intervention to optimize the result. To overcome the limitation we calculate a secondary opacity volume from the original CT data based on the well-known approach from [<xref ref-type="bibr" rid="B20">31</xref>
], that is very often used to visualize surfaces from scalar volume data in volume rendering.</p>
<p>For the lungs segmentation, two regions would be investigated: (a) concave and (b) convex. For the convex regions firstly different starting directions was defined. The algorithm requires an initial point to start the tracing of the edge of the object under investigation. The initial point travels to the vertical or horizontal direction until the edge of the investigated object is reached. Then the algorithm will start to exam the surrounding pixel of that edge and check whether they belong to the current edge or not. For the concave regions a different approach was achieved implementing a two moving position methods based on where the starting point appears: (i) outside point and (ii) inside point. The algorithm uses a constant threshold selection with levels 20 to 70 Hounsfield values.</p>
<p><statement id="head1"><title>Outside Point</title>
<p>Considering the case where the object is <italic>concave</italic>
and a <italic>starting point</italic>
was given, extended experiments indicate false segmentation alarms, when the starting point remains at the same position for all the slices; to overcome this, a region growing technique (grey color) was applied to find the first white region inside the organ; a region growing approach (green color) was used, to avoid undesired results in case the point position was moved at the edge of the region.</p>
</statement>
</p>
<p>The region-growing (RG) algorithm is used very often in the region-based segmentation techniques and has been successfully incorporated into several medical imaging applications for the extraction of organ volumes. In this work we follow a simple design principle since the region boundaries that must be detected have low complexity and high contrast differences with the surrounding tissues. The RG algorithm is initiated with a seed voxel selected manually, which is known to be a part of the voxel of interest, room air or skin surface. If the difference in grey level is between the voxel under investigation and its six adjacent voxels are less than a given threshold, then the current voxel is merged with the growing region. This process is repeated recursively to grow the object until not more voxels can be found. The starting point changes and the boundary tracking technique continue as before (<xref ref-type="fig" rid="fig10">Figure 10</xref>
).</p>
<p><statement id="head2"><title>Inside Point</title>
<p>Consider now the case where the starting point is inside the lung region and close to the area of high tissue (small white spots). In this case using the original method, the tracking technique probably will spot (for some slices) the white areas avoiding the bigger lung region. Extended experimental results suggest that these regions have maximum area close to 6 cm<sup>2</sup>
: if the object is smaller than 6 cm<sup>2</sup>
then it is removed and the process continues until a larger region corresponds to the overall lung area is found. With this restriction the method avoids to segment areas that are meaningless (<xref ref-type="fig" rid="fig11">Figure 11</xref>
).</p>
</statement>
</p>
<p>For visualizing volumetric medical data, sequences of 2D images are piled up to recreate the three-dimensional structure (<xref ref-type="fig" rid="fig12">Figure 12(a)</xref>
). Usually, in this step linear interpolation of adjacent slices is needed for the generation of new slices (<xref ref-type="fig" rid="fig12">Figure 12(b)</xref>
), since one of the problems resulting from image acquisition is the space between slices. This problem occurs because the sampling interval between slices is normally greater than the generated image resolution, and then the volume voxels are not cubic. After interpolation this size distortion is corrected, so that the visualization algorithm could generate correct proportion projections.</p>
<p>Assuming a simple 1D example of sampling points linear interpolation offers first-degree connectivity among the sampling points, passing a straight line through every two consecutive points of the input signal. In the spatial domain, linear interpolation (LN) is equivalent to convolving the sampled data with the following interpolation kernel (<xref ref-type="disp-formula" rid="EEq2">6</xref>
):</p>
<p><disp-formula id="EEq2"><label>(6)</label>
<mml:math id="M6"><mml:mi>h</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mi>x</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mrow><mml:mo>{</mml:mo>
<mml:mrow><mml:mtable><mml:mtr><mml:mtd columnalign="left"><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mrow><mml:mo>|</mml:mo>
<mml:mrow><mml:mi>x</mml:mi>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mtd>
<mml:mtd columnalign="left"><mml:mtext>when</mml:mtext>
<mml:mi> </mml:mi>
<mml:mn>0</mml:mn>
<mml:mo>≤</mml:mo>
<mml:mrow><mml:mo>|</mml:mo>
<mml:mrow><mml:mi>x</mml:mi>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
<mml:mo>≤</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd columnalign="left"><mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
</mml:mtd>
<mml:mtd columnalign="left"><mml:mtext>when</mml:mtext>
<mml:mi> </mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>≤</mml:mo>
<mml:mrow><mml:mo>|</mml:mo>
<mml:mrow><mml:mi>x</mml:mi>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
The above interpolation kernel corresponds to a reasonably good low-pass filter in the frequency domain [<xref ref-type="bibr" rid="B30">32</xref>
]. In practice we can define the linear interpolation between two points <italic>p</italic>
<sub>0</sub>
, <italic>p</italic>
<sub>1</sub>
in one dimension as follows (<xref ref-type="disp-formula" rid="EEq3">7</xref>
):</p>
<p><disp-formula id="EEq3"><label>(7)</label>
<mml:math id="M7"><mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>x</mml:mi>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>⇒</mml:mo>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>x</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:math>
</disp-formula>
In two dimensions the interpolation scheme will involve four data points' <italic>p</italic>
<sub>00</sub>
, <italic>p</italic>
<sub>01</sub>
, <italic>p</italic>
<sub>10</sub>
, and <italic>p</italic>
<sub>11</sub>
. The interpolation can be formulated using the following formula (<xref ref-type="disp-formula" rid="EEq4">8</xref>
):</p>
<p><disp-formula id="EEq4"><label>(8)</label>
<mml:math id="M8"><mml:mtable><mml:mtr><mml:mtd columnalign="right"><mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd columnalign="left"><mml:mo>=</mml:mo>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>00</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>y</mml:mi>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>01</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd columnalign="right"></mml:mtd>
<mml:mtd columnalign="left"><mml:mo> </mml:mo>
<mml:mo>+</mml:mo>
<mml:mi>x</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>10</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>11</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
</disp-formula>
This interpolation method is known as <italic>bilinear </italic>
interpolation and is commonly applied on image interpolation for example, when magnifying raster images.</p>
<p>In volumetric data linear interpolation is known as tri-linear interpolation and estimates the value of the result voxel considering the neighbourhood of eight (8) voxels (<italic>p</italic>
<sub>000</sub>
, <italic>p</italic>
<sub>001</sub>
, <italic>p</italic>
<sub>011</sub>
, <italic>p</italic>
<sub>010</sub>
, <italic>p</italic>
<sub>100</sub>
, <italic>p</italic>
<sub>110</sub>
, <italic>p</italic>
<sub>101</sub>
, and <italic>p</italic>
<sub>111</sub>
) (<xref ref-type="fig" rid="fig13">Figure 13</xref>
) with estimation formula for <italic>p</italic>
<sub><italic>xyz</italic>
</sub>
(<xref ref-type="disp-formula" rid="EEq5">9</xref>
):
<disp-formula id="EEq5"><label>(9)</label>
<mml:math id="M9"><mml:mtable><mml:mtr><mml:mtd columnalign="right"><mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
<mml:mi>z</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
<mml:mtd columnalign="left"><mml:mo>=</mml:mo>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>000</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>x</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>100</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd columnalign="right"></mml:mtd>
<mml:mtd columnalign="left"><mml:mo> </mml:mo>
<mml:mo>+</mml:mo>
<mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>111</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>y</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>010</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd columnalign="right"></mml:mtd>
<mml:mtd columnalign="left"><mml:mo> </mml:mo>
<mml:mo>+</mml:mo>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>z</mml:mi>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>001</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>x</mml:mi>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>z</mml:mi>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>101</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr><mml:mtd columnalign="right"></mml:mtd>
<mml:mtd columnalign="left"><mml:mo> </mml:mo>
<mml:mo>+</mml:mo>
<mml:mrow><mml:mo>(</mml:mo>
<mml:mrow><mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>y</mml:mi>
<mml:mi>z</mml:mi>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>011</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
<mml:mi>z</mml:mi>
<mml:msub><mml:mrow><mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow><mml:mn>111</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
</disp-formula>
<xref ref-type="fig" rid="fig14">Figure 14</xref>
illustrates different 2D and 3D reconstruction examples of segmented structures.</p>
<p><xref ref-type="fig" rid="fig15">Figure 15</xref>
illustrates examples where volume segmentation techniques and bean object reconstruction using Z-buffer methodology are applied.</p>
<p>To assess the effectiveness of the methods and its sensitivity, the following measures are considered: (1) area of a contour in cm<sup>2</sup>
, (2) periphery of a contour in cm, (3) computational time in sec and (4) number of points for the contours drawing. <xref ref-type="table" rid="tab1"> Table 1</xref>
illustrates the performance of the segmentation methods for various slices using the manual, the proposed method, and the proposed method after the point decimation process.</p>
</sec>
<sec id="sec6"><title>6. Volume Definition</title>
<p>Target volume and critical structure definition is a complex and time-consuming process in radiotherapy: although the complexity varies for different anatomical sites. In CT-Sim and plan evaluation, the physicists and radiation oncologists interact closely to subjectively identify the plan most appropriate for the individual patient. In order to reduce the investment of time and effort by the radiation oncology staff, several image analysis tools are integrated by CT-Sim systems. These systems thus allow the user to draw contours around the tumour as target [PTV] and around normal tissues and organs of interest on a slice-by-slice basis. This provides at the same time, a cross-reference to planar images.</p>
<p>Organs with large differences in their radiation dose distributions can be segmented semiautomatically. In terms of user effort the only action required from the user is the selection of a starting point for the algorithm on the original axial slices. The complete 3D geometry of the organ will be traced automatically. <xref ref-type="fig" rid="fig16"> Figure 16</xref>
illustrates various applications of segmented anatomical structures under telemedical system. <xref ref-type="fig" rid="fig16"> Figure 16</xref>
(a) illustrate transformation of the segmented medical images of the lungs. <xref ref-type="fig" rid="fig16"> Figure 16</xref>
(b) illustrates the receiving process of the appropriate images.</p>
<p>Performance analysis of the system is taking place where the experiments are performed on a double processor (2xPentium III 450 MHz) PC with physical memory 512 Mb. For each view we performed time measurements for several rendering image sizes using different data resolution. The goal of this experiment is to examine the volume rendering interactivity as well as to prove the effectiveness of the system for large amount of data.</p>
<p>A comparison for the system memory relative to different amount of data is presented in <xref ref-type="fig" rid="fig17">Figure 17</xref>
. The results suggest a linear increase in required memory as it was expected. Important is that a PC with 512 MB physical memory can manipulate up to 300 slices with a rendering speed for transparent mode between 1.2 and 1.8 seconds and for the surface mode between 0.6 and 0.9 seconds.</p>
<p>Accuracy of the system is very important for the system implementation especially for the investigation of (1) CT volume data orientation and (2) treatment parameters, including table translation, gantry, collimator, and table rotation, reference point placement, beam, and block size. Commonly slices thickness between 3 mm to 5 mm and total number of slices maximum to 120 slices are used to implement segmentation analysis or radiotherapy treatment planning dose. A cubic phantom of size 120 × 120 mm was initially used to exam the accuracy of the system. Inside the phantom spheres of diameter 2 mm are placed in constant distance. The phantom was scanned using 1 mm slice thickness. The total number of produced slices was 120, in square CT matrices of 512 × 512 pixels. The recorded system error concerning the table translation is at ±1 mm. The beam size and the projected light field size matched completely. No isocenter sphere effect occurred during component rotation. The interactive landmark registration routine might have the error of the slice thickness. The accuracy of the routines automatic field and block adaptation is related to the resolution of the BEV image (<xref ref-type="fig" rid="fig18">Figure 18</xref>
). In most cases the BEV image has the size of 256 × 256 up to 400 × 400. The higher the image resolution the smaller the error of these routines.</p>
</sec>
<sec id="sec7"><title>7. Conclusions</title>
<p>CT-Sim is a technological advance that has already been tested in our clinical environment with demonstrable advantages particularly for complicated field arrangements. The new, innovative virtual simulator system is a very useful additional tool for the radiation oncologist and makes the requirement for a conventional X-ray simulator redundant. A significant advantage of the software is that it can run on portable computers such as laptops. This makes the CT-Sim concept extremely cost-effective. The system can be integrated immediately into the clinical environment via a direct interface to the CT scanner. The advantages of CT-Sim are not limited only to those mentioned above. Combination of different diagnostic (e.g., MR and PET) and radiotherapy (e.g., MV portal detectors) imaging modalities will make the CT-Sim an even more effective tool in radiotherapy. This technology could be combined with telemetrically techniques for the improvements of health services telemedicine applications are largely image-based. The main purpose of this work is to represent an efficient interactive, easy-to-use medical system that provides modules for online and offline collaboration of medical doctors together with software products. Moreover new improvements for the system starts to be implemented based on telemedical applications (this work is under development) where an online mode gives the opportunity to communicate over far distances with a given partner in real time. In this case both partners look at the same image material and through text messages (chat window) and transferred mouse actions to the remote PC, they can discuss interactively over a medical case. The system combines low price, low weight, mobility, and a wide range of nonradiating examinations. As a result the proposed platform reduces the disparity in the level of medical services, between the main centers and the less assisted areas, contributing to improvement of the quality of life.</p>
</sec>
</body>
<back><ack><title>Acknowledgments</title>
<p>The first author would like to thank Dr. Grigoris Karangelis and Professor Nikos Zamboglou for the useful scientific help and comments about the progress of this work. Also many thanks to Professor G. Sakas MedCom Company and Städtisches Klinikum Offenbach whom gave us equipment and medical data sets for the implementation of the above work. Finally the first author would like to thank the EC and the Marie Curie Fellowship Association for this great opportunity to work with different people. This work partly had been supported by a Marie Curie Industry Host Fellowship Grant no. HPMI-CT-1999-00005.</p>
</ack>
<ref-list><ref id="B1"><label>1</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hebert</surname>
<given-names>M</given-names>
</name>
</person-group>
<article-title>Telehealth success: evaluation framework development</article-title>
<source><italic>Medinfo</italic>
</source>
<year>2001</year>
<volume>10</volume>
<issue>2</issue>
<fpage>1145</fpage>
<lpage>1149</lpage>
</element-citation>
</ref>
<ref id="B2"><label>2</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>De Neve</surname>
<given-names>W</given-names>
</name>
<name><surname>De Wagter</surname>
<given-names>C</given-names>
</name>
<name><surname>De Jaeger</surname>
<given-names>K</given-names>
</name>
<etal></etal>
</person-group>
<article-title>Planning and delivering high doses to targets surrounding the spinal cord at the lower neck and upper mediastinal levels: static beam-segmentation technique executed with a multileaf collimator</article-title>
<source><italic>Radiotherapy and Oncology</italic>
</source>
<year>1996</year>
<volume>40</volume>
<issue>3</issue>
<fpage>271</fpage>
<lpage>279</lpage>
<pub-id pub-id-type="pmid">8940755</pub-id>
</element-citation>
</ref>
<ref id="B3"><label>3</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Isacsson</surname>
<given-names>U</given-names>
</name>
<name><surname>Hagberg</surname>
<given-names>H</given-names>
</name>
<name><surname>Johansson</surname>
<given-names>K-A</given-names>
</name>
<name><surname>Montelius</surname>
<given-names>A</given-names>
</name>
<name><surname>Jung</surname>
<given-names>B</given-names>
</name>
<name><surname>Glimelius</surname>
<given-names>B</given-names>
</name>
</person-group>
<article-title>Potential advantages of protons over conventional radiation beams for paraspinal tumours</article-title>
<source><italic>Radiotherapy and Oncology</italic>
</source>
<year>1997</year>
<volume>45</volume>
<issue>1</issue>
<fpage>63</fpage>
<lpage>70</lpage>
<pub-id pub-id-type="pmid">9364633</pub-id>
</element-citation>
</ref>
<ref id="B4"><label>4</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Pirzkall</surname>
<given-names>A</given-names>
</name>
<name><surname>Lohr</surname>
<given-names>F</given-names>
</name>
<name><surname>Rhein</surname>
<given-names>B</given-names>
</name>
<etal></etal>
</person-group>
<article-title>Conformal radiotherapy of challenging paraspinal tumors using a multiple arc segment technique</article-title>
<source><italic>International Journal of Radiation Oncology Biology Physics</italic>
</source>
<year>2000</year>
<volume>48</volume>
<issue>4</issue>
<fpage>1197</fpage>
<lpage>1204</lpage>
</element-citation>
</ref>
<ref id="B5"><label>5</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Powell</surname>
<given-names>AW</given-names>
<suffix>III</suffix>
</name>
</person-group>
<article-title>Reengineering health care delivery using telemedicine</article-title>
<conf-name>In: Proceedings of the Medical Technology Symposium</conf-name>
<conf-date>1998</conf-date>
<conf-loc>Honolulu, Hawaii, USA</conf-loc>
<fpage>371</fpage>
<lpage>374</lpage>
</element-citation>
</ref>
<ref id="B32"><label>6</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Kontaxakis</surname>
<given-names>G</given-names>
</name>
<name><surname>Walter</surname>
<given-names>S</given-names>
</name>
<name><surname>Sakas</surname>
<given-names>G</given-names>
</name>
</person-group>
<article-title>Eu-teleInViVo: an integrated portable telemedicine workstation featuring acquisition, processing and transmission over low-bandwidth lines of 3D ultrasound volume images</article-title>
<conf-name>In: Proceedings of the Information Technology Applications in Biomedicine, IEEE EMBS International Conference (IEEE-EMBS '00)</conf-name>
<conf-date>November 2000</conf-date>
<conf-loc>Arlington, Va, USA</conf-loc>
<fpage>158</fpage>
<lpage>163</lpage>
</element-citation>
</ref>
<ref id="B33"><label>7</label>
<element-citation publication-type="other"><comment>T@LEMED Project web site: <ext-link ext-link-type="uri" xlink:href="http://www.alis-telemed.net/">http://www.alis-telemed.net/</ext-link>
</comment>
</element-citation>
</ref>
<ref id="B6"><label>8</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Sherouse</surname>
<given-names>G</given-names>
</name>
<name><surname>Mosher</surname>
<given-names>C</given-names>
</name>
<name><surname>Novins</surname>
<given-names>K</given-names>
</name>
<name><surname>Rosemann</surname>
<given-names>J</given-names>
</name>
<name><surname>Chaney</surname>
<given-names>EL</given-names>
</name>
</person-group>
<article-title>Virtual simulation: concept and implementation</article-title>
<conf-name>In: Proceedings of the 9th International Conference of the Use of Computers in Radiation Therapy (ICCR '87)</conf-name>
<conf-date>1987</conf-date>
<conf-loc>Scheveningen, The Netherlands</conf-loc>
<publisher-name>North Holland Publishing</publisher-name>
<fpage>433</fpage>
<lpage>436</lpage>
</element-citation>
</ref>
<ref id="B7"><label>9</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Nagata</surname>
<given-names>Y</given-names>
</name>
<name><surname>Nishidai</surname>
<given-names>T</given-names>
</name>
<name><surname>Abe</surname>
<given-names>M</given-names>
</name>
<etal></etal>
</person-group>
<article-title>CT simulator: a new 3-D planning and simulating system for radiotherapy: part 2. Clinical application</article-title>
<source><italic>International Journal of Radiation Oncology Biology Physics</italic>
</source>
<year>1990</year>
<volume>18</volume>
<issue>3</issue>
<fpage>505</fpage>
<lpage>513</lpage>
</element-citation>
</ref>
<ref id="B8"><label>10</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Nishidai</surname>
<given-names>T</given-names>
</name>
<name><surname>Nagata</surname>
<given-names>Y</given-names>
</name>
<name><surname>Takahashi</surname>
<given-names>M</given-names>
</name>
<etal></etal>
</person-group>
<article-title>CT simulator: a new 3-D planning and simulating system for radiotherapy: part 1. Description of system</article-title>
<source><italic>International Journal of Radiation Oncology Biology Physics</italic>
</source>
<year>1990</year>
<volume>18</volume>
<issue>3</issue>
<fpage>499</fpage>
<lpage>504</lpage>
</element-citation>
</ref>
<ref id="B9"><label>11</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Rosenman</surname>
<given-names>J</given-names>
</name>
<name><surname>Sailer</surname>
<given-names>SL</given-names>
</name>
<name><surname>Sherouse</surname>
<given-names>GW</given-names>
</name>
<name><surname>Chaney</surname>
<given-names>EL</given-names>
</name>
<name><surname>Tepper</surname>
<given-names>JE</given-names>
</name>
</person-group>
<article-title>Virtual simulation: initial clinical results</article-title>
<source><italic>International Journal of Radiation Oncology Biology Physics</italic>
</source>
<year>1991</year>
<volume>20</volume>
<issue>4</issue>
<fpage>843</fpage>
<lpage>851</lpage>
</element-citation>
</ref>
<ref id="B10"><label>12</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sherouse</surname>
<given-names>GW</given-names>
</name>
<name><surname>Chaney</surname>
<given-names>EL</given-names>
</name>
</person-group>
<article-title>The portable virtual simulator</article-title>
<source><italic>International Journal of Radiation Oncology Biology Physics</italic>
</source>
<year>1991</year>
<volume>21</volume>
<issue>2</issue>
<fpage>475</fpage>
<lpage>482</lpage>
</element-citation>
</ref>
<ref id="B11"><label>13</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Perez</surname>
<given-names>CA</given-names>
</name>
<name><surname>Purdy</surname>
<given-names>JA</given-names>
</name>
<name><surname>Harms</surname>
<given-names>W</given-names>
</name>
<etal></etal>
</person-group>
<article-title>Design of a fully integrated three-dimensional computed tomography simulator and preliminary clinical evaluation</article-title>
<source><italic>International Journal of Radiation Oncology Biology Physics</italic>
</source>
<year>1994</year>
<volume>30</volume>
<issue>4</issue>
<fpage>887</fpage>
<lpage>897</lpage>
</element-citation>
</ref>
<ref id="B12"><label>14</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Butker</surname>
<given-names>EK</given-names>
</name>
<name><surname>Helton</surname>
<given-names>DJ</given-names>
</name>
<name><surname>Keller</surname>
<given-names>JW</given-names>
</name>
<name><surname>Hughes</surname>
<given-names>LL</given-names>
</name>
<name><surname>Crenshaw</surname>
<given-names>T</given-names>
</name>
<name><surname>Davis</surname>
<given-names>LW</given-names>
</name>
</person-group>
<article-title>A totally integrated simulation technique for three-field breast treatment using a CT simulator</article-title>
<source><italic>Medical Physics</italic>
</source>
<year>1996</year>
<volume>23</volume>
<issue>10</issue>
<fpage>1809</fpage>
<lpage>1814</lpage>
<pub-id pub-id-type="pmid">8946378</pub-id>
</element-citation>
</ref>
<ref id="B13"><label>15</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname>
<given-names>GTY</given-names>
</name>
<name><surname>Pelizzari</surname>
<given-names>CA</given-names>
</name>
<name><surname>Vijayakumar</surname>
<given-names>S</given-names>
</name>
</person-group>
<article-title>Imaging: the basis for effective therapy</article-title>
<source><italic>Frontiers of Radiation Therapy and Oncology</italic>
</source>
<year>1996</year>
<volume>29</volume>
<fpage>31</fpage>
<lpage>42</lpage>
<pub-id pub-id-type="pmid">8742886</pub-id>
</element-citation>
</ref>
<ref id="B14"><label>16</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Michalski</surname>
<given-names>JM</given-names>
</name>
<name><surname>Purdy</surname>
<given-names>JA</given-names>
</name>
<name><surname>Harms</surname>
<given-names>W</given-names>
</name>
<name><surname>Matthews</surname>
<given-names>JW</given-names>
</name>
</person-group>
<article-title>The CT-simulation 3-D treatment planning process</article-title>
<source><italic>Frontiers of Radiation Therapy and Oncology</italic>
</source>
<year>1996</year>
<volume>29</volume>
<fpage>43</fpage>
<lpage>56</lpage>
<pub-id pub-id-type="pmid">8742887</pub-id>
</element-citation>
</ref>
<ref id="B15"><label>17</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sakas</surname>
<given-names>G</given-names>
</name>
</person-group>
<article-title>Interactive volume rendering of large fields</article-title>
<source><italic>The Visual Computer</italic>
</source>
<year>1993</year>
<volume>9</volume>
<issue>8</issue>
<fpage>425</fpage>
<lpage>438</lpage>
</element-citation>
</ref>
<ref id="B16"><label>18</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Cai</surname>
<given-names>W</given-names>
</name>
</person-group>
<article-title>Transfer functions in DRR volume rendering</article-title>
<conf-name>In: Proceedings of the 13th International Congress and Exhibition, Computer Assisted Radiology and Surgery (CARS '99)</conf-name>
<conf-date>June 1999</conf-date>
<conf-loc>Paris, France</conf-loc>
<fpage>23</fpage>
<lpage>26</lpage>
</element-citation>
</ref>
<ref id="B17"><label>19</label>
<element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Karangelis</surname>
<given-names>G</given-names>
</name>
</person-group>
<source><italic>3D simulation of external beam radiotherapy</italic>
</source>
<year>2004</year>
<publisher-loc>Darmstadt, Germany</publisher-loc>
<publisher-name>University of Darmstadt</publisher-name>
<comment>Ph.D. thesis</comment>
</element-citation>
</ref>
<ref id="B19"><label>20</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Levoy</surname>
<given-names>M</given-names>
</name>
</person-group>
<article-title>Display of surfaces from volume data</article-title>
<source><italic>IEEE Computer Graphics and Applications</italic>
</source>
<year>1988</year>
<volume>8</volume>
<issue>3</issue>
<fpage>29</fpage>
<lpage>37</lpage>
</element-citation>
</ref>
<ref id="B18"><label>21</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Max</surname>
<given-names>N</given-names>
</name>
</person-group>
<article-title>Optical models for direct volume rendering</article-title>
<source><italic>IEEE Transactions on Visualization and Computer Graphics</italic>
</source>
<year>1995</year>
<volume>1</volume>
<issue>2</issue>
<fpage>99</fpage>
<lpage>108</lpage>
</element-citation>
</ref>
<ref id="B21"><label>22</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Haralick</surname>
<given-names>RM</given-names>
</name>
<name><surname>Shapiro</surname>
<given-names>LG</given-names>
</name>
</person-group>
<article-title>Image segmentation techniques.</article-title>
<source><italic>Computer Vision, Graphics, & Image Processing</italic>
</source>
<year>1985</year>
<volume>29</volume>
<issue>1</issue>
<fpage>100</fpage>
<lpage>132</lpage>
</element-citation>
</ref>
<ref id="B22"><label>23</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Carlbom</surname>
<given-names>I</given-names>
</name>
<name><surname>Terzopoulos</surname>
<given-names>D</given-names>
</name>
<name><surname>Harris</surname>
<given-names>KM</given-names>
</name>
</person-group>
<article-title>Computer-assisted registration, segmentation, and 3D reconstruction from images of neuronal tissue section</article-title>
<source><italic>IEEE Transactions on Medical Imaging</italic>
</source>
<year>1994</year>
<volume>13</volume>
<issue>2</issue>
<fpage>351</fpage>
<lpage>362</lpage>
<pub-id pub-id-type="pmid">18218511</pub-id>
</element-citation>
</ref>
<ref id="B23"><label>24</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kuszyk</surname>
<given-names>BS</given-names>
</name>
<name><surname>Ney</surname>
<given-names>DR</given-names>
</name>
<name><surname>Fishman</surname>
<given-names>EK</given-names>
</name>
</person-group>
<article-title>The current state of the art in three dimensional oncologic imaging: an overview</article-title>
<source><italic>International Journal of Radiation Oncology Biology Physics</italic>
</source>
<year>1995</year>
<volume>33</volume>
<issue>5</issue>
<fpage>1029</fpage>
<lpage>1039</lpage>
</element-citation>
</ref>
<ref id="B24"><label>25</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Zimeras</surname>
<given-names>S</given-names>
</name>
<name><surname>Karangelis</surname>
<given-names>G</given-names>
</name>
</person-group>
<article-title>Semi-automatic segmentation techniques for CT medical data</article-title>
<conf-name>In: Proceedings of the 3rd caesarium Computer Aided Medicine</conf-name>
<conf-date>November, 2001</conf-date>
<conf-loc>Bonn, Germany</conf-loc>
</element-citation>
</ref>
<ref id="B25"><label>26</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Karangelis</surname>
<given-names>G</given-names>
</name>
<name><surname>Zimeras</surname>
<given-names>S</given-names>
</name>
<name><surname>Firle</surname>
<given-names>E</given-names>
</name>
<name><surname>Wang</surname>
<given-names>Min</given-names>
</name>
<name><surname>Sakas</surname>
<given-names>G</given-names>
</name>
</person-group>
<person-group person-group-type="editor"><name><surname>Viergever</surname>
<given-names>M-A</given-names>
</name>
<name><surname>Dohi</surname>
<given-names>T</given-names>
</name>
<name><surname>Vannier</surname>
<given-names>M</given-names>
</name>
</person-group>
<article-title>Volume definition tools for medical image applications</article-title>
<conf-name>In: Proceedings of the 4th MICCAI International Conference, vol. 2208</conf-name>
<conf-date>2001</conf-date>
<conf-loc>Utrecht, The Netherlands</conf-loc>
<publisher-name>Springer</publisher-name>
<fpage>1295</fpage>
<lpage>1297</lpage>
<comment><italic>Lecture Notes in Computer Sciences</italic>
.</comment>
</element-citation>
</ref>
<ref id="B26"><label>27</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Zimeras</surname>
<given-names>S</given-names>
</name>
<name><surname>Karangelis</surname>
<given-names>G</given-names>
</name>
</person-group>
<article-title>An efficient 3D shape reconstruction techniques for CT images using volume definition tools</article-title>
<conf-name>In: Proceedings of the ICCMSE, vol. 4</conf-name>
<conf-date>2005</conf-date>
<fpage>1532</fpage>
<lpage>1529</lpage>
<comment><italic>Lecture Series on Computer and Computational Sciences</italic>
.</comment>
</element-citation>
</ref>
<ref id="B27"><label>28</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Karangelis</surname>
<given-names>G</given-names>
</name>
<name><surname>Zimeras</surname>
<given-names>S</given-names>
</name>
</person-group>
<person-group person-group-type="editor"><name><surname>Meiler</surname>
<given-names>M</given-names>
</name>
<name><surname>Saupe</surname>
<given-names>D</given-names>
</name>
<name><surname>Kruggel</surname>
<given-names>F</given-names>
</name>
<name><surname>Handels</surname>
<given-names>H</given-names>
</name>
<name><surname>Lehmann</surname>
<given-names>TM</given-names>
</name>
</person-group>
<article-title>An accurate 3D segmentation method of the spinal canal applied on CT images</article-title>
<conf-name>In: Proceedings of the Bildverarbeitung für die Medizin (BVM '02)</conf-name>
<conf-date>2002</conf-date>
<conf-loc>Berlin, Germany</conf-loc>
<publisher-name>Springer</publisher-name>
<fpage>366</fpage>
<lpage>369</lpage>
</element-citation>
</ref>
<ref id="B28"><label>29</label>
<element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Karangelis</surname>
<given-names>G</given-names>
</name>
<name><surname>Zimeras</surname>
<given-names>S</given-names>
</name>
</person-group>
<article-title>3D segmentation method of the spinal cord applied on CT data</article-title>
<source><italic>Computer Graphics Topics</italic>
</source>
<year>2002</year>
<volume>14</volume>
<fpage>28</fpage>
<lpage>29</lpage>
</element-citation>
</ref>
<ref id="B29"><label>30</label>
<element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Wolberg</surname>
<given-names>G</given-names>
</name>
</person-group>
<source><italic>Digital Image Warping</italic>
</source>
<year>1990</year>
<edition>1st edition</edition>
<issue>chapter</issue>
<publisher-loc>New York, NY, USA</publisher-loc>
<publisher-name>Wiley-IEEE Press</publisher-name>
</element-citation>
</ref>
<ref id="B20"><label>31</label>
<element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Gonzales</surname>
<given-names>RC</given-names>
</name>
<name><surname>Woods</surname>
<given-names>RE</given-names>
</name>
</person-group>
<source><italic>Digital Image Processing</italic>
</source>
<year>1992</year>
<publisher-loc>Boston, Mass, USA</publisher-loc>
<publisher-name>Addison-Wesley</publisher-name>
</element-citation>
</ref>
<ref id="B30"><label>32</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Karangelis</surname>
<given-names>G</given-names>
</name>
<name><surname>Zimeras</surname>
<given-names>S</given-names>
</name>
</person-group>
<article-title>Segmentation of anatomical structures using volume definition tools</article-title>
<conf-name>In: Proceedings of the European Computing Conference, vol. 27</conf-name>
<conf-date>September 2007</conf-date>
<conf-loc>Athens Greece</conf-loc>
<issue>7</issue>
<publisher-name>Springer</publisher-name>
<fpage>767</fpage>
<lpage>777</lpage>
<comment><italic>Lecture Notes in Computer Science</italic>
.</comment>
</element-citation>
</ref>
<ref id="B31"><label>33</label>
<element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Sachpazidis</surname>
<given-names>IA</given-names>
</name>
<name><surname>Ohl</surname>
<given-names>R</given-names>
</name>
<name><surname>Polanczyk</surname>
<given-names>CA</given-names>
</name>
<etal></etal>
</person-group>
<article-title>Applying telemedicine to remote and rural underserved regions in Brazil using eMedical consulting tool</article-title>
<conf-name>In: Proceedings of the 27th Annual International Conference of the Engineering in Medicine and Biology Society (IEEE-EMBS '05)</conf-name>
<conf-date>September 2005</conf-date>
<conf-loc>Shanghai, China</conf-loc>
<fpage>2191</fpage>
<lpage>2195</lpage>
</element-citation>
</ref>
</ref-list>
</back>
<floats-group><fig id="fig1" position="float"><label>Figure 1</label>
<caption><p>Online and offline telecollaboration.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.001"></graphic>
</fig>
<fig id="fig2" position="float"><label>Figure 2</label>
<caption><p>The six-window layout of the system. On the left side the slices windows, the middle lower window is the OEV, the lower right the Room View, and the upper right hosts the BEV [<xref ref-type="bibr" rid="B18">21</xref>
].</p>
</caption>
<graphic xlink:href="IJTA2012-713739.002"></graphic>
</fig>
<fig id="fig3" position="float"><label>Figure 3</label>
<caption><p>Simulation System.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.003"></graphic>
</fig>
<fig id="fig4" position="float"><label>Figure 4</label>
<caption><p>Current clinical routine for external beam treatment delivery [<xref ref-type="bibr" rid="B18">21</xref>
].</p>
</caption>
<graphic xlink:href="IJTA2012-713739.004"></graphic>
</fig>
<fig id="fig5" position="float"><label>Figure 5</label>
<caption><p>(a) Reconstruction of CT volume using DRR; (b) Reconstruction using direct volume surface using direct gradient volume estimation [<xref ref-type="bibr" rid="B18">21</xref>
, <xref ref-type="bibr" rid="B27">28</xref>
, <xref ref-type="bibr" rid="B31">33</xref>
].</p>
</caption>
<graphic xlink:href="IJTA2012-713739.005"></graphic>
</fig>
<fig id="fig6" position="float"><label>Figure 6</label>
<caption><p>On (a) the light field projection, delineated from the block shape. In (b) the 3D reconstruction of the beam and block object. On (c), the delineated virtual light field projection [<xref ref-type="bibr" rid="B18">21</xref>
].</p>
</caption>
<graphic xlink:href="IJTA2012-713739.006"></graphic>
</fig>
<fig id="fig7" position="float"><label>Figure 7</label>
<caption><p>On the left side a simple case where an interpolated contour is created from the plane intersection with the triangles [<xref ref-type="bibr" rid="B31">33</xref>
].</p>
</caption>
<graphic xlink:href="IJTA2012-713739.007"></graphic>
</fig>
<fig id="fig8" position="float"><label>Figure 8</label>
<caption><p>Contour samples defined according to trachea and bronchus shape. 3D segmentation and linear and bisection interpolation using surface rendering technique.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.008"></graphic>
</fig>
<fig id="fig9" position="float"><label>Figure 9</label>
<caption><p>(a) Boundary tracking method. (b) Contour filtering.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.009"></graphic>
</fig>
<fig id="fig10" position="float"><label>Figure 10</label>
<caption><p>Moving position process (outside position).</p>
</caption>
<graphic xlink:href="IJTA2012-713739.010"></graphic>
</fig>
<fig id="fig11" position="float"><label>Figure 11</label>
<caption><p>Moving position process (inside position).</p>
</caption>
<graphic xlink:href="IJTA2012-713739.011"></graphic>
</fig>
<fig id="fig12" position="float"><label>Figure 12</label>
<caption><p>Slice interpolation.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.012"></graphic>
</fig>
<fig id="fig13" position="float"><label>Figure 13</label>
<caption><p>The geometry of a unit cube with the data points lying on the edges and the interpolated value in position (<italic>x</italic>
, <italic>y</italic>
, <italic>z</italic>
).</p>
</caption>
<graphic xlink:href="IJTA2012-713739.013"></graphic>
</fig>
<fig id="fig14" position="float"><label>Figure 14</label>
<caption><p>Segmentation of different anatomical structures. (a) 2D segmentation of the left and right lung; (b) 3D segmentation of the left and right lung; (c) 3D segmentation of the lungs, spine, and tumor.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.014"></graphic>
</fig>
<fig id="fig15" position="float"><label>Figure 15</label>
<caption><p>3D beam object reconstructed with patient's CT data. Green object: tumour.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.015"></graphic>
</fig>
<fig id="fig16" position="float"><label>Figure 16</label>
<caption><p>(a) Transformation of the reconstructed images under the telemedical platform. (b) Receiving process of the segmented medical images.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.016"></graphic>
</fig>
<fig id="fig17" position="float"><label>Figure 17</label>
<caption><p>The system memory cost in the loaded CT slices.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.017"></graphic>
</fig>
<fig id="fig18" position="float"><label>Figure 18</label>
<caption><p>Phantom used for system verification. From (a)–(c) phantom photo, its CT scan, and its 3D surface reconstruction.</p>
</caption>
<graphic xlink:href="IJTA2012-713739.018"></graphic>
</fig>
<fig id="alg1" position="float"><label>Algorithm 1</label>
<graphic xlink:href="IJTA2012-713739.alg.001"></graphic>
</fig>
<table-wrap id="tab1" position="float"><label>Table 1</label>
<caption><p>Performance of the segmentation methods for various slices. M: manual; B: boundary tracking; D: boundary tracking after decimation.</p>
</caption>
<table frame="hsides" rules="groups"><thead><tr><th align="left" rowspan="1" colspan="1"></th>
<th align="center" colspan="3" rowspan="1"> Area</th>
<th align="center" colspan="3" rowspan="1"> Periphery</th>
<th align="center" colspan="3" rowspan="1"><italic>≈</italic>
Time (sec)</th>
<th align="center" colspan="3" rowspan="1"> Points</th>
</tr>
<tr><th align="left" rowspan="1" colspan="1">Slices</th>
<th align="center" rowspan="1" colspan="1">M.</th>
<th align="center" rowspan="1" colspan="1">B.</th>
<th align="center" rowspan="1" colspan="1">D.</th>
<th align="center" rowspan="1" colspan="1">M.</th>
<th align="center" rowspan="1" colspan="1">B.</th>
<th align="center" rowspan="1" colspan="1">D.</th>
<th align="center" rowspan="1" colspan="1">M.</th>
<th align="center" rowspan="1" colspan="1">B.</th>
<th align="center" rowspan="1" colspan="1">D.</th>
<th align="center" rowspan="1" colspan="1">M.</th>
<th align="center" rowspan="1" colspan="1">B.</th>
<th align="center" rowspan="1" colspan="1">D.</th>
</tr>
</thead>
<tbody><tr><td align="left" rowspan="1" colspan="1">22</td>
<td align="center" rowspan="1" colspan="1">37.6</td>
<td align="center" rowspan="1" colspan="1">37.5</td>
<td align="center" rowspan="1" colspan="1">32.2</td>
<td align="center" rowspan="1" colspan="1">41.6</td>
<td align="center" rowspan="1" colspan="1">55.7</td>
<td align="center" rowspan="1" colspan="1">50.1</td>
<td align="center" rowspan="1" colspan="1">40</td>
<td align="center" rowspan="1" colspan="1">5</td>
<td align="center" rowspan="1" colspan="1">2</td>
<td align="center" rowspan="1" colspan="1">600</td>
<td align="center" rowspan="1" colspan="1">530</td>
<td align="center" rowspan="1" colspan="1">424</td>
</tr>
<tr><td align="left" rowspan="1" colspan="1">42</td>
<td align="center" rowspan="1" colspan="1">72.4</td>
<td align="center" rowspan="1" colspan="1">70.2</td>
<td align="center" rowspan="1" colspan="1">68.1</td>
<td align="center" rowspan="1" colspan="1">52.4</td>
<td align="center" rowspan="1" colspan="1">61.5</td>
<td align="center" rowspan="1" colspan="1">62.3</td>
<td align="center" rowspan="1" colspan="1">60</td>
<td align="center" rowspan="1" colspan="1">5</td>
<td align="center" rowspan="1" colspan="1">2</td>
<td align="center" rowspan="1" colspan="1">850</td>
<td align="center" rowspan="1" colspan="1">712</td>
<td align="center" rowspan="1" colspan="1">569</td>
</tr>
<tr><td align="left" rowspan="1" colspan="1">62</td>
<td align="center" rowspan="1" colspan="1">59</td>
<td align="center" rowspan="1" colspan="1">56</td>
<td align="center" rowspan="1" colspan="1">52.8</td>
<td align="center" rowspan="1" colspan="1">30.8</td>
<td align="center" rowspan="1" colspan="1">40.8</td>
<td align="center" rowspan="1" colspan="1">38.9</td>
<td align="center" rowspan="1" colspan="1">40</td>
<td align="center" rowspan="1" colspan="1">5</td>
<td align="center" rowspan="1" colspan="1">2</td>
<td align="center" rowspan="1" colspan="1">540</td>
<td align="center" rowspan="1" colspan="1">418</td>
<td align="center" rowspan="1" colspan="1">334</td>
</tr>
</tbody>
</table>
</table-wrap>
</floats-group>
</pmc>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Pmc/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000466 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Pmc/Corpus/biblio.hfd -nk 000466 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= TelematiV1 |flux= Pmc |étape= Corpus |type= RBID |clé= |texte= }}
![]() | This area was generated with Dilib version V0.6.31. | ![]() |