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

Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

5.6K
The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an...
5.6K
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

20.8K
It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
20.8K
Deconvolution01:20

Deconvolution

728
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...
728
Structural Classification of Joints01:20

Structural Classification of Joints

9.0K
Joints, also known as articulations, are classified based on their structural characteristics, i.e., based on whether the articulating surfaces of the adjacent bones are directly connected by fibrous connective tissue or cartilage, or whether the articulating surfaces contact each other within a fluid-filled joint cavity. These differences serve to divide the joints of the body into three structural classifications.
A fibrous joint is where the adjacent bones are united by fibrous connective...
9.0K
Normal and Tangetial Components: Problem Solving01:24

Normal and Tangetial Components: Problem Solving

710
Consider a man with a mass of 70 kg seated in a chair connected to a pin support through a member BC. If the man maintains an upright position, the task is to determine the horizontal and vertical reactions of the chair on the man when the member makes a 45° angle with the horizontal. At this moment, the man has a speed of 5 m/s, increasing at a rate of 1 m/s².
710
Aggregates Classification01:29

Aggregates Classification

1.2K
Aggregate classification is generally based on its size, petrographic characteristics, weight, and source. Size classification ranges from coarse to fine aggregates, defined by the size of the particles. Coarse aggregates are particles that do not pass through ASTM sieve No. 4, and aggregates that pass through the sieve are fine aggregates.
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...
1.2K

You might also read

Related Articles

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

Sort by
Same author

Brain-inspired spatial intelligence for embodied agents.

Nature communications·2026
Same author

Improving Viewpoint Robustness for Visual Recognition via Adversarial Training.

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

Efficient, Robust, and Anti-Collusion Fingerprinting of Image Diffusion Models.

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

A dual-pronged strategy: multi-bioactive nanoplatform synergizes ROS antidote and iron stabilization to protect against liver ischemia-reperfusion injury.

Journal of nanobiotechnology·2026
Same author

Effects of whole lotus root powder particle size on gel properties and microstructure of duck emulsified sausage: Underlying mechanisms of gelling behavior.

Food chemistry·2026
Same author

A Policy-Driven Black-Box Adversarial Example With Location Optimization Against 3D Object Detection.

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

An Evolutionary Algorithm Assisted by an Ensemble of Pareto-Optimal Surrogate Models.

IEEE transactions on cybernetics·2026
Same journal

A Quantum Self-Attention Neural Network Model on Quantum Circuits.

IEEE transactions on cybernetics·2026
Same journal

Semi-Explicit Solution of Some Discrete-Time Higher-Order-Cost Mean-Field-Type Control.

IEEE transactions on cybernetics·2026
Same journal

A Novel One-Step Small Object Detector for Autonomous Aerial Vehicles.

IEEE transactions on cybernetics·2026
Same journal

Online Data-Driven-Based Optimal Output Tracking Control Without Initial Stabilizing Policy.

IEEE transactions on cybernetics·2026
Same journal

Digital Redesign-Based Interval State Estimation for Continuous Systems With Aperiodic Discrete Measurements.

IEEE transactions on cybernetics·2026
See all related articles

Related Experiment Video

Updated: Apr 19, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.5K

Robust Face Clustering Via Tensor Decomposition.

Xiaochun Cao, Xingxing Wei, Yahong Han

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

    This study introduces robust tensor clustering (RTC), a novel algorithm for face clustering. RTC effectively handles variations in pose, expression, and illumination, offering improved accuracy and noise resilience in image and video analysis.

    More Related Videos

    Automated Joint Space Detection Improves Bone Segmentation Accuracy
    06:45

    Automated Joint Space Detection Improves Bone Segmentation Accuracy

    Published on: November 28, 2025

    300
    Quantification of Orofacial Phenotypes in Xenopus
    09:26

    Quantification of Orofacial Phenotypes in Xenopus

    Published on: November 6, 2014

    10.4K

    Related Experiment Videos

    Last Updated: Apr 19, 2026

    Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
    12:27

    Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

    Published on: February 15, 2017

    7.5K
    Automated Joint Space Detection Improves Bone Segmentation Accuracy
    06:45

    Automated Joint Space Detection Improves Bone Segmentation Accuracy

    Published on: November 28, 2025

    300
    Quantification of Orofacial Phenotypes in Xenopus
    09:26

    Quantification of Orofacial Phenotypes in Xenopus

    Published on: November 6, 2014

    10.4K

    Area of Science:

    • Computer Vision
    • Machine Learning
    • Data Science

    Background:

    • Face clustering is crucial for image and video analysis.
    • Real-world facial data presents challenges like pose, expression, and illumination variations.
    • Noise, occlusions, and disguises degrade face clustering performance.

    Purpose of the Study:

    • Develop a robust face clustering algorithm resilient to various noise types.
    • Improve the accuracy and reliability of face clustering in challenging conditions.

    Main Methods:

    • Represent facial images using tensors to preserve structured information.
    • Employ robust tensor clustering (RTC) utilizing L1 norm optimization for noise reduction.
    • Apply non-greedy high-order singular value decomposition for enhanced clustering.

    Main Results:

    • RTC demonstrates superior performance compared to state-of-the-art clustering algorithms.
    • The algorithm exhibits significant robustness against various noise types in facial data.
    • Experiments on benchmark datasets validate the effectiveness of RTC.

    Conclusions:

    • Robust tensor clustering (RTC) offers a powerful solution for accurate and noise-resilient face clustering.
    • Tensor-based representation and L1 norm optimization are key to RTC's robustness.
    • RTC advances the field of face clustering for image and video analysis applications.