Searcharxiv⌕ Search

arXiv subjects

Rémi Grisot

Publications and source records attributed to Rémi Grisot.

2 recordsLinked to original sources
arXiv2023

Monitoring of the heart movements using a FMCW radar and correlation with an ECG

Monitoring the activity of the heart is important for diagnosing and preventing cardiovascular diseases. The electrocardiogram (ECG) is the gold standard for diagnosing such diseases. It monitors the heart's electrical activity, and while this is highly correlated with the cardiac mechanical activity, it does not provide all the information. Other sensors such as the echocardiograph are able to monitor the heart's movements, but such tools are expensive and hard to operate. Therefore, contactless monitoring of the heart using RF sensing has gained interest in recent years. In this paper, we describe a process to extract the movements of the heart from millimeter wave radar with high accuracy, and thus we provide a noninvasive and affordable way to monitor cardiac movements. We then demonstrate the correlation between the observed movements and the ECG. Furthermore, we propose an algorithm to synchronize the ECG signal and the processed signal from the radar sensor. The results we obtained provide insights on the mechanical activity of the heart, which could assist cardiologists in their diagnoses.

eess.SP↗
arXiv2022

On List Coloring with Separation of the Complete Graph and Set System Intersections

We consider the following list coloring with separation problem: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|= a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $φ$ of sets of integers to the vertices of $G$ such that $φ(u)\subset L(u)$ and $|φ(v)|=b$ for any vertex $u$ and $φ(u)\cap φ(v)=\emptyset$ for any edge $uv$. Such a value of $c$ is called the separation number of $(G,a,b)$. Using a special partition of a set of lists for which we obtain an improved version of Poincaré's crible, we determine the separation number of the complete graph $K_n$ for some values of $a,b$ and $n$, and prove bounds for the remaining values.

math.CO↗