@inbook {914, title = {Techniques of Virtual Dissection of the Colon Based on Spiral CT Data}, booktitle = {Image Processing in Radiology}, year = {2008}, note = {doi: 10.1007/978-3-540-49830-8_18}, month = {2008}, pages = {257 - 268}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, type = {Book chapter}, address = {Berlin}, abstract = {

Colorectal cancer represents the third most commonly diagnosedcancer and is the second leading cause of cancer deaths in the United States (Gazelle et al. 2000). In addition, colorectal cancer is responsible for about 11\% of all new cancer cases per year (Gazelle et al. 2000). Five-year prognosis is about 90\% for patients with localized disease compared to 60\% if there is a regional spread and a drop to 10\% in patients with distant metastasis (Gazelle et al. 2000). In the field of medicine there is a widely accepted opinion that most colorectal cancers arise from pre-existent adenomatous polyps (Johnson 2000). Therefore, different societies, such as the American Cancer Society, have proposed screening for colorectal cancer (Byers et al. 1997; Winawer et al. 1997). Today, different options exist for detection of colorectal cancer, including digital rectal examination, fecal occult blood testing, flexible and rigid sigmoidoscopy, barium enema and its variants, colonoscopy and recently computed tomography or magnetic resonance-based virtual colonography (Gazelle et al. 2000).

}, doi = {10.1007/978-3-540-49830-8_18}, author = {Erich Sorantin and Emese Balogh and Anna Vilanova Bartroli and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Franz Lindbichler and Andrea Ruppert}, editor = {Emanuele Neri and Davide Caramella and Carlo Bartolozzi} } @conference {977, title = {Sz{\'a}m{\'\i}t{\'o}g{\'e}pes k{\'e}pfeldolgoz{\'a}s oktat{\'a}sa a Szegedi Tudom{\'a}nyegyetemen}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2004}, year = {2004}, month = {Jan 2004}, pages = {191 - 196}, publisher = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, organization = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, address = {Miskolc}, abstract = {

Az SZTE Informatikai Tansz{\'e}kcsoportja {\'a}ltal gondozott szakoktanterveiben 1993 {\'o}ta szerepel a k{\'e}pfeldolgoz{\'a}s {\'e}s alkalmaz{\'a}sainak oktat{\'a}sa. A kreditrendszer bevezet{\'e}s{\'e}vel a K{\'e}pfeldolgoz{\'a}s I. t{\'a}rgy k{\"o}telez{\H o} az {\"o}t{\'e}ves k{\'e}pz{\'e}sben r{\'e}szt vev{\H o} informatikus hallgat{\'o}knak. Ezen fel{\"u}l a v{\'a}laszthat{\'o} szakir{\'a}nyok k{\"o}z{\"o}tt szint{\'e}n szerepel a K{\'e}pfeldolgoz{\'a}s szakir{\'a}ny. A szakir{\'a}nyon bel{\"u}l k{\"u}l{\"o}nb{\"o}z{\H o} k{\'e}ppfeldolgoz{\'a}si ter{\"u}leteket t{\'a}rgyal{\'o} kurzusok {\'e}p{\"u}lnek egym{\'a}sra. Az elm{\'e}leti megalapoz{\'a}s mellett a k{\'e}pfeldolgoz{\'a}s alkalmaz{\'a}saira is nagy hangs{\'u}lyt fektet{\"u}nk. A kutat{\'a}sok illetve az orvosi alkalmaz{\'a}sok fejleszt{\'e}se sor{\'a}n szerzett eredm{\'e}nyeket a k{\"o}telez{\H o} jelleg{\H u} t{\'a}rgyak mellett speci{\'a}lkoll{\'e}giumok keret{\'e}ben {\'e}p{\'\i}tj{\"u}l be az otkat{\'a}si anyagba. Sz{\'a}mos hallgat{\'o}nk v{\'a}laszt a k{\'e}pfeldolgz{\'a}s ter{\"u}let{\'e}r{\H o}l t{\'e}m{\'a}t a diplomamunk{\'a}j{\'a}hoz, dolgozataikkal rendszeresen {\'e}s sikerrel szerepelnek az OTDK-n. Hallgat{\'o}ink {\'e}vente t{\"o}bb h{\'o}napot t{\"o}lthetnek k{\"u}lf{\"o}ldi partneregyetemeinken, ahol a kutat{\'o}- {\'e}s fejleszt{\H o}munka mellett n{\'a}lunk is elfogadott kurzusokat teljes{\'\i}thetnek. A k{\'e}pfeldolgoz{\'a}s t{\'e}mak{\"o}r{\"o}n bel{\"u}l "ipari" projekt munk{\'a}kban is egyre t{\"o}bb hallgat{\'o} vesz r{\'e}szt. A doktori programon bel{\"u}l is meghirdet{\"u}nk k{\'e}pfeldolgoz{\'a}shoz kapcsol{\'o}d{\'o} kutat{\'a}si ir{\'a}nyokat. Az {\'e}vente megrendez{\'e}sre ker{\"u}l{\H o}, 11-{\'e}ves m{\'u}ltra visszatekint{\H o} K{\'e}pfeldolgoz{\'o} Ny{\'a}ri Iskol{\'a}nak (SSIP) eddig hatszor adott otthont Szeged. A rendszv{\'e}nysorozat kiemelked{\H o} fontoss{\'a}g{\'u} nemzetk{\"o}zi f{\'o}rum hallgat{\'o}ink {\'e}s oktat{\'o}ink sz{\'a}m{\'a}ra is.

} } @conference {1874, title = {Composition of Radiography Pictures of Whole Helicopter Rotor Blades in Hungary}, booktitle = {7th World Conference on Neutron Radiography (WCNR)}, year = {2002}, month = {2002}, pages = {637-642}, type = {Conference paper}, author = {M{\'a}rton Balask{\'o} and Zolt{\'a}n Balask{\'o} and Emese Balogh and Attila Tanacs and Endre Katona and Attila Kuba} } @article {938, title = {Medical Image Processing, Surgical Planning, Image-Guided Therapy and Robotic Applications: Recent Developments for Radiology}, journal = {EUROPEAN RADIOLOGY}, volume = {12}, year = {2002}, note = {doi: 10.1007/s00330-002-0004-7}, month = {2002///}, pages = {504}, isbn = {0938-7994} } @article {Kuba2002, title = {Reconstruction of convex 2D discrete sets in polynomial time}, journal = {Theoretical Computer Science}, volume = {283}, year = {2002}, month = {June}, pages = {223-242}, abstract = {

The reconstruction problem is considered in those classes of discrete sets where the reconstruction can be performed from two projections in polynomial time. The reconstruction algorithms and complexity results are summarized in the case of hv-convex sets, hv-convex 8-connected sets, hv-convex polyominoes, and directed h-convex sets. As new results some properties of the feet and spines of the hv-convex 8-connected sets are proven and it is shown that the spine of such a set can be determined from the projections in linear time. Two algorithms are given to reconstruct hv-convex 8-connected sets. Finally, it is shown that the directed h-convex sets are uniquely reconstructible with respect to their row and column sum vectors.

}, doi = {10.1016/S0304-3975(01)00080-9}, author = {Attila Kuba and Emese Balogh} } @article {900, title = {Virtual dissection and automated polyp detection of the colon based on spiral CT - Techniques and preliminary experience on a cadaveric phantom}, journal = {EUROPEAN SURGERY - ACTA CHIRURGICA AUSTRIACA}, volume = {34}, year = {2002}, note = {ScopusID: 0037000327doi: 10.1046/j.1563-2563.2002.02018.x}, month = {2002///}, pages = {143 - 149}, abstract = {Background: CT colonography was found to be sensitive andspecific for detection of colonic polyps and colorectal cancer (CRC). Depending on the software used, CT colonography requires a certain amount of operator interaction, which limits it{\textquoteright}s widespread usage. The goal of this papers is to present two novel automated techniques for displaying CT colonography: virtual dissection and automated colonic polyp detection. Methods: Virtual dissection refers to a technique where the entire colon is virtually stretched and flattened thus simulating the view on the pathologist{\textquoteright}s table. Colonic folds show a {\textquoteright}global outward bulging of the contour{\textquoteright}, whereas colonic polyps exhibit the inverse ({\textquoteright}local inward bulging{\textquoteright}). This feature is used to map areas of {\textquoteright}local inward bulging{\textquoteright} with colours on 3D reconstructions. A cadaveric phantom with 13 artificially inserted polyps was used for validation of both techniques. Results: On virtual dissection all 13 inserted polyps could be identified. They appeared either as bumps or as local broadening of colonic folds. In addition, the automated colonic polyp detection algorithm was able to tag all polyps. Only 10 min of operator interaction were necessary for both techniques. Conclusions: Virtual dissection overcomes the shortcomings of CT colonography, and automated colonic polyp detection establishes a roadmap of the polyps. }, isbn = {1682-8631} } @inbook {901, title = {Virtual Dissection of the Colon}, booktitle = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k III. Konfereci{\'a}ja}, year = {2002}, month = {2002///}, pages = {109 - 117}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, address = {Szeged} } @inbook {899, title = {Virtual Dissection of the Colon}, booktitle = {3D Image Processing}, year = {2002}, note = {doi: 10.1007/978-3-642-59438-0_18}, month = {2002///}, pages = {197 - 209}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {New York} } @inbook {897, title = {Virtual dissection of the colon: technique and first experiments with artificial and cadaveric phantoms}, booktitle = {Medical Imaging 2002: Visualization, Image-Guided Procedures, and Display}, year = {2002}, note = {ScopusID: 0036061143doi: 10.1117/12.466982}, month = {2002///}, pages = {713 - 721}, publisher = {SPIE}, organization = {SPIE}, address = {Bellingham; Washington}, abstract = {Virtual dissection refers to a display technique for polypdetection, where the colon is digitally straightened and then flattened using multirow detector Computed Tomograph (CT) images. As compared to virtual colonoscopy where polyps may be hidden from view behind the folds, the unravelled colon is more suitable for polyp detection, because the entire inner surface of the colon is displayed in a single view. The method was tested both on artificial and cadaveric phantoms. All polyps could be recognized on both phantoms. This technique for virtual dissection requires only a minimum of operator interaction. } } @article {Balogh2001, title = {Comparison of algorithms for reconstructing hv-convex discrete sets}, journal = {Linear Algebra and its Applications}, volume = {339}, year = {2001}, month = {December}, pages = {23-35}, doi = {10.1016/S0024-3795(01)00430-X}, author = {Emese Balogh and Attila Kuba and Csaba Devenyi and Alberto Del Lungo} } @article {936, title = {A sequential 3D thinning algorithm and its medical applications}, journal = {LECTURE NOTES IN COMPUTER SCIENCE}, volume = {2082}, year = {2001}, note = {doi: 10.1007/3-540-45729-1_42}, month = {2001///}, pages = {409 - 415}, isbn = {0302-9743}, url = {http://www.springerlink.com/content/py49qu0e434n0n16} } @inbook {898, title = {Virtual Dissection of the Colon Based on Helical CT Data - Can It Be Done?}, booktitle = {Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis, ISPA 2001, Pula, Croatia}, year = {2001}, note = {doi: 10.1109/ISPA.2001.938632}, month = {2001///}, pages = {224 - 229}, publisher = {University of Zagreb}, organization = {University of Zagreb}, address = {Zagreb}, abstract = {Colorectal cancer is the third most commonly diagnosed cancer;and colonic polyps are known precursors of that particular cancer. Virtual dissection refers to a display technique for polyp detection based on helical CT data, where the colon is dissected and flattened as on the pathologist{\textquoteright}s table. The approach and image processing as well as the early experience are described in this paper. } }