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

Upsampling01:22

Upsampling

188
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
188
¹H NMR: Interpreting Distorted and Overlapping Signals01:02

¹H NMR: Interpreting Distorted and Overlapping Signals

989
Spin systems where the difference in chemical shifts of the coupled nuclei is greater than ten times J are called first-order spin systems. These nuclei are weakly coupled, and their chemical shifts and coupling constant can generally be estimated from the well-separated signals in the spectrum.
As Δν decreases and the signals move closer, the doublets appear increasingly distorted. The intensities of the inner lines increase at the cost of those of the outer lines as the signals are...
989
Fast Fourier Transform01:10

Fast Fourier Transform

252
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...
252
2D NMR: Heteronuclear Single-Quantum Correlation Spectroscopy (HSQC)01:19

2D NMR: Heteronuclear Single-Quantum Correlation Spectroscopy (HSQC)

614
Heteronuclear single-quantum correlation spectroscopy (HSQC) is a 2D NMR technique that reveals one-bond correlations between hydrogen and a heteronucleus. The HSQC experiment is similar to the heteronuclear correlation experiment (HETCOR) but is more sensitive. In the HSQC spectrum, the proton chemical shift is plotted on the horizontal F2 axis, while the 13C chemical shift is plotted on the vertical F1 axis. The corresponding proton and 13C spectra are also shown. The HSQC contour plot does...
614
Downsampling01:20

Downsampling

121
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...
121
Cluster Sampling Method01:20

Cluster Sampling Method

11.6K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
11.6K

You might also read

Related Articles

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

Sort by
Same author

Unsupervised feature selection via row-sparse local preserving projection.

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

A Unified Framework for Pseudo-Supervised Clustering via Weighted Sample Aggregation.

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

Projection with mixed-size anchor graphs.

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

SimMTC: Simple Multi-View Tensor Clustering.

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

Unsupervised fine-tuning of vision-language models by fusing classifier tuning and visual prompt tuning.

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

IB2MC: Information Bottleneck Inspired Balanced Multiview Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026

Related Experiment Video

Updated: May 24, 2025

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

2.4K

Harmonic Fast One-Step Cut: An Efficient Strategy for Spectral Clustering Optimization.

Jingwei Chen, Shasha Fu, Hui Yang

    IEEE Transactions on Neural Networks and Learning Systems
    |March 3, 2025
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a new spectral clustering method that avoids common issues like high computational cost and poor accuracy. The harmonic fast one-step graph cut (HFOC) offers superior clustering performance efficiently.

    More Related Videos

    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
    05:12

    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

    Published on: January 16, 2019

    11.3K
    High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis
    13:31

    High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis

    Published on: December 22, 2015

    14.9K

    Related Experiment Videos

    Last Updated: May 24, 2025

    ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
    07:11

    ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

    Published on: August 19, 2021

    2.4K
    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
    05:12

    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

    Published on: January 16, 2019

    11.3K
    High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis
    13:31

    High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis

    Published on: December 22, 2015

    14.9K

    Area of Science:

    • Data Science
    • Machine Learning
    • Computer Vision

    Background:

    • Spectral clustering (SC) is widely applied but suffers from high computational complexity and multi-step processes.
    • Traditional SC's objective function (maximizing arithmetic mean of trace ratios) can be dominated by larger objectives, impacting recognition accuracy.
    • Existing methods often require regularization or constraints to address limitations.

    Purpose of the Study:

    • To propose a novel graph cut criterion for spectral clustering that overcomes limitations of traditional methods.
    • To develop an efficient one-step solution for spectral clustering.
    • To address the worst-cluster issue without regularization or constraints.

    Main Methods:

    • Introduced a new graph cut criterion minimizing the trace ratios of the harmonic mean.
    • Employed an efficient coordinate descent (CD) method for a one-step optimization.
    • Developed the harmonic fast one-step graph cut (HFOC) algorithm.

    Main Results:

    • The proposed HFOC method effectively avoids the worst-cluster issue.
    • HFOC achieves superior clustering performance compared to state-of-the-art methods.
    • The method demonstrates relatively less time consumption.

    Conclusions:

    • The novel graph cut criterion and one-step solution effectively address key challenges in spectral clustering.
    • HFOC offers a unified framework for improved clustering accuracy and efficiency.
    • The method shows significant advantages over existing spectral clustering techniques.