• Corpus ID: 911803

Geometric approach to sampling and communication

  title={Geometric approach to sampling and communication},
  author={Emil Saucan and Eli Appleboim and Yehoshua Y. Zeevi},
Relationships that exist between the classical, Shannon-type, and geometric-based approaches to sampling are investigated. Some aspects of coding and communication through a Gaussian channel are considered. In particular, a constructive method to determine the quantizing dimension in Zador's theorem is provided. A geometric version of Shannon's Second Theorem is introduced. Applications to Pulse Code Modulation and Vector Quantization of Images are addressed. 
Geometric Sampling of Images, Vector Quantization and Zador's Theorem
We present several consequences of the geometric approach to image sampling and reconstruction we have previously introduced. We single out the relevance of the geometric method to the vector
Isometric Embeddings in Imaging and Vision: Facts and Fiction
  • E. Saucan
  • Computer Science, Mathematics
    Journal of Mathematical Imaging and Vision
  • 2011
This work investigates the relevance of a result of Burago and Zalgaller regarding the existence of PL isometric embeddings of polyhedral surfaces in ℝ3 and shows that their proof does not extended directly to higher dimensions.
Metric curvatures and their applications I
We present, in a natural, developmental manner, the main types of metric curvatures and investigate their relationship with the notions of Hausdorff and Gromov-Hausdorff distances, which by now have
A Simple Sampling Method for Metric Measure Spaces
  • E. Saucan
  • Mathematics, Computer Science
  • 2011
We introduce a new, simple metric method of sampling metric measure spaces, based on a well-known "snowflakeing operator" and we show that, as a consequence of a classical result of Assouad, the
Geometric Wavelets for Image Processing: Metric Curvature of Wavelets
We introduce a semi-discrete version of the FinslerHaantjes metric curvature to define curvature for wavelets and show that scale and curvature play similar roles with respect to image presentation
Generalized Ricci curvature based sampling and reconstruction of images
We introduce a novel method of image sampling based on viewing grayscale images as manifolds with density, and sampling them according to the generalized Ricci curvature introduced by Bakry, Emery
Metric Ricci curvature for $PL$ manifolds
  • E. Saucan
  • Mathematics, Computer Science
  • 2012
A fitting version of the Bonnet-Myers theorem is proved, for surfaces as well as for a large class of higher dimensional manifolds, and a metric notion of Ricci curvature is introduced.
Network Topology vs. Geometry: From persistent Homology to Curvature
Among the methods for data analysis, and mainly for the understanding of the shape of the data, as obtained by sampling of some underlying structure (the intended final object of such a study) the so
Metric Curvatures Revisited: A Brief Overview
We survey metric curvatures, special accent being placed upon the Wald curvature, its relationship with Alexandrov curvature, as well as its application in defining a metric Ricci curvature for PL
Homotopic Object Reconstruction Using Natural Neighbor Barycentric Coordinates
  • Ojaswa Sharma, F. Anton
  • Mathematics, Computer Science
    2010 International Symposium on Voronoi Diagrams in Science and Engineering
  • 2010
This paper addresses the problem of 2D object reconstruction from arbitrary linear cross sections through continuous deformations of line intersections in the plane and defines Voronoi diagram based barycentric coordinates on the edges of n-sided convex polygons as the area stolen by any point inside a polygon from the Vor onoi regions of each open oriented line segment bounding the polygon.


Sampling and Reconstruction of Surfaces and Higher Dimensional Manifolds
This work presents new sampling theorems for surfaces and higher dimensional manifolds and shows how to apply the main results to obtain a new, geometric proof of the classical Shannon sampling theorem, and also to image analysis.
Communication in the presence of noise
A method is developed for representing any communication system geometrically. Messages and the corresponding signals are points in two "function spaces," and the modulation process is a mapping of
Geometric Sampling For Signals With Applications to Images 1 SampTA 2007 – June 1-5 , 2007 , Thessaloniki , Greece
We present a non uniform version of the sampling theorems introduced in [15], [16]. In addition, we show that the geometric sampling scheme produces sparse sampling for gray scale images.
Sampling, data transmission, and the Nyquist rate
The sampling theorem for bandlimited signals of finite energy can be interpreted in two ways, associated with the names of Nyquist and Shannon. 1) Every signal of finite energy and bandwidth W Hz may
A mathematical theory of communication
  • C. Shannon
  • Computer Science, Mathematics
    Bell Syst. Tech. J.
  • 1948
In this final installment of the paper we consider the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now. To a
Nonuniform sampling and antialiasing in image representation
A unified approach to the representation and processing of a class of images which are not bandlimited but belong to the space of locally bandlimited signals is presented. A nonuniform sampling
Sampling-50 years after Shannon
  • M. Unser
  • Mathematics
    Proceedings of the IEEE
  • 2000
This paper presents an account of the current state of sampling, 50 years after Shannon's formulation of the sampling theorem. The emphasis is on regular sampling, where the grid is uniform. This
Sampling Principle for Continuous Signals with Time-Varying Bands
  • K. Horiuchi
  • Mathematics, Computer Science
    Inf. Control.
  • 1968
The reproduction problems of the original signals from the nonuniformly sampled pulse trains are discussed, from the standpoints of both the exact and approximate theories.
Uncertainty principles and signal recovery
The uncertainty principle can easily be generalized to cases where the “sets of concentration” are not intervals. Such generalizations are presented for continuous and discrete-time functions, and
Sphere Packings, Lattices and Groups
  • J. Conway, N. Sloane
  • Mathematics, Computer Science
    Grundlehren der mathematischen Wissenschaften
  • 1988
The second edition of this book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space? The authors also continue to