Showing 1 - 11 results of 11 for search 'minimum spanning three segmentation', query time: 0.08s Refine Results
  1. 1
  2. 2

    Utilizing weak graph for edge consolidation-based efficient enhancement of network robustness by Wei Ding, Zhengdan Wang

    Published 2025-05-01
    “…The algorithm then extracts the weak graph and discovers a superior solution by constructing a partial minimum cost spanning tree. We compare the proposed algorithm with optimal and approximate algorithms across graphs of varying scales. …”
    Get full text
    Article
  3. 3

    Fast sparse representative tree splitting via local density for large-scale clustering by Renmin Wang, Jie Li

    Published 2025-08-01
    “…This paper proposes a novel large-scale clustering framework with three key innovations: (1) Parameter-free cluster discovery: unlike conventional methods requiring predefined cluster numbers, our algorithm autonomously identifies natural cluster structures through dynamic density-based splitting decisions. (2) Hybrid sampling-partitioning strategy: by integrating randomized sampling with K-means-based partitioning, we extract high-quality representative points that preserve data integrity with linear computational complexity. (3) Local density-driven MST segmentation: A minimum spanning tree (MST) constructed from representatives is adaptively partitioned using a local density criterion, which dynamically disconnects weakly associated edges by comparing density peaks between adjacent representative points. …”
    Get full text
    Article
  4. 4
  5. 5

    Calculation of vessel pulse wave velocities in retinal vein segments within the optic disc centre by A. Vukmirovic, W. H. Morgan, D. Obreschkow, A. Abdul-Rahman, D. Y. Yu, A. Mehnert

    Published 2024-11-01
    “…An optic disc (OD) PPG video is acquired spanning three cardiac cycles for a fixed ophthalmodynamometric force. …”
    Get full text
    Article
  6. 6

    Masks-to-Skeleton: Multi-View Mask-Based Tree Skeleton Extraction with 3D Gaussian Splatting by Xinpeng Liu, Kanyu Xu, Risa Shinoda, Hiroaki Santo, Fumio Okura

    Published 2025-07-01
    “…Furthermore, we use a minimum spanning tree (MST) algorithm during the optimization loop to regularize the graph to a tree structure. …”
    Get full text
    Article
  7. 7

    Una Técnica Bayesiana y de Varianza Mínima para Segmentación del Lumen Arterial en Imágenes de Ultrasonido by Sergio Rogelio Tinoco-Martínez, Felix Calderon, Carlos Lara-Alvarez, Jaime Carranza-Madrigal

    Published 2014-07-01
    “…Lumen is located applying three criteria on segmented trajec- tories: length, dark and, our proposal, minimum variance. …”
    Get full text
    Article
  8. 8
  9. 9

    Responses of field-grown maize to different soil types, water regimes, and contrasting vapor pressure deficit by T. H. Nguyen, T. Gaiser, J. Vanderborght, A. Schnepf, F. Bauer, A. Klotzsche, L. Lärm, H. Hüging, F. Ewert, F. Ewert

    Published 2024-12-01
    “…The seasonally observed minimum leaf water potential (<span class="inline-formula"><i>ψ</i><sub>leaf</sub></span>) varied from around <span class="inline-formula">−1.5</span> MPa in the rainfed plot in 2017 to around <span class="inline-formula">−2.5</span> MPa in the same plot of the stony soil in 2018. …”
    Get full text
    Article
  10. 10
  11. 11