2,331 research outputs found

    Advanced Algorithms for 3D Medical Image Data Fusion in Specific Medical Problems

    Get PDF
    FĂșze obrazu je dnes jednou z nejbÄ›ĆŸnějĆĄĂ­ch avĆĄak stĂĄle velmi diskutovanou oblastĂ­ v lĂ©kaƙskĂ©m zobrazovĂĄnĂ­ a hraje dĆŻleĆŸitou roli ve vĆĄech oblastech lĂ©kaƙskĂ© pĂ©Äe jako je diagnĂłza, lĂ©Äba a chirurgie. V tĂ©to dizertačnĂ­ prĂĄci jsou pƙedstaveny tƙi projekty, kterĂ© jsou velmi Ășzce spojeny s oblastĂ­ fĂșze medicĂ­nskĂœch dat. PrvnĂ­ projekt pojednĂĄvĂĄ o 3D CT subtrakčnĂ­ angiografii dolnĂ­ch končetin. V prĂĄci je vyuĆŸito kombinace kontrastnĂ­ch a nekontrastnĂ­ch dat pro zĂ­skĂĄnĂ­ kompletnĂ­ho cĂ©vnĂ­ho stromu. DruhĂœ projekt se zabĂœvĂĄ fĂșzĂ­ DTI a T1 vĂĄhovanĂœch MRI dat mozku. CĂ­lem tohoto projektu je zkombinovat stukturĂĄlnĂ­ a funkčnĂ­ informace, kterĂ© umoĆŸĆˆujĂ­ zlepĆĄit znalosti konektivity v mozkovĂ© tkĂĄni. TƙetĂ­ projekt se zabĂœvĂĄ metastĂĄzemi v CT časovĂœch datech pĂĄteƙe. Tento projekt je zaměƙen na studium vĂœvoje metastĂĄz uvnitƙ obratlĆŻ ve fĂșzovanĂ© časovĂ© ƙadě snĂ­mkĆŻ. Tato dizertačnĂ­ prĂĄce pƙedstavuje novou metodologii pro klasifikaci těchto metastĂĄz. VĆĄechny projekty zmĂ­něnĂ© v tĂ©to dizertačnĂ­ prĂĄci byly ƙeĆĄeny v rĂĄmci pracovnĂ­ skupiny zabĂœvajĂ­cĂ­ se analĂœzou lĂ©kaƙskĂœch dat, kterou vedl pan Prof. Jiƙí Jan. Tato dizertačnĂ­ prĂĄce obsahuje registračnĂ­ část prvnĂ­ho a klasifikačnĂ­ část tƙetĂ­ho projektu. DruhĂœ projekt je pƙedstaven kompletně. DalĆĄĂ­ část prvnĂ­ho a tƙetĂ­ho projektu, obsahujĂ­cĂ­ specifickĂ© pƙedzpracovĂĄnĂ­ dat, jsou obsaĆŸeny v disertačnĂ­ prĂĄci mĂ©ho kolegy Ing. Romana Petera.Image fusion is one of todayÂŽs most common and still challenging tasks in medical imaging and it plays crucial role in all areas of medical care such as diagnosis, treatment and surgery. Three projects crucially dependent on image fusion are introduced in this thesis. The first project deals with the 3D CT subtraction angiography of lower limbs. It combines pre-contrast and contrast enhanced data to extract the blood vessel tree. The second project fuses the DTI and T1-weighted MRI brain data. The aim of this project is to combine the brain structural and functional information that purvey improved knowledge about intrinsic brain connectivity. The third project deals with the time series of CT spine data where the metastases occur. In this project the progression of metastases within the vertebrae is studied based on fusion of the successive elements of the image series. This thesis introduces new methodology of classifying metastatic tissue. All the projects mentioned in this thesis have been solved by the medical image analysis group led by Prof. Jiƙí Jan. This dissertation concerns primarily the registration part of the first project and the classification part of the third project. The second project is described completely. The other parts of the first and third project, including the specific preprocessing of the data, are introduced in detail in the dissertation thesis of my colleague Roman Peter, M.Sc.

    3D time series analysis of cell shape using Laplacian approaches

    Get PDF
    Background: Fundamental cellular processes such as cell movement, division or food uptake critically depend on cells being able to change shape. Fast acquisition of three-dimensional image time series has now become possible, but we lack efficient tools for analysing shape deformations in order to understand the real three-dimensional nature of shape changes. Results: We present a framework for 3D+time cell shape analysis. The main contribution is three-fold: First, we develop a fast, automatic random walker method for cell segmentation. Second, a novel topology fixing method is proposed to fix segmented binary volumes without spherical topology. Third, we show that algorithms used for each individual step of the analysis pipeline (cell segmentation, topology fixing, spherical parameterization, and shape representation) are closely related to the Laplacian operator. The framework is applied to the shape analysis of neutrophil cells. Conclusions: The method we propose for cell segmentation is faster than the traditional random walker method or the level set method, and performs better on 3D time-series of neutrophil cells, which are comparatively noisy as stacks have to be acquired fast enough to account for cell motion. Our method for topology fixing outperforms the tools provided by SPHARM-MAT and SPHARM-PDM in terms of their successful fixing rates. The different tasks in the presented pipeline for 3D+time shape analysis of cells can be solved using Laplacian approaches, opening the possibility of eventually combining individual steps in order to speed up computations

    Reconstruction and restoration of PET images

    Get PDF

    Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14)

    Get PDF
    The implicit objective of the biennial "international - Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST) is to foster collaboration between international scientific teams by disseminating ideas through both specific oral/poster presentations and free discussions. For its second edition, the iTWIST workshop took place in the medieval and picturesque town of Namur in Belgium, from Wednesday August 27th till Friday August 29th, 2014. The workshop was conveniently located in "The Arsenal" building within walking distance of both hotels and town center. iTWIST'14 has gathered about 70 international participants and has featured 9 invited talks, 10 oral presentations, and 14 posters on the following themes, all related to the theory, application and generalization of the "sparsity paradigm": Sparsity-driven data sensing and processing; Union of low dimensional subspaces; Beyond linear and convex inverse problem; Matrix/manifold/graph sensing/processing; Blind inverse problems and dictionary learning; Sparsity and computational neuroscience; Information theory, geometry and randomness; Complexity/accuracy tradeoffs in numerical methods; Sparsity? What's next?; Sparse machine learning and inference.Comment: 69 pages, 24 extended abstracts, iTWIST'14 website: http://sites.google.com/site/itwist1

    Image Processing Algorithms for Detection of Anomalies in Orthopedic Surgery Implants

    Get PDF
    Orthopedic implant procedures for hip implants are performed on 300,000 patients annually in the United States, with 22.3 million procedures worldwide. While most such operations are successfully performed to relieve pain and restore joint function for the duration of the patient\u27s life, advances in medicine have enabled patients to outlive the life of their implant, increasing the likelihood of implant failure. There is significant advantage to the patient, the surgeon, and the medical community in early detection of implant failures.The research work presented in this thesis demonstrates a non-invasive digital image processing technique for the automated detection of specific arthroplasty failures before requiring revision surgery. This thesis studies hip implant loosening as the primary cause of failure. A combination of digital image segmentation, representation and numerical description is employed and validated on 2-D X-ray images of hip implant phantoms to detect 3-D rotations of the implant, with the support of radial basis function neural networks to accomplish this task. A successful clinical implementation of the methods developed in this thesis can eliminate the need for revision surgery and prolong the life of the orthopedic implant

    Spatio-temporal wavelet regularization for parallel MRI reconstruction: application to functional MRI

    Get PDF
    Parallel MRI is a fast imaging technique that enables the acquisition of highly resolved images in space or/and in time. The performance of parallel imaging strongly depends on the reconstruction algorithm, which can proceed either in the original k-space (GRAPPA, SMASH) or in the image domain (SENSE-like methods). To improve the performance of the widely used SENSE algorithm, 2D- or slice-specific regularization in the wavelet domain has been deeply investigated. In this paper, we extend this approach using 3D-wavelet representations in order to handle all slices together and address reconstruction artifacts which propagate across adjacent slices. The gain induced by such extension (3D-Unconstrained Wavelet Regularized -SENSE: 3D-UWR-SENSE) is validated on anatomical image reconstruction where no temporal acquisition is considered. Another important extension accounts for temporal correlations that exist between successive scans in functional MRI (fMRI). In addition to the case of 2D+t acquisition schemes addressed by some other methods like kt-FOCUSS, our approach allows us to deal with 3D+t acquisition schemes which are widely used in neuroimaging. The resulting 3D-UWR-SENSE and 4D-UWR-SENSE reconstruction schemes are fully unsupervised in the sense that all regularization parameters are estimated in the maximum likelihood sense on a reference scan. The gain induced by such extensions is illustrated on both anatomical and functional image reconstruction, and also measured in terms of statistical sensitivity for the 4D-UWR-SENSE approach during a fast event-related fMRI protocol. Our 4D-UWR-SENSE algorithm outperforms the SENSE reconstruction at the subject and group levels (15 subjects) for different contrasts of interest (eg, motor or computation tasks) and using different parallel acceleration factors (R=2 and R=4) on 2x2x3mm3 EPI images.Comment: arXiv admin note: substantial text overlap with arXiv:1103.353

    Efficient implementations of machine vision algorithms using a dynamically typed programming language

    Get PDF
    Current machine vision systems (or at least their performance critical parts) are predominantly implemented using statically typed programming languages such as C, C++, or Java. Statically typed languages however are unsuitable for development and maintenance of large scale systems. When choosing a programming language, dynamically typed languages are usually not considered due to their lack of support for high-performance array operations. This thesis presents efficient implementations of machine vision algorithms with the (dynamically typed) Ruby programming language. The Ruby programming language was used, because it has the best support for meta-programming among the currently popular programming languages. Although the Ruby programming language was used, the approach presented in this thesis could be applied to any programming language which has equal or stronger support for meta-programming (e.g. Racket (former PLT Scheme)). A Ruby library for performing I/O and array operations was developed as part of this thesis. It is demonstrated how the library facilitates concise implementations of machine vision algorithms commonly used in industrial automation. I.e. this thesis is about a different way of implementing machine vision systems. The work could be applied to prototype and in some cases implement machine vision systems in industrial automation and robotics. The development of real-time machine vision software is facilitated as follows 1. A JIT compiler is used to achieve real-time performance. It is demonstrated that the Ruby syntax is sufficient to integrate the JIT compiler transparently. 2. Various I/O devices are integrated for seamless acquisition, display, and storage of video and audio data. In combination these two developments preserve the expressiveness of the Ruby programming language while providing good run-time performance of the resulting implementation. To validate this approach, the performance of different operations is compared with the performance of equivalent C/C++ programs
    • 

    corecore