scholarly journals Modified Low Rank Approximation for Detection of Weak Target by Noise space Exploitation in Through Wall Imaging

2019 ◽  
Vol 69 (5) ◽  
pp. 464-468
Author(s):  
Mandar K. Bivalkar ◽  
Bambam Kumar ◽  
Dharmendra Singh
Keyword(s):  
Dielectric Material ◽  
Random Noise ◽  
Dielectric Materials ◽  
Low Rank ◽  
Low Rank Approximation ◽  
Low Dielectric ◽  
Novel Approach ◽  
Rank Approximation ◽  
Weak Target ◽  
Wall Imaging

Low dielectric materials referred as weak targets are very difficult to detect behind the wall in through wall imaging (TWI) due to strong reflections from wall. TWI Experimental data collected for low dielectric target behind the wall and transceiver on another side of the wall. Recently several researchers are using low-rank approximation (LRA) for reduction of random noise in the various data. Explore the possibilities of using LRA for TWI data for improving the detection of low dielectric material. A novel approach using modification of LRA with exploiting the noise subspace in singular value decomposition (SVD) to detect weak target behind the wall is introduced. LRA consider data has low rank in f-x domain for noisy data, local windows are implemented in LRA approach to satisfy the principle assumptions required by the LRA algorithm itself. Decomposed TWI data in the noise space of the SVD to detect the weak target adaptively. Results for modified LRA for detection of weak target behind the wall are very encouraging over LRA.

scholarly journals Entropy-Based Low-Rank Approximation for Contrast Dielectric Target Detection with Through Wall Imaging System

Electronics ◽  
2019 ◽  
Vol 8 (6) ◽  
pp. 634 ◽  
Author(s):  
Mandar Bivalkar ◽  
Dharmendra Singh ◽  
Hirokazu Kobayashi
Keyword(s):  
Target Detection ◽  
Imaging System ◽  
Random Noise ◽  
Low Rank ◽  
Low Rank Approximation ◽  
Reduction Techniques ◽  
Single Target ◽  
Detection Of Objects ◽  
Rank Approximation ◽  
Wall Imaging

In through wall imaging, clutter plays an important role in the detection of objects behind the wall. In the literature, extensive studies have been carried out to eliminate clutter in the case of targets with the same dielectric. Existing clutter reduction techniques, such as the sub-space approach, differential approach, entropy-based time gating, etc., are able to detect a single target or two targets with the same dielectric behind the wall. In a real-time scenario, it is not necessary that targets with the same dielectric will be present behind the wall. Very few studies are available for the detection of targets with different dielectrics; here we termed it “contrast target detection” in the same scene. Recently, low-rank approximation (LRA) was proposed to reduce random noise in the data. In this paper, a novel method based on entropy thresholding for low-rank approximation is introduced for contrast target detection. It was observed that our proposed method gives satisfactory results.

scholarly journals Neuron Interaction Based Representation Composition for Neural Machine Translation

2020 ◽  
Vol 34 (05) ◽  
pp. 8204-8211
Author(s):  
Jian Li ◽  
Xing Wang ◽  
Baosong Yang ◽  
Shuming Shi ◽  
Michael R. Lyu ◽  
...  
Keyword(s):  
Machine Translation ◽  
Semantic Information ◽  
Low Rank ◽  
Strong Interactions ◽  
Low Rank Approximation ◽  
Neural Machine Translation ◽  
First Order ◽  
Complex Information ◽  
Novel Approach ◽  
Rank Approximation

Recent NLP studies reveal that substantial linguistic information can be attributed to single neurons, i.e., individual dimensions of the representation vectors. We hypothesize that modeling strong interactions among neurons helps to better capture complex information by composing the linguistic properties embedded in individual neurons. Starting from this intuition, we propose a novel approach to compose representations learned by different components in neural machine translation (e.g., multi-layer networks or multi-head attention), based on modeling strong interactions among neurons in the representation vectors. Specifically, we leverage bilinear pooling to model pairwise multiplicative interactions among individual neurons, and a low-rank approximation to make the model computationally feasible. We further propose extended bilinear pooling to incorporate first-order representations. Experiments on WMT14 English⇒German and English⇒French translation tasks show that our model consistently improves performances over the SOTA Transformer baseline. Further analyses demonstrate that our approach indeed captures more syntactic and semantic information as expected.

Random noise attenuation in seismic data using Hankel sparse low-rank approximation

2021 ◽  
pp. 104802
Author(s):  
Rasoul Anvari ◽  
Amin Roshandel Kahoo ◽  
Mehrdad Soleimani Monfared ◽  
Mokhtar Mohammadi ◽  
Rebaz Mohammed Dler Omer ◽  
...  
Keyword(s):  
Seismic Data ◽  
Random Noise ◽  
Low Rank ◽  
Noise Attenuation ◽  
Low Rank Approximation ◽  
Random Noise Attenuation ◽  
Rank Approximation

scholarly journals Thresholding Approach for Low-Rank Correlation Matrix based on MM algorithm

2021 ◽  
Author(s):  
Kensuke Tanioka ◽  
Yuki Furotani ◽  
Satoru Hiwa
Keyword(s):  
Correlation Matrix ◽  
Rank Correlation ◽  
Low Rank ◽  
Threshold Values ◽  
Low Rank Approximation ◽  
Microarray Gene Expression ◽  
Sparse Estimation ◽  
Mm Algorithm ◽  
Novel Approach ◽  
Rank Approximation

Background: Low-rank approximation is a very useful approach for interpreting the features of a correlation matrix; however, a low-rank approximation may result in estimation far from zero even if the corresponding original value was far from zero. In this case, the results lead to misinterpretation. Methods: To overcome these problems, we propose a new approach to estimate a sparse low-rank correlation matrix based on threshold values combined with cross-validation. In the proposed approach, the MM algorithm was used to estimate the sparse low-rank correlation matrix, and a grid search was performed to select the threshold values related to sparse estimation. Results: Through numerical simulation, we found that the FPR and average relative error of the proposed method were superior to those of the tandem approach. For the application of microarray gene expression, the FPRs of the proposed approach with d=2,3, and 5 were 0.128, 0.139, and 0.197, respectively, while FPR of the tandem approach was 0.285. Conclusions: We propose a novel approach to estimate sparse low-rank correlation matrix. The advantage of the proposed method is that it provides results that are easy to interpret and avoid misunderstandings. We demonstrated the superiority of the proposed method through both numerical simulations and real examples.

Improved MR image denoising via low- rank approximation and Laplacian-of-Gaussian edge detector

2020 ◽  
Vol 14 (12) ◽  
pp. 2791-2798
Author(s):  
Xiaoqun Qiu ◽  
Zhen Chen ◽  
Saifullah Adnan ◽  
Hongwei He
Keyword(s):  
Image Denoising ◽  
Low Rank ◽  
Edge Detector ◽  
Low Rank Approximation ◽  
Mr Image ◽  
Rank Approximation

scholarly journals Fast Joint Multiband Reconstruction From Wideband Images Based on Low-Rank Approximation

2020 ◽  
Vol 6 ◽  
pp. 922-933
Author(s):  
M. Amine Hadj-Youcef ◽  
Francois Orieux ◽  
Alain Abergel ◽  
Aurelia Fraysse
Keyword(s):  
Low Rank ◽  
Low Rank Approximation ◽  
Rank Approximation

scholarly journals Low-Rank Approximation of Difference between Correlation Matrices Using Inner Product

2021 ◽  
Vol 11 (10) ◽  
pp. 4582
Author(s):  
Kensuke Tanioka ◽  
Satoru Hiwa
Keyword(s):  
Dimensional Reduction ◽  
Low Rank ◽  
Inner Product ◽  
Low Rank Approximation ◽  
Correlation Matrices ◽  
Rank Matrix ◽  
Clustering Approach ◽  
Rank Approximation ◽  
The Difference ◽  
Low Rank Matrix

In the domain of functional magnetic resonance imaging (fMRI) data analysis, given two correlation matrices between regions of interest (ROIs) for the same subject, it is important to reveal relatively large differences to ensure accurate interpretation. However, clustering results based only on differences tend to be unsatisfactory and interpreting the features tends to be difficult because the differences likely suffer from noise. Therefore, to overcome these problems, we propose a new approach for dimensional reduction clustering. Methods: Our proposed dimensional reduction clustering approach consists of low-rank approximation and a clustering algorithm. The low-rank matrix, which reflects the difference, is estimated from the inner product of the difference matrix, not only from the difference. In addition, the low-rank matrix is calculated based on the majorize–minimization (MM) algorithm such that the difference is bounded within the range −1 to 1. For the clustering process, ordinal k-means is applied to the estimated low-rank matrix, which emphasizes the clustering structure. Results: Numerical simulations show that, compared with other approaches that are based only on differences, the proposed method provides superior performance in recovering the true clustering structure. Moreover, as demonstrated through a real-data example of brain activity measured via fMRI during the performance of a working memory task, the proposed method can visually provide interpretable community structures consisting of well-known brain functional networks, which can be associated with the human working memory system. Conclusions: The proposed dimensional reduction clustering approach is a very useful tool for revealing and interpreting the differences between correlation matrices, even when the true differences tend to be relatively small.

Sign in / Sign up

Export Citation Format

Share Document