Advanced search

Showing result 1 - 5 of 17 essays matching the above criteria.

  1. 1. Phase Unwrapping MRI Flow Measurements

    University essay from Uppsala universitet/Avdelningen Vi3

    Author : Mio Liljeblad; [2023]
    Keywords : phase unwrapping; computer vision; cine MRI; NMR; flow measurements; velocity encoding; venc; energy minimization; magnetic resonance; cardiac MRI; sinotubuar junction; pulmonary artery; ascending descending aorta; laplacian algorithm; iterative graph cuts; IGC; sequential tree-reweighted message passing; TRW-S; velocity to noise ratio; VNR; retrospective wrapping; energy formulation;

    Abstract : Magnetic resonance images (MRI) are acquired by sampling the current of induced electromotiveforce (EMF). EMF is induced due to flux of the net magnetic field from coherent nuclear spins with intrinsic magnetic dipole moments. READ MORE

  3. 2. Evaluate Machine Learning Model to Better Understand Cutting in Wood

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Md Tahseen Anam; [2021]
    Keywords : Machine Learning; Mask R-CNN; Image Analysis; Wood Image; Pith Detection; Knots; Cracks; Cutting Efficiency;

    Abstract : Wood cutting properties for the chains of chainsaw is measured in the lab by analyzing the force, torque, consumed power and other aspects of the chain as it cuts through the wood log. One of the essential properties of the chains is the cutting efficiency which is the measured cutting surface per the power used for cutting per the time unit. READ MORE

  4. 3. Parallel Minimum Cuts : An improved CREW PRAM algorithm

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Andrés López Martínez; [2020]
    Keywords : ;

    Abstract : This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple randomized CREW PRAM algorithm to find the minimum cut in a graph G with n nodes and m edges, based on Karger’s celebrated randomized near-linear time min-cut algorithm [STOC’96]. READ MORE

  5. 4. On Minimal Non-(2, 1)-Colorable Graphs

    University essay from Stockholms universitet/Matematiska institutionen

    Author : Ruth Bosse; [2017]
    Keywords : Graph coloring;

    Abstract : A graph is (2, 1)-colorable if it allows a partition of its vertices into two classes such that both induce graphs with maximum degree at most one. A non-(2, 1)-colorable graph is minimal if all proper subgraphs are (2, 1)-colorable. We prove that such graphs are 2-edge-connected and that every edge sits in an odd cycle. READ MORE

  6. 5. Streaming Graph Partitioning : Degree Project in Distributed Computing at KTH Information and Communication Technology

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Zainab Abbas; [2016]
    Keywords : ;

    Abstract : Graph partitioning is considered to be a standard solution to process huge graphs efficiently when processing them on a single machine becomes inefficient due to its limited computation power and storage space. In graph partitioning, the whole graph is divided among different computing nodes that process the graph in parallel. READ MORE