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...
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Multi-input and Multi-variable systems01:22

Multi-input and Multi-variable systems

Cruise control systems in cars are designed as multi-input systems to maintain a driver's desired speed while compensating for external disturbances such as changes in terrain. The block diagram for a cruise control system typically includes two main inputs: the desired speed set by the driver and any external disturbances, such as the incline of the road. By adjusting the engine throttle, the system maintains the vehicle's speed as close to the desired value as possible.
In the absence of...
Transfer Function to State Space01:23

Transfer Function to State Space

State-space representation is a powerful tool for simulating physical systems on digital computers, necessitating the conversion of the transfer function into state-space form. Consider an nth-order linear differential equation with constant coefficients, like those encountered in an RLC circuit. The state variables are selected as the output and its n−1 derivatives. Differentiating these variables and substituting them back into the original equation produces the state equations.
In an RLC...
State Space to Transfer Function01:21

State Space to Transfer Function

The conversion of state-space representation to a transfer function is a fundamental process in system analysis. It provides a method for transitioning from a time-domain description to a frequency-domain representation, which is crucial for simplifying the analysis and design of control systems.
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...

You might also read

Related Articles

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

Sort by
Same author

Adaptive Mixtures of Local Experts.

Neural computation·2019
Same author

The Potential Energy of an Autoencoder.

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

Modeling natural images using gated MRFs.

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

Learning to relate images.

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

Machine learning for neuroscience.

Neural systems & circuits·2012
Same author

Shared Kernel Information Embedding for discriminative inference.

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

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

Related Experiment Videos

Learning to represent spatial transformations with factored higher-order Boltzmann machines.

Roland Memisevic1, Geoffrey E Hinton

  • 1Department of Computer Science, University of Toronto, Toronto M5S 3G4, Canada. roland@cs.toronto.edu

Neural Computation
|February 10, 2010
PubMed
Summary
This summary is machine-generated.

This study introduces a low-rank approximation for modeling image transformations using restricted Boltzmann machines. The method efficiently learns optimal filter pairs for representing transformations and performing visual analogy tasks.

Related Experiment Videos

Area of Science:

  • Artificial Intelligence
  • Machine Learning
  • Computer Vision

Background:

  • Restricted Boltzmann machines (RBMs) traditionally model pairwise interactions.
  • Modeling transformations between images requires complex, high-order interactions.
  • Previous methods, like Memisevic and Hinton's (2007), used three-way interactions leading to cubic parameter growth.

Purpose of the Study:

  • To develop a computationally efficient method for modeling image transformations using RBMs.
  • To introduce a low-rank approximation for the three-dimensional interaction tensor in RBMs.
  • To demonstrate the model's ability to learn optimal filter pairs for image transformation representation.

Main Methods:

  • A low-rank approximation of the three-way interaction tensor is proposed, represented as a sum of factorized outer products.
  • Each factor is interpreted as a pair of image filters.
  • The model is trained on synthetic and real image sequences to learn these filter pairs.

Main Results:

  • The low-rank approximation enables efficient learning of transformations between larger image patches.
  • The model successfully learns optimal filter pairs for representing image transformations.
  • The unsupervised network trained on transformations demonstrates human-like perception of transparent dot pattern motions.

Conclusions:

  • The proposed low-rank approximation significantly improves the efficiency of modeling image transformations in RBMs.
  • Learned filter pairs effectively capture essential transformation characteristics.
  • The model shows potential for unsupervised learning of visual perception and analogy tasks.