SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Wang Chunliang) ;lar1:(uu)"

Sökning: WFRF:(Wang Chunliang) > Uppsala universitet

  • Resultat 1-10 av 10
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Bendazzoli, Simone, et al. (författare)
  • Automatic rat brain segmentation from MRI using statistical shape models and random forest
  • 2019
  • Ingår i: MEDICAL IMAGING 2019. - : SPIE-INT SOC OPTICAL ENGINEERING. - 9781510625464 - 9781510625457
  • Konferensbidrag (refereegranskat)abstract
    • In MRI neuroimaging, the shimming procedure is used before image acquisition to correct for inhomogeneity of the static magnetic field within the brain. To correctly adjust the field, the brain's location and edges must first be identified from quickly-acquired low resolution data. This process is currently carried out manually by an operator, which can be time-consuming and not always accurate. In this work, we implement a quick and automatic technique for brain segmentation to be potentially used during the shimming. Our method is based on two main steps. First, a random forest classifier is used to get a preliminary segmentation from an input MRI image. Subsequently, a statistical shape model of the brain, which was previously generated from ground-truth segmentations, is fitted to the output of the classifier to obtain a model-based segmentation mask. In this way, a-priori knowledge on the brain's shape is included in the segmentation pipeline. The proposed methodology was tested on low resolution images of rat brains and further validated on rabbit brain images of higher resolution. Our results suggest that the present method is promising for the desired purpose in terms of time efficiency, segmentation accuracy and repeatability. Moreover, the use of shape modeling was shown to be particularly useful when handling low-resolution data, which could lead to erroneous classifications when using only machine learning-based methods.
  •  
2.
  • Brusini, Irene, et al. (författare)
  • Changes in brain architecture are consistent with altered fear processing in domestic rabbits
  • 2018
  • Ingår i: Proceedings of the National Academy of Sciences of the United States of America. - : National Academy of Sciences. - 0027-8424 .- 1091-6490. ; 115:28, s. 7380-7385
  • Tidskriftsartikel (refereegranskat)abstract
    • The most characteristic feature of domestic animals is their change in behavior associated with selection for tameness. Here we show, using high-resolution brain magnetic resonance imaging in wild and domestic rabbits, that domestication reduced amygdala volume and enlarged medial prefrontal cortex volume, supporting that areas driving fear have lost volume while areas modulating negative affect have gained volume during domestication. In contrast to the localized gray matter alterations, white matter anisotropy was reduced in the corona radiata, corpus callosum, and the subcortical white matter. This suggests a compromised white matter structural integrity in projection and association fibers affecting both afferent and efferent neural flow, consistent with reduced neural processing. We propose that compared with their wild ancestors, domestic rabbits are less fearful and have an attenuated flight response because of these changes in brain architecture.
  •  
3.
  • Brusini, Irene, et al. (författare)
  • Fully automatic estimation of the waist of the nerve fiber layer at the optic nerve head angularly resolved
  • 2021
  • Ingår i: Progress in Biomedical Optics and Imaging - Proceedings of SPIE. - : SPIE-Intl Soc Optical Eng. ; , s. 1D1-1D8
  • Konferensbidrag (refereegranskat)abstract
    • The present project aims at developing a fully automatic software for estimation of the waist of the nerve fiber layer in the Optic Nerve Head (ONH) angularly resolved in the frontal plane as a tool for morphometric monitoring of glaucoma. The waist of the nerve fiber layer is here defined as Pigment epithelium central limit –Inner limit of the retina – Minimal Distance, (PIMD). 3D representations of the ONH were collected with high resolution OCT in young not glaucomatous eyes and glaucomatous eyes. An improved tool for manual annotation was developed in Python. This tool was found user friendly and to provide sufficiently precise manual annotation. PIMD was automatically estimated with a software consisting of one AI model for detection of the inner limit of the retina and another AI model for localization of the Optic nerve head Pigment epithelium Central limit (OPCL). In the current project, the AI model for OPCL localization was retrained with new data manually annotated with the improved tool for manual annotation both in not glaucomatous eyes and in glaucomatous eyes. Finally, automatic annotations were compared to 3 annotations made by 3 independent annotators in an independent subset of both the not glaucomatous and the glaucomatous eyes. It was found that the fully automatic estimation of PIMD-angle overlapped the 3 manual annotators with small variation among the manual annotators. Considering interobserver variation, the improved tool for manual annotation provided less variation than our original annotation tool in not glaucomatous eyes suggesting that variation in glaucomatous eyes is due to variable pathological anatomy, difficult to annotate without error. The small relative variation in relation to the substantial overall loss of PIMD in the glaucomatous eyes compared to the not glaucomatous eyes suggests that our software for fully automatic estimation of PIMD-angle can now be implemented clinically for monitoring of glaucoma progression.
  •  
4.
  •  
5.
  • Kisonaite, Konstancija, et al. (författare)
  • Automatic estimation of the cross-sectional area of the waist of the nerve fiber layer at the optic nerve head
  • 2023
  • Ingår i: Acta Ophthalmologica. - : John Wiley & Sons. - 1755-375X .- 1755-3768.
  • Tidskriftsartikel (refereegranskat)abstract
    • PurposeGlaucoma leads to pathological loss of axons in the retinal nerve fibre layer at the optic nerve head (ONH). This study aimed to develop a strategy for the estimation of the cross-sectional area of the axons in the ONH. Furthermore, improving the estimation of the thickness of the nerve fibre layer, as compared to a method previously published by us.MethodsIn the 3D-OCT image of the ONH, the central limit of the pigment epithelium and the inner limit of the retina, respectively, were identified with deep learning algorithms. The minimal distance was estimated at equidistant angles around the circumference of the ONH. The cross-sectional area was estimated by the computational algorithm. The computational algorithm was applied on 16 non-glaucomatous subjects.ResultsThe mean cross-sectional area of the waist of the nerve fibre layer in the ONH was 1.97 ± 0.19 mm2. The mean difference in minimal thickness of the waist of the nerve fibre layer between our previous and the current strategies was estimated as CIμ (0.95) 0 ± 1 μm (d.f. = 15).ConclusionsThe developed algorithm demonstrated an undulating cross-sectional area of the nerve fibre layer at the ONH. Compared to studies using radial scans, our algorithm resulted in slightly higher values for cross-sectional area, taking the undulations of the nerve fibre layer at the ONH into account. The new algorithm for estimation of the thickness of the waist of the nerve fibre layer in the ONH yielded estimates of the same order as our previous algorithm.
  •  
6.
  • Kisonaite, Konstancija, et al. (författare)
  • Estimation of the cross-sectional surface area of the waist of the nerve fiber layer at the optic nerve head
  • 2022
  • Ingår i: Progress in Biomedical Optics and Imaging. - : SPIE-Intl Soc Optical Eng.
  • Konferensbidrag (refereegranskat)abstract
    • Glaucoma is a global disease that leads to blindness due to pathological loss of retinal ganglion cell axons in the optic nerve head (ONH). The presented project aims at improving a computational algorithm for estimating the thickness and surface area of the waist of the nerve fiber layer in the ONH. Our currently developed deep learning AI algorithm meets the need for a morphometric parameter that detects glaucomatous change earlier than current clinical follow-up methods. In 3D OCT image volumes, two different AI algorithms identify the Optic nerve head Pigment epithelium Central Limit (OPCL) and the Inner limit of the Retina Closest Point (IRCP) in a 3D grid. Our computational algorithm includes the undulating surface area of the waist of the ONH, as well as waist thickness. In 16 eyes of 16 non-glaucomatous subjects aged [20;30] years, the mean difference in minimal thickness of the waist of the nerve fiber layer between our previous and the current post-processing strategies was estimated as CIμ(0.95) 0 ±1 μm (D.f. 15). The mean surface area of the waist of the nerve fiber layer in the optic nerve head was 1.97 ± 0.19 mm2. Our computational algorithm results in slightly higher values for surface areas compared to published work, but as expected, this may be due to surface undulations of the waist being considered. Estimates of the thickness of the waist of the ONH yields estimates of the same order as our previous computational algorithm.
  •  
7.
  • Lidayová, Kristína, et al. (författare)
  • Coverage segmentation of 3D thin structures
  • 2015
  • Ingår i: Image Processing Theory, Tools and Applications (IPTA), 2015 International Conference on. - Piscataway, NJ : IEEE conference proceedings. - 9781479986361 ; , s. 23-28
  • Konferensbidrag (refereegranskat)abstract
    • We present a coverage segmentation method for extracting thin structures in three-dimensional images. The proposed method is an improved extension of our coverage segmentation method for 2D thin structures. We suggest implementation that enables low memory consumption and processing time, and by that applicability of the method on real CTA data. The method needs a reliable crisp segmentation as an input and uses information from linear unmixing and the crisp segmentation to create a high-resolution crisp reconstruction of the object, which can then be used as a final result, or down-sampled to a coverage segmentation at the starting image resolution. Performed quantitative and qualitative analysis confirm excellent performance of the proposed method, both on synthetic and on real data, in particular in terms of robustness to noise.
  •  
8.
  • Lidayová, Kristína, et al. (författare)
  • Fast vascular skeleton extraction algorithm
  • 2016
  • Ingår i: Pattern Recognition Letters. - : Elsevier. - 0167-8655 .- 1872-7344. ; 76, s. 67-75
  • Tidskriftsartikel (refereegranskat)abstract
    • Vascular diseases are a common cause of death, particularly in developed countries. Computerized image analysis tools play a potentially important role in diagnosing and quantifying vascular pathologies. Given the size and complexity of modern angiographic data acquisition, fast, automatic and accurate vascular segmentation is a challenging task.In this paper we introduce a fully automatic high-speed vascular skeleton extraction algorithm that is intended as a first step in a complete vascular tree segmentation program. The method takes a 3D unprocessed Computed Tomography Angiography (CTA) scan as input and produces a graph in which the nodes are centrally located artery voxels and the edges represent connections between them. The algorithm works in two passes where the first pass is designed to extract the skeleton of large arteries and the second pass focuses on smaller vascular structures. Each pass consists of three main steps. The first step sets proper parameters automatically using Gaussian curve fitting. In the second step different filters are applied to detect voxels - nodes - that are part of arteries. In the last step the nodes are connected in order to obtain a continuous centerline tree for the entire vasculature. Structures found, that do not belong to the arteries, are removed in a final anatomy-based analysis. The proposed method is computationally efficient with an average execution time of 29s and has been tested on a set of CTA scans of the lower limbs achieving an average overlap rate of 97% and an average detection rate of 71%.
  •  
9.
  • Wang, Chunliang, 1980-, et al. (författare)
  • An interactive software module for visualizing coronary arteries in CT angiography
  • 2008
  • Ingår i: International Journal of Computer Assisted Radiology and Surgery. - Heidelberg/Berlin : Springer. - 1861-6410 .- 1861-6429. ; 3:1-2, s. 11-18
  • Tidskriftsartikel (refereegranskat)abstract
    • A new software module for coronary artery segmentation and visualization in CT angiography (CTA) datasets is presented, which aims to interactively segment coronary arteries and visualize them in 3D with maximum intensity projection (MIP) and volume rendering (VRT).Materials and Methods:  The software was built as a plug-in for the open-source PACS workstation OsiriX. The main segmentation function is based an optimized “virtual contrast injection” algorithm, which uses fuzzy connectedness of the vessel lumen to separate the contrast-filled structures from each other. The software was evaluated in 42 clinical coronary CTA datasets acquired with 64-slice CT using isotropic voxels of 0.3–0.5 mm.Results:  The median processing time was 6.4 min, and 100% of main branches (right coronary artery, left circumflex artery and left anterior descending artery) and 86.9% (219/252) of visible minor branches were intact. Visually correct centerlines were obtained automatically in 94.7% (321/339) of the intact branches.Conclusion:  The new software is a promising tool for coronary CTA post-processing providing good overviews of the coronary artery with limited user interaction on low-end hardware, and the coronary CTA diagnosis procedure could potentially be more time-efficient than using thin-slab technique.
  •  
10.
  • Wang, Chunliang, 1980-, et al. (författare)
  • Fast level-set based image segmentation using coherent propagation
  • 2014
  • Ingår i: Medical physics (Lancaster). - : John Wiley and Sons Ltd. - 0094-2405. ; 41:7
  • Tidskriftsartikel (refereegranskat)abstract
    • Purpose: The level-set method is known to require long computation time for 3D image segmentation, which limits its usage in clinical workflow. The goal of this study was to develop a fast level-set algorithm based on the coherent propagation method and explore its character using clinical datasets. Methods: The coherent propagation algorithm allows level set functions to converge faster by forcing the contour to move monotonically according to a predicted developing trend. Repeated temporary backwards propagation, caused by noise or numerical errors, is then avoided. It also makes it possible to detect local convergence, so that the parts of the boundary that have reached their final position can be excluded in subsequent iterations, thus reducing computation time. To compensate for the overshoot error, forward and backward coherent propagation is repeated periodically. This can result in fluctuations of great magnitude in parts of the contour. In this paper, a new gradual convergence scheme using a damping factor is proposed to address this problem. The new algorithm is also generalized to non-narrow band cases. Finally, the coherent propagation approach is combined with a new distance-regularized level set, which eliminates the needs of reinitialization of the distance. Results: Compared with the sparse field method implemented in the widely available ITKSnap software, the proposed algorithm is about 10 times faster when used for brain segmentation and about 100 times faster for aorta segmentation. Using a multiresolution approach, the new method achieved 50 times speed-up in liver segmentation. The Dice coefficient between the proposed method and the sparse field method is above 99% in most cases. Conclusions: A generalized coherent propagation algorithm for level set evolution yielded substantial improvement in processing time with both synthetic datasets and medical images.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 10

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy