Optimal image alignment with random projections of manifolds: algorithm and geometric analysis

Effrosyni Kokiopoulou1, Daniel Kressner, Pascal Frossard

  • 1Seminar for Applied Mathematics, Department of Mathematics, ETH Zurich, CH-8092 Zurich, Switzerland. effrosyni.kokiopoulou@sam.math.ethz.ch

Summary

This study presents a new method for image alignment using random measurements. The approach optimizes transformations by solving a difference of convex (DC) program, enabling accurate image registration.

Related Concept Videos

Coordinates and Map Projections01:29

Coordinates and Map Projections

Coordinates and map projections are essential tools in accurately representing the Earth's surface for various applications, ranging from navigation to spatial analysis. The latitude and longitude coordinate system is a universally recognized framework for defining locations. Latitude specifies the distance of a point north or south of the equator, measured in degrees from 0° at the equator to 90° at the poles. Longitude indicates a location's position east or west of the prime meridian,...
Optimization Problems01:26

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...
Orthogonal Trajectories01:26

Orthogonal Trajectories

Orthogonal trajectories describe the geometric relationship between two families of curves that intersect each other at right angles. One illustrative case involves a family of parabolas that open sideways along the x-axis. These curves share a common shape but differ by a scaling parameter, resulting in a set of curves that all pass through the origin and widen at different rates.Determining Orthogonal TrajectoriesTo identify the orthogonal trajectories for these parabolas, the first step...
Gauss's Law: Planar Symmetry01:27

Gauss's Law: Planar Symmetry

A planar symmetry of charge density is obtained when charges are uniformly spread over a large flat surface. In planar symmetry, all points in a plane parallel to the plane of charge are identical with respect to the charges. Suppose the plane of the charge distribution is the xy-plane, and the electric field at a space point P with coordinates (x, y, z) is to be determined. Since the charge density is the same at all (x, y) - coordinates in the z = 0 plane, by symmetry, the electric field at P...
Geometry of Hyperbolas01:30

Geometry of Hyperbolas

A hyperbola consists of all points where the absolute difference of distances to two fixed points, called foci, remains constant. The standard equation isEach branch extends infinitely and approaches two asymptotes, which guide the curve’s behavior. The parameters a and b define key features: a measures the distance from the center to each vertex along the transverse axis, while b influences the slopes of the asymptotes. The asymptotes have equationsA rectangle centered at the origin with...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...