dual algorithm
Recently Published Documents


TOTAL DOCUMENTS

275
(FIVE YEARS 64)

H-INDEX

26
(FIVE YEARS 3)

2021 ◽  
Vol 7 (12) ◽  
pp. 248
Author(s):  
Alessandro Guazzo ◽  
Massimiliano Colarieti-Tosti

We have adapted, implemented and trained the Learned Primal Dual algorithm suggested by Adler and Öktem and evaluated its performance in reconstructing projection data from our PET scanner. Learned Primal Dual reconstructions are compared to Maximum Likelihood Expectation Maximisation (MLEM) reconstructions. Different strategies for training are also compared. Whenever the noise level of the data to reconstruct is sufficiently represented in the training set, the Learned Primal Dual algorithm performs well on the recovery of the activity concentrations and on noise reduction as compared to MLEM. The algorithm is also shown to be robust against the appearance of artefacts, even when the images that are to be reconstructed present features were not present in the training set. Once trained, the algorithm reconstructs images in few seconds or less.


2021 ◽  
Vol 15 ◽  
Author(s):  
Ro’ee Gilron ◽  
Simon Little ◽  
Robert Wilt ◽  
Randy Perrone ◽  
Juan Anso ◽  
...  

Adaptive deep brain stimulation (aDBS) is a promising new technology with increasing use in experimental trials to treat a diverse array of indications such as movement disorders (Parkinson’s disease, essential tremor), psychiatric disorders (depression, OCD), chronic pain and epilepsy. In many aDBS trials, a neural biomarker of interest is compared with a predefined threshold and stimulation amplitude is adjusted accordingly. Across indications and implant locations, potential biomarkers are greatly influenced by sleep. Successful chronic embedded adaptive detectors must incorporate a strategy to account for sleep, to avoid unwanted or unexpected algorithm behavior. Here, we show a dual algorithm design with two independent detectors, one used to track sleep state (wake/sleep) and the other used to track parkinsonian motor state (medication-induced fluctuations). Across six hemispheres (four patients) and 47 days, our detector successfully transitioned to sleep mode while patients were sleeping, and resumed motor state tracking when patients were awake. Designing “sleep aware” aDBS algorithms may prove crucial for deployment of clinically effective fully embedded aDBS algorithms.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Lumin Fan ◽  
Lingli Shen ◽  
Xinghua Zuo

In this paper, we propose an improved algorithm based on the active contour model Mumford-Shah model for CT images, which is the subject of this study. After analyzing the classical Mumford-Shah model and related improvement algorithms, we found that most of the improvement algorithms start from the initialization strategy of the model and the minimum value solution of the energy generalization function, so we will also improve the classical Mumford-Shah model from these two perspectives. For the initialization strategy of the Mumford-Shah model, we propose to first reduce the dimensionality of the image data by the PCA principal component analysis method, and for the reduced image feature vector, we use K -means, a general clustering method, as the initial position algorithm of the segmentation curve. For the image data that have completed the above two preprocessing processes, we then use the Mumford-Shah model for image segmentation. The Mumford-Shah curve evolution model solves the image segmentation by finding the minimum of the energy generalization of its model to obtain the optimal result of image segmentation, so for solving the minimum of the Mumford-Shah model, we first optimize the discrete problem of the energy generalization of the model by the convex relaxation technique and then use the Chambolle-Pock pairwise algorithm We then use the Chambolle-Pock dual algorithm to solve the optimization problem of the model after convex relaxation and finally obtain the image segmentation results. Finally, a comparison with the existing model through many numerical experiments shows that the model proposed in this paper calculates the texture image segmentation with high accuracy and good edge retention. Although the work in this paper is aimed at two-phase image segmentation, it can be easily extended to multiphase segmentation problems.


Author(s):  
Amine Laghrib ◽  
Fatimzehrae Aitbella ◽  
Abdelilah Hakim

Abstract In this paper, we propose a new nonlocal super-resolution (SR) model which is a combination of the nonlocal total variation (TV) regularization and the nonlocal p-Laplacian term (with p = 2). This choice is motivated by the success of the nonlocal TV term in preserving image edges and the efficiency of the nonlocal p-Laplacian term in preserving the image texture. To ensure the convergence of the proposed optimization SR problem, we prove the existence and uniqueness of a solution in a well-posed framework. In addition, to resolve the encountered minimization problem, we proposed a modified primal-dual algorithm and numerical results are also given to show the performance of the proposed approach.


Sign in / Sign up

Export Citation Format

Share Document