scholarly journals Microwave Breast Imaging Using Compressed Sensing Approach of Iteratively Corrected Delay Multiply and Sum Beamforming

Diagnostics ◽  
2021 ◽  
Vol 11 (3) ◽  
pp. 470
Author(s):  
Mohammad Tariqul Islam ◽  
Md Tarikul Islam ◽  
Md Samsuzzaman ◽  
Salehin Kibria ◽  
Muhammad E. H. Chowdhury
Keyword(s):  
Compressed Sensing ◽  
Breast Imaging ◽  
Computation Time ◽  
Vital Role ◽  
Imaging Diagnosis ◽  
Improved Method ◽  
Multiple Reflections ◽  
Channel Calculation ◽  
Monitoring Technique ◽  
Vivaldi Antennas

Microwave imaging (MI) is a consistent health monitoring technique that can play a vital role in diagnosing anomalies in the breast. The reliability of biomedical imaging diagnosis is substantially dependent on the imaging algorithm. Widely used delay and sum (DAS)-based diagnosis algorithms suffer from some significant drawbacks. The delay multiply and sum (DMAS) is an improved method and has benefits over DAS in terms of greater contrast and better resolution. However, the main drawback of DMAS is its excessive computational complexity. This paper presents a compressed sensing (CS) approach of iteratively corrected DMAS (CS-ICDMAS) beamforming that reduces the channel calculation and computation time while maintaining image quality. The array setup for acquiring data comprised 16 Vivaldi antennas with a bandwidth of 2.70–11.20 GHz. The power of all the channels was calculated and low power channels were eliminated based on the compression factor. The algorithm involves data-independent techniques that eliminate multiple reflections. This can generate results similar to the uncompressed variants in a significantly lower time which is essential for real-time applications. This paper also investigates the experimental data that prove the enhanced performance of the algorithm.

Performance Evaluation of Population Seeding Techniques of Permutation-Coded GA Traveling Salesman Problems Based Assessment

2021 ◽  
pp. 1074-1115
Author(s):  
Victer Paul ◽  
Ganeshkumar C ◽  
Jayakumar L
Keyword(s):  
Genetic Algorithms ◽  
Nearest Neighbor ◽  
Optimization Technique ◽  
Optimal Solution ◽  
Computation Time ◽  
Search Space ◽  
Population Based ◽  
Vital Role ◽  
Traveling Salesman ◽  
Performance Criteria

Genetic algorithms (GAs) are a population-based meta-heuristic global optimization technique for dealing with complex problems with a very large search space. The population initialization is a crucial task in GAs because it plays a vital role in the convergence speed, problem search space exploration, and also the quality of the final optimal solution. Though the importance of deciding problem-specific population initialization in GA is widely recognized, it is hardly addressed in the literature. In this article, different population seeding techniques for permutation-coded genetic algorithms such as random, nearest neighbor (NN), gene bank (GB), sorted population (SP), and selective initialization (SI), along with three newly proposed ordered-distance-vector-based initialization techniques have been extensively studied. The ability of each population seeding technique has been examined in terms of a set of performance criteria, such as computation time, convergence rate, error rate, average convergence, convergence diversity, nearest-neighbor ratio, average distinct solutions and distribution of individuals. One of the famous combinatorial hard problems of the traveling salesman problem (TSP) is being chosen as the testbed and the experiments are performed on large-sized benchmark TSP instances obtained from standard TSPLIB. The scope of the experiments in this article is limited to the initialization phase of the GA and this restricted scope helps to assess the performance of the population seeding techniques in their intended phase alone. The experimentation analyses are carried out using statistical tools to claim the unique performance characteristic of each population seeding techniques and best performing techniques are identified based on the assessment criteria defined and the nature of the application.

scholarly journals Energy Preserved Sampling for Compressed Sensing MRI

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Yudong Zhang ◽  
Bradley S. Peterson ◽  
Genlin Ji ◽  
Zhengchao Dong
Keyword(s):  
Compressed Sensing ◽  
Cost Function ◽  
Computation Time ◽  
Reconstruction Algorithm ◽  
Simple Random Sampling ◽  
Variable Density ◽  
Reconstruction Algorithms ◽  
Iterative Thresholding ◽  
Thresholding Algorithm

The sampling patterns, cost functions, and reconstruction algorithms play important roles in optimizing compressed sensing magnetic resonance imaging (CS-MRI). Simple random sampling patterns did not take into account the energy distribution ink-space and resulted in suboptimal reconstruction of MR images. Therefore, a variety of variable density (VD) based samplings patterns had been developed. To further improve it, we propose a novel energy preserving sampling (ePRESS) method. Besides, we improve the cost function by introducing phase correction and region of support matrix, and we propose iterative thresholding algorithm (ITA) to solve the improved cost function. We evaluate the proposed ePRESS sampling method, improved cost function, and ITA reconstruction algorithm by 2D digital phantom and 2Din vivoMR brains of healthy volunteers. These assessments demonstrate that the proposed ePRESS method performs better than VD, POWER, and BKO; the improved cost function can achieve better reconstruction quality than conventional cost function; and the ITA is faster than SISTA and is competitive with FISTA in terms of computation time.

Breast Imaging: Diagnosis and Morphology of Breast Diseases

Radiology ◽  
1988 ◽  
Vol 168 (2) ◽  
pp. 428-428
Author(s):  
Douglas E. Sanders
Keyword(s):  
Breast Imaging ◽  
Breast Diseases ◽  
Imaging Diagnosis

scholarly journals A Novel Compressed Sensing Method for Magnetic Resonance Imaging: Exponential Wavelet Iterative Shrinkage-Thresholding Algorithm with Random Shift

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Yudong Zhang ◽  
Jiquan Yang ◽  
Jianfei Yang ◽  
Aijun Liu ◽  
Ping Sun
Keyword(s):  
Magnetic Resonance Imaging ◽  
Magnetic Resonance ◽  
Compressed Sensing ◽  
Mean Squared Error ◽  
State Of The Art ◽  
Computation Time ◽  
Resonance Imaging ◽  
Iterative Shrinkage ◽  
Thresholding Algorithm ◽  
Iterative Shrinkage Thresholding

Aim. It can help improve the hospital throughput to accelerate magnetic resonance imaging (MRI) scanning. Patients will benefit from less waiting time.Task. In the last decade, various rapid MRI techniques on the basis of compressed sensing (CS) were proposed. However, both computation time and reconstruction quality of traditional CS-MRI did not meet the requirement of clinical use.Method. In this study, a novel method was proposed with the name of exponential wavelet iterative shrinkage-thresholding algorithm with random shift (abbreviated as EWISTARS). It is composed of three successful components: (i) exponential wavelet transform, (ii) iterative shrinkage-thresholding algorithm, and (iii) random shift.Results. Experimental results validated that, compared to state-of-the-art approaches, EWISTARS obtained the least mean absolute error, the least mean-squared error, and the highest peak signal-to-noise ratio.Conclusion. EWISTARS is superior to state-of-the-art approaches.

scholarly journals An Introspective Performance Analysis of Threshold-based Segmentation Techniques on Digital Mammograms

YMER Digital ◽  
2021 ◽  
Vol 20 (11) ◽  
pp. 176-195
Author(s):  
A Nithya ◽  
◽  
P Shanmugavadivu ◽  
Keyword(s):  
Image Segmentation ◽  
Medical Image Analysis ◽  
Region Of Interest ◽  
Computation Time ◽  
Vital Role ◽  
Cancer Prognosis ◽  
Processing Step ◽  
Segmentation Methods ◽  
Reliable Source ◽  
Mammogram Images

Image segmentation, as a pre-processing step, plays a vital role in medical image analysis. The variants of threshold-based image segmentation methods are proved to offer feasible and optimal solutions to extract the region of interest (RoI), from medical images. Digital mammograms are used as a reliable source of breast cancer prognosis and diagnosis. Thresholding is a simple and effective strategy that finds applications in image processing and analysis. This research aimed to analyze the performance behaviour of a few threshold-based segmentation methods with respect to the intensity distribution of the input mammograms. For this analytical research, six automated thresholding segmentation techniques were chosen: Kapur, Otsu’s, Isoentropic, Ridler & Calvard’s, Kittler & Illingworth's, and Yen. The performance and behaviour of those methods were validated on the digital mammogram images of mini-MIAS database featured with Fatty (F), Fatty-Glandular (G), and Dense-Glandular (D) breast tissues. Those methods were analyzed on two metrics viz., Region Non-Uniformity (RNU) and computation time. The results of this research confirm that Ridler & Calvard’s method gives the best segmentation results for Dense-Glandular, Isoentropic method gives better segmentation results for Fatty and Yen method works well on the Fatty-Glandular normal mammogram images.

scholarly journals Evaluation of Unsupervised Anomaly Detection Methods in Sentiment Mining

2019 ◽  
Vol 8 (9) ◽  
pp. 1080-1085
Keyword(s):  
Anomaly Detection ◽  
Computation Time ◽  
Vital Role ◽  
Detection Methods ◽  
Research Focus ◽  
Comparative Performance ◽  
Detection Techniques ◽  
Detection Algorithms ◽  
Sentiment Mining ◽  
Unsupervised Anomaly Detection

Anomaly detection has vital role in data preprocessing and also in the mining of outstanding points for marketing, network sensors, fraud detection, intrusion detection, stock market analysis. Recent studies have been found to concentrate more on outlier detection for real time datasets. Anomaly detection study is at present focuses on the expansion of innovative machine learning methods and on enhancing the computation time. Sentiment mining is the process to discover how people feel about a particular topic. Though many anomaly detection techniques have been proposed, it is also notable that the research focus lacks a comparative performance evaluation in sentiment mining datasets. In this study, three popular unsupervised anomaly detection algorithms such as density based, statistical based and cluster based anomaly detection methods are evaluated on movie review sentiment mining dataset. This paper will set a base for anomaly detection methods in sentiment mining research. The results show that density based (LOF) anomaly detection method suits best for the movie review sentiment dataset.

Performance Evaluation of Population Seeding Techniques of Permutation-Coded GA Traveling Salesman Problems Based Assessment

2019 ◽  
Vol 10 (2) ◽  
pp. 55-92 ◽  
Author(s):  
Victer Paul ◽  
Ganeshkumar C ◽  
Jayakumar L
Keyword(s):  
Genetic Algorithms ◽  
Nearest Neighbor ◽  
Optimization Technique ◽  
Optimal Solution ◽  
Computation Time ◽  
Search Space ◽  
Population Based ◽  
Vital Role ◽  
Traveling Salesman ◽  
Performance Criteria

Genetic algorithms (GAs) are a population-based meta-heuristic global optimization technique for dealing with complex problems with a very large search space. The population initialization is a crucial task in GAs because it plays a vital role in the convergence speed, problem search space exploration, and also the quality of the final optimal solution. Though the importance of deciding problem-specific population initialization in GA is widely recognized, it is hardly addressed in the literature. In this article, different population seeding techniques for permutation-coded genetic algorithms such as random, nearest neighbor (NN), gene bank (GB), sorted population (SP), and selective initialization (SI), along with three newly proposed ordered-distance-vector-based initialization techniques have been extensively studied. The ability of each population seeding technique has been examined in terms of a set of performance criteria, such as computation time, convergence rate, error rate, average convergence, convergence diversity, nearest-neighbor ratio, average distinct solutions and distribution of individuals. One of the famous combinatorial hard problems of the traveling salesman problem (TSP) is being chosen as the testbed and the experiments are performed on large-sized benchmark TSP instances obtained from standard TSPLIB. The scope of the experiments in this article is limited to the initialization phase of the GA and this restricted scope helps to assess the performance of the population seeding techniques in their intended phase alone. The experimentation analyses are carried out using statistical tools to claim the unique performance characteristic of each population seeding techniques and best performing techniques are identified based on the assessment criteria defined and the nature of the application.

Optimization of Greedy Pursuit Algorithms Based on Probability Analysis

2013 ◽  
Vol 433-435 ◽  
pp. 621-625
Author(s):  
Yi Zheng ◽  
Ti Jian Cai
Keyword(s):  
Compressed Sensing ◽  
Conditional Probability ◽  
Signal Reconstruction ◽  
Probability Analysis ◽  
Improved Method

Through analyzing prior conditional probability of signal reconstruction in compressed sensing, the paper puts forward an improved method toward serials greedy pursuit algorithms. This method can achieve more accurate selection when select columns in perception matrix that is the most correlated with the residual. Meanwhile, this paper reviews most of greedy pursuit algorithms, and simulations validate the efficacy of the proposed method.

Systemic diseases affecting the breast: Imaging, diagnosis, and management

2021 ◽  
Vol 77 ◽  
pp. 76-85
Author(s):  
Ted Goh ◽  
Kimberly Dao ◽  
Anna F. Rives ◽  
Michael D.C. Fishman ◽  
Priscilla J. Slanetz
Keyword(s):  
Breast Imaging ◽  
Systemic Diseases ◽  
Imaging Diagnosis ◽  
Diagnosis And Management

scholarly journals An Improved Method of Measuring Wavefront Aberration Based on Image with Machine Learning in Free Space Optical Communication

Sensors ◽  
2019 ◽  
Vol 19 (17) ◽  
pp. 3665 ◽  
Author(s):  
Yangjie Xu ◽  
Dong He ◽  
Qiang Wang ◽  
Hongyang Guo ◽  
Qing Li ◽  
...  
Keyword(s):  
Machine Learning ◽  
Optical Communication ◽  
Free Space ◽  
Computation Time ◽  
Estimation Accuracy ◽  
Wavefront Aberration ◽  
Free Space Optical Communication ◽  
Free Space Optical ◽  
Improved Method ◽  
Space Optical Communication

In this paper, an improved method of measuring wavefront aberration based on image with machine learning is proposed. This method had better real-time performance and higher estimation accuracy in free space optical communication in cases of strong atmospheric turbulence. We demonstrated that the network we optimized could use the point spread functions (PSFs) at a defocused plane to calculate the corresponding Zernike coefficients accurately. The computation time of the network was about 6–7 ms and the root-mean-square (RMS) wavefront error (WFE) between reconstruction and input was, on average, within 0.1263 waves in the situation of D/r0 = 20 in simulation, where D was the telescope diameter and r0 was the atmospheric coherent length. Adequate simulations and experiments were carried out to indicate the effectiveness and accuracy of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document