Leonid Yaroslavsky
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Leonid Yaroslavsky has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
I. Ideses
Tel Aviv University
3 shared publicationsB. Fishbain
Tel Aviv University
2 shared publicationsChad Goerzen
Department Physical Electronics, Faculty of Engineering, Tel Aviv University, Tel Aviv, Ramat Aviv, 69978, Israel
2 shared publicationsG. Shabat
Tel Aviv University
2 shared publications- H. John Caulfield
Physics Department Fisk University 1000 17th St. 37298 Nashville TN USA
2 shared publications Stanislav Umansky
Department Physical Electronics, Faculty of Engineering, Tel Aviv University, Tel Aviv, Ramat Aviv, 69978, Israel
2 shared publications
Latest Publications
- Open Access
Compressed Sensing, ASBSR-method of image sampling and reconstruction and the problem of digital image acquisition with the lowest possible sampling rate
The problem of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy is addressed. Basics of the sampling theory are outlined to show that the lower bound of signal sampling rate sufficient for signal reconstruction with a given accuracy is equal to the spectrum sparsity of the signal sparse approximation that has this accuracy. It is revealed that the compressed sensing approach, which was advanced as a solution to the sampling rate minimization problem, is far from reaching the sampling rate theoretical minimum. Potentials and limitations of compressed sensing are demystified using a simple and intutive model, A method of image Arbitrary Sampling and Bounded Spectrum Reconstruction (ASBSR-method) is described that allows to draw near the image sampling rate theoretical minimum. Presented and discussed are also results of experimental verification of the ASBSR-method and its possible applicability extensions to solving various underdetermined inverse problems such as color image demosaicing, image in-painting, image reconstruction from their sparsely sampled or decimated projections, image reconstruction from the modulus of its Fourier spectrum, and image reconstruction from its sparse samples in Fourier domain
Open AccessCompressed Sensing, ASBSR-method of image sampling and reconstruction and the problem of digital image acquisition with the lowest possible sampling rate
The problem of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy is addressed. Basics of the sampling theory are outlined to show that the lower bound of signal sampling rate sufficient for signal reconstruction with a given accuracy is equal to the spectrum sparsity of the signal sparse approximation that has this accuracy. It is revealed that the compressed sensing approach, which was advanced as a solution to the sampling rate minimization problem, is far from reaching the sampling rate theoretical minimum. Potentials and limitations of compressed sensing are demystified using a simple and intutive model, A method of image Arbitrary Sampling and Bounded Spectrum Reconstruction (ASBSR-method) is described that allows to draw near the image sampling rate theoretical minimum. Presented and discussed are also results of experimental verification of the ASBSR-method and its possible applicability extensions to solving various underdetermined inverse problems such as color image demosaicing, image in-painting, image reconstruction from their sparsely sampled or decimated projections, image reconstruction from the modulus of its Fourier spectrum, and image reconstruction from its sparse samples in Fourier domain
- Open Access
How can one sample images with sampling rates close to the theoretical minimum?
A problem is addressed of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy. A sampling theory based method of image sampling and reconstruction is suggested that allows to draw near the minimal rate of image sampling defined by the sampling theory. Presented and discussed are also results of experimental verification of the method and its possible applicability extensions.
Open AccessHow can one sample images with sampling rates close to the theoretical minimum?
A problem is addressed of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy. A sampling theory based method of image sampling and reconstruction is suggested that allows to draw near the minimal rate of image sampling defined by the sampling theory. Presented and discussed are also results of experimental verification of the method and its possible applicability extensions.
- 18 April 2017
- Published by IOP Publishing in Journal of Optics
- Vol. 19 (5) , 055706
How can one sample images with sampling rates close to the theoretical minimum?
A problem is addressed of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy. A sampling theory based method of image sampling and reconstruction is suggested that allows to draw near the minimal rate of image sampling defined by sampling theory. Presented and discussed are also results of experimental verification of the method and its possible applicability extensions.
- 18 April 2017
- Published by IOP Publishing in Journal of Optics
- Vol. 19 (5) , 055706
How can one sample images with sampling rates close to the theoretical minimum?
A problem is addressed of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy. A sampling theory based method of image sampling and reconstruction is suggested that allows to draw near the minimal rate of image sampling defined by sampling theory. Presented and discussed are also results of experimental verification of the method and its possible applicability extensions.
- Open Access
Can compressed sensing beat the Nyquist sampling rate?
Data saving capability of "Compressed sensing (sampling)" in signal discretization is disputed and found to be far below the theoretical upper bound defined by the signal sparsity. On a simple and intuitive example, it is demonstrated that, in a realistic scenario for signals that are believed to be sparse, one can achieve a substantially larger saving than compressing sensing can. It is also shown that frequent assertions in the literature that "Compressed sensing" can beat the Nyquist sampling approach are misleading substitution of terms and are rooted in misinterpretation of the sampling theory.
Open AccessCan compressed sensing beat the Nyquist sampling rate?
Data saving capability of "Compressed sensing (sampling)" in signal discretization is disputed and found to be far below the theoretical upper bound defined by the signal sparsity. On a simple and intuitive example, it is demonstrated that, in a realistic scenario for signals that are believed to be sparse, one can achieve a substantially larger saving than compressing sensing can. It is also shown that frequent assertions in the literature that "Compressed sensing" can beat the Nyquist sampling approach are misleading substitution of terms and are rooted in misinterpretation of the sampling theory.
- Open Access
Is "Compressed Sensing" compressive? Can it beat the Nyquist Sampling Approach?
Data compression capability of "Compressed sensing (sampling)" in signal discretization is numerically evaluated and found to be far from the theoretical upper bound defined by signal sparsity. It is shown that, for the cases when ordinary sampling with subsequent data compression is prohibitive, there is at least one more efficient, in terms of data compression capability, and more simple and intuitive alternative to Compressed sensing: random sparse sampling and restoration of image band-limited approximations based on energy compaction capability of transforms. It is also shown that assertions that "Compressed sensing" can beat the Nyquist sampling approach are rooted in misinterpretation of the sampling theory.
Open AccessIs "Compressed Sensing" compressive? Can it beat the Nyquist Sampling Approach?
Data compression capability of "Compressed sensing (sampling)" in signal discretization is numerically evaluated and found to be far from the theoretical upper bound defined by signal sparsity. It is shown that, for the cases when ordinary sampling with subsequent data compression is prohibitive, there is at least one more efficient, in terms of data compression capability, and more simple and intuitive alternative to Compressed sensing: random sparse sampling and restoration of image band-limited approximations based on energy compaction capability of transforms. It is also shown that assertions that "Compressed sensing" can beat the Nyquist sampling approach are rooted in misinterpretation of the sampling theory.
- Open Access
- 6 July 2014
- Published by Hindawi Limited in Advances in Electrical Engineering
- Vol. 2014, 1-23
Fast Transforms in Image Processing: Compression, Restoration, and Resampling
Transform image processing methods are methods that work in domains of image transforms, such as Discrete Fourier, Discrete Cosine, Wavelet, and alike. They proved to be very efficient in image compression, in image restoration, in image resampling, and in geometrical transformations and can be traced back to early 1970s. The paper reviews these methods, with emphasis on their comparison and relationships, from the very first steps of transform image compression methods to adaptive and local adaptive filters for image restoration and up to “compressive sensing” methods that gained popularity in last few years. References are made to both first publications of the corresponding results and more recent and more easily available ones. The review has a tutorial character and purpose.
- 6 July 2014
- Published by Hindawi Limited in Advances in Electrical Engineering
- Vol. 2014, 1-23
Open AccessFast Transforms in Image Processing: Compression, Restoration, and Resampling
Transform image processing methods are methods that work in domains of image transforms, such as Discrete Fourier, Discrete Cosine, Wavelet, and alike. They proved to be very efficient in image compression, in image restoration, in image resampling, and in geometrical transformations and can be traced back to early 1970s. The paper reviews these methods, with emphasis on their comparison and relationships, from the very first steps of transform image compression methods to adaptive and local adaptive filters for image restoration and up to “compressive sensing” methods that gained popularity in last few years. References are made to both first publications of the corresponding results and more recent and more easily available ones. The review has a tutorial character and purpose.
- Open Access
Self-controlled growth, coherent shrinkage, eternal life in a self-bounded space and other amazing evolutionary dynamics of stochastic pattern formation and growth models inspired by Conways Game of Life
Results of experimental investigation are presented of evolutionary dynamics of several stochastic pattern formation and growth models designed by modifications of the famous mathematical Game of Life. The modifications are two-fold: Game of Life rules are made stochastic and mutual influence of neighboring cells is made non-uniform. The results reveal a number of new phenomena in the evolutionary dynamics of the models: - Ordering of chaos to maze-like patterns: evolutionary formation, from arbitrary seed patterns, of stable maze-like patterns with chaotic dislocations that resemble natural patterns frequently found in the nature, such as skin patterns of some animals. The remarkable property of these patterns is their capability of unlimited growth, self-healing and transplantation. - Self-controlled growth of chaotic live formations into communities bounded, depending on the model, by a square, hexagon or octagon, until they reach a certain critical size, after which the growth stops. - Coherent shrinkage of mature, after reaching a certain size, communities into one of stable or oscillating patterns preserving in this process isomorphism of their bounding shapes until the very end. - Eternal life in a self-bounded space of communities: seemingly permanent birth/death activity of communities after they reach a certain size and shape.
Open AccessSelf-controlled growth, coherent shrinkage, eternal life in a self-bounded space and other amazing evolutionary dynamics of stochastic pattern formation and growth models inspired by Conways Game of Life
Results of experimental investigation are presented of evolutionary dynamics of several stochastic pattern formation and growth models designed by modifications of the famous mathematical Game of Life. The modifications are two-fold: Game of Life rules are made stochastic and mutual influence of neighboring cells is made non-uniform. The results reveal a number of new phenomena in the evolutionary dynamics of the models: - Ordering of chaos to maze-like patterns: evolutionary formation, from arbitrary seed patterns, of stable maze-like patterns with chaotic dislocations that resemble natural patterns frequently found in the nature, such as skin patterns of some animals. The remarkable property of these patterns is their capability of unlimited growth, self-healing and transplantation. - Self-controlled growth of chaotic live formations into communities bounded, depending on the model, by a square, hexagon or octagon, until they reach a certain critical size, after which the growth stops. - Coherent shrinkage of mature, after reaching a certain size, communities into one of stable or oscillating patterns preserving in this process isomorphism of their bounding shapes until the very end. - Eternal life in a self-bounded space of communities: seemingly permanent birth/death activity of communities after they reach a certain size and shape.
- Open Access
The amazing dynamics of stochastic pattern formation and growth models inspired by the Conway's Game of Life
Several modifications of the famous mathematical Game of Life are introduced by making Game of Life rules stochastic and mutual influence of cells in their 8-neighborhood on a rectangular lattice spatially non-uniform. Results are reported of experimental investigation of evolutionary dynamics of the introduced models. A number of new phenomena in the evolutionary dynamics of the models and collective behavior of patterns they generate are revealed, described and illustrated: formation of maze-like patterns as fixed points of the models, "self-controlled growth", "eternal life" in a bounded space and "coherent shrinkage".
Open AccessThe amazing dynamics of stochastic pattern formation and growth models inspired by the Conway's Game of Life
Several modifications of the famous mathematical Game of Life are introduced by making Game of Life rules stochastic and mutual influence of cells in their 8-neighborhood on a rectangular lattice spatially non-uniform. Results are reported of experimental investigation of evolutionary dynamics of the introduced models. A number of new phenomena in the evolutionary dynamics of the models and collective behavior of patterns they generate are revealed, described and illustrated: formation of maze-like patterns as fixed points of the models, "self-controlled growth", "eternal life" in a bounded space and "coherent shrinkage".
- Open Access
- 24 April 2010
- Published by Walter de Gruyter GmbH in Open Physics
- Vol. 8 (3) , 455-462
Optics-less smart sensors and a possible mechanism of cutaneous vision in nature
Although optics-less cutaneous (“skin”) vision is not uncommon among living organisms, its mechanisms and capabilities have not been thoroughly investigated. This paper demonstrates, using methods from statistical parameter estimation theory and numerical simulations, that arrays of bare radiation detectors arranged on a planar or curved surface have the ability to perform imaging tasks without any optics at all. The working principle of this type of optics-less sensors and the model developed here for determining their performance may be used to shed light on possible mechanisms, capabilities and evolution of cutaneous vision in nature.
- 24 April 2010
- Published by Walter de Gruyter GmbH in Open Physics
- Vol. 8 (3) , 455-462
Open AccessOptics-less smart sensors and a possible mechanism of cutaneous vision in nature
Although optics-less cutaneous (“skin”) vision is not uncommon among living organisms, its mechanisms and capabilities have not been thoroughly investigated. This paper demonstrates, using methods from statistical parameter estimation theory and numerical simulations, that arrays of bare radiation detectors arranged on a planar or curved surface have the ability to perform imaging tasks without any optics at all. The working principle of this type of optics-less sensors and the model developed here for determining their performance may be used to shed light on possible mechanisms, capabilities and evolution of cutaneous vision in nature.
- Open Access
Discrete Sampling Theorem, Sinc-lets and Other Peculiar Properties of Sampled Signals
Discrete sampling theorem is formulated that refers to discrete signals specified by a finite number of their samples and band-limited in a domain of a certain orthogonal transform. Conditions of the recoverability of such signals from their sparse samples are discussed for different transforms and applications are illustrated by examples of image super-resolution from multiple chaotically sampled frames and in image reconstruction from projections. Experimental evidence is presented of the existence of discrete signals sharply bounded both in space and DFT or DCT domains and of the family of the corresponding basis functions
Open AccessDiscrete Sampling Theorem, Sinc-lets and Other Peculiar Properties of Sampled Signals
Discrete sampling theorem is formulated that refers to discrete signals specified by a finite number of their samples and band-limited in a domain of a certain orthogonal transform. Conditions of the recoverability of such signals from their sparse samples are discussed for different transforms and applications are illustrated by examples of image super-resolution from multiple chaotically sampled frames and in image reconstruction from projections. Experimental evidence is presented of the existence of discrete signals sharply bounded both in space and DFT or DCT domains and of the family of the corresponding basis functions