Skip to main content
Log in

Two iterative methods of decomposition of a fuzzy relation for image compression/decompression processing

  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

A decomposition problem of max–min type for a fuzzy relation is proposed. A fast method is derived by transforming slightly the derivatives in the traditional gradient algorithm and by updating simultaneously the prototype relation. The complexities of the proposed algorithm, with respect to the traditional gradient one, are decreased to approximately 1/c, where “c” denotes the Schein rank of the fuzzy relation involved. A dual decomposition problem of max–min type is also formulated and a similar fast method is presented. Both methods are applied to image compression/decompression processing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to H. Nobuhara.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nobuhara, H., Hirota, K., Pedrycz, W. et al. Two iterative methods of decomposition of a fuzzy relation for image compression/decompression processing. Soft Computing 8, 698–704 (2004). https://doi.org/10.1007/s00500-003-0319-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-003-0319-6

Keywords