Differences
This shows you the differences between two versions of the page.
|
talksposters:transientx [2024/07/12 10:58] lspitler |
talksposters:transientx [2024/08/30 11:01] (current) lspitler |
||
|---|---|---|---|
| Line 15: | Line 15: | ||
| - Clustering of candidates | - Clustering of candidates | ||
| - Plotting | - Plotting | ||
| + | |||
| + | ===== General parameters ===== | ||
| + | |||
| + | * Block size: This should be chosen such that one block corresponds to of order 10,000 time samples. This can, in principal, be optimized for the properties of the CPU being used. | ||
| + | * Overlap: RFI mitigation and DM-time plot generation are applied only on the data that are within a single block. Only during dedispersion is the block size padded by the duration of the DM sweep. If the burst lands on or near a block size boundary, it could be missed. Therefore, a small amount of overlap is warranted. | ||
| + | |||
| ===== Skewness/kurtosis filtering ===== | ===== Skewness/kurtosis filtering ===== | ||
| - | This filtering method is always on and controlled by the ''-zapthre'' option. There is no flag to turn it off directly. However, a high threshold basically disables it. | + | This filter calculates the skewness and kurtosis statistics for each frequency channel within a time block and is applied to the full time/frequency resolution data (i.e. before any downsampling time/freq is applied). The IQR algorithm is used to avoid the statistics being biased by strong outlier. This filtering method is always on and controlled by the ''-zapthre'' option. There is no flag to turn it off directly. However, a high threshold basically disables it. |
| + | |||
| ===== Downsampling ===== | ===== Downsampling ===== | ||
| - | Next, the filterbank is downsampled in time and frequency according to the values given by ''--td'' and ''--fd''. Be aware that the filterbank can be downsampled in addition to the values given in the ''ddplan''. Hence, the file might be downsampled multiple times! | + | Next, the filterbank is downsampled in time and frequency according to the values given by ''--td'' and ''--fd''. Be aware that the filterbank can be downsampled in addition to the values given in the ''ddplan''. Hence, the file might be downsampled multiple times! Also, RFI algorithms that take time and frequency downsampling factors are applied in addition to the global time and frequency. |
| ===== Normalization ===== | ===== Normalization ===== | ||
| Line 41: | Line 48: | ||
| ===== De-dispersion ===== | ===== De-dispersion ===== | ||
| - | The data is de-dispersed using subband de-dispersion. The size of the subbands is controlled by the loss of S/N controlled by ''--snrloss''. The trails are controlled by ''dms'' (Start DM), ''ndm''0 (Number of DMs) and ''ddm'' (DM step size). | + | The data is de-dispersed using subband de-dispersion. The size of the subbands is controlled by the loss of S/N controlled by ''--snrloss''. The trials are controlled by ''dms'' (Start DM), ''ndm''0 (Number of DMs) and ''ddm'' (DM step size). |
| + | |||
| + | The buffer size is the user-specified block size plus the dispersion sweep of the largest trial DM. | ||
| ===== Matched filtering ===== | ===== Matched filtering ===== | ||
| Line 47: | Line 56: | ||
| ===== Clustering of candidates ===== | ===== Clustering of candidates ===== | ||
| - | To avoid seeing the same candidates at several DMs, transientX clusters them based on the DBSCAN algorithm. This algorithm searches for other candidates in a radius around a candidate in DM (difference in dispersive delay) and time. If the specified number of candidates is found, they are collected as a core point, i.e. summarized into the one with the highest S/N. The radius is controlled with ''-r'' and should be large enough so that the delay from the DM step size fits comfortably in the radius. | + | To avoid seeing the same candidates at several DMs and adjacent time bins, transientX clusters them based on the DBSCAN algorithm. This algorithm searches for other candidates in a radius around a candidate in DM (difference in dispersive delay) and time. If the specified number of candidates is found, they are collected as a core point, i.e. summarized into the one with the highest S/N. The radius is controlled with ''-r'' and should be large enough so that the delay from the DM step size fits comfortably in the radius. |
| + | |||
| + | If the code is running sluggishly, it is mostly likely that the clustering step has a large number of candidates to group together. Check the parameters you are using in the search. In particular avoid searching with widths that correspond to a larger number of time samples; it is better to downsample in time in these cases. | ||
| ===== Plotting ===== | ===== Plotting ===== | ||
| Line 54: | Line 65: | ||
| ====== replot_fil ====== | ====== replot_fil ====== | ||
| Next to ''transientx_fil'', ''replot_fil'' is the second important tool when searching single pulses. The purpose of replot_fil is to do a finer search for the TOA, DM, and the width of the pulse candidates. If a candidate is RFI, the change is large and then the candidate is dropped. | Next to ''transientx_fil'', ''replot_fil'' is the second important tool when searching single pulses. The purpose of replot_fil is to do a finer search for the TOA, DM, and the width of the pulse candidates. If a candidate is RFI, the change is large and then the candidate is dropped. | ||
| + | |||
| + | ===== Debugging ===== | ||
| + | |||
| + | If you want to know how a candidate that is filtered out by ''replot_fil'' "looks like", you can run the software with the "no clean" option and it will return all of the ''TransientX'' candidates as they are reprocessed by ''replot_fil''. | ||
| + | |||
