Sökning: "graph cuts"

Visar resultat 1 - 5 av 8 avhandlingar innehållade orden graph cuts.

  1. 1. Graph-based Methods for Interactive Image Segmentation

    Författare :Filip Malmberg; Ingela Nyström; Ewert Bengtsson; Jayaram K. Udupa; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Digital image analysis; Interactive image segmentation; Fuzzy image segmentation; Image foresting transform; Graph labeling; Graph cuts; Computerized Image Processing; Datoriserad bildbehandling;

    Sammanfattning : The subject of digital image analysis deals with extracting relevant information from image data, stored in digital form in a computer. A fundamental problem in image analysis is image segmentation, i.e., the identification and separation of relevant objects and structures in an image. LÄS MER

  3. 2. Global Optimization in Computer Vision: Convexity, Cuts and Approximation Algorithms

    Författare :Carl Olsson; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Spectral Relaxation; Normalized Cuts; Continuous Cuts; Segmentation; Generalized Convexity; 3D-Reconstruction; Global Optimization; Multiple View Geometry; Trust Region Subproblem;

    Sammanfattning : Computer vision is today a wide research area including topics like robot vision, image analysis, pattern recognition, medical imaging and geometric reconstruction problems. Over the past decades there has been a rapid development in understanding and modeling different computer vision applications. LÄS MER

  4. 3. Dynamic Programming for Ultrasound Image Analysis of Atherosclerosis

    Författare :Peter Holdfeldt; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; atherosclerotic plaque; ultrasound; classification; dynamic programming; carotid artery; image analysis; edge detection; graph cuts;

    Sammanfattning : Cardiovascular diseases, due to atherosclerosis, are among the most common causes of death in the industrialized world. Atherosclerotic plaque composition as well as arterial diameter and wall thickness can be used to predict the risk of cardiovascular disease. These risk factors can be assessed non-invasively by ultrasound. LÄS MER

  5. 4. Scalable Streaming Graph and Time Series Analysis Using Partitioning and Machine Learning

    Författare :Zainab Abbas; Vladimir Vlassov; Peter Van Roy; Paris Carbone; Vasiliki Kalavri; Vincenzo Massimiliano Gulisano; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Stream processing; graph processing; time series; big data; machine learning; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Recent years have witnessed a massive increase in the amount of data generated by the Internet of Things (IoT) and social media. Processing huge amounts of this data poses non-trivial challenges in terms of the hardware and performance requirements of modern-day applications. LÄS MER

  7. 5. Graph dominators in logic synthesis and verification

    Författare :René Krenz; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formal verification; logic synthesis; dominators; equivalence checking; decomposition; Computer science; Datavetenskap;

    Sammanfattning : This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. LÄS MER