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

Buffers02:56

Buffers

170.6K
A solution containing appreciable amounts of a weak conjugate acid-base pair is called a buffer solution, or a buffer. Buffer solutions resist a change in pH when small amounts of a strong acid or a strong base are added. A solution of acetic acid and sodium acetate is an example of a buffer that consists of a weak acid and its salt: CH3COOH (aq) + CH3COONa (aq). An example of a buffer that consists of a weak base and its salt is a solution of ammonia and ammonium chloride: NH3 (aq) + NH4Cl...
170.6K
Types of Collisions - II01:19

Types of Collisions - II

9.2K
When two or more objects collide with each other, they can stick together to form one single composite object (after collision). The total mass of the object after the collision is the sum of the masses of the original objects, and it moves with a velocity dictated by the conservation of momentum. Although the system's total momentum remains constant, the kinetic energy decreases, and thus such a collision is an inelastic collision. Most of the collisions between objects in daily life are...
9.2K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

7.7K
The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
7.7K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

3.3K
3.3K
Bulk Modulus01:21

Bulk Modulus

566
The bulk modulus is a scientific term used to describe a material's resistance to uniform compression. It is the proportionality constant that links a change in pressure to the resulting relative volume change.
566
Parallel Processing01:20

Parallel Processing

451
The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
451

You might also read

Related Articles

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

Sort by
Same author

Beyond Foundation Models: Distilling Geometric Priors for Lightweight Monocular Depth Estimation in Endoscopy.

IEEE transactions on medical imaging·2026
Same author

Bilateral Sharpness-Aware Minimization for Flatter Minima.

IEEE transactions on neural networks and learning systems·2026
Same author

Robust learning for ridge-penalized quasi-GLMs under non-identical distributions.

Scientific reports·2025
Same author

EMOv2: Pushing 5M Vision Model Frontier.

IEEE transactions on pattern analysis and machine intelligence·2025
Same author

Aligning Text-to-Image Diffusion Models With Constrained Reinforcement Learning.

IEEE transactions on pattern analysis and machine intelligence·2025
Same author

Temporal Feature Matters: A Framework for Diffusion Model Quantization.

IEEE transactions on pattern analysis and machine intelligence·2025
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
Same journal

Task-KV: Task-aware KV Cache Optimization via Semantic Differentiation of Attention Heads.

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

Achieving Text-based Person Retrieval with Any Granularity.

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

Related Experiment Video

Updated: Nov 27, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

952

Fast Class-Wise Updating for Online Hashing.

Mingbao Lin, Rongrong Ji, Xiaoshuai Sun

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

    This study introduces Fast Class-wise Updating for Online Hashing (FCOH), an efficient method for updating image hash functions online. FCOH improves adaptivity and efficiency, significantly reducing storage and training time for large-scale data processing.

    More Related Videos

    Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae
    08:52

    Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae

    Published on: December 22, 2023

    4.5K
    A Protocol for Real-time 3D Single Particle Tracking
    10:16

    A Protocol for Real-time 3D Single Particle Tracking

    Published on: January 3, 2018

    15.2K

    Related Experiment Videos

    Last Updated: Nov 27, 2025

    Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
    05:30

    Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

    Published on: September 8, 2023

    952
    Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae
    08:52

    Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae

    Published on: December 22, 2023

    4.5K
    A Protocol for Real-time 3D Single Particle Tracking
    10:16

    A Protocol for Real-time 3D Single Particle Tracking

    Published on: January 3, 2018

    15.2K

    Area of Science:

    • Computer Science
    • Machine Learning
    • Data Science

    Background:

    • Online image hashing processes large datasets in a streaming fashion.
    • Existing supervised methods lack adaptivity and efficiency due to extensive training requirements.
    • Current methods struggle with on-the-fly hash function updates.

    Purpose of the Study:

    • To propose a novel supervised online hashing scheme, Fast Class-wise Updating for Online Hashing (FCOH).
    • To address the limitations of existing methods in adaptivity and efficiency for online learning.
    • To enable fast and efficient updates of hash functions for large-scale streaming data.

    Main Methods:

    • Introduced a novel inner product operation for efficient computation.
    • Developed a class-wise updating method to decompose binary code learning.
    • Implemented a semi-relaxation optimization to accelerate online training by treating constraints independently.

    Main Results:

    • Achieved fast online adaptivity through class-wise renewal of hash functions.
    • Reduced storage requirements by at least 75% due to decomposition.
    • Significantly decreased time complexity by treating binary constraints independently.
    • Preserved past information effectively during hash function updates.

    Conclusions:

    • FCOH offers superior performance compared to state-of-the-art methods.
    • The combination of class-wise updating and semi-relaxation optimization enhances both adaptivity and efficiency.
    • FCOH is validated through extensive experiments on multiple datasets.