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

Lagrange Multipliers: Problem Solving

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...

Lagrange Multipliers: Two Constraints

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.

Lagrange Multipliers: One Constraint

Lagrange Multipliers: One Constraint

In constrained optimization, the objective is to maximize or minimize a quantity while satisfying a fixed condition. A standard example is a rectangular pen built against a barn wall using 100 meters of fencing. Because the wall provides one side of the enclosure, only the other three sides require fencing. The problem is to find the dimensions that produce the greatest possible area.Let L represent the length parallel to the wall and W the width perpendicular to it. The area of the pen is A =...

Sequence Networks of Rotating Machines

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

Vector Algebra: Graphical Method

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...

Graphs of Equations in Two Variables

Graphs of Equations in Two Variables

An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...

You might also read

Related Articles

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

Sort by

Same author

Feasibility of Passive ECG Bio-sensing and EMA Emotion Reporting Technologies and Acceptability of Just-in-Time Content in a Well-being Intervention, Considerations for Scalability and Improved Uptake.

Affective science·2022

Same author

Data-Driven Discovery of Extravasation Pathway in Circulating Tumor Cells.

Scientific reports·2017

Same author

Thrombospondin-1 repression is mediated via distinct mechanisms in fibroblasts and epithelial cells.

Oncogene·2015

Same author

Thrombospondin-1 repression is mediated via distinct mechanisms in fibroblasts and epithelial cells.

Oncogene·2014

Same author

Model of structuring the stem cell niche in shoot apical meristem of Arabidopsis thaliana.

Doklady biological sciences : proceedings of the Academy of Sciences of the USSR, Biological sciences sections·2013

Same author

Introduction of SV40ER and hTERT into mammospheres generates breast cancer cells with stem cell properties.

Oncogene·2011

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

A Lagrangian relaxation network for graph matching.

A Rangarajan¹, E D Mjolsness

¹Dept. of Diagnostic Radiol., Yale Univ., New Haven, CT.

IEEE Transactions on Neural Networks

|January 1, 1996

Summary

This summary is machine-generated.

This study introduces a Lagrangian relaxation network for graph matching, effectively finding correspondences between graph vertices. The method addresses symmetries in graph isomorphism to ensure accurate permutation matrix generation.

Related Experiment Videos

Last Updated: Jul 7, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

Area of Science:

Computer Science
Artificial Intelligence
Graph Theory

Background:

Graph matching is a fundamental problem in computer vision and pattern recognition.
Existing methods often struggle with symmetries inherent in graph isomorphism, leading to multiple solutions.
Deterministic annealing provides a framework for solving complex optimization problems.

Purpose of the Study:

To develop a novel Lagrangian relaxation network for solving the graph matching problem.
To address the challenge of symmetries in graph isomorphism by incorporating a symmetry-breaking term.
To formulate graph matching within a deterministic annealing framework.

Main Methods:

Formulating graph matching as finding a permutation matrix (M) between two graphs (G and g).
Utilizing Lagrangian relaxation by decomposing row and column constraints and using Lagrange multipliers.
Introducing a symmetry-breaking self-amplification term to resolve multiple global minima.
Applying a fixpoint-preserving algebraic transformation to distance and self-amplification terms.
Implementing a network that minimizes Lagrange parameters and maximizes permutation matrix variables.

Main Results:

The proposed Lagrangian relaxation network successfully generates a permutation matrix for graph matching.
The symmetry-breaking term effectively handles unavoidable symmetries in graph isomorphism.
Simulations on 100-node random graphs demonstrated the network's performance across various connectivities.

Conclusions:

The developed Lagrangian relaxation network offers an effective approach to graph matching.
The method provides a robust solution for problems with inherent symmetries.
The approach shows promise for applications in computer vision and related fields.