arXiv subjects

Mario Mastriani

Publications and source records attributed to Mario Mastriani.

34 records · Page 2Linked to original sources

arXiv2016

Denoising based on wavelets and deblurring via self-organizing map for Synthetic Aperture Radar images

This work deals with unsupervised image deblurring. We present a new deblurring procedure on images provided by low-resolution synthetic aperture radar (SAR) or simply by multimedia in presence of multiplicative (speckle) or additive noise, respectively. The method we propose is defined as a two-step process. First, we use an original technique for noise reduction in wavelet domain. Then, the learning of a Kohonen self-organizing map (SOM) is performed directly on the denoised image to take out it the blur. This technique has been successfully applied to real SAR images, and the simulation results are presented to demonstrate the effectiveness of the proposed algorithms.

cs.CV↗

arXiv2016

Fuzzy thresholding in wavelet domain for speckle reduction in Synthetic Aperture Radar images

The application of wavelet transforms to Synthetic Aperture Radar (SAR) imagery has improved despeckling performance. To deduce the problem of filtering the multiplicative noise to the case of an additive noise, the wavelet decomposition is performed on the logarithm of the image gray levels. The detail coefficients produced by the bidimensional discrete wavelet transform (DWT-2D) needs to be thresholded to extract out the speckle in highest subbands. An initial threshold value is estimated according to the noise variance. In this paper, an additional fuzzy thresholding approach for automatic determination of the rate threshold level around the traditional wavelet noise thresholding (initial threshold) is applied, and used for the soft or hard-threshold performed on all the high frequency subimages. The filtered logarithmic image is then obtained by reconstruction from the thresholded coefficients. This process is applied a single time, and exclusively to the first level of decomposition. The exponential function of this reconstructed image gives the final filtered image. Experimental results on test images have demonstrated the effectiveness of this method compared to the most of methods in use at the moment.

cs.CV↗

arXiv2016

Neural shrinkage for wavelet-based SAR despeckling

The wavelet shrinkage denoising approach is able to maintain local regularity of a signal while suppressing noise. However, the conventional wavelet shrinkage based methods are not time-scale adaptive to track the local time-scale variation. In this paper, a new type of Neural Shrinkage (NS) is presented with a new class of shrinkage architecture for speckle reduction in Synthetic Aperture Radar (SAR) images. The numerical results indicate that the new method outperforms the standard filters, the standard wavelet shrinkage despeckling method, and previous NS.

cs.CV↗

arXiv2016

New version of Gram-Schmidt Process with inverse for Signal and Image Processing

The Gram-Schmidt Process (GSP) is used to convert a non-orthogonal basis (a set of linearly independent vectors, matrices, etc) into an orthonormal basis (a set of orthogonal, unit-length vectors, bi or tri dimensional matrices). The process consists of taking each array and then subtracting the projections in common with the previous arrays. This paper introduces an enhanced version of the Gram-Schmidt Process (EGSP) with inverse, which is useful for Digital Signal and Image Processing, among others applications.

cs.CV↗

arXiv2016

Systholic Boolean Orthonormalizer Network in Wavelet Domain for SAR Image Despeckling

We describe a novel method for removing speckle (in wavelet domain) of unknown variance from SAR images. The me-thod is based on the following procedure: We apply 1) Bidimentional Discrete Wavelet Transform (DWT-2D) to the speckled image, 2) scaling and rounding to the coefficients of the highest subbands (to obtain integer and positive coefficients), 3) bit-slicing to the new highest subbands (to obtain bit-planes), 4) then we apply the Systholic Boolean Orthonormalizer Network (SBON) to the input bit-plane set and we obtain two orthonormal output bit-plane sets (in a Boolean sense), we project a set on the other one, by means of an AND operation, and then, 5) we apply re-assembling, and, 6) re-sca-ling. Finally, 7) we apply Inverse DWT-2D and reconstruct a SAR image from the modified wavelet coefficients. Despeckling results compare favorably to the most of methods in use at the moment.

cs.CV↗

arXiv2016

Quantum Enhanced Correlation Matrix Memories via States Orthogonalisation

This paper introduces a Quantum Correlation Matrix Memory (QCMM) and Enhanced QCMM (EQCMM), which are useful to work with quantum memories. A version of classical Gram-Schmidt orthogonalisation process in Dirac notation (called Quantum Orthogonalisation Process: QOP) is presented to convert a non-orthonormal quantum basis, i.e., a set of non-orthonormal quantum vectors (called qudits) to an orthonormal quantum basis, i.e., a set of orthonormal quantum qudits. This work shows that it is possible to improve the performance of QCMM thanks QOP algorithm. Besides, the EQCMM algorithm has a lot of additional fields of applica-tions, e.g.: Steganography, as a replacement Hopfield Net-works, Bi-level image processing, etc. Finally, it is important to mention that the EQCMM is an extremely easy to implement in any firmware.

quant-ph↗

arXiv2016

Fast Cosine Transform to increase speed-up and efficiency of Karhunen-Loeve Transform for lossy image compression

In this work, we present a comparison between two techniques of image compression. In the first case, the image is divided in blocks which are collected according to zig-zag scan. In the second one, we apply the Fast Cosine Transform to the image, and then the transformed image is divided in blocks which are collected according to zig-zag scan too. Later, in both cases, the Karhunen-Loeve transform is applied to mentioned blocks. On the other hand, we present three new metrics based on eigenvalues for a better comparative evaluation of the techniques. Simulations show that the combined version is the best, with minor Mean Absolute Error (MAE) and Mean Squared Error (MSE), higher Peak Signal to Noise Ratio (PSNR) and better image quality. Finally, new technique was far superior to JPEG and JPEG2000.

cs.CV↗

arXiv2016

Enhanced Boolean Correlation Matrix Memory

This paper introduces an Enhanced Boolean version of the Correlation Matrix Memory (CMM), which is useful to work with binary memories. A novel Boolean Orthonormalization Process (BOP) is presented to convert a non-orthonormal Boolean basis, i.e., a set of non-orthonormal binary vectors (in a Boolean sense) to an orthonormal Boolean basis, i.e., a set of orthonormal binary vectors (in a Boolean sense). This work shows that it is possible to improve the performance of Boolean CMM thanks BOP algorithm. Besides, the BOP algorithm has a lot of additional fields of applications, e.g.: Steganography, Hopfield Networks, Bi-level image processing, etc. Finally, it is important to mention that the BOP is an extremely stable and fast algorithm.

cs.NE↗

arXiv2016

Quantum image processing?

This paper presents a number of problems concerning the practical (real) implementation of the techniques known as Quantum Image Processing. The most serious problem is the recovery of the outcomes after the quantum measurement, which will be demonstrated in this work that is equivalent to a noise measurement, and it is not considered in the literature on the subject. It is noteworthy that this is due to several factors: 1) a classical algorithm that uses Dirac's notation and then it is coded in MATLAB does not constitute a quantum algorithm, 2) the literature emphasizes the internal representation of the image but says nothing about the classical-to-quantum and quantum-to-classical interfaces and how these are affected by decoherence, 3) the literature does not mention how to implement in a practical way (at the laboratory) these proposals internal representations, 4) given that Quantum Image Processing works with generic qubits this requires measurements in all axes of the Bloch sphere, logically, and 5) among others. In return, the technique known as Quantum Boolean Image Processing is mentioned, which works with computational basis states (CBS), exclusively. This methodology allows us to avoid the problem of quantum measurement, which alters the results of the measured except in the case of CBS. Said so far is extended to quantum algorithms outside image processing too.

quant-ph↗

arXiv2016

3D zigzag for multislicing, multiband and video processing

We present a 3D zigzag rafter (first in literature) which allows us to obtain the exact sequence of spectral components after application of Discrete Cosine Transform 3D (DCT-2D) over a cube. Such cube represents part of a video or eventually a group of images such as multislicing (e.g., Magnetic Resonance or Computed Tomography imaging) and multi or hyperspectral imagery (optical satellites). Besides, we present a new version of the traditional 2D zigzag, including the case of rectangular blocks. Finally, all the attached code is done in MATLAB, and that code serves both blocks of pixels or blocks of blocks.

cs.CV↗

arXiv2015

A proposal for the optimal estimation of states in Quantum Information Processing

An optimal estimator of quantum states based on a modified Kalman's Filter is proposed in this work. Such estimator acts after state measurement, allowing obtain an optimal estimation of quantum state resulting in the output of any quantum algorithm. This method is much more accurate than other types of quantum measurements, such as, weak measurement, strong measurement, quantum state tomography, among others.

quant-ph↗

arXiv2014

Quantum Edge Detection for Image Segmentation in Optical Environments

A quantum edge detector for image segmentation in optical environments is presented in this work. A Boolean version of the same detector is presented too. The quantum version of the new edge detector works with computational basis states, exclusively. This way, we can easily avoid the problem of quantum measurement retrieving the result of applying the new detector on the image. Besides, a new criterion and logic based on projections onto vertical axis of Bloch's Sphere exclusively are presented too. This approach will allow us: 1) a simpler development of logic quantum operations, where they will closer to those used in the classical logic operations, 2) building simple and robust classical-to-quantum and quantum-to-classical interfaces. Said so far is extended to quantum algorithms outside image processing too. In a special section on metric and simulations, a new metric based on the comparison between the classical and quantum versions algorithms for edge detection of images is presented. Notable differences between the results of classical and quantum versions of such algorithms (outside and inside of quantum computer, respectively) show the existence of implementation problems involved in the experiment, and that they have not been properly modeled for optical environments. However, although they are different, the quantum results are equally valid. The latter is clearly seen in the computer simulations

cs.CV↗

arXiv2014

Lossless compression catalyst based on binary allocation via modular arithmetic

A new binary (bit-level) lossless compression catalyst method based on a modular arithmetic, called Binary Allocation via Modular Arithmetic (BAMA), has been introduced in this paper. In other words, BAMA is for storage and transmission of binary sequences, digital signal, images and video, also streaming and all kinds of digital transmission. As we said, our method does not compress, but facilitates the action of the real compressor, in our case, any lossless compression algorithm (Run Length Encoding, Lempel-Ziv-Welch, Huffman, Arithmetic, etc), that is, it acts as a compression catalyst. Finally, this catalyst allows a significant increase in the compression performance of binary sequences, among others.

cs.IT↗

arXiv2014

Quantum Boolean Image Denoising

A quantum Boolean image processing methodology is presented in this work, with special emphasis in image denoising. A new approach for internal image representation is outlined together with two new interfaces: classical-to-quantum and quantum-to-classical. The new quantum-Boolean image denoising called quantum Boolean mean filter (QBMF) works with computational basis states (CBS), exclusively. To achieve this, we first decompose the image into its three color components, i.e., red, green and blue. Then, we get the bitplanes for each color, e.g., 8 bits-per-pixel, i.e., 8 bitplanes-per-color. From now on, we will work with the bitplane corresponding to the most significant bit (MSB) of each color, exclusive manner. After a classical-to-quantum interface (which includes a classical inverter), we have a quantum Boolean version of the image within the quantum machine. This methodology allows us to avoid the problem of quantum measurement, which alters the results of the measured except in the case of CBS. Said so far is extended to quantum algorithms outside image processing too. After filtering of the inverted version of MSB (inside quantum machine) the result passes through a quantum-classical interface (which involves another classical inverter) and then proceeds to reassemble each color component and finally the ending filtered image. Finally, we discuss the more appropriate metrics for image denoising in a set of experimental results.

quant-ph↗

arXiv2014

Optimal Estimation of States in Quantum Image Processing

An optimal estimator of quantum states based on a modified Kalman Filter is presented in this work. Such estimator acts after state measurement, allowing to obtain an optimal estimation of quantum state resulting in the output of any quantum image algorithm. Besides, a new criteria, logic, and arithmetic based on projections onto vertical axis of Bloch Sphere exclusively are presented too. This approach will allow us: 1) a simpler development of logic and arithmetic quantum operations, where they will closer to those used in the classical digital image processing algorithms, 2) building simple and robust classical-to-quantum and quantum-to-classical interfaces. Said so far is extended to quantum algorithms outside image processing too. In a special section on metrics and simulations, three new metrics based on the comparison between the classical and quantum versions algorithms for filtering and edge detection of images are presented. Notable differences between the results of classical and quantum versions of such algorithms (outside and inside of quantum computer, respectively) show the need for modeling state and measurement noise inside estimation scheme.

quant-ph↗

arXiv2014

Rule of Three for Superresolution of Still Images with Applications to Compression and Denoising

We describe a new method for superresolution of still images (in the wavelet domain) based on the reconstruction of missing details subbands pixels at a given ith level via Rule of Three (Ro3) between pixels of approximation subband of such level, and pixels of approximation and detail subbands of (i+1)th level. The histogramic profiles demonstrate that Ro3 is the appropriate mechanism to recover missing detail subband pixels in these cases. Besides, with the elimination of the details subbands pixels (in an eventual compression scheme), we obtain a bigger compression rate. Experimental results demonstrate that our approach compares favorably to more typical methods of denoising and compression in wavelet domain. Our method does not compress, but facilitates the action of the real compressor, in our case, Joint Photographic Experts Group (JPEG) and JPEg2000, that is, Ro3 acts as a catalyst compression

cs.CV↗