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

Principal Moments of Area01:14

Principal Moments of Area

In mechanics, the product of inertia and moments of inertia of area help to calculate the stability and performance of various structures and components. The coordinate transformation relations are used to calculate the moments and products of inertia for an area about the inclined axes. Further, the moments and products of inertia with respect to the principal axes can be determined using the moments and products of inertia about the inclined axes.
The principal moment of inertia axes are the...
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

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...
Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
Difference from Background: Limit of Detection01:05

Difference from Background: Limit of Detection

The limit of detection (LOD) is the smallest amount of analyte that can be distinguished from the background noise. The LOD value corresponds to the concentration at which the analyte signal is three times larger than the standard deviation of the blank signal. Below this value, the analyte signal cannot be differentiated from the background noise. It is calculated by dividing the calibration slope by 3 times the standard deviation of the blank signals.
The LOD indicates the presence or absence...
Associative Learning01:27

Associative Learning

Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...
Insensitive Nuclei Enhanced by Polarization Transfer (INEPT)01:15

Insensitive Nuclei Enhanced by Polarization Transfer (INEPT)

Insensitive Nuclei Enhanced by Polarization Transfer (INEPT) is an advanced Nuclear Magnetic Resonance (NMR) technique specifically designed to detect and enhance the signals of low-abundance nuclei, such as carbon-13 and nitrogen-15, in small molecules. The fundamental principle behind INEPT is the transfer of polarization from a more abundant and highly polarizable nucleus, typically hydrogen-1, to the low-abundance nucleus of interest. This process effectively boosts the NMR signal of the...

You might also read

Related Articles

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

Sort by
Same author

XOV-Action: Towards Generalizable Open-Vocabulary Action Recognition.

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

Decoupled Seg Tokens Make Stronger Reasoning Video Segmenter and Grounder.

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

Enhancing Lesion Segmentation via Medical Image-Mask Pair Synthesis using Phenotype-Conditioned Diffusion Models.

IEEE journal of biomedical and health informatics·2026
Same author

EcoRxAgent: an AI agent for generating economically substitutable prescriptions.

NPJ digital medicine·2026
Same author

Double Nonconvex Tensor Robust Kernel Principal Component Analysis and Its Visual Applications.

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

Laboratory Test-Guided Medical Image Generation for Multi-Modal Disease Prediction.

IEEE transactions on medical imaging·2026
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

Related Experiment Video

Updated: Jun 16, 2026

Identification of Disease-related Spatial Covariance Patterns using Neuroimaging Data
14:27

Identification of Disease-related Spatial Covariance Patterns using Neuroimaging Data

Published on: June 26, 2013

Penalized preimage learning in kernel principal component analysis.

Wei-Shi Zheng1, JianHuang Lai, Pong C Yuen

  • 1School of Mathematics and Computational Science, Sun Yat-sen University, Guangzhou, China. wszheng@ieee.org

IEEE Transactions on Neural Networks
|February 11, 2010
PubMed
Summary
This summary is machine-generated.

This study introduces a penalized strategy to improve preimage estimation in kernel principal component analysis (KPCA). The new method enhances image preprocessing by guiding the learning process for better preimage reconstruction.

More Related Videos

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

Related Experiment Videos

Last Updated: Jun 16, 2026

Identification of Disease-related Spatial Covariance Patterns using Neuroimaging Data
14:27

Identification of Disease-related Spatial Covariance Patterns using Neuroimaging Data

Published on: June 26, 2013

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

Area of Science:

  • Machine Learning
  • Computer Vision
  • Data Science

Background:

  • Kernel Principal Component Analysis (KPCA) is vital for image preprocessing, but finding the exact preimage of feature vectors is challenging as it often doesn't exist in the input space.
  • Current approximate preimage estimation methods in kernel methods are ill-posed, making it difficult to achieve 'good' estimations and posing an open problem in guiding this learning process.

Purpose of the Study:

  • To develop a penalized strategy for guiding preimage learning in KPCA to achieve better estimations.
  • To propose a two-step general framework for modeling preimages via weighted combinations of observed samples, optimizing combination weights.

Main Methods:

  • A penalized methodology is developed, integrating two types of penalizations: a convexity constraint for well-defined preimages within data ranges and a penalized function to guide learning.
  • Weakly supervised, Laplacian, and ridge penalties are proposed, discussed, and evaluated, with the weakly supervised penalty interpreted as preserving pointwise conditional mutual information.
  • The framework transforms preimage learning into optimizing combination weights, offering advantages over existing techniques.

Main Results:

  • The penalized methodology, particularly with the weakly supervised penalty, significantly improves preimage estimation in KPCA.
  • Application of KPCA with the proposed preimage learning on face image datasets for tasks like expression normalization, denoising, occlusion recovery, and illumination normalization yielded superior results.
  • Experimental results demonstrate lower mean square error (MSE) and enhanced visual quality in reconstructed images compared to existing methods.

Conclusions:

  • The developed penalized strategy effectively guides preimage learning in KPCA, addressing the ill-posed nature of estimation.
  • The proposed two-step framework and integration of convexity constraints and specific penalties offer a robust approach to preimage reconstruction.
  • The method shows significant practical utility in various image processing applications, achieving both quantitative (MSE) and qualitative improvements.