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

Thouless-Anderson-Palmer approach for lossy compression.

Tatsuto Murayama1

  • 1RIKEN Brain Science Institute, Hirosawa 2-1, Wako, Saitama 351-0198, Japan.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|April 20, 2004
PubMed
Summary

This study presents an iterative algorithm for sparse matrix-based binary sequence reproduction. The algorithm empirically achieves near-optimal data compression, approaching theoretical limits for sparse code construction.

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

Rate distortion theorem and the multicritical point of a spin glass.

Physical review. Eยท2020
See all related articles

Area of Science:

  • Information Theory
  • Computational Mathematics
  • Signal Processing

Background:

  • Studying ill-posed linear inverse problems involving sparse matrix reconstruction.
  • Theoretical models suggest optimal compression for arbitrary distortion levels.
  • Encoding remains an NP-complete challenge.

Purpose of the Study:

  • Develop an iterative algorithm for sparse binary sequence reproduction.
  • Address the NP-complete encoding problem in data compression.
  • Evaluate algorithm performance against theoretical limits.

Main Methods:

  • Utilizing a Markov-type dynamics model and its consistency condition.
  • Applying the Thouless-Anderson-Palmer (TAP) approach for algorithm derivation.
  • Conducting numerical simulations to validate the algorithm's efficacy.

Main Results:

  • The derived iterative algorithm empirically saturates theoretical limits for sparse code construction.
  • Achieved compression rates closely approximate the theoretical rate-distortion function.
  • Demonstrated practical feasibility for sparse matrix-based data compression.

Conclusions:

  • The proposed iterative algorithm offers an effective solution for sparse binary sequence reproduction.
  • The method bridges the gap between theoretical compression limits and practical implementation.
  • Advances in information theory and computational methods for data compression.

Related Experiment Videos