Red blood cell segmentation in microscopic images is the first step for various clinical studies carried out on blood samples such as cell counting, cell shape identification, etc. Conventional methods while often sho...
详细信息
ISBN:
(纸本)9781728111414
Red blood cell segmentation in microscopic images is the first step for various clinical studies carried out on blood samples such as cell counting, cell shape identification, etc. Conventional methods while often showing a high accuracy are heavily depending on the acquisition modality. Deep learning approaches have shown to be more robust regarding such modalities and still showing a comparable accuracy. In this paper, we first investigate necessary steps to apply a specific type of deep learning methods, namely fully convolutional networks, to red blood cell segmentation. Based on data given and constraints imposed by our partners mainly regarding a high throughput of their data we then describe an exemplary application. First results show, that even with a focus on high performance a good accuracy above 90% can be reached.
Fibres in fibre reinforced concrete (FRC) and fibre reinforced shotcrete (FRS) are known to increase the toughness of the composite material thanks to their ability to transfer tensile stresses even after cracks have ...
详细信息
Fibres in fibre reinforced concrete (FRC) and fibre reinforced shotcrete (FRS) are known to increase the toughness of the composite material thanks to their ability to transfer tensile stresses even after cracks have opened. However, fibres are deemed responsible for uncertainty in mechanical performance of FRC and FRS. This uncertainty is ascribed to how the fibres are physically located with respect to the crack. In this study a novel approach is presented to measure the distribution of fibres from digital images. A computer code that features imageprocessing and Machine Learning algorithms has been developed to extract: i) the 2D location, ii) the mode of failure, iii) the orientation, iv) the pull-out length for each single fibre and v) the total number of fibres bridging the crack. The Machine Learning Algorithm is trained with a database that is attached to this article. This methodology, apart from giving an understanding of how fibres are distributed over the crack, provides the main input of several numerical models that simulate the behaviour of FRC/FRS taking into account the position and orientation of each single fibre. The main advantage of this approach over existing methods is that the hardware required to carry out the analysis consists of a simple smartphone camera while an output with errors within a few thousands parts of the actual measures. The algorithm is employed to analyse the fibres' distribution for 9 Round Determinate Panels (RDP) made of wet-mix shotcrete. The spatial 2D-location of fibres in the crack is tested for randomness with a Monte Carlo procedure and the fibres' distribution is found to follow an Independent Random Process. For fibres that pulled-out from one side of the crack, a further 3D investigation has been carried out. The analysis on the fibres' orientation confirmed the conclusion found by other authors that fibres tend to align perpendicular to the direction of spraying. Furthermore, it is unlikely to find fibres per
Linear operators used in iterative methods like conjugate gradient have typically been implemented either as "matrix-driven" subroutines backed by explicit sparse or dense matrices, or as "matrix-free&q...
详细信息
ISBN:
(纸本)9781538643686
Linear operators used in iterative methods like conjugate gradient have typically been implemented either as "matrix-driven" subroutines backed by explicit sparse or dense matrices, or as "matrix-free" subroutines that implement specific linear operations directly (e.g. FFTs). The matrix-driven approach is generally more portable because it can target widely-available BLAS libraries, but it can be inefficient in terms of time and space complexity. In contrast, the matrix-free approach is more performant because it leverages structure in operations, but it requires each operator be re-implemented on each new platform. To increase performance and portability, we propose a hybrid approach that represents linear operators as expression trees. Leaf nodes in the tree are either matrix-free or matrix-driven operators, and interior nodes represent mathematical compositions (sums, products, transposes) or structural compositions (stacks, block diagonals, etc.) of the leaf operators. This representation enables expert-guided reordering and fusion transformations that can improve performance or reduce memory pressure. We implement our approach in a domain-specific language called Indigo. We assess Indigo on image reconstruction problems arising in four application areas: magnetic resonance imaging, ptychography, magnetic particle imaging, and fluorescent microscopy. We give performance results from vendor BLAS libraries, and we introduce specializations to Sparse BLAS routines that achieve near-Roofline performance on multi-core, many-core, and GPU systems.
Monte-Carlo rendering algorithms are known for producing highly realistic images, but at a significant computational cost, because they rely on tracing up to trillions of light paths through a scene to simulate physic...
详细信息
ISBN:
(纸本)9783030050511;9783030050504
Monte-Carlo rendering algorithms are known for producing highly realistic images, but at a significant computational cost, because they rely on tracing up to trillions of light paths through a scene to simulate physically based light transport. For this reason, a large body of research exists on various techniques for accelerating these costly algorithms. As one of the Monte-Carlo rendering algorithms, PSSMLT (Primary Sample Space Metropolis Light Transport) is widely used nowadays for photorealistic rendering. Unfortunately, the computational cost of PSSMLT is still very high since the space of light paths in high-dimension and up to trillions of paths are typically required in such path space. Recent research on PSSMLT has proposed a variety of optimized methods for single node rendering, however, multi-node rendering for PSSMLT is rarely mentioned due in large part to the complicated mathematical model, complicated physical processes and the irregular memory access patterns, and the imbalanced workload of light-carrying paths. In this paper, we present a highly scalable distributedparallel simulation framework for PSSMLT. Firstly, based on light transport equation, we propose the notion of sub-image with certain property for multi-node rendering and theoretically prove that the whole set of sub-images can be combined to produce the final image;Then we further propose a sub-image based assignment partitioning algorithm for multi-node rendering since the traditional demand-driven assignment partitioning algorithm doesn't work well. Secondly, we propose a physically based parallel simulation for the PSSMLT algorithm, which is revealed on a parallel computer system in master-worker paradigm. Finally, we discuss the issue of granularity of the assignment partitioning and some optimization strategies for improving overall performance, and then a static/dynamic hybrid scheduling strategy is described. Experiments show that framework has a nearly linear speedup along wi
image clustering is one of the challenging tasks in machine learning, and has been extensively used in various applications. Recently, various deep clustering methods has been proposed. These methods take a two-stage ...
详细信息
ISBN:
(纸本)9781479970612
image clustering is one of the challenging tasks in machine learning, and has been extensively used in various applications. Recently, various deep clustering methods has been proposed. These methods take a two-stage approach, feature learning and clustering, sequentially or jointly. We observe that these works usually focus on the combination of reconstruction loss and clustering loss, relatively little work has focused on improving the learning representation of the neural network for clustering. In this paper, we propose a deep convolutional embedded clustering algorithm with inception-like block (DCECI). Specifically, an inception-like block with different type of convolution filters are introduced in the symmetric deep convolutional network to preserve the local structure of convolution layers. We simultaneously minimize the reconstruction loss of the convolutional autoencoders with inception-like block and the clustering loss. Experimental results on multiple image datasets exhibit the promising performance of our proposed algorithm compared with other competitive methods.
Exact segmentation of the brain tumor is one of the imperative tasks in medical imageprocessing and its analysis as it deals with extracting the information of the tumorous region from the brain MRI sequences. Automa...
详细信息
ISBN:
(纸本)9781728106465
Exact segmentation of the brain tumor is one of the imperative tasks in medical imageprocessing and its analysis as it deals with extracting the information of the tumorous region from the brain MRI sequences. Automated segmentation and detection of brain tumors from the brain MRI is an exigent issue caused by the texture, size, shape, and location. In this paper, a significant method of brain tumor segmentation from the FLAIR MRI sequences is by classifying local window followed by parallel fuzzy c means clustering. Fuzzy c- means methods have shown their efficiency in extracting a variety of objects in several medical imageprocessing applications. However, one of the major issues of these algorithms is high computational requirements at the time of dealing with large data set. Nowadays, NVIDIA's GPU plays an extremely essential role in implementing such time-consuming algorithms to reduce the time complexity. Our experiments based on NCI-MICCAI BRATS 2017 FLAIR MRI of HGG (High-Grade Glioma) demonstrate the efficiency of the implemented parallel algorithm. For the segmentation of tumorous region, a mechanism of sliding window is implemented on CPU (host) in which a 45 X 45 sized window is taken to classify whether that particular window is having tumor region or not. For perfect segmentation at the GPU (device) side, fuzzy c means technique is used to get the exact location of the tumor. Approx 17.6 speed up obtained, for the BRATS data sets over the implementation of the algorithm on CPU. Apart from speed up significant dice similarity coefficients are obtained which shows the efficient segmentation in the reasonable time.
Glaucoma is a disease associated with retina of eye. Presently, millions of human being is suffering from this disease. Early detection of these diseases can save the people from blindness. Therefore, various methods ...
详细信息
With the rapid development of information technology, the amount of remote sensing data is increasing at an unprecedented scale. In the presence of massive remote sensing data, the traditional processingmethods have ...
详细信息
With the rapid development of information technology, the amount of remote sensing data is increasing at an unprecedented scale. In the presence of massive remote sensing data, the traditional processingmethods have the problems of low efficiency and lack of scalability, so this paper uses open source big data technology to improve it. Firstly, the storage model of remote sensing image data is designed by using the distributed storage database HBase. Then, the grid index and the Hibert curve are combined to establish the index for the image data. Finally, the method of MapReduce parallelprocessing is used to write and query remote sensing images. The experimental results show that the method can effectively improve the data writing and query speed, and has good scalability. Copyright (C) 2018 Elsevier Ltd. All rights reserved.
暂无评论