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

Association Areas of the Cortex01:21

Association Areas of the Cortex

10.6K
Association areas are regions of the cerebral cortex that do not have a specific sensory or motor function. Instead, they integrate and interpret information from various sources to enable higher cognitive processes such as memory, learning, and decision-making. Some key association areas include the following:
Prefrontal Association Area: This area is located in the frontal lobe and is involved in planning, decision-making, and moderating social behavior. It connects with primary motor areas,...
10.6K
IR Frequency Region: Fingerprint Region01:03

IR Frequency Region: Fingerprint Region

2.3K
IR spectra are divided into two main regions: the diagnostic region and the fingerprint region. The diagnostic region of the spectrum lies above 1500 cm−1. The absorptions resulting from single-bond vibrations of the N–H, C–H, and O–H stretch at higher wavenumbers and appear on the left side of the spectrum. The stretching absorptions of the C≡C and C≡N occur between 2100–2300 cm−1. In contrast, those arising from stretching absorptions of the...
2.3K
Fast Fourier Transform01:10

Fast Fourier Transform

1.2K
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...
1.2K

You might also read

Related Articles

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

Sort by
Same author

RAD51 gene is associated with advanced age-related macular degeneration in Chinese population.

Clinical biochemistry·2013
Same author

Immunization against recombinant GnRH-I alters ultrastructure of gonadotropin cell in an experimental boar model.

Reproductive biology and endocrinology : RB&E·2013
Same author

Multi-class constrained normalized cut with hard, soft, unary and pairwise priors and its applications to object segmentation.

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

Comparison of genomic and amino acid sequences of eight Japanese encephalitis virus isolates from bats.

Archives of virology·2013
Same author

Regulation of dendritic cell differentiation in bone marrow during emergency myelopoiesis.

Journal of immunology (Baltimore, Md. : 1950)·2013
Same author

Separation of mandelic acid and its derivatives with new immobilized cellulose chiral stationary phase.

Journal of Zhejiang University. Science. B·2013
Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

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

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

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

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

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

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

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

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

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

Learning Shape Anchors for Holistic Indoor Scene Understanding.

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

Related Experiment Video

Updated: Apr 4, 2026

Human Brown Adipose Tissue Depots Automatically Segmented by Positron Emission Tomography/Computed Tomography and Registered Magnetic Resonance Images
09:21

Human Brown Adipose Tissue Depots Automatically Segmented by Positron Emission Tomography/Computed Tomography and Registered Magnetic Resonance Images

Published on: February 18, 2015

12.7K

Learning Compact Binary Face Descriptor for Face Recognition.

Jiwen Lu, Venice Erin Liong, Xiuzhuang Zhou

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |September 5, 2015
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a compact binary face descriptor (CBFD) for robust face recognition. The method learns compact binary codes from pixel differences, outperforming existing hand-crafted descriptors.

    More Related Videos

    Simultaneous Brightfield, Fluorescence, and Optical Coherence Tomographic Imaging of Contracting Cardiac Trabeculae Ex Vivo
    12:54

    Simultaneous Brightfield, Fluorescence, and Optical Coherence Tomographic Imaging of Contracting Cardiac Trabeculae Ex Vivo

    Published on: October 2, 2021

    3.8K
    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 4, 2026

    Human Brown Adipose Tissue Depots Automatically Segmented by Positron Emission Tomography/Computed Tomography and Registered Magnetic Resonance Images
    09:21

    Human Brown Adipose Tissue Depots Automatically Segmented by Positron Emission Tomography/Computed Tomography and Registered Magnetic Resonance Images

    Published on: February 18, 2015

    12.7K
    Simultaneous Brightfield, Fluorescence, and Optical Coherence Tomographic Imaging of Contracting Cardiac Trabeculae Ex Vivo
    12:54

    Simultaneous Brightfield, Fluorescence, and Optical Coherence Tomographic Imaging of Contracting Cardiac Trabeculae Ex Vivo

    Published on: October 2, 2021

    3.8K
    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
    • Biometrics

    Background:

    • Binary feature descriptors like Local Binary Patterns (LBP) are vital for face recognition due to robustness and discriminative power.
    • Existing descriptors are often hand-crafted, necessitating significant domain expertise.
    • There is a need for automated, efficient binary feature learning methods for face representation.

    Purpose of the Study:

    • To propose a novel compact binary face descriptor (CBFD) learning method for enhanced face representation and recognition.
    • To develop an unsupervised feature learning approach that generates discriminative and compact binary codes.
    • To introduce a coupled CBFD (C-CBFD) for addressing the modality gap in heterogeneous face recognition.

    Main Methods:

    • Extracting pixel difference vectors (PDVs) from local image patches.
    • Unsupervised learning of a feature mapping to project PDVs into low-dimensional binary codes, optimizing variance, minimizing reconstruction loss, and ensuring even code distribution.
    • Clustering and pooling binary codes into histogram features for final face representation.
    • Developing C-CBFD to reduce feature-level modality gaps for heterogeneous recognition.

    Main Results:

    • The proposed CBFD method effectively learns compact and discriminative binary codes.
    • CBFD demonstrates superior performance compared to traditional hand-crafted binary descriptors.
    • The C-CBFD variant shows significant improvements in heterogeneous face recognition tasks.
    • Experiments on five benchmark datasets validate the effectiveness of both CBFD and C-CBFD.

    Conclusions:

    • The proposed CBFD feature learning method offers a powerful alternative to hand-crafted descriptors for face recognition.
    • The unsupervised learning approach effectively captures essential facial information in compact binary codes.
    • C-CBFD provides a viable solution for heterogeneous face recognition by bridging modality gaps.
    • The methods show state-of-the-art performance, highlighting their potential for real-world applications.