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

Centroid for the Paraboloid of Revolution01:16

Centroid for the Paraboloid of Revolution

The paraboloid of revolution is an axially symmetric surface generated by rotating a parabola around its axis. This shape has several applications in mechanical engineering due to its advantageous structural properties, such as strength against stress concentration points and rotational symmetry.
The centroid for the paraboloid of revolution is the point where all the mass of the paraboloid is concentrated. This centroid is important for engineering applications, as it determines how forces are...
Methods of Obtaining Topography01:25

Methods of Obtaining Topography

Topography involves measuring and mapping land elevations, natural features, and artificial structures to create accurate representations of the terrain. Topographic surveying relies on traditional and modern methods, each with distinct advantages and limitations.Traditional Surveying Methods:Transit stadia surveys and plane table surveys were widely used traditional surveying methods. These techniques relied on instruments like theodolites and stadia rods for measuring distances and angles,...
Area Computation by the Alternative Coordinate Method01:24

Area Computation by the Alternative Coordinate Method

The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...

You might also read

Related Articles

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

Sort by
Same author

A vendor-neutral functional MRI acquisition protocol for multi-site studies.

Aperture neuroยท2026
Same author

Phantom- and simulation-based validation of combined diffusion relaxometry in ex vivo ADRD white matter.

bioRxiv : the preprint server for biologyยท2026
Same author

Smooth optimization using global and local low-rank regularizers.

SIAM journal on imaging sciencesยท2026
Same author

Bilevel Optimized Implicit Neural Representation for Scan-Specific Accelerated MRI Reconstruction.

IEEE transactions on medical imagingยท2026
Same author

Scan-Adaptive MRI Undersampling Using Neighbor-based Optimization (SUNO).

IEEE transactions on computational imagingยท2026
Same author

Spatiotemporal Maps for Dynamic MRI Reconstruction.

IEEE transactions on computational imagingยท2026

Related Experiment Video

Updated: Jul 7, 2026

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
06:25

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Published on: February 12, 2014

Image recovery using partitioned-separable paraboloidal surrogate coordinate ascent algorithms.

Saowapak Sotthivirat1, Jeffrey A Fessler

  • 1Dept. of Electr. Eng. and Comput. Sci., Michigan Univ., Ann Arbor, MI 48109-2122, USA. ssotthiv@eecs.umich.edu

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|February 5, 2008
PubMed
Summary
This summary is machine-generated.

This study introduces a novel parallelizable algorithm for image recovery, significantly reducing computation time. The new method enhances efficiency for parallel computing, outperforming traditional sequential algorithms.

More Related Videos

Photorealistic Learned Landscapes for Augmented Reality
06:54

Photorealistic Learned Landscapes for Augmented Reality

Published on: June 27, 2025

Related Experiment Videos

Last Updated: Jul 7, 2026

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
06:25

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Published on: February 12, 2014

Photorealistic Learned Landscapes for Augmented Reality
06:54

Photorealistic Learned Landscapes for Augmented Reality

Published on: June 27, 2025

Area of Science:

  • Image processing and computational imaging.
  • Optimization algorithms and parallel computing.

Background:

  • Iterative coordinate ascent algorithms are effective for image recovery but limited by their sequential nature, hindering parallelization.
  • Existing methods struggle with efficient parallel computation for image restoration tasks.

Purpose of the Study:

  • To develop a fast-converging, parallelizable algorithm for image recovery applicable to a wide range of objective functions.
  • To overcome the limitations of sequential algorithms in parallel computing environments for image restoration.

Main Methods:

  • The algorithm utilizes paraboloidal surrogate functions to simplify the optimization problem.
  • A concavity technique partitions pixels into subsets for parallel updates, reducing computation time.
  • Sequential coordinate ascent is applied within each subset for rapid convergence.

Main Results:

  • The proposed algorithm monotonically increases the objective function and handles nonnegativity constraints.
  • Simulation results demonstrate reduced elapsed time for convergence compared to iterative coordinate ascent algorithms.
  • A speedup factor of 3.77 was achieved on four parallel processors for a 3-D confocal image restoration problem.

Conclusions:

  • The new algorithm offers a significant improvement in speed and efficiency for image recovery tasks.
  • Its parallelizable nature makes it well-suited for modern high-performance computing architectures.
  • This method provides a robust and efficient solution for complex image restoration problems.