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

State Space Representation01:27

State Space Representation

The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Fast Fourier Transform01:10

Fast Fourier Transform

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...
Convolution Properties II01:17

Convolution Properties II

The important convolution properties include width, area, differentiation, and integration properties.
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...

You might also read

Related Articles

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

Sort by
Same author

CaWRKY8 participates in the defense response of pepper to pepper mild mottle virus by negatively regulating the expression of defense-related genes.

Plant science : an international journal of experimental plant biology·2026
Same author

Bridging the Gap between <i>In Vitro</i> and Intracellular: Systematic Analysis and Screening Optimization of Inconsistencies between Target Activity and Cellular-Level Activity.

Journal of medicinal chemistry·2026
Same author

Discovery of a Novel Thienopyrimidine Derivative as a Potent Dual URAT1/GLUT9 Inhibitor with Enhanced Urate-Lowering Efficacy, Superior Pharmacokinetics, and Favorable Safety Profile for Gout and Hyperuricemia.

Journal of medicinal chemistry·2026
Same author

PSMa: Learning Protein Surface Representations with Physicochemical Masked Autoencoders.

Journal of chemical information and modeling·2026
Same author

Differential inhibition of Morbillivirus and Henipavirus polymerases by ERDRP-0519 and structure-guided inhibitor optimization.

Cell·2026
Same author

PhenoModel: A multimodal phenotypic drug design foundation model for discovering novel potential inhibitors of multiple cancer cells.

Acta pharmaceutica Sinica. B·2026
Same journal

Mask-guided Asymmetric Contrastive and Semantic Alignment for Unsupervised Person Re-Identification.

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

Hyperbolic Cycle Alignment for Infrared-Visible Image Fusion.

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

Learning Gaze Synthesizer via 3D-eye Controlled Diffusion and Cross-domain Feature Alignment.

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

Underlying Semantic Diffusion for Effective and Efficient In-Context Learning.

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

DiffRES: Unleashing Text-to-Image Diffusion Models for Generative Referring Expression Segmentation without Information Leakage.

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

Location Matters: Frequency-Spatial Dual Space Adaptation for Cross-Domain Few-Shot Segmentation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles

Related Experiment Videos

Sparse representation with kernels.

Shenghua Gao1, Ivor Wai-Hung Tsang, Liang-Tien Chia

  • 1School of Computer Engineering, Nanyang Technological University, 639798, Singapore. gaos0004@ntu.edu.sg

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|September 28, 2012
PubMed
Summary
This summary is machine-generated.

Kernel sparse representation (KSR) enhances computer vision by enabling sparse coding in high-dimensional spaces. This method improves image classification, face recognition, and kernel matrix approximation.

Related Experiment Videos

Area of Science:

  • Computer Vision
  • Machine Learning
  • Kernel Methods

Background:

  • Sparse coding (Sc) has shown initial success in computer vision tasks.
  • Kernel trick captures nonlinear feature similarity, aiding sparse representation of nonlinear features.

Purpose of the Study:

  • Propose Kernel Sparse Representation (KSR) as a sparse coding technique in high-dimensional feature spaces.
  • Apply KSR to image classification, face recognition, and kernel matrix approximation.

Main Methods:

  • Developed KSR by mapping features to a high-dimensional space via an implicit function.
  • Integrated KSR into Spatial Pyramid Matching (SPM) to create KSRSPM for image classification.
  • Utilized KSR with a histogram intersection kernel (HIK) for feature coding.

Main Results:

  • KSRSPM achieved good performance in image classification.
  • KSR demonstrated higher accuracy and more discriminative sparse codes for face recognition compared to Sc.
  • KSR showed robustness in kernel matrix approximation, particularly with limited data.

Conclusions:

  • KSR is effective for feature coding, generalizing efficient match kernel and extending Sc-based SPM.
  • KSR offers a soft assignment extension of HIK-based feature quantization.
  • KSR proves effective across diverse computer vision and machine learning applications, including image classification, face recognition, and kernel matrix approximation.