O presente trabalho tem como objetivo realizar um estudo comparativo entre os três métodos para obtenção das características aerodinâmicas de tabuleiros de pontes: analítico, experimental e numérico. O tema é motivado pelo crescimento das necessidades de conhecimento científico e tecnológico na área de desempenho aerodinâmico de seções típicas de pontes nas etapas mais iniciais de projeto. A precisão de uma ferramenta de previsão certamente acelera a convergência ao modelo final; porém, qualquer metodologia numérica deve ser extensivamente testada antes de ser utilizada nos escritórios de cálculo. Inicialmente mostra-se a lógica da análise de instabilidades provocadas pelo vento, resume-se a modelagem de tabuleiros de pontes para ensaios em túnel de vento e descreve-se o método numérico implementado no programa comercial de análise de pontes RM. Comparam-se dados disponíveis de testes de modelos reduzidos no túnel de vento com as estimativas de aproximação do Método da Vorticidade em Partículas (MVP). Confrontam-se resultados para casos clássicos, um estudo paramétrico, dados dos relatórios de três pontes Brasileiras já ensaiadas no Túnel de Vento Joaquim Blessmann do LAC – PPGEC/UFRGS: Paulicéia, Guamá e Roberto Marinho. Finalmente, considera-se o método experimental como preciso e julga-se o método numérico comparativamente, analisando a confiabilidade dos resultados e procurando definir a sua faixa de aplicabilidade. Examinando a variabilidade dos resultados, bastante baixa, definiu-se sua faixa de aplicação considerando os resultados obtidos como satisfatórios para projetos básicos e executivos de estruturas; necessitando, porém, para os casos especiais, de comprovação experimental em túnel de vento antes da sua execução. Exemplifica-se então o uso do método para alguns problemas de análises de seções. Os resultados e comparações corroboram verificações anteriores do método dos vórtices discretos para verdadeiras seções de pontes e mostram porque o seu uso vem se tornando cada vez mais aceitável. / The work has the objective to realize a comparative study between three methods to obtain bridge aerodynamic coefficients: analytic, experimental and numerical. The theme is motivated by the increasing need of knowledge about the aerodynamic behaviour of bridge decks in the early stages of the design process. The accuracy of a predictive tool will certainly accelerate the convergence to the final design. However, any numerical methodology must be extensively tested ascertain and hence validated before it becomes of current use by designers. Collaboration is made comparing wind tunnel data of reduced models and numerical estimations by a simplified approach. After a brief overview of wind loading and wind tunnel modeling, the bridge wind resistance design in the commercially available bridge design software package RM is shown. The Discrete Vortex Method and the implementation are shortly described. Initially, classical fluid problems are indicated together with the comparison of parametric cross sectional bridge shapes. After, three Brazilian large cablestayed bridge projects are presented as instance of analysis: Paulicéia, Guamá and Roberto Marinho. Bridges aerodynamic coefficients were experimentally obtained at the Boundary Layer Wind Tunnel Joaquim Blessmann at Universidade Federal do Rio Grande do Sul (UFRGS). Finally, experimental results are considered precise and those results evaluated with CFD are compared analyzing the liability and applicability. According to the results variability, quite low, we considered them appropriated for basic and final structural designs; needing, although, for special cases, of experimental probation in wind tunnel tests before the construction phase. Some CFD analysis problems of cross sections are then presented as application examples. The results and similitude corroborate earlier verifications of the method and this implementation, demonstrating why its use is becoming increasingly acceptable.

O método numérico para fluidos incompressíveis desenvolvido no presente estudo é o Moving Particle Semi-Implicit Method (MPS) que enxerga o domínio discretizado em partículas, é baseado em representação lagrangeana e não tem a necessidade de utilização de malhas. O método MPS tem como equações governantes uma forma particular da equação de Navier-Stokes e a equação da continuidade para fluidos incompressíveis e não viscosos. Os métodos de simulação de fluidos mais comumente utilizados são baseados em representação euleriana e utilizam malhas para descrever a geometria do domínio a ser simulado. Devido a essas diferenças, uma das grandes virtudes do método de partículas é a facilidade de investigação de fenômenos altamente não-lineares como o de superfície livre com quebra de ondas, de líquidos no interior de uma embarcação em movimento, de ondas batendo na parte externa do casco de um navio, etc. Em artigos já publicados, resultados de experimentos físicos mostraram boa aderência aos resultados numéricos de simulações realizadas com o método MPS. No presente trabalho, resultados das forças de excitação das simulações com ondas regulares foram comparados com os resultados do programa Wave Analysis MIT (WAMIT) que é um programa consagrado no meio científico. Houve uma boa concordância de resultados entre os dois programas. A otimização do cálculo de vizinhança forneceu uma grande economia de tempo computacional. A maior contribuição deste estudo foi a otimização da função que resolve o sistema linear implementando no código desenvolvido um código paralelizado de uso público existente chamado Portable, Extensible Toolkit for Scientific Computation (PETSc) que proporcionou um bom ganho de desempenho. / A numerical method called Moving Particle Semi-implicit (MPS) method was developed in this study to analyze incompressible fluids. It is a particle method using a lagrangean representation without any grid. The governing equations are the Navier-Stokes equation and continuity equation for incompressible and non-viscous flow. Most of the computational fluid dynamics (CFD) methods are based on eulerian representation and use grids to describe the geometry of the simulated domain. These differences make the MPS method easier to analyze highly nonlinear phenomena as free surface with wave breaking, sloshing, slamming, etc. In previously published articles, results of physical experiments had shown good agreement with the numerical results obtained with MPS method. In the present work, results of exciting forces were compared with the results obtained with a validated program called Wave Analysis MIT (WAMIT). It had a good agreement of results between these two programs. The optimization of the neighborhood calculation function got a good economy of computational time. The greatest contribution of this study was the optimization of the linear system solver. It was made implementing in the developed code a parallelized public code called Portable, Extensible Toolkit for Scientific Computation (PETSc) that provided a good performance profit.

O presente trabalho tem como objetivo realizar um estudo comparativo entre os três métodos para obtenção das características aerodinâmicas de tabuleiros de pontes: analítico, experimental e numérico. O tema é motivado pelo crescimento das necessidades de conhecimento científico e tecnológico na área de desempenho aerodinâmico de seções típicas de pontes nas etapas mais iniciais de projeto. A precisão de uma ferramenta de previsão certamente acelera a convergência ao modelo final; porém, qualquer metodologia numérica deve ser extensivamente testada antes de ser utilizada nos escritórios de cálculo. Inicialmente mostra-se a lógica da análise de instabilidades provocadas pelo vento, resume-se a modelagem de tabuleiros de pontes para ensaios em túnel de vento e descreve-se o método numérico implementado no programa comercial de análise de pontes RM. Comparam-se dados disponíveis de testes de modelos reduzidos no túnel de vento com as estimativas de aproximação do Método da Vorticidade em Partículas (MVP). Confrontam-se resultados para casos clássicos, um estudo paramétrico, dados dos relatórios de três pontes Brasileiras já ensaiadas no Túnel de Vento Joaquim Blessmann do LAC – PPGEC/UFRGS: Paulicéia, Guamá e Roberto Marinho. Finalmente, considera-se o método experimental como preciso e julga-se o método numérico comparativamente, analisando a confiabilidade dos resultados e procurando definir a sua faixa de aplicabilidade. Examinando a variabilidade dos resultados, bastante baixa, definiu-se sua faixa de aplicação considerando os resultados obtidos como satisfatórios para projetos básicos e executivos de estruturas; necessitando, porém, para os casos especiais, de comprovação experimental em túnel de vento antes da sua execução. Exemplifica-se então o uso do método para alguns problemas de análises de seções. Os resultados e comparações corroboram verificações anteriores do método dos vórtices discretos para verdadeiras seções de pontes e mostram porque o seu uso vem se tornando cada vez mais aceitável. / The work has the objective to realize a comparative study between three methods to obtain bridge aerodynamic coefficients: analytic, experimental and numerical. The theme is motivated by the increasing need of knowledge about the aerodynamic behaviour of bridge decks in the early stages of the design process. The accuracy of a predictive tool will certainly accelerate the convergence to the final design. However, any numerical methodology must be extensively tested ascertain and hence validated before it becomes of current use by designers. Collaboration is made comparing wind tunnel data of reduced models and numerical estimations by a simplified approach. After a brief overview of wind loading and wind tunnel modeling, the bridge wind resistance design in the commercially available bridge design software package RM is shown. The Discrete Vortex Method and the implementation are shortly described. Initially, classical fluid problems are indicated together with the comparison of parametric cross sectional bridge shapes. After, three Brazilian large cablestayed bridge projects are presented as instance of analysis: Paulicéia, Guamá and Roberto Marinho. Bridges aerodynamic coefficients were experimentally obtained at the Boundary Layer Wind Tunnel Joaquim Blessmann at Universidade Federal do Rio Grande do Sul (UFRGS). Finally, experimental results are considered precise and those results evaluated with CFD are compared analyzing the liability and applicability. According to the results variability, quite low, we considered them appropriated for basic and final structural designs; needing, although, for special cases, of experimental probation in wind tunnel tests before the construction phase. Some CFD analysis problems of cross sections are then presented as application examples. The results and similitude corroborate earlier verifications of the method and this implementation, demonstrating why its use is becoming increasingly acceptable.

Le travail effectué au cours de cette thèse s'inscrit au sein du projet ANR Mascaret, dont l'objectif est la compréhension du phénomène de mascaret, l'étude de ses conséquences sur l'environnement et sa sensibilité aux modifications de cet environnement. La contribution de cette thèse s'inscrit uniquement dans la partie numérique de ce projet. Seul l'aspect transport sédimentaire causé par le mascaret sera abordé. Le but est de construire un modèle numérique de transport sédimentaire général qui pourra notamment s'appliquer au cas du mascaret. Trois méthodes numériques sont explorées, une première permettant le suivi individuel des grains sédimentaires et deux autres permettant de suivre l'évolution de la concentration en grains au sein de l'écoulement. La première méthode considérera les plus petites échelles et sera appelée méthode tracker et consistera en un suivi individuel des grains sédimentaires. La seconde méthode, dite méthode particulaire, portera sur des échelles plus larges et le transport d'une concentration locale en grains sédimentaires. Enfin, la troisième méthode, que l'on appellera méthode des moments, s'intéressera aux échelles les plus larges en transportant un nuage de particules sédimentaires dans son ensemble grâce à une seule particule numérique caractérisée par les moments de sa distribution en concentration interne. Ceci permettra de caractériser le transport sédimentaire de manière locale qui se produit lors du passage d'un mascaret. Deux mascarets ondulés de nombre de Froude proches seront étudiés. Il sera notamment montré que le nombre de Froude n'est pas un critère permettant de caractériser le transport sédimentaire induit par les mascarets. / The work performed during this thesis is a part of the Mascaret ANR project, which aims to understand the phenomenon of tidal bore, the study of its impact on the environment and its sensitivity to changes in that environment. The contribution of this thesis lies solely in the numerical part of this project. Only the sediment transport caused by the tidal bore is discussed. The goal is to build a generic numerical model of sediment transport which can therefore be applied to the specific case of tidal bores. Three methods are explored, a first for individual tracking of sediment grains and two to model the concentration of grains in the flow. The first method considers the smallest scales and will be called tracking method and consists of individual tracking of sediment grains. The second method, called particle method, focuses on larger scales and the transport of local concentration of sedimentary grains. The third method, which we call moments method, will focus on the largest scales, carrying a cloud of sediment grains as a whole using a single numerical particle characterized by the moments of its internal concentration distribution. This will characterize the local sediment transport process occurring during the passage of a tidal bore. Two undulating bores will be studied whose Froude numbers are close. It will be shown in particular that the Froude number is not a criterion to deduce the intensity of the induced tidal bores sediment transport.

<p>This thesis presents a computational model of the surgical stitching tasks and a path planning algorithm for robotic assisted stitching. The overall goal of the research is to enable surgical robots to perform automatic suturing. Suturing comprises several distinct steps, one of them is the stitching. During stitching, reaching the desired exit point is difficult because it must be accomplished without direct visual feedback. Moreover, the stitching is a time consuming procedure repeated multiple times during suturing. Therefore, it would be desirable to enhance the surgical robots with the ability of performing automatic suturing. The focus of this work is on the automation of the stitching task. The thesis presents a model based path planning algorithm for the autonomous stitching. The method uses a nonlinear model for the curved needle - soft tissue interaction. The tissue is modeled as a deformable object using continuum mechanics tools. This thesis uses a mesh free deformable tissue model namely, Reproducing Kernel Particle Method (RKPM). RKPM was chosen as it has been proven to accurately handle large deformation and requires no re-meshing algorithms. This method has the potential to be more realistic in modeling various material characteristics by using appropriate strain energy functions. The stitching task is simulated using a constrained deformable model; the deformable tissue is constrained by the interaction with the curved needle. The stitching model was used for needle trajectory path planning during stitching. This new path planning algorithm for the robotic stitching was developed, implemented, and evaluated. Several simulations and experiments were conducted. The first group of simulations comprised random insertions from different insertion points without planning to assess the modeling method and the trajectory of the needle inside the tissue. Then the parameters of the simulations were set according to the measured experimental parameters. The proposed path planning method was tested using a surgical ETHICON needle of type SH 1=2 Circle with the radius of 8:88mm attached to a robotic manipulator. The needle was held by a grasper which is attached to the robotic arm. The experimental results illustrate that the path planned curved needle insertions are fifty percent more accurate than the unplanned ones. The results also show that this open loop approach is sensitive to model parameters.</p> / Master of Applied Science (MASc)

Made available in DSpace on 2016-12-23T14:04:30Z (GMT). No. of bitstreams: 1 Wesley Jose Nunes Pinto.pdf: 2090367 bytes, checksum: e676fde8423a3a2cfeac61da24020ea8 (MD5) Previous issue date: 2013-08-19 / Neste estudo foi aplicado do método numérico, sem malhas, baseado em partículas, denominado SPH (Smoothed Particles Hydrodynamics). E um código numérico na linguagem computacional FORTRAN foi utilizado para solucionar as equações de Navier-Stokes. O clássico problema da literatura da dinâmica dos fluidos Computacional, denotado como problema da cavidade quadrada bidimensional (Shear-Driven Cavity Flow) , foi estudado com a intenção de verificar o comportamento do código numérico em relação a resultados específicos já existentes do assunto. O citado problema físico das cavidades abertas é amplamente empregado como benchmark, visando a validação do método numérico utilizado no trabalho desenvolvido na pesquisa. O trabalho de análise e validação do código numérico foi dividido em três seções: a primeira lista as localizações dos centros dos vórtices principais gerados pelo escoamento na aresta superior das cavidades; a segunda plota os perfis das componentes das velocidades centrais das cavidades; e a terceira: lista os desvios absolutos dos perfis das velocidades centrais do presente trabalho, comparados com dados de outros estudos. Constata-se que o método SPH apresentou boa acurácia nas simulações realizadas, obtendo boa concordância entre os resultados das simulações dinâmicas com os dados de referências, validando-se o modelo numérico proposto, tendo melhores resultados para baixos números de Reynolds / In this study, it was applied the numerical method, grid-free, based on particles named SPH (Smoothed Particles Hydrodynamics). Also, a numerical code in the computer language FORTRAN was used to solve the Navier-Stokes Equations. This classic problem of the literature related to Computational Fluid Dynamics indicated as Shear-Driven Cavity Flow was studied to check the behavior of the numerical code regarding specific existing results. Such problem is highly used as Benchmark, aiming the validation of the numerical method used to develop the research. The analysis and validation of the numerical code was divided into three sections: the first one lists the location of the centre of the main vortex generated by the flow of the upper edge of the cavities; the second one plots the profiles of the components of the central speed of the cavities; the third one lists the absolute deviation of the profiles of the central speed of this study compared with other cases data. It is established that the SPH Method presented accuracy in the performed simulations, in a consonance between the results of the dynamic simulations and the reference data, thus the proposed numerical model was validated with better results for low Reynolds numbers

The flow field and forces on an isolated oscillating NACA 0012 airfoil in a uniform flow is studied using viscous vortex particle method. The simulations are carried out at very low chord (c) based Reynolds number (Re=1000), motivated by the current interest in development of Micro Air Vehicles (MAV). The airfoil is forced to oscillate in both heave and pitch at different normalized oscillation frequencies (f), which is represented by the non-dimensional reduced frequency fc/U).( From the unsteady loading on the airfoil, the net energy transfer to the airfoil is calculated to determine the propensity for the airfoil to undergo self-induced oscillations or flutter at these very low Reynolds numbers. The simulations are carried out using a viscous vortex particle method that utilizes discrete vortex elements to represent the vorticity in the flow field. After validation of the code against test cases in the literature, simulations are first carried out for the stationary airfoil at different angles of attack, which shows the stall characteristics of the airfoil at this very low Reynolds numbers. For the airfoil oscillating in heave, the airfoil is forced to oscillate at different reduced frequencies at a large angle of attack in the stall regime. The unsteady loading on the blade is obtained at different reduced frequencies. This is used to calculate the net energy transfer to the airfoil from the flow, which is found to be negative in all cases studied. This implies that stall flutter or self-induced oscillations are not possible under the given heave conditions. The wake vorticity dynamics is presented for the different reduced frequencies, which show that the leading edge vortex dynamics is progressively more complex as the reduced frequency is increased from small values. For the airfoil oscillating in pitch, the airfoil is forced to oscillate about a large mean angle of attack corresponding to the stall regime. The unsteady moment on the blade is obtained at different reduced frequencies, and this is used to calculate the net energy transfer to the airfoil from the flow, which is found to be positive in all cases studied. This implies that stall flutter or self-induced oscillations are possible in the pitch mode, unlike in the heave case. The wake vorticity dynamics for this case is found to be relatively simple compared to that in heave. The results of the present simulations are broadly in agreement with earlier stall flutter studies at higher Reynolds numbers that show that stall flutter does not occur in the heave mode, but can occur in the pitch mode. The main difference in the present very low Reynolds number case appears to be the broader extent of the excitation region in the pitch mode compared to large Re cases studied earlier. region in the pitch mode compared to large Re cases studied earlier.

Modern fluorescence microscopy modalities, such as light-sheet microscopy, are capable of acquiring large three-dimensional images at high data rate. This creates a bottleneck in computational processing and analysis of the acquired images, as the rate of acquisition outpaces the speed of processing. Moreover, images can be so large that they do not fit the main memory of a single computer. Another issue is the information loss during image acquisition due to limitations of the optical imaging systems. Analysis of the acquired images may, therefore, find multiple solutions (or no solution) due to imaging noise, blurring, and other uncertainties introduced during image acquisition. In this thesis, we address the computational processing time and memory issues by developing a distributed parallel algorithm for segmentation of large fluorescence-microscopy images. The method is based on the versatile Discrete Region Competition (Cardinale et al., 2012) algorithm, which has previously proven useful in microscopy image segmentation. The present distributed implementation decomposes the input image into smaller sub-images that are distributed across multiple computers. Using network communication, the computers orchestrate the collective solving of the global segmentation problem. This not only enables segmentation of large images (we test images of up to 10^10 pixels) but also accelerates segmentation to match the time scale of image acquisition. Such acquisition-rate image segmentation is a prerequisite for the smart microscopes of the future and enables online data inspection and interactive experiments. Second, we estimate the segmentation uncertainty on large images that do not fit the main memory of a single computer. We there- fore develop a distributed parallel algorithm for efficient Markov- chain Monte Carlo Discrete Region Sampling (Cardinale, 2013). The parallel algorithm provides a measure of segmentation uncertainty in a statistically unbiased way. It approximates the posterior probability densities over the high-dimensional space of segmentations around the previously found segmentation. / Moderne Fluoreszenzmikroskopie, wie zum Beispiel Lichtblattmikroskopie, erlauben die Aufnahme hochaufgelöster, 3-dimensionaler Bilder. Dies führt zu einen Engpass bei der Bearbeitung und Analyse der aufgenommenen Bilder, da die Aufnahmerate die Datenverarbeitungsrate übersteigt. Zusätzlich können diese Bilder so groß sein, dass sie die Speicherkapazität eines einzelnen Computers überschreiten. Hinzu kommt der aus Limitierungen des optischen Abbildungssystems resultierende Informationsverlust während der Bildaufnahme. Bildrauschen, Unschärfe und andere Messunsicherheiten können dazu führen, dass Analysealgorithmen möglicherweise mehrere oder keine Lösung für Bildverarbeitungsaufgaben finden. Im Rahmen der vorliegenden Arbeit entwickeln wir einen verteilten, parallelen Algorithmus für die Segmentierung von speicherintensiven Fluoreszenzmikroskopie-Bildern. Diese Methode basiert auf dem vielseitigen "Discrete Region Competition" Algorithmus (Cardinale et al., 2012), der sich bereits in anderen Anwendungen als nützlich für die Segmentierung von Mikroskopie-Bildern erwiesen hat. Das hier präsentierte Verfahren unterteilt das Eingangsbild in kleinere Unterbilder, welche auf die Speicher mehrerer Computer verteilt werden. Die Koordinierung des globalen Segmentierungsproblems wird durch die Benutzung von Netzwerkkommunikation erreicht. Dies erlaubt die Segmentierung von sehr großen Bildern, wobei wir die Anwendung des Algorithmus auf Bildern mit bis zu 10^10 Pixeln demonstrieren. Zusätzlich wird die Segmentierungsgeschwindigkeit erhöht und damit vergleichbar mit der Aufnahmerate des Mikroskops. Dies ist eine Grundvoraussetzung für die intelligenten Mikroskope der Zukunft, und es erlaubt die Online-Betrachtung der aufgenommenen Daten, sowie interaktive Experimente. Wir bestimmen die Unsicherheit des Segmentierungsalgorithmus bei der Anwendung auf Bilder, deren Größe den Speicher eines einzelnen Computers übersteigen. Dazu entwickeln wir einen verteilten, parallelen Algorithmus für effizientes Markov-chain Monte Carlo "Discrete Region Sampling" (Cardinale, 2013). Dieser Algorithmus quantifiziert die Segmentierungsunsicherheit statistisch erwartungstreu. Dazu wird die A-posteriori-Wahrscheinlichkeitsdichte über den hochdimensionalen Raum der Segmentierungen in der Umgebung der zuvor gefundenen Segmentierung approximiert.

Modern fluorescence microscopy modalities, such as light-sheet microscopy, are capable of acquiring large three-dimensional images at high data rate. This creates a bottleneck in computational processing and analysis of the acquired images, as the rate of acquisition outpaces the speed of processing. Moreover, images can be so large that they do not fit the main memory of a single computer. Another issue is the information loss during image acquisition due to limitations of the optical imaging systems. Analysis of the acquired images may, therefore, find multiple solutions (or no solution) due to imaging noise, blurring, and other uncertainties introduced during image acquisition. In this thesis, we address the computational processing time and memory issues by developing a distributed parallel algorithm for segmentation of large fluorescence-microscopy images. The method is based on the versatile Discrete Region Competition (Cardinale et al., 2012) algorithm, which has previously proven useful in microscopy image segmentation. The present distributed implementation decomposes the input image into smaller sub-images that are distributed across multiple computers. Using network communication, the computers orchestrate the collective solving of the global segmentation problem. This not only enables segmentation of large images (we test images of up to 10^10 pixels) but also accelerates segmentation to match the time scale of image acquisition. Such acquisition-rate image segmentation is a prerequisite for the smart microscopes of the future and enables online data inspection and interactive experiments. Second, we estimate the segmentation uncertainty on large images that do not fit the main memory of a single computer. We there- fore develop a distributed parallel algorithm for efficient Markov- chain Monte Carlo Discrete Region Sampling (Cardinale, 2013). The parallel algorithm provides a measure of segmentation uncertainty in a statistically unbiased way. It approximates the posterior probability densities over the high-dimensional space of segmentations around the previously found segmentation. / Moderne Fluoreszenzmikroskopie, wie zum Beispiel Lichtblattmikroskopie, erlauben die Aufnahme hochaufgelöster, 3-dimensionaler Bilder. Dies führt zu einen Engpass bei der Bearbeitung und Analyse der aufgenommenen Bilder, da die Aufnahmerate die Datenverarbeitungsrate übersteigt. Zusätzlich können diese Bilder so groß sein, dass sie die Speicherkapazität eines einzelnen Computers überschreiten. Hinzu kommt der aus Limitierungen des optischen Abbildungssystems resultierende Informationsverlust während der Bildaufnahme. Bildrauschen, Unschärfe und andere Messunsicherheiten können dazu führen, dass Analysealgorithmen möglicherweise mehrere oder keine Lösung für Bildverarbeitungsaufgaben finden. Im Rahmen der vorliegenden Arbeit entwickeln wir einen verteilten, parallelen Algorithmus für die Segmentierung von speicherintensiven Fluoreszenzmikroskopie-Bildern. Diese Methode basiert auf dem vielseitigen "Discrete Region Competition" Algorithmus (Cardinale et al., 2012), der sich bereits in anderen Anwendungen als nützlich für die Segmentierung von Mikroskopie-Bildern erwiesen hat. Das hier präsentierte Verfahren unterteilt das Eingangsbild in kleinere Unterbilder, welche auf die Speicher mehrerer Computer verteilt werden. Die Koordinierung des globalen Segmentierungsproblems wird durch die Benutzung von Netzwerkkommunikation erreicht. Dies erlaubt die Segmentierung von sehr großen Bildern, wobei wir die Anwendung des Algorithmus auf Bildern mit bis zu 10^10 Pixeln demonstrieren. Zusätzlich wird die Segmentierungsgeschwindigkeit erhöht und damit vergleichbar mit der Aufnahmerate des Mikroskops. Dies ist eine Grundvoraussetzung für die intelligenten Mikroskope der Zukunft, und es erlaubt die Online-Betrachtung der aufgenommenen Daten, sowie interaktive Experimente. Wir bestimmen die Unsicherheit des Segmentierungsalgorithmus bei der Anwendung auf Bilder, deren Größe den Speicher eines einzelnen Computers übersteigen. Dazu entwickeln wir einen verteilten, parallelen Algorithmus für effizientes Markov-chain Monte Carlo "Discrete Region Sampling" (Cardinale, 2013). Dieser Algorithmus quantifiziert die Segmentierungsunsicherheit statistisch erwartungstreu. Dazu wird die A-posteriori-Wahrscheinlichkeitsdichte über den hochdimensionalen Raum der Segmentierungen in der Umgebung der zuvor gefundenen Segmentierung approximiert.