ALBERT

Description: Sensors, Vol. 18, Pages 792: Quality Control Procedure Based on Partitioning of NMR Time Series Sensors doi: 10.3390/s18030792 Authors: Michał Staniszewski Agnieszka Skorupa Łukasz Boguszewicz Maria Sokół Andrzej Polański The quality of the magnetic resonance spectroscopy (MRS) depends on the stability of magnetic resonance (MR) system performance and optimal hardware functioning, which ensure adequate levels of signal-to-noise ratios (SNR) as well as good spectral resolution and minimal artifacts in the spectral data. MRS quality control (QC) protocols and methodologies are based on phantom measurements that are repeated regularly. In this work, a signal partitioning algorithm based on a dynamic programming (DP) method for QC assessment of the spectral data is described. The proposed algorithm allows detection of the change points—the abrupt variations in the time series data. The proposed QC method was tested using the simulated and real phantom data. Simulated data were randomly generated time series distorted by white noise. The real data were taken from the phantom quality control studies of the MRS scanner collected for four and a half years and analyzed by LCModel software. Along with the proposed algorithm, performance of various literature methods was evaluated for the predefined number of change points based on the error values calculated by subtracting the mean values calculated for the periods between the change-points from the original data points. The time series were checked using external software, a set of external methods and the proposed tool, and the obtained results were comparable. The application of dynamic programming in the analysis of the phantom MRS data is a novel approach to QC. The obtained results confirm that the presented change-point-detection tool can be used either for independent analysis of MRS time series (or any other) or as a part of quality control.

Description: Tracking and action-recognition algorithms are currently widely used in video surveillance, monitoring urban activities and in many other areas. Their development highly relies on benchmarking scenarios, which enable reliable evaluations/improvements of their efficiencies. Presently, benchmarking methods for tracking and action-recognition algorithms rely on manual annotation of video databases, prone to human errors, limited in size and time-consuming. Here, using gained experiences, an alternative benchmarking solution is presented, which employs methods and tools obtained from the computer-game domain to create simulated video data with automatic annotations. Presented approach highly outperforms existing solutions in the size of the data and variety of annotations possible to create. With proposed system, a potential user can generate a sequence of random images involving different times of day, weather conditions, and scenes for use in tracking evaluation. In the design of the proposed tool, the concept of crowd simulation is used and developed. The system is validated by comparisons to existing methods.

Description: Quantitative mapping is desirable in many scientific and clinical magneric resonance imaging (MRI) applications. Recent inverse recovery-look locker sequence enables single-shot T1 mapping with a time of a few seconds but the main computational load is directed into offline reconstruction, which can take from several minutes up to few hours. In this study we proposed improvement of model-based approach for T1-mapping by introduction of two steps fitting procedure. We provided analysis of further reduction of k-space data, which lead us to decrease of computational time and perform simulation of multi-slice development. The region of interest (ROI) analysis of human brain measurements with two different initial models shows that the differences between mean values with respect to a reference approach are in white matter—0.3% and 1.1%, grey matter—0.4% and 1.78% and cerebrospinal fluid—2.8% and 11.1% respectively. With further improvements we were able to decrease the time of computational of single slice to 6.5 min and 23.5 min for different initial models, which has been already not achieved by any other algorithm. In result we obtained an accelerated novel method of model-based image reconstruction in which single iteration can be performed within few seconds on home computer.