32,359 research outputs found
Paraunitary oversampled filter bank design for channel coding
Oversampled filter banks (OSFBs) have been considered for channel coding, since their redundancy can be utilised to permit the detection and correction of channel errors. In this paper, we propose an OSFB-based channel coder for a correlated additive Gaussian noise channel, of which the noise covariance matrix is assumed to be known. Based on a suitable factorisation of this matrix, we develop a design for the decoder's synthesis filter bank in order to minimise the noise power in the decoded signal, subject to admitting perfect reconstruction through paraunitarity of the filter bank. We demonstrate that this approach can lead to a significant reduction of the noise interference by exploiting both the correlation of the channel and the redundancy of the filter banks. Simulation results providing some insight into these mechanisms are provided
Linear-Array Photoacoustic Imaging Using Minimum Variance-Based Delay Multiply and Sum Adaptive Beamforming Algorithm
In Photoacoustic imaging (PA), Delay-and-Sum (DAS) beamformer is a common
beamforming algorithm having a simple implementation. However, it results in a
poor resolution and high sidelobes. To address these challenges, a new
algorithm namely Delay-Multiply-and-Sum (DMAS) was introduced having lower
sidelobes compared to DAS. To improve the resolution of DMAS, a novel
beamformer is introduced using Minimum Variance (MV) adaptive beamforming
combined with DMAS, so-called Minimum Variance-Based DMAS (MVB-DMAS). It is
shown that expanding the DMAS equation results in multiple terms representing a
DAS algebra. It is proposed to use the MV adaptive beamformer instead of the
existing DAS. MVB-DMAS is evaluated numerically and experimentally. In
particular, at the depth of 45 mm MVB-DMAS results in about 31 dB, 18 dB and 8
dB sidelobes reduction compared to DAS, MV and DMAS, respectively. The
quantitative results of the simulations show that MVB-DMAS leads to improvement
in full-width-half-maximum about 96 %, 94 % and 45 % and signal-to-noise ratio
about 89 %, 15 % and 35 % compared to DAS, DMAS, MV, respectively. In
particular, at the depth of 33 mm of the experimental images, MVB-DMAS results
in about 20 dB sidelobes reduction in comparison with other beamformers.Comment: This is the final version of this paper, which is accepted in the
"Journal of Biomedical Optics". Compared to previous versions, this version
contains more experiments and evaluatio
Binary Adaptive Semi-Global Matching Based on Image Edges
Image-based modeling and rendering is currently one of the most challenging topics in Computer Vision and Photogrammetry. The key issue here is building a set of dense correspondence points between two images, namely dense matching or stereo matching. Among all dense matching algorithms, Semi-Global Matching (SGM) is arguably one of the most promising algorithms for real-time stereo vision. Compared with global matching algorithms, SGM aggregates matching cost from several (eight or sixteen) directions rather than only the epipolar line using Dynamic Programming (DP). Thus, SGM eliminates the classical “streaking problem” and greatly improves its accuracy and efficiency. In this paper, we aim at further improvement of SGM accuracy without increasing the computational cost. We propose setting the penalty parameters adaptively according to image edges extracted by edge detectors. We have carried out experiments on the standard Middlebury stereo dataset and evaluated the performance of our modified method with the ground truth. The results have shown a noticeable accuracy improvement compared with the results using fixed penalty parameters while the runtime computational cost was not increased
Sparsity vs. Statistical Independence in Adaptive Signal Representations: A Case Study of the Spike Process
Finding a basis/coordinate system that can efficiently represent an input
data stream by viewing them as realizations of a stochastic process is of
tremendous importance in many fields including data compression and
computational neuroscience. Two popular measures of such efficiency of a basis
are sparsity (measured by the expected norm, ) and
statistical independence (measured by the mutual information). Gaining deeper
understanding of their intricate relationship, however, remains elusive.
Therefore, we chose to study a simple synthetic stochastic process called the
spike process, which puts a unit impulse at a random location in an
-dimensional vector for each realization. For this process, we obtained the
following results: 1) The standard basis is the best both in terms of sparsity
and statistical independence if and the search of basis is
restricted within all possible orthonormal bases in ; 2) If we extend our
basis search in all possible invertible linear transformations in , then
the best basis in statistical independence differs from the one in sparsity; 3)
In either of the above, the best basis in statistical independence is not
unique, and there even exist those which make the inputs completely dense; 4)
There is no linear invertible transformation that achieves the true statistical
independence for .Comment: 39 pages, 7 figures, submitted to Annals of the Institute of
Statistical Mathematic
- …