Tag Info

6

I will divide my answer into 3 sections. The Distribution of the Derivative of Images Take a real world image, any image. Apply the derivative operator on it (Namely apply the kernel $\left[ 1, -1 \right]$ on it. Display the histogram of the filtered image. I took this image: The histogram I got is this: This distribution is very similar to Laplace ...

4

While it can be done in Frequency Domain it requires delicate handling of the edges (Discrete Frequency Domain assumes Periodic Signals). Hence I think the best approach is to build this problem as an optimization problem in spatial domain. The Gradient The Graident with Respect to the Convolution Kernel Given the objective function: $$\frac{1}{2} {\left\| ... 4 I'm answering the question the way I understood it - How can one find a similarity measure which isn't sensitive to scaling and shifting. An approach could be borrowed from the Computer Vision world by comparing Shift and Scale Invariant features between the two signals. I'm not sure it will work for measuring the quality of recovering signals but it ... 4 I will talk about the Linear Spatially Invariant (LSI) Model. Since the Filter (System) is LSI it can be described in the domain of Fourier Transform:$$ Y \left( \omega \right) = H \left( \omega \right) X \left( \omega \right) $$Where  Y \left( \omega \right)  is the Blurred (Output) Image,  X \left( \omega \right)  is the Input Image and  H \left( ... 4 You can think of MAP as a regularization of the ML. Just like you have regularization for Least Squares Problem (They can be built, mostly, as MAP problem). The nice thing is that, as always, the best regularization is more data, namely, in most case when there is a lot of data they collide (Namely, low sensitivity fir the Posterior PDF). So they differ ... 4 One way, though not directly visual, is to observe the image statistics. We have a pretty good idea about the statistics of Natural Images, more specifically, their Gradient Distribution (See Statistics of Natural Images and Models by Jinggang Huang, D. Mumford, What Makes a Good Model of Natural Images by Yair Weiss, William T. Freeman, The Statistic ... 4 This is closely related to Blind Deconvolution. The only difference is we limit our self to a very specific type of blur kernels. The nice thing about the Gaussian Kernel is being defined by single parameter - The Standard Deviation of the kernel. The less nice thing is the connection isn't linear. Optimization Problem Let's define a classic non ... 3 First of all note that there is a certain ambiguity in the problem formulation because the approximation of x(t) has to be divided into the part represented by x^{\prime}(t) and the part represented by f(y(t)), and this division is not unique. The approach I chose is to start with a parametrization of f(y(t)), and approximate the given x(t) as well ... 3 I didn't have time to fully read the article yet I'll try to answer according to your question. If you take the first equation and convolove it on the left by  {f}_{i}  and use the second identity you can see this specific  g  holds the equation. Regarding how to get this  g , I think he uses "Deconvolution" in the Fourier domain. 2 As mentioned in the comments, the symbol ^H denotes the conjugate transpose of a matrix or vector, which means that the vector/matrix is transposed and that all of its elements are conjugated. The bar over y_k means complex conjugate (note that y_k is a scalar, not a vector or matrix). When computing the gradient with respect to a complex variable in ... 2 Take Fourier Transform of both original image and blurred image, then divide Fourier transform of blurred image by Fourier transform of original image. This will give you the Fourier transform of kernel (except at frequencies with zero value which lead to division by zero). Then take inverse Fourier transform and find the kernel in spatial domain. 2 My first comment would be why the heck are you using R if you are concerned with processing speed, or are you just prototyping algorithms? Anyway, Without getting into how I derived it, here is a formula that is much much faster: Take the log of your signal (-1 if 0):$$ g[x] = \ln(y[x]) $$Calculate the following value:$$ B = \frac{ \begin{array}{c} ...

2

Ha just figured out a faster and better method just using BIC-optimized selection of optimal peak width, using a banded covariate matrix with shifted Gaussian peak shapes of given width & using nonnegative least squares fits (which is solved using an active set method and regularizes the problem a bit, though less of course than with LASSO or L0 norm ...

2

Ok, your code is very difficult to understand, but I think that we can answer your question. There is a group of processing blocks that every communication systems have. Normally, they appear in the following order in almost every simulation: Bit Stream -> Modulator -> Channel -> Equalization -> Demodulator -> Received Bit Stream Note that I suppressed ...

2

A "point spread function" denotes how a single point from the source, or a punctual object (mathematically a Dirac) would spread on the observed image through the imaging system. In blind deconvolution, both image priors and PSF priors are useful to unmix those intricate systems (even more with noise). They are different, as the PSF is somehow invariant to ...

2

You use the matched filtering technique when you search measurement data for a signal of a given form. You know the signal waveform in advance and either you are not sure if the signal is present in your data, or you see the signal and your task is to compute the signal magnitude and location. In these cases you use the matched filtering technique. If your ...

1

Your formula/method for computing MSE between estimated and known inputs looks good to me. For symbol error rate you could use something like a Hamming distance which simply counts the number of times the estimated symbol is different from the actual symbol. In your 10 symbol example the error rate is 4/10 i.e 40%. In Matlab you can do something like: ...

1

This question is confusing, but I thought I'd try to make some sense of it. Suppose you are transmitting one of your $\mathbf{x}_i$ vectors one component at a time. That is, the transmitted signal, $s[k]$, for the $i^{\rm th}$ feature vector is: $$s_i[k] = x_{ik}$$ If this signal is corrupted by a channel with impulse response $h[k]$ then the received ...

1

If you just want to estimate the height of the square shaped component you can pass the composite signal thorough a low pass filter with a cut-off frequency close to DC or less than the minimum frequency you can expect to see in the composite signal apart from the square component. The resulting signal would have most of the non-DC components filtered out ...

1

Maximum a Posteriori (MAP) is the same as Maximum Likelihood Estimation (MLE) except with a Bayesian prior distribution on whatever it is that you're trying to estimate. So if you have prior information on the distribution of point spread functions then MAP will work better.

Only top voted, non community-wiki answers of a minimum length are eligible