raab/GP2023_chirp_detection
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

final peak version with bool

Browse Source
This commit is contained in:
wendtalexander 2023-01-18 09:38:23 +01:00
parent 7034e9421b
commit 844f65e24e
2 changed files with 12 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
code/chirpdetection.py
View File

@ -12,7 +12,7 @@ from sklearn.preprocessing import normalize
from modules.filters import bandpass_filter, envelope, highpass_filter
from modules.filehandling import ConfLoader, LoadData
from modules.plotstyle import PlotStyle
from modules.timestamps import group_timestamps, group_timestamp_v2
from modules.timestamps import group_timestamps, group_timestamps_v2
ps = PlotStyle()
@ -527,6 +527,7 @@ def main(datapath: str) -> None:
if len(baseline_ts) == 0 or len(search_ts) == 0 or len(freq_ts) == 0:
continue
# get index for each feature
baseline_idx = np.zeros_like(baseline_ts)
search_idx = np.ones_like(search_ts)
@ -562,6 +563,7 @@ def main(datapath: str) -> None:
bool_timestamps[cm] = False
# for checking if there are chirps on multiple electrodes
chirps_electrodes.append(current_chirps)
for ct in current_chirps:
@ -597,20 +599,22 @@ def main(datapath: str) -> None:
bool_vector = np.ones(len(sort_chirps_electrodes), dtype=bool)
# make index vector
index_vector = np.arange(len(sort_chirps_electrodes))
# make it more than only two electrodes for the search after chirps
combinations_best_elctrodes = list(itertools.combinations(range(3), 2))
# make it more than only two electrodes for the search after chirps
combinations_best_elctrodes = list(
itertools.combinations(range(3), 2))
the_real_chirps = []
for chirp_index, seoc in enumerate(sort_chirps_electrodes):
if bool_vector[chirp_index] == False:
continue
cm = index_vector[(sort_chirps_electrodes >= seoc) & (
sort_chirps_electrodes <= seoc + config.chirp_window_threshold)]
sort_chirps_electrodes <= seoc + config.chirp_window_threshold)]
for combination in combinations_best_elctrodes:
if set(combination).issubset(sort_electrodes[cm]):
the_real_chirps.append(np.mean(sort_chirps_electrodes[cm]))
"""
the_real_chirps.append(
np.mean(sort_chirps_electrodes[cm]))
if set([0,1]).issubset(sort_electrodes[cm]):
the_real_chirps.append(np.mean(sort_chirps_electrodes[cm]))
elif set([1,0]).issubset(sort_electrodes[cm]):
@ -619,7 +623,6 @@ def main(datapath: str) -> None:
the_real_chirps.append(np.mean(sort_chirps_electrodes[cm]))
elif set([1,2]).issubset(sort_electrodes[cm]):
the_real_chirps.append(np.mean(sort_chirps_electrodes[cm]))
"""
bool_vector[cm] = False
for ct in the_real_chirps:

1
code/modules/timestamps.py
View File

@ -82,6 +82,7 @@ def group_timestamps_v2(sublists: List[List[Union[int, float]]], n: int, time_th
current_group = []
# Create a set to store the timestamps that occur in at least n of the sublists
common_timestamps = set.intersection(*[set(lst) for lst in sublists])
embed()
# Iterate through the timestamps
for i in range(len(common_timestamps)):
# If the current timestamp is less than 50 milliseconds away from the previous timestamp