Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Methods of Medium Optimization

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

Optimal Foraging

Optimal Foraging

How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.

Optimization Problems

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...

Expected Frequencies in Goodness-of-Fit Tests

Expected Frequencies in Goodness-of-Fit Tests

A goodness-of-fit test is conducted to determine whether the observed frequency values are statistically similar to the frequencies expected for the dataset. Suppose the expected frequencies for a dataset are equal such as when predicting the frequency of any number appearing when casting a die. In that case, the expected frequency is the ratio of the total number of observations (n) to the number of categories (k).

Types of Selection

Types of Selection

Natural selection influences the frequencies of particular alleles and phenotypes within populations in several different ways. Primarily, natural selection can be directional, stabilizing, or disruptive. Directional selection favors one extreme trait and shifts the population towards that phenotype while selecting against individuals displaying alternate traits. Stabilizing selection favors an intermediate trait with a narrow range of variation. Deviation from the optimal phenotype towards an...

Heuristics

Heuristics

Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...

You might also read

Related Articles

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

Sort by

Same author

Toward a fundamental theory of optimal feature selection: part I.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

Phase analysis of an optical complex array multiplication system.

Optics letters·2009

Same author

Rigid body constrained noisy point pattern matching.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·1995

See all related articles

Search research articles

Related Experiment Video

Updated: May 29, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Toward a Fundamental Theory of Optimal Feature Selection: Part II-Implementation and Computational Complexit.

¹Department of Electrical Engineering, McGill University, 3480 University Street, Montreal, P.Q. H3A 2A7, Canada.

IEEE Transactions on Pattern Analysis and Machine Intelligence

|August 27, 2011

Summary

This study optimizes real-time pattern classification using VLSI by developing a parallel algorithm for eigensystem decomposition. This approach significantly reduces computational complexity for pattern recognition and signal processing applications.

Related Experiment Videos

Last Updated: May 29, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Area of Science:

Computer Engineering
Signal Processing
Pattern Recognition

Background:

VLSI implementation of real-time pattern classifiers requires efficient algorithms.
Computational complexity is a major bottleneck, especially during classifier training.

Purpose of the Study:

To examine algorithms and their computational complexity for VLSI implementation of a real-time pattern classifier.
To develop a parallelizable eigensystem decomposition method for centrosymmetric matrices.

Main Methods:

Analysis of computational complexity for VLSI-based pattern classification.
Operator-based eigensystem decomposition for centrosymmetric matrices.
Implementation of specialized matrix-arithmetic modules in linear arrays.

Main Results:

A parallel algorithm architecture is achieved for centrosymmetric matrices using operator-based decomposition.
Specialized modules require O(N) processing elements and O(N) time steps.
Significant reduction in computational operations compared to conventional methods (O(N^3)) and Levinson algorithm (O(2N^2)).

Conclusions:

The proposed parallel approach offers substantial computational efficiency for VLSI pattern classifiers.
This method is applicable to various pattern recognition and signal processing tasks.
Novel two-stage iterative method shows promise for eigensystem decomposition.