Collective sensing: a fixed-point approach in the metric space

  title={Collective sensing: a fixed-point approach in the metric space},
  author={Xin Li},
  booktitle={Visual Communications and Image Processing},
  • Xin Li
  • Published in
    Visual Communications and…
    11 July 2010
  • Computer Science
Conventional wisdom in signal processing heavily relies on the concept of inner product defined in the Hilbert space. Despite the popularity of Hilbert-space formulation, we argue it is overly-structured to account for the complexity of signals arising from the real-world. Inspired by the works on fractal image decoding and nonlocal image processing, we propose to view an image as the fixed-point of some nonexpansive mapping in the metric space in this paper. Recently proposed BM3D-based… 

Fine-Granularity and Spatially-Adaptive Regularization for Projection-Based Image Deblurring

  • Xin Li
  • Mathematics
    IEEE Transactions on Image Processing
  • 2011
This paper studies two classes of regularization strategies to achieve an improved tradeoff between image recovery and noise suppression in projection-based image deblurring. The first is based on a

A Study of the Structural Similarity Image Quality Measure with Applications to Image Processing

It is demonstrated how the SSIM index can be transformed into a distance metric and the hypothesis that the main source of selfsimilarity of images lies in their regions of low variance is confirmed.

Chapter 1 Patch-Based Image Processing : from Dictionary Learning to Structural Clustering

Under the context of JPEG compression, fast advances of communication and computing technologies in later 1980s and early 1990s stimulated the research into image compression especially the development of standard.

On the Mathematical Properties of the Structural Similarity Index

A series of normalized and generalized metrics based on the important ingredients of SSIM are constructed and it is shown that such modified measures are valid distance metrics and have many useful properties, among which the most significant ones include quasi-convexity, a region of convexity around the minimizer, and distance preservation under orthogonal or unitary transformations.

SSIM-based non-local means image denoising

  • A. RehmanZhou Wang
  • Computer Science
    2011 18th IEEE International Conference on Image Processing
  • 2011
This work makes one of the first efforts to incorporate the structural similarity (SSIM) index, a successful perceptual image quality assessment measure, into the framework of non-local means (NLM) image denoising, which is a state-of-the-art method that delivers superior desnoising performance.

A Class of Image Metrics Based on the Structural Similarity Quality Index

A class of metrics for signals and images, considered as elements of RN, that are based upon the structural similarity (SSIM) index are derived, which shows that a suitable norm of an ordered pair of metrics defines a metric in RN.

SSIM-Inspired Quality Assessment, Compression, and Processing for Visual Communications

The goal of this research is to break the tradition of using MSE as the optimization criterion for image and video processing algorithms and tackle several important problems in visual communication applications by exploiting SSIM-inspired design and optimization to achieve significantly better performance.

Fractal Imaging Theory and Applications beyond Compression

The Natural Sciences and Engineering Research Council and the University of Guelph helped to provide financial support for this research.



Image coding based on a fractal theory of iterated contractive image transformations

  • A. Jacquin
  • Computer Science
    IEEE Trans. Image Process.
  • 1992
The author proposes an independent and novel approach to image coding, based on a fractal theory of iterated transformations, that relies on the assumption that image redundancy can be efficiently exploited through self-transformability on a block-wise basis and approximates an original image by a Fractal image.

Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction

The proposed general algorithm framework for inverse problem regularization with a single forward-backward operator step, namely, Bregmanized operator splitting (BOS), converges without fully solving the subproblems, and numerical results on deconvolution and compressive sensing illustrate the performance of nonlocal total variation regularization under the proposed algorithm framework.

Projection-based spatially adaptive reconstruction of block-transform compressed images

A spatially adaptive image recovery algorithm is proposed based on the theory of projections onto convex sets that captures both the local statistical properties of the image and the human perceptual characteristics.

Nonlinear approximation based image recovery using adaptive sparse reconstructions and iterated denoising-part II: adaptive algorithms

  • O. Guleryuz
  • Computer Science
    IEEE Transactions on Image Processing
  • 2006
This work shows that constructing estimates based on nonlinear approximants is fundamentally a nonconvex problem and proposes a progressive algorithm that is designed to deal with this issue directly and is applied to images through an extensive set of simulation examples.

Generalized Image Restoration by the Method of Alternating Orthogonal Projections

We adopt a view that suggests that many problems of image restoration are probably geometric in character and admit the following initial linear formulation: The original f is a vector known a priori

Image Denoising by Sparse 3-D Transform-Domain Collaborative Filtering

An algorithm based on an enhanced sparse representation in transform domain based on a specially developed collaborative Wiener filtering achieves state-of-the-art denoising performance in terms of both peak signal-to-noise ratio and subjective visual quality.

Nonlocal Operators with Applications to Image Processing

This topic can be viewed as an extension of spectral graph theory and the diffusion geometry framework to functional analysis and PDE-like evolutions to define new types of flows and functionals for image processing and elsewhere.

Redundancy reduction revisited

This paper argues that the original hypothesis was wrong in over-emphasizing the role of compressive coding and economy in neuron numbers, but right in drawing attention to the importance of redundancy.

Deterministic annealing for clustering, compression, classification, regression, and related optimization problems

  • K. Rose
  • Computer Science
    Proc. IEEE
  • 1998
The deterministic annealing approach to clustering and its extensions has demonstrated substantial performance improvement over standard supervised and unsupervised learning methods in a variety of

Set theoretic compression with an application to image coding

  • N. T. ThaoM. Vetterli
  • Computer Science
    Proceedings of 1st International Conference on Image Processing
  • 1994
We discuss the concept of set theoretic compression where the input signal is implicitly encoded by the specification of a set which contains it, rather than an estimate which approximates it. This