Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Survival Tree01:19

Survival Tree

87
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
87
Wald-Wolfowitz Runs Test I01:17

Wald-Wolfowitz Runs Test I

651
The Wald-Wolfowitz test, also known as the runs test, is a nonparametric statistical test used to assess the randomness of a sequence of two different types of elements (e.g., positive/negative values, successes/failures). It examines whether the order of the elements in a sequence is random or if there is a pattern or trend present. This nonparametric test applies to any ordered data despite the population and sample data distribution, even if a higher sample size is available.
The test works...
651
Wald-Wolfowitz Runs Test II01:17

Wald-Wolfowitz Runs Test II

244
The Wald-Wolfowitz runs test, commonly referred to as the runs test, is a nonparametric test used to assess the randomness of ordered data. The test evaluates the number of runs, which are consecutive sequences of similar elements within the data. If the number of runs is significantly higher or lower than expected, the data is considered non-random, indicating a detectable pattern or structure.
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
244

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

A Shared-Memory Parallel Alpha-Tree Algorithm for Extreme Dynamic Ranges.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2025
Same author

Evaluation of Alpha-Trees for Hierarchical Segmentation by Horizontal Cuts.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2025
Same author

Stripe noise removal in conductive atomic force microscopy.

Scientific reports·2024
Same author

Effects of mobile phone usage on sperm quality - No time-dependent relationship on usage: A systematic review and updated meta-analysis.

Environmental research·2021
Same author

Distributed Connected Component Filtering and Analysis in 2D and 3D Tera-Scale Data Sets.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2021
Same author

A Hybrid Shared-Memory Parallel Max-Tree Algorithm for Extreme Dynamic-Range Images.

IEEE transactions on pattern analysis and machine intelligence·2017
Same journal

TraGraph-GS: Trajectory Graph-based Gaussian Splatting for Arbitrary Large-Scale Scene Rendering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

SWIFT: A Small-World Interaction Framework for Flow-Aware Trajectory Prediction in Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Adaptive Hardness-Driven Dictionary Distillation for Incomplete Streaming View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Mixture of Global and Local Experts with Diffusion Transformer for Controllable Face Generation.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

Related Experiment Video

Updated: Jul 8, 2025

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

42.9K

A Fast Alpha-Tree Algorithm for Extreme Dynamic Range Pixel Dissimilarities.

Jiwoo Ryu, Scott C Trager, Michael H F Wilkinson

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |December 13, 2023
    PubMed
    Summary
    This summary is machine-generated.

    A new hierarchical heap priority queue significantly speeds up the alpha-tree algorithm for image analysis. This advancement enhances the efficiency of processing complex remote sensing and medical images.

    More Related Videos

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
    08:12

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

    Published on: March 1, 2022

    2.5K
    A Technical Perspective in Modern Tree-ring Research - How to Overcome Dendroecological and Wood Anatomical Challenges
    09:33

    A Technical Perspective in Modern Tree-ring Research - How to Overcome Dendroecological and Wood Anatomical Challenges

    Published on: March 5, 2015

    29.1K

    Related Experiment Videos

    Last Updated: Jul 8, 2025

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
    13:44

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

    Published on: August 30, 2013

    42.9K
    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
    08:12

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

    Published on: March 1, 2022

    2.5K
    A Technical Perspective in Modern Tree-ring Research - How to Overcome Dendroecological and Wood Anatomical Challenges
    09:33

    A Technical Perspective in Modern Tree-ring Research - How to Overcome Dendroecological and Wood Anatomical Challenges

    Published on: March 5, 2015

    29.1K

    Area of Science:

    • Computer Vision
    • Image Processing
    • Data Structures

    Background:

    • The alpha-tree algorithm is a key hierarchical representation for image analysis, particularly for remote sensing and medical imaging.
    • Traditional alpha-tree algorithms often rely on priority queues, which can be inefficient with extreme-dynamic-range pixel dissimilarities, leading to slower performance compared to methods like component trees.

    Purpose of the Study:

    • To introduce a novel hierarchical heap priority queue designed for more efficient processing of alpha-tree edges.
    • To address the performance limitations of traditional priority queues in alpha-tree algorithms dealing with high-contrast image data.

    Main Methods:

    • Development of a novel hierarchical heap priority queue algorithm.
    • Integration and testing of the proposed priority queue within the flooding alpha-tree algorithm.
    • Experimental evaluation using 48-bit Sentinel-2 A remote sensing images and randomly generated datasets.

    Main Results:

    • The proposed hierarchical heap priority queue demonstrated significant improvements in the execution speed of the flooding alpha-tree algorithm.
    • Speedups of 1.68x (4-N) and 2.41x (8-N) were observed on Sentinel-2 A images.
    • Even greater speedups of 2.56x (4-N) and 4.43x (8-N) were achieved on randomly generated images.

    Conclusions:

    • The novel hierarchical heap priority queue offers a substantial performance enhancement for alpha-tree algorithms.
    • This improved efficiency is particularly notable when processing images with extreme-dynamic-range pixel values, such as remote sensing data.
    • The algorithm provides a more efficient alternative to standard priority queues for complex image analysis tasks.