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

Optimization Problems01:26

Optimization Problems

214
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
214
Methods of Medium Optimization01:28

Methods of Medium Optimization

68
Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
68
Compacting Factor test01:22

Compacting Factor test

759
The compacting factor test is a method used to assess the workability of concrete. It is  especially suitable for concrete mixes containing aggregates up to one and a half inches in size. This test involves specialized equipment consisting of two truncated cone-shaped hoppers and a cylinder, all with polished interior surfaces to minimize friction.
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...
759
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

616
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
616
Mismatch Repair01:20

Mismatch Repair

5.4K
Organisms are capable of detecting and fixing nucleotide mismatches that occur during DNA replication. This sophisticated process requires identifying the new strand and replacing the erroneous bases with correct nucleotides. Mismatch repair is coordinated by many proteins in both prokaryotes and eukaryotes.
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...
5.4K
Mismatch Repair01:36

Mismatch Repair

37.8K
Overview
37.8K

You might also read

Related Articles

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

Sort by
Same author

The Effects of Visual-Olfactory Interactions With Moving Particles on EEG-Based Emotional Classification in AR Environments.

IEEE transactions on visualization and computer graphics·2026
Same author

DriveGen: Shared Video-Condition Encoding for Autonomous Multi-View Video Generation.

IEEE transactions on visualization and computer graphics·2026
Same author

Clinical determinants of retinal age gap estimated from fundus photographs in glaucoma patients.

Scientific reports·2026
Same author

Memory-efficient divide-and-conquer attention for lightweight image super-resolution.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

Recent Progress of Single-Ion Conducting Polymer Electrolytes for Rechargeable Mono- and Multivalent Cation-Based Metal Batteries.

Angewandte Chemie (International ed. in English)·2026
Same author

MPLDM: Multi-modal prosthetic loosening diagnostic model for total hip arthroplasty.

Medical image analysis·2025
Same journal

Robust Semiglobal and Global Stabilization for Nonlinear Normal Form Systems by Time-Varying Feedback.

IEEE transactions on cybernetics·2026
Same journal

Adaptive Global Asymptotic Output Stabilization of Uncertain Nonlinear Systems Under Dynamic State/Input Quantization.

IEEE transactions on cybernetics·2026
Same journal

Accelerated Distributed Gradient Tracking for Constrained Aggregative Optimization Over Time-Varying Digraphs.

IEEE transactions on cybernetics·2026
Same journal

Small-Gain-Based Plug-and-Play Distributed Control Framework for DC Microgrids With Decentralized Reconfiguration.

IEEE transactions on cybernetics·2026
Same journal

Prescribed-Time Impulsive Control of High-Order Integrator Systems.

IEEE transactions on cybernetics·2026
Same journal

Relaxed Stability Conditions for Model Predictive Control of Hybrid Dynamical Systems Using Hybrid Recurrent Neural Networks.

IEEE transactions on cybernetics·2026
See all related articles

Related Experiment Video

Updated: Apr 23, 2026

Oncogenic Gene Fusion Detection Using Anchored Multiplex Polymerase Chain Reaction Followed by Next Generation Sequencing
09:49

Oncogenic Gene Fusion Detection Using Anchored Multiplex Polymerase Chain Reaction Followed by Next Generation Sequencing

Published on: July 5, 2019

9.1K

Robust Match Fusion Using Optimization.

Xiameng Qin, Jianbing Shen, Xiaoyang Mao

    IEEE Transactions on Cybernetics
    |September 24, 2014
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a novel patch-based algorithm for fusing multiple exposure images, effectively preserving moving objects in dynamic scenes without prior alignment. The method avoids ghosting artifacts, offering visually pleasing results.

    More Related Videos

    Improving the Combustion Performance of a Hybrid Rocket Engine using a Novel Fuel Grain with a Nested Helical Structure
    07:58

    Improving the Combustion Performance of a Hybrid Rocket Engine using a Novel Fuel Grain with a Nested Helical Structure

    Published on: January 18, 2021

    5.6K

    Related Experiment Videos

    Last Updated: Apr 23, 2026

    Oncogenic Gene Fusion Detection Using Anchored Multiplex Polymerase Chain Reaction Followed by Next Generation Sequencing
    09:49

    Oncogenic Gene Fusion Detection Using Anchored Multiplex Polymerase Chain Reaction Followed by Next Generation Sequencing

    Published on: July 5, 2019

    9.1K
    Improving the Combustion Performance of a Hybrid Rocket Engine using a Novel Fuel Grain with a Nested Helical Structure
    07:58

    Improving the Combustion Performance of a Hybrid Rocket Engine using a Novel Fuel Grain with a Nested Helical Structure

    Published on: January 18, 2021

    5.6K

    Area of Science:

    • Computer Vision
    • Image Processing
    • Computational Photography

    Background:

    • Exposure fusion aims to combine multiple images with varying exposures into a single, well-exposed image.
    • Dynamic scenes with moving objects pose challenges for traditional fusion methods, often resulting in ghosting artifacts.
    • Existing methods frequently require image registration (alignment) before fusion, adding computational complexity.

    Purpose of the Study:

    • To develop a novel patch-based algorithm for exposure fusion that accurately handles moving objects in dynamic scenes.
    • To eliminate the need for pre-alignment of multiple exposure image sequences.
    • To achieve ghosting-free fusion results superior to current state-of-the-art techniques.

    Main Methods:

    • A uniform iterative approach is employed to match corresponding patches across different exposure images.
    • A new patch-based energy function is optimized to enhance matching accuracy, considering exposure time variations.
    • The random walker algorithm is utilized for efficient patch-based exposure fusion, preserving moving object details.

    Main Results:

    • The proposed algorithm successfully fuses multiple exposure image sequences of dynamic scenes without ghosting artifacts.
    • Experimental results demonstrate visually pleasing fusion outcomes, outperforming existing exposure fusion and tone mapping algorithms.
    • The method effectively preserves moving objects, a significant improvement over techniques prone to ghosting.

    Conclusions:

    • This patch-based approach represents a novel solution for exposure fusion in dynamic scenes, specifically addressing moving object preservation.
    • The algorithm's ability to perform fusion without image registration simplifies the process and enhances efficiency.
    • The developed method offers a robust and effective way to generate high-quality, artifact-free fused images from dynamic scene sequences.