}Kg&DdZddlZddlZddlmZddlmZddl m Z ddl m Z dd gZ ed d d ddddejdedededede dejfdZed dd ddejdedede dejf dZedddZy) zFeature manipulation utilitiesN)jit)cache)ParameterError)Anydelta stack_memory()level interp)widthorderaxismodedatarrrrkwargsreturnc tj|}|dk(r0||j|kDrtd|d|j||dkstj|ddk7r td|dks t |t tjfs td |jd d |jd |tjj||f|||d |}|S)a Compute delta features: local estimate of the derivative of the input data along the selected axis. Delta features are computed Savitsky-Golay filtering. Parameters ---------- data : np.ndarray the input data matrix (eg, spectrogram) width : int, positive, odd [scalar] Number of frames over which to compute the delta features. Cannot exceed the length of ``data`` along the specified axis. If ``mode='interp'``, then ``width`` must be at least ``data.shape[axis]``. order : int > 0 [scalar] the order of the difference operator. 1 for first derivative, 2 for second, etc. axis : int [scalar] the axis along which to compute deltas. Default is -1 (columns). mode : str, {'interp', 'nearest', 'mirror', 'constant', 'wrap'} Padding mode for estimating differences at the boundaries. **kwargs : additional keyword arguments See `scipy.signal.savgol_filter` Returns ------- delta_data : np.ndarray [shape=(..., t)] delta matrix of ``data`` at specified order Notes ----- This function caches at level 40. See Also -------- scipy.signal.savgol_filter Examples -------- Compute MFCC deltas, delta-deltas >>> y, sr = librosa.load(librosa.ex('libri1'), duration=5) >>> mfcc = librosa.feature.mfcc(y=y, sr=sr) >>> mfcc_delta = librosa.feature.delta(mfcc) >>> mfcc_delta array([[-5.713e+02, -5.697e+02, ..., -1.522e+02, -1.224e+02], [ 1.104e+01, 1.330e+01, ..., 2.089e+02, 1.698e+02], ..., [ 2.829e+00, 1.933e+00, ..., -3.149e+00, 2.294e-01], [ 2.890e+00, 2.187e+00, ..., 6.959e+00, -1.039e+00]], dtype=float32) >>> mfcc_delta2 = librosa.feature.delta(mfcc, order=2) >>> mfcc_delta2 array([[-1.195, -1.195, ..., -4.328, -4.328], [-1.566, -1.566, ..., -9.949, -9.949], ..., [ 0.707, 0.707, ..., 2.287, 2.287], [ 0.655, 0.655, ..., -1.719, -1.719]], dtype=float32) >>> import matplotlib.pyplot as plt >>> fig, ax = plt.subplots(nrows=3, sharex=True, sharey=True) >>> img1 = librosa.display.specshow(mfcc, ax=ax[0], x_axis='time') >>> ax[0].set(title='MFCC') >>> ax[0].label_outer() >>> img2 = librosa.display.specshow(mfcc_delta, ax=ax[1], x_axis='time') >>> ax[1].set(title=r'MFCC-$\Delta$') >>> ax[1].label_outer() >>> img3 = librosa.display.specshow(mfcc_delta2, ax=ax[2], x_axis='time') >>> ax[2].set(title=r'MFCC-$\Delta^2$') >>> fig.colorbar(img1, ax=[ax[0]]) >>> fig.colorbar(img2, ax=[ax[1]]) >>> fig.colorbar(img3, ax=[ax[2]]) rzwhen mode='interp', width=z cannot exceed data.shape[axis]=rr z!width must be an odd integer >= 3rz order must be a positive integerderivN polyorder)rrr) np atleast_1dshapermod isinstanceintintegerpop setdefaultscipysignal savgol_filter)rrrrrrresults Y/home/alanp/www/video.onchill/myenv/lib/python3.12/site-packages/librosa/feature/utils.pyrrst == D xEDJJt$44(0..2jj.>-? A   qyBFF5!$)@AA zEC+<=?@@ JJw k5)33 e t$:@F M)n_stepsdelayr*r+c |dkr td|dk(r tdtj|}|jd}|dkrtd|j|j dd|ddk(r|j d dgt |j Dcgc]}d }}|dkDrt|dz |zdf|d<ndt|dz | zf|d<tj||fi|}t|j}|d |z|d <||d<t|}tj|| }t|||||Scc}w) a Short-term history embedding: vertically concatenate a data vector or matrix with delayed copies of itself. Each column ``data[:, i]`` is mapped to:: data[..., i] -> [data[..., i], data[..., i - delay], ... data[..., i - (n_steps-1)*delay]] For columns ``i < (n_steps - 1) * delay``, the data will be padded. By default, the data is padded with zeros, but this behavior can be overridden by supplying additional keyword arguments which are passed to `np.pad()`. Parameters ---------- data : np.ndarray [shape=(..., d, t)] Input data matrix. If ``data`` is a vector (``data.ndim == 1``), it will be interpreted as a row matrix and reshaped to ``(1, t)``. n_steps : int > 0 [scalar] embedding dimension, the number of steps back in time to stack delay : int != 0 [scalar] the number of columns to step. Positive values embed from the past (previous columns). Negative values embed from the future (subsequent columns). **kwargs : additional keyword arguments Additional arguments to pass to `numpy.pad` Returns ------- data_history : np.ndarray [shape=(..., m * d, t)] data augmented with lagged copies of itself, where ``m == n_steps - 1``. Notes ----- This function caches at level 40. Examples -------- Keep two steps (current and previous) >>> data = np.arange(-3, 3) >>> librosa.feature.stack_memory(data) array([[-3, -2, -1, 0, 1, 2], [ 0, -3, -2, -1, 0, 1]]) Or three steps >>> librosa.feature.stack_memory(data, n_steps=3) array([[-3, -2, -1, 0, 1, 2], [ 0, -3, -2, -1, 0, 1], [ 0, 0, -3, -2, -1, 0]]) Use reflection padding instead of zero-padding >>> librosa.feature.stack_memory(data, n_steps=3, mode='reflect') array([[-3, -2, -1, 0, 1, 2], [-2, -3, -2, -1, 0, 1], [-1, -2, -3, -2, -1, 0]]) Or pad with edge-values, and delay by 2 >>> librosa.feature.stack_memory(data, n_steps=3, delay=2, mode='edge') array([[-3, -2, -1, 0, 1, 2], [-3, -3, -3, -2, -1, 0], [-3, -3, -3, -3, -3, -2]]) Stack time-lagged beat-synchronous chroma edge padding >>> y, sr = librosa.load(librosa.ex('sweetwaltz'), duration=10) >>> chroma = librosa.feature.chroma_cqt(y=y, sr=sr) >>> tempo, beats = librosa.beat.beat_track(y=y, sr=sr, hop_length=512) >>> beats = librosa.util.fix_frames(beats, x_min=0) >>> chroma_sync = librosa.util.sync(chroma, beats) >>> chroma_lag = librosa.feature.stack_memory(chroma_sync, n_steps=3, ... mode='edge') Plot the result >>> import matplotlib.pyplot as plt >>> fig, ax = plt.subplots() >>> beat_times = librosa.frames_to_time(beats, sr=sr, hop_length=512) >>> librosa.display.specshow(chroma_lag, y_axis='chroma', x_axis='time', ... x_coords=beat_times, ax=ax) >>> ax.text(1.0, 1/6, "Lag=0", transform=ax.transAxes, rotation=-90, ha="left", va="center") >>> ax.text(1.0, 3/6, "Lag=1", transform=ax.transAxes, rotation=-90, ha="left", va="center") >>> ax.text(1.0, 5/6, "Lag=2", transform=ax.transAxes, rotation=-90, ha="left", va="center") >>> ax.set(title='Time-lagged chroma', ylabel="") r z"n_steps must be a positive integerrz delay must be a non-zero integerrzECannot stack memory when input data has no columns. Given data.shape=rconstantconstant_values)rr)r) rr atleast_2drr#rangendimr padlisttuple empty_like__stack) rr*r+rt_paddingrhistorys r(r r suH{ABB z?@@ == D 2A1u ,,0JJ< 9   fj) f~#+aS1$TYY/0/!v/G0 qyGaK50115 #w{uf456 66$ *6 *D  Eb G#E"IE"I %LEmmD.G GT7E* N-1s& ET)nopythonrcr|jd}|jd}|dkDr>t|D]/}|dz |z }|d||z||z|zf|d||z|dz|zddf<1y|d| df|d| dddf<t|dz D]0}|dz |z }|d| ||zz||zf|d||z|dz|zddf<2y)afMemory-stacking helper function. Parameters ---------- history : output array (2-dimensional) data : pre-padded input array (2-dimensional) n_steps : int > 0, the number of steps to stack delay : int != 0, the amount of delay between steps Returns ------- None Output is stored directly in the history array r/rrr .N)rr1)r;rr*r+dr8stepqs r(r7r7s " 2A  bA qy'ND! d"A9=QYUQ..:GCTAXN2A5 6# $C!H~aRS! 'A+&D! d"A9=aR!e)^a%i//:GCTAXN2A5 6'r))__doc__numpyr scipy.signalr$numbar_cacherutil.exceptionsrtypingr__all__ndarrayr strrr r7r)r(rLs%, N #R l **l l  l  l  llZZll^R()L **L"%L25LEHLZZLL^d$% %r)