Computational reconstruction plays a vital role in computer vision and computational photography. Most of the conventional optimization and deep learning techniques explore local information for reconstruction. Recently, nonlocal low-rank (NLR) reconstruction has achieved remarkable success in improving accuracy and generalization. However, the computational cost has inhibited NLR from seeking global structural similarity, which consequentially keeps it trapped in the tradeoff between accuracy and efficiency and prevents it from high-dimensional large-scale tasks. To address this challenge, we report here the global low-rank (GLR) optimization technique, realizing highly-efficient large-scale reconstruction with global self-similarity. Inspired by the self-attention mechanism in deep learning, GLR extracts exemplar image patches by feature detection instead of conventional uniform selection. This directly produces key patches using structural features to avoid burdensome computational redundancy. Further, it performs patch matching across the entire image via neural-based convolution, which produces the global similarity heat map in parallel, rather than conventional sequential block-wise matching. As such, GLR improves patch grouping efficiency by more than one order of magnitude. We experimentally demonstrate GLR's effectiveness on temporal, frequency, and spectral dimensions, including different computational imaging modalities of compressive temporal imaging, magnetic resonance imaging, and multispectral filter array demosaicing. This work presents the superiority of inherent fusion of deep learning strategies and iterative optimization, and breaks the persistent dilemma of the tradeoff between accuracy and efficiency for various large-scale reconstruction tasks.
Compressed sensing MRI is a classic inverse problem in the field of computational imaging, accelerating the MR imaging by measuring less k-space data. The deep neural network models provide the stronger representation ability and faster reconstruction compared with "shallow" optimization-based methods. However, in the existing deep-based CS-MRI models, the high-level semantic supervision information from massive segmentation-labels in MRI dataset is overlooked. In this paper, we proposed a segmentation-aware deep fusion network called SADFN for compressed sensing MRI. The multilayer feature ag…
Based on point spread function (PSF) engineering and astigmatism due to a pair of cylindrical lenses, a novel compressed imaging mechanism is proposed to achieve single-shot incoherent 3D imaging. The speckle-like PSF of the imaging system is sensitive to axial shift, which makes it feasible to reconstruct a 3D image by solving an optimization problem with sparsity constraint. With the experimentally calibrated PSFs, the proposed method is demonstrated by a synthetic 3D point object and real 3D object, and the images in different axial slices can be reconstructed faithfully. Moreover, 3D multi…
In this paper, we propose an advanced framework of ghost edge imaging, named compressed ghost edge imaging (CGEI). In the scheme, a set of structured speckle patterns with pixel shifting are illuminated on an unknown object, and the output is collected by a bucket detector without any spatial resolution. By using compressed sensing algorithm, we obtain the horizontal and vertical edge information of the unknown object with the bucket detector detection results and the known structured speckle patterns. The edge is finally constructed by the two-dimentional edge information. The experimental an…
Bangladesh University of Engineering and Technology（孟加拉国工程技术大学）
Parallel imaging accelerates MRI data acquisition by acquiring additional sensitivity information with an array of receiver coils, resulting in fewer phase encoding steps. Because of fewer data requirements than parallel imaging, compressed sensing magnetic resonance imaging (CS-MRI) has gained popularity in the field of medical imaging. Parallel imaging and compressed sensing (CS) both reduce the amount of data captured in the k-space, which speeds up traditional MRI acquisition. As acquisition time is inversely proportional to sample count, forming an image from reduced k-space samples resul…
Traditional radar imaging methods suffer from the problems of low resolution and poor noise suppression. We propose a new radar imaging method based on Self-supervised deep-learning-assisted compressed sensing (SS-DL-CS-Net). The original radar image as the input of net. The net is trained to learn the mapping function between the original radar image and the high quality radar image. However, the high quality radar image cant be obtained. We solve this problem by used the sparsity of radar image. The original radar image and image with the zeros value as the reference of net. Ours net dont ne…
With the advent of multi-coil imaging and compressed sensing, a number of model based reconstruction algorithms have been created. They incorporate a multitude of different regularization functions based on physics, observed phenomenology, and heuristics. Moreover, several iterative methods exist that attempt to simultaneously estimate the sensitivity maps and the image. In this manuscript, we present a generalization of several existing iterative model based algorithms. We devise a calibrationless instance of this generalization that only incorporates regularization terms based on physics and…
Computational ghost imaging (CGI) has recently been intensively studied as an indirect imaging technique. However, the speed of CGI cannot meet the requirements of practical applications. Here, we propose a novel CGI scheme for high-speed imaging. In our scenario, the conventional CGI data processing algorithm is optimized to a new compressed sensing (CS) algorithm based on a convolutional neural network (CNN). CS is used to process the data collected by a conventional CGI device. Then, the processed data are trained by a CNN to reconstruct the image. The experimental results show that our sch…
In this text, results of a 0.35 terahertz (THz) dynamic aperture imaging approach are presented. The experiments use an optical modulation approach and a single pixel detector at a stand-off imaging distance of approx 1 meter. The optical modulation creates dynamic apertures of 5cm diameter with approx 2000 individually controllable elements. An optical modulation approach is used here for the first time at a large far-field distance, for the investigation of various test targets in a field-of-view of 8 x 8 cm. The results highlight the versatility of this modulation technique and show that th…
In various imaging problems, we only have access to compressed measurements of the underlying signals, hindering most learning-based strategies which usually require pairs of signals and associated measurements for training. Learning only from compressed measurements is impossible in general, as the compressed observations do not contain information outside the range of the forward sensing operator. We propose a new end-to-end self-supervised framework that overcomes this limitation by exploiting the equivariances present in natural signals. Our proposed learning strategy performs as well as f…
In this paper, a convolutional sparse coding method based on global structure characteristics and spectral correlation is proposed for the reconstruction of compressive spectral images. The spectral data is regarded as the convolution sum of the convolution kernel and the corresponding coefficients, using the convolution kernel operates the global image information, preserving the structure information of the spectral image in the spatial dimension. To take full exploration of the constraints between spectra, the coefficients corresponding to the convolution kernel are constrained by the L_(2,…
Wireless ultrasound (US) systems that produce high-quality images can improve current clinical diagnosis capabilities by making the imaging process much more efficient, affordable, and accessible to users. The most common technique for generating B-mode US images is delay and sum (DAS) beamforming, where an appropriate delay is introduced to signals sampled and processed at each transducer element. However, sampling rates that are much higher than the Nyquist rate of the signal are required for high resolution DAS beamforming, leading to large amounts of data, making transmission of channel da…
Compressed sensing (CS) is a powerful method routinely employed to accelerate image acquisition. It is particularly suited to situations when the image under consideration is sparse but can be sampled in a basis where it is non-sparse. Here we propose an alternate CS regime in situations where the image can be sampled in two incoherent spaces simultaneously, with a special focus on image sampling in Fourier reciprocal spaces (e.g. real-space and k-space). Information is fed-forward from one space to the other, allowing new opportunities to efficiently solve the optimization problem at the hear…
Compressed sensing (CS) is a valuable technique for reconstructing measurements in numerous domains. CS has not yet gained widespread adoption in scanning tunneling microscopy (STM), despite potentially offering the advantages of lower acquisition time and enhanced tolerance to noise. Here we applied a simple CS framework, using a weighted iterative thresholding algorithm for CS reconstruction, to representative high-resolution STM images of superconducting surfaces and adsorbed molecules. We calculated reconstruction diagrams for a range of scanning patterns, sampling densities, and noise int…
Compressed BC-LISTA via Low-Rank Convolutional Decomposition
Ilmenau University of Technology, Ilmenau, Germany（伊门瑙技术大学）；Weizmann Institute of Science, Rehovot, Israel（魏茨曼科学研究院）；Fraunhofer Institute for Nondestructive Testing, Saarbrücken, Germany（弗劳恩霍夫非破坏性测试研究所）
Packet Compressed Sensing Imaging (PCSI) is digital unconnected image transmission method resilient to packet loss. The goal is to develop a robust image transmission method that is computationally trivial to transmit (e.g., compatible with low-power 8-bit microcontrollers) and well suited for weak signal environments where packets are likely to be lost. In other image transmission techniques, noise and packet loss leads to parts of the image being distorted or missing. In PCSI, every packet contains random pixel information from the entire image, and each additional packet received (in any or…
Cross-organ all-in-one parallel compressed sensing magnetic resonance imaging
School of Information Science and Engineering, Yanshan University（燕山大学信息科学与工程学院）；School of Mathematics and Statistics, Xi’an Jiaotong University（西安交通大学数学与统计学院）
Tongji University（同济大学）；Universidad Industrial de Santander（桑坦德工业大学）；Kunming University of Science and Technology（昆明理工大学）；University of Delaware（特拉华大学）
This paper aims at developing a clustering approach with spectral images directly from CASSI compressive measurements. The proposed clustering method first assumes that compressed measurements lie in the union of multiple low-dimensional subspaces. Therefore, sparse subspace clustering (SSC) is an unsupervised method that assigns compressed measurements to their respective subspaces. In addition, a 3D spatial regularizer is added into the SSC problem, thus taking full advantages of the spatial information contained in spectral images. The performance of the proposed spectral image clustering a…
Inspired by the first-order method of Malitsky and Pock, we propose a new variational framework for compressed MR image reconstruction which introduces the application of a rotation-invariant discretization of total variation functional into MR imaging while exploiting BM3D frame as a sparsifying transform. In the first step, we provide theoretical and numerical analysis establishing the exceptional rotation-invariance property of this total variation functional and observe its superiority over other well-known variational regularization terms in both upright and rotated imaging setups. Thereu…
Eindhoven University of Technology（埃因霍温理工大学）；University of Amsterdam（阿姆斯特丹大学）；Philips Research（飞利浦研究院）
Limitations on bandwidth and power consumption impose strict bounds on data rates of diagnostic imaging systems. Consequently, the design of suitable (i.e. task- and data-aware) compression and reconstruction techniques has attracted considerable attention in recent years. Compressed sensing emerged as a popular framework for sparse signal reconstruction from a small set of compressed measurements. However, typical compressed sensing designs measure a (non)linearly weighted combination of all input signal elements, which poses practical challenges. These designs are also not necessarily task-o…
College of Electronic and Optical Engineering（电子与光学工程学院）；College of Microelectronics（微电子学院）；Nanjing University of Posts and Telecommunications（南京邮电大学）；College of Telecommunications & Information Engineering（通信与信息工程学院）
Group sparse representation (GSR) based method has led to great successes in various image recovery tasks, which can be converted into a low-rank matrix minimization problem. As a widely used surrogate function of low-rank, the nuclear norm based convex surrogate usually leads to over-shrinking problem, since the standard soft-thresholding operator shrinks all singular values equally. To improve traditional sparse representation based image compressive sensing (CS) performance, we propose a generalized CS framework based on GSR model, which leads to a nonconvex nonsmooth low-rank minimization …
Group-prior based regularization method has led to great successes in various image processing tasks, which can usually be considered as a low-rank matrix minimization problem. As a widely used surrogate function of low-rank, the nuclear norm based convex surrogate usually lead to over-shrinking phenomena, since the nuclear norm shrinks the rank components (singular value) simultaneously. In this paper, we propose a novel Group-prior based nonconvex image compressive sensing (CS) reconstruction framework via a family of nonconvex nuclear norms functions which contain common concave and monoton…
This paper aims at developing a clustering approach with spectral images directly from the compressive measurements of coded aperture snapshot spectral imager (CASSI). Assuming that compressed measurements often lie approximately in low dimensional subspaces corresponding to multiple classes, state of the art methods generally obtains optimal solution for each step separately but cannot guarantee that it will achieve the globally optimal clustering results. In this paper, a low-rank subspace representation (LRSR) algorithm is proposed to perform clustering on the compressed measurements. In ad…
