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 Experiment Videos

Memory-efficient iterative process on a two-dimensional first-order regular graph.

S C Park1, H Jeong

  • 1Electronic Department, Pohang University of Science and Technology, Pohang 790-784, South Korea. mrzoo@postech.ac.kr

Optics Letters
|December 25, 2007
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

Proton Radiotherapy with Induction Chemotherapy for Locally Advanced Pancreatic Cancer: A Retrospective Analysis of Treatment Strategy and Outcomes.

Clinical oncology (Royal College of Radiologists (Great Britain))·2026
Same author

Three-dimensional echocardiographic determinants of the early onset of myxomatous mitral valve disease within two years in young Cavalier King Charles spaniel dogs.

Journal of veterinary cardiology : the official journal of the European Society of Veterinary Cardiology·2026
Same author

OPTIMAL: a multinational phase III study of oral paclitaxel (DHP107) versus intravenous weekly paclitaxel in HER2-negative recurrent or metastatic breast cancer.

Annals of oncology : official journal of the European Society for Medical Oncology·2026
Same author

Zinc Isotope Fingerprints in Juvenile Fishes from Estuarine Nurseries with Different Pollution Histories: Perspectives for Environmental Monitoring and Fish Ecology.

Environmental science & technology·2025
Same author

Molecular profile and clinical impact of MDM2 amplification in patients with advanced biliary tract cancer.

ESMO open·2025
Same author

Evidence of Coherent Elastic Neutrino-Nucleus Scattering with COHERENT's Germanium Array.

Physical review letters·2025
Same journal

Gaussian-modulated continuous-variable quantum key distribution over 60 km fiber using an integrated silicon photonic receiver.

Optics letters·2026
Same journal

E2E-OCT: end-to-end joint learning model using optical coherence tomography images for vocal cord leukoplakia diagnosis.

Optics letters·2026
Same journal

Holographic generation of panoramic 3D scenes by concave ellipsoidal mirror reflection.

Optics letters·2026
Same journal

Dual-pilot phase recovery with pair-wise maximum-ratio combining for coherent PONs.

Optics letters·2026
Same journal

Mapping the whispering gallery modes of a CaF<sub>2</sub> disk resonator with half-tapered fibers to estimate the fundamental mode volume.

Optics letters·2026
Same journal

Quantitative estimation of deep-subwavelength scale via dark-field scattering axial energy concentration decay profiles.

Optics letters·2026
See all related articles

This study introduces a parallel algorithm for regular graphs that significantly reduces memory usage. By optimizing computation order, memory needs decrease substantially for tasks like stereo vision and motion estimation.

Area of Science:

  • Computer Vision
  • Parallel Algorithms
  • Graph Theory

Background:

  • Iterative algorithms on regular graphs are crucial for many computational tasks.
  • High memory requirements can limit the scalability and efficiency of these algorithms.
  • Existing methods often struggle with memory constraints in large-scale problems.

Purpose of the Study:

  • To develop a memory-efficient parallel iterative algorithm for 2D regular graphs.
  • To significantly reduce memory resource requirements compared to conventional approaches.
  • To enhance the applicability of iterative graph algorithms in memory-intensive domains.

Main Methods:

  • The algorithm is based on 2D first-order regular graphs.
  • A specific computation order is carefully chosen to optimize memory usage.

Related Experiment Videos

  • The approach is designed for parallel processing environments.

    • Main Results:

    • Memory resources are reduced from O(MN) to O(ML) for an M x N graph with L iterations.
    • Achieved memory reduction factors ranging from 4 to 27 times.
    • Demonstrated effectiveness in computation-intensive applications like stereo vision and motion estimation.

    Conclusions:

    • The proposed algorithm offers substantial memory savings for iterative graph computations.
    • This memory efficiency enables processing of larger and more complex problems.
    • The method provides a practical solution for memory-bound computer vision tasks.