# Tag Info

3

If I understand this problem correctly you have access to 2 signals: Noise Signal - $w \left[ n \right]$. It is composed of a linear combination of harmonic signals. Something like $w \left[ n \right] = \sum_{i}^{m} {a}_{i} \sin \left[ 2 \pi \frac{ {f}_{i} }{ {f}_{s} } n + {\phi}_{i} \right]$. Input Signal - $y \left[ n \right]$ which is composed of ...

4

Assuming you meant to produce something similar to the green line: What about $$\text{output}[n] = \max\{\text{input}[n-k], \text{input}[n-k+1], \ldots ,\text{input}[n]\}$$ i.e. you just find the maximum along a sliding window over the last $k$ input values?

0

I have a mask image of shape 500x500x1 that contains polygons. . . . These polygons [...] are labeled These two statements are incompatible. Assuming that the third number is the color depth, then 1-bit implies a binary mask, but each class being assigned to a different level implies a color depth >1. With a 1-bit mask, binary erosion is applied. ...

Top 50 recent answers are included