Tuddao, Christian Jon D.

Thesis 1 September 6, 2018

BSECE Engr. Evelyn Q. Raguindin

A discretized tomographic image reconstruction based upon total variation regularization

Tomographic image reconstruction problem has an ill-posed nature like many other linear inverse
problems in the image processing domain. Discrete tomography (DT) techniques are developed to cope
with this drawback by utilizing the discreteness of an image. Discrete algebraic reconstruction technique
(DART) is a DT technique that alternates between an inversion stage, employed by the algebraic
reconstruction methods (ARM), and a discretization (i.e. segmentation) stage. Total variation (TV)
minimization is another popular technique that deals with the ill-posedness by exploiting the piece-wise
constancy of the image and basically requires to solve a convex optimization problem. In this paper, we
propose an algorithm which also performs the successive sequences of inversion and discretization, but
it estimates the continuous reconstructions under TV-based regularization instead of using ARM. Our
algorithm incorporates the DART’s idea of reducing the number of unknowns through the subsequent
iterations, with a 1-D TV-based setting. As a second contribution, we also suggest a procedure to be able
to select the segmentation parameters automatically which can be applied when the gray levels
(corresponding to the different densities in the scanned object) are not known a priori. We performed
various experiments using different phantoms, to show the proposed algorithm reveals better
approximations when compared to DART, as well as three other continuous reconstruction techniques.
While investigating the performances, we considered limited number of projections, limited-view, noisy
projections and lack of prior knowledge on gray levels scenarios.

Green - Introduction

Blue - Result

Red – Objective

Teal – Scope

Yellow – Methodology

Violet - Conclusion

Title A discretized tomographic image reconstruction based

upon total variation regularization

Author Ezgi Demircan-Tureyena, Mustafa E. Kamasak

Publication ELSEVIER, www.elsevier.com/locate/bspc
No. of Words 235 words
No. of KeyWords 5 Keywords
Introduction 1st Sentence
Objective/ Significance 5th Sentence
Methodology 2 To 4th Sentences
nd

Scope 6th to 7th Sentences

Results 8th Sentence
Conclusion 9th Sentence
Type of Abstract Desrciptive
An adaptive kernel-based weighted extreme learning machine approach for effective detection of
Parkinson’s disease

Imbalanced data appear in many real-world applications, from biomedical application to network
intrusion or fraud detection, etc. Existing methods for Parkinson’s disease (PD) diagnosis are usually
more concerned with overall accuracy (ACC), but ignore the classification performance of the minority
class. To alleviate the bias against performance caused by imbalanced data. In this paper, an effective
method named AABC-KWELM has been proposed for PD detection. First, based on a fast classifier
extreme learning machine (ELM), weighted strategy is used for dealing with imbalanced data and non-
linear mapping of kernel function is used for improving the extent of linear separation. Furthermore,
both binary version and continuous version of an adaptive artificial bee colony (AABC) algorithm are
used for performing feature selection and parameters optimization, respectively. Finally, PD data set is
used for evaluating rigorously the effectiveness of the proposed method in accordance with specificity,
sensitivity, ACC, Gmean and F-measure. Experimental results demonstrate that the proposed AABC-
KWELM remarkably outperforms other approaches in the literature and obtains better classification
performance via 5-fold cross-validation (CV), with specificity of 100%, sensitivity of 98.62%, ACC of
98.97%, G-mean of 99.30%, and F-measure of 99.30%.

Green - Introduction

Yellow – Objective

Violet – Scope

Red – Methodology

Gray - Result

Title An adaptive kernel-based weighted extreme learning

machine approach for effective detection of
Parkinson’s disease

Author Yang Wanga, An-Na Wanga, Qing Ai , Hai-Jing Suna

Publication ELSEVIER, www.elsevier.com/locate/bspc
No. of Words 188 Words
No. of KeyWords 5 Keywords
Introduction 1st to 2nd Sentence
Objective/Significance 3rd Sentence
Methodology 5th to 7th Sentence
Scope 4th Sentence
Results 8th Sentence
Conclusion
Type of Abstract Desrciptive