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

Deconvolution01:20

Deconvolution

154
Deconvolution, also known as inverse filtering, is the process of extracting the impulse response from known input and output signals. This technique is vital in scenarios where the system's characteristics are unknown, and they must be inferred from the observable signals.
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
154
Filtration00:53

Filtration

815
Filtration is a physical separation process that involves passing a suspension through a porous medium to separate solids from fluids. During filtration, solids collect on the porous medium while liquids, also collectively known as the filtrate, pass through. The filtration medium is selected based on the filtration purpose, quantity, and nature of the precipitate. The general criteria for a suitable filtering medium are that it is inert, mechanically strong, nonabsorbent toward dissolved...
815
Fast Fourier Transform01:10

Fast Fourier Transform

305
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
305
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

305
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
305
¹³C NMR: Distortionless Enhancement by Polarization Transfer (DEPT)01:20

¹³C NMR: Distortionless Enhancement by Polarization Transfer (DEPT)

1.0K
When proton-coupled carbon-13 spectra are simplified by a broadband proton decoupling technique, structural information about the coupled protons is lost. Distortionless enhancement by polarization transfer (DEPT) is a technique that provides information on the number of hydrogens attached to each carbon in a molecule. While the DEPT experiment utilizes complex pulse sequences, the pulse delay and flip angle are specifically manipulated. The resulting signals have different phases depending on...
1.0K
Downsampling01:20

Downsampling

153
When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
153

You might also read

Related Articles

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

Sort by
Same author

Bacillus Subtilis THC1I Restores Intestinal Barrier Integrity and Gut Microbiota Balance in a Mouse Model of Antibiotic-Associated Diarrhea.

Current microbiology·2026
Same author

Dynamic chain for scheduling of the multi-AGV systems with load-aware motion profiling.

Scientific reports·2026
Same author

Coupled Tensor Decomposition for Compact Network Representation.

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

Singular values-driven automated filter pruning.

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

RRT-CS: A free-collision planner for capsule-like SCORBOT by iterated learning.

PloS one·2025
Same author

Design and implementation of a field robot using a parallelogram mechanism.

Science progress·2024
Same journal

Dynamic analysis and reliable mechanical optimization application of ring HNN effected with a memristive neuron.

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

DAFF-Net: A detection and search method for small-scale low surface brightness galaxies.

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

Quasi-synchronization for complex networks with hybrid pinning intermittent control.

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

Physics-encoded convolutional neural operators for parametric PDEs: A convergence-guaranteed framework via pre-computed kernel fields.

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

Exploiting audio-visual modalities in videos: Object detection via multi-stage bilateral coupling network.

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

Reliability-aware modality completion with cross-modal distillation for federated learning with missing modalities.

Neural networks : the official journal of the International Neural Network Society·2026
See all related articles

Related Experiment Video

Updated: Jun 24, 2025

Air Filter Devices Including Nonwoven Meshes of Electrospun Recombinant Spider Silk Proteins
09:51

Air Filter Devices Including Nonwoven Meshes of Electrospun Recombinant Spider Silk Proteins

Published on: May 8, 2013

16.2K

Efficient tensor decomposition-based filter pruning.

Van Tien Pham1, Yassine Zniyed1, Thanh Phuong Nguyen1

  • 1Université de Toulon, Aix Marseille University, CNRS, LIS UMR 7020, France.

Neural Networks : the Official Journal of the International Neural Network Society
|June 3, 2024
PubMed
Summary
This summary is machine-generated.

We introduce CORING (efficient tensor decomposition-based filter pruning), a novel neural network pruning method. CORING uses tensor decomposition to significantly reduce model complexity while maintaining accuracy across various vision tasks.

Keywords:
Filter pruningNetwork compressionTensor decompositions

More Related Videos

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique
04:48

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique

Published on: July 5, 2024

388
Design and Characterization Methodology for Efficient Wide Range Tunable MEMS Filters
15:25

Design and Characterization Methodology for Efficient Wide Range Tunable MEMS Filters

Published on: February 4, 2018

6.1K

Related Experiment Videos

Last Updated: Jun 24, 2025

Air Filter Devices Including Nonwoven Meshes of Electrospun Recombinant Spider Silk Proteins
09:51

Air Filter Devices Including Nonwoven Meshes of Electrospun Recombinant Spider Silk Proteins

Published on: May 8, 2013

16.2K
Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique
04:48

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique

Published on: July 5, 2024

388
Design and Characterization Methodology for Efficient Wide Range Tunable MEMS Filters
15:25

Design and Characterization Methodology for Efficient Wide Range Tunable MEMS Filters

Published on: February 4, 2018

6.1K

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Machine Learning

Background:

  • Neural network pruning is crucial for reducing computational costs and memory footprints.
  • Conventional pruning methods often rely on simplified filter representations, potentially losing information.
  • There is a need for efficient pruning techniques that preserve network performance.

Purpose of the Study:

  • To introduce CORING (efficient tensor decomposition-based filter pruning), a novel filter pruning methodology for neural networks.
  • To leverage tensor decomposition for efficient and effective neural network compression.
  • To demonstrate CORING's superiority over existing state-of-the-art pruning methods.

Main Methods:

  • CORING utilizes tensor decomposition, specifically Higher-Order Singular Value Decomposition (HOSVD), to approximate filters in their multidimensional form.
  • A novel filter similarity metric is introduced, based on HOSVD's low-rank approximation, enhancing efficiency.
  • The methodology was tested across diverse neural network architectures and datasets for various computer vision tasks.

Main Results:

  • CORING significantly reduces Multiply-Accumulate operations (MACs) and parameters compared to state-of-the-art methods.
  • The method consistently improves validation accuracy across image classification, object detection, instance segmentation, and keypoint detection tasks.
  • Ablation studies and qualitative results confirm the efficiency of the tensor-based approach and the retention of essential network features.

Conclusions:

  • CORING offers an efficient and effective approach to neural network filter pruning using tensor decomposition.
  • The method achieves superior compression rates while enhancing model accuracy.
  • CORING represents a significant advancement in model optimization for deep learning applications.