Engineering Papers⌕ Search

Engineering topics

Katsaggelos, Aggelos K.

Publications and source records attributed to Katsaggelos, Aggelos K..

At least 19 records

Characterization of Crystal Properties and Defects in CdZnTe Radiation Detectors

CdZnTe-based detectors are highly valued because of their high spectral resolution, which is an essential feature for nuclear medical imaging. However, this resolution is compromised when there are substantial defects in the CdZnTe crystals. In this study, we present a learning-based approach to determine the spatially dependent bulk properties and defects in semiconductor detectors. This characterization allows us to mitigate and compensate for the undesired effects caused by crystal impurities. We tested our model with computer-generated noise-free input data, where it showed excellent accuracy, achieving an average RMSE of 0.43% between the predicted and the ground truth crystal properties. In addition, a sensitivity analysis was performed to determine the effect of noisy data on the accuracy of the model.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Avian Activity Classification Using Recurrent Networks to Fuse Videos with Metadata on Imbalanced Datasets

Activity classification plays a crucial role in various real-life scenarios involving both humans and animals. There is an increasing need for precise activity classification focused on avian-solar interactions, as the usage of solar energy facilities, such as photovoltaic array power stations, has been observed to impact bird species richness, behavior, and activity. However, there has been no work to develop an automated system to monitor and classify these avian-solar interactions. All current methods rely on human observers, which is time and human resources costly and subject to errors related to searcher efficiency. With the recent success of Deep Learning models in activity classification problems, this paper develops a recurrent neural network-based model to automatically classify six avian activities around solar energy facilities. Our proposed model integrates critical feature engineering metadata with video frame data, enabling improved learning and more accurate activity classification. Furthermore, we address the challenge of data imbalance during training and demonstrate the efficacy of our model in detecting and classifying different activities within video tracks. Additionally, we analyze the saliency/backpropagation map of the trained proposed model and validate its decision-making rationale.

Avian activity classification; bidirectional LSTM;↗

Discriminative Dimensionality Reduction using Deep Neural Networks for Clustering of LIGO Data

In this paper, leveraging the capabilities of neural networks for modeling the non-linearities that exist in the data, we propose several models that can project data into a low dimensional, discriminative, and smooth manifold. The proposed models can transfer knowledge from the domain of known classes to a new domain where the classes are unknown. A clustering algorithm is further applied in the new domain to find potentially new classes from the pool of unlabeled data. The research problem and data for this paper originated from the Gravity Spy project which is a side project of Advanced Laser Interferometer Gravitational-wave Observatory (LIGO). The LIGO project aims at detecting cosmic gravitational waves using huge detectors. However non-cosmic, non-Gaussian disturbances known as "glitches", show up in gravitational-wave data of LIGO. This is undesirable as it creates problems for the gravitational wave detection process. Gravity Spy aids in glitch identification with the purpose of understanding their origin. Since new types of glitches appear over time, one of the objective of Gravity Spy is to create new glitch classes. Towards this task, we offer a methodology in this paper to accomplish this.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Systems and methods for interferometric multifocus microscopy

A system to generate image representations includes a first objective that receives a first light beam emitted from a sample and a second objective that receives a second light beam emitted from the sample, where the first light beam and the second light beam have conjugate phase. The system also includes a first diffractive element to receive the first light beam and separate it into a first plurality of diffractive light beams that are spatially distinct, and a second diffractive element to receive the second light beam and separate it into a second plurality of diffractive light beams that are spatially distinct. The system further includes a detector that receives the first and second plurality of diffractive light beams. The first plurality of diffractive light beams and the second plurality of diffractive light beams are simultaneously directed and focused onto different portions of an image plane of the detector.

He, Kuan↗

Limited-angle computed tomography with deep image and physics priors

Computed tomography is a well-established x-ray imaging technique to reconstruct the three-dimensional structure of objects. It has been used extensively in a variety of fields, from diagnostic imaging to materials and biological sciences. One major challenge in some applications, such as in electron or x-ray tomography systems, is that the projections cannot be gathered over all the angles due to the sample holder setup or shape of the sample. This results in an ill-posed problem called the limited angle reconstruction problem. Typical image reconstruction in this setup leads to distortion and artifacts, thereby hindering a quantitative evaluation of the results. To address this challenge, we use a generative model to effectively constrain the solution of a physics-based approach. Our approach is self-training that can iteratively learn the nonlinear mapping from partial projections to the scanned object. Because our approach combines the data likelihood and image prior terms into a single deep network, it is computationally tractable and improves performance through an end-to-end training. We also complement our approach with total-variation regularization to handle high-frequency noise in reconstructions and implement a solver based on alternating direction method of multipliers. We present numerical results for various degrees of missing angle range and noise levels, which demonstrate the effectiveness of the proposed approach.

47 OTHER INSTRUMENTATION↗

Snapshot multifocal light field microscopy

Light field microscopy (LFM) is an emerging technology for high-speed wide-field 3D imaging by capturing 4D light field of 3D volumes. However, its 3D imaging capability comes at a cost of lateral resolution. In addition, the lateral resolution is not uniform across depth in the light field dconvolution reconstructions. To address these problems, here, we propose a snapshot multifocal light field microscopy (MFLFM) imaging method. The underlying concept of the MFLFM is to collect multiple focal shifted light fields simultaneously. We show that by focal stacking those focal shifted light fields, the depth-of-field (DOF) of the LFM can be further improved but without sacrificing the lateral resolution. Also, if all differently focused light fields are utilized together in the deconvolution, the MFLFM could achieve a high and uniform lateral resolution within a larger DOF. We present a house-built MFLFM system by placing a diffractive optical element at the Fourier plane of a conventional LFM. The optical performance of the MFLFM are analyzed and given. Both simulations and proof-of-principle experimental results are provided to demonstrate the effectiveness and benefits of the MFLFM. We believe that the proposed snapshot MFLFM has potential to enable high-speed and high resolution 3D imaging applications.

He, Kuan↗

Scalable and efficient learning from crowds with Gaussian processes

Over the last few years, multiply-annotated data has become a very popular source of information. Online platforms such as Amazon Mechanical Turk have revolutionized the labelling process needed for any classification task, sharing the effort between a number of annotators (instead of the classical single expert). This crowdsourcing approach has introduced new challenging problems, such as handling disagreements on the annotated samples or combining the unknown expertise of the annotators. Probabilistic methods, such as Gaussian Processes (GP), have proven successful to model this new crowdsourcing scenario. However, GPs do not scale up well with the training set size, which makes them prohibitive for medium-to-large datasets (beyond 10K training instances). This constitutes a serious limitation for current real-world applications. In this work, we introduce two scalable and efficient GP-based crowdsourcing methods that allow for processing previously-prohibitive datasets. The first one is an efficient and fast approximation to GP with squared exponential (SE) kernel. The second allows for learning a more flexible kernel at the expense of a heavier training (but still scalable to large datasets). Since the latter is not a GP-SE approximation, it can be also considered as a whole new scalable and efficient crowdsourcing method, useful for any dataset size. Both methods use Fourier features and variational inference, can predict the class of new samples, and estimate the expertise of the involved annotators. A complete experimentation compares them with state-of-the-art probabilistic approaches in synthetic and real crowdsourcing datasets of different sizes. Finally, they stand out as the best performing approach for large scale problems. Moreover, the second method is competitive with the current state-of-the-art for small datasets.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Rapid alignment of nanotomography data using joint iterative reconstruction and reprojection

As x-ray and electron tomography is pushed farther into the nanoscale, the limitations of rotation stages become more apparent leading to challenges in the alignment of the acquired projection images. Here we present an approach for rapid post-acquisition alignment of these projections to obtain high quality 3D images. Our approach is based on a joint estimation of alignment errors, and the object, using an iterative refinement procedure. We characterize convergence in simulations, and show its application in x-ray and electron nanotomography.

47 OTHER INSTRUMENTATION↗

Spatial-Spectral Representation for X-Ray Fluorescence Image Super-Resolution

X-ray fluorescence (XRF) scanning of works of art is becoming an increasing popular nondestructive analyticalmethod. The high quality XRF spectra is necessary to obtain significant information on both major and minor elements used for characterization and provenance analysis. However, there is a tradeoff between the spatial resolution of an XRF scan and the signalto- noise ratio (SNR) of each pixel’s spectrum, due to the limited scanning time. In this project, we propose an XRF image super-resolution method to address this tradeoff; thus, obtaining a high spatial resolution XRF scan with high SNR. We fuse a lowresolution XRF image and a conventional RGB high-resolution image into a product of both high spatial and high spectral resolution XRF image. There is no guarantee of a one to one mapping between XRF spectrum and RGB color since, for instance, paintings with hidden layers cannot be detected in visible but can in X-ray wavelengths. We separate the XRF image into the visible and nonvisible components. The spatial resolution of the visible component is increased utilizing the high-resolution RGB image, whereas the spatial resolution of the non-visible component is increased using a total variation super-resolution method. Finally, the visible and nonvisible components are combined to obtain the final result.

Dai, Qiqin↗

Bayesian K-SVD Using Fast Variational Inference

Recent work in signal processing in general and image processing in particular deals with sparse representation related problems. Two such problems are of paramount importance: an overriding need for designing a well-suited overcomplete dictionary containing a redundant set of atoms— i.e., basis signals—and how to find a sparse representation of a given signal with respect to the chosen dictionary. Dictionary learning techniques, among which we find the popular K-singular value decomposition algorithm, tackle these problems by adapting a dictionary to a set of training data. A common drawback of such techniques is the need for parameter-tuning. In order to overcome this limitation, we propose a fullyautomated Bayesian method that considers the uncertainty of the estimates and produces a sparse representation of the data without prior information on the number of non-zeros in each representation vector. We follow a Bayesian approach that uses a three-tiered hierarchical prior to enforce sparsity on the representations and develop an efficient variational inference framework that reduces computational complexity. Furthermore, we describe a greedy approach that speeds up the whole process. Lastly, we present experimental results that show superior performance on two different applications with real images: denoising and inpainting.

97 MATHEMATICS AND COMPUTING↗

Fast Bayesian blind deconvolution with Huber Super Gaussian priors

We report expectation Maximization (EM) based inference has already proven to be a very powerful tool to solve blind image deconvolution (BID) problems. Unfortunately, three important problems still impede the application of EM in BID: the undesirable saddle points and local minima caused by highly nonconvex priors, the instability around zero of some of the most interesting sparsity promoting priors, and the intrinsic high computational cost of the corresponding BID algorithm. In this paper we first show how Super Gaussian priors can be made numerically tractable around zero by introducing the family of Huber Super Gaussian priors and then present a fast EM based blind deconvolution method formulated in the image space. In the proposed computational approach, image and kernel estimation are performed by using the Alternating Direction Method of Multipliers (ADMM), which allows to exploit the advantages of FFT computation. For highly nonconvex priors, we propose a Smooth ADMM (SADMM) approach to avoid poor BID estimates. In conclusion, extensive experiments demonstrate that the proposed method significantly outperforms state-of-the-art BID methods in terms of quality of the reconstructions and speed.

97 MATHEMATICS AND COMPUTING↗

Joint Data Filtering and Labeling Using Gaussian Processes and Alternating Direction Method of Multipliers

Here, sequence labeling aims at assigning a label to every sample of a signal (or pixel of an image) while considering the sequentiality (or vicinity) of the samples. To perform this task, many works in the literature first filter and then label the data. Unfortunately, the filtering, which is performed independently from the labeling, is far from optimal and frequently makes the latter task harder. In this paper, a novel approach that trains a Gaussian process classifier and estimates the coefficients of an optimal filter jointly is presented. The new approach, based on Bayesian modeling and alternating direction method of multipliers (ADMMs) optimization, performs both tasks simultaneously. All unknowns are treated as stochastic variables, which are estimated using variational inference and filtering and labeling are linked with the use of ADMM. In the experimental section, synthetic and real experiments are presented to compare the proposed method with other existing approaches.

97 MATHEMATICS AND COMPUTING↗

Compressive sensing super resolution from multiple observations with application to passive millimeter wave images

In this study we propose a novel framework to obtain high resolution images from compressed sensing imaging systems capturing multiple low resolution images of the same scene. The proposed approach of Compressed Sensing Super Resolution (CSSR), combines existing compressed sensing reconstruction algorithms with a low-resolution to high-resolution approach based on the use of a super Gaussian regularization term. The reconstruction alternates between compressed sensing reconstruction and super resolution reconstruction, including registration parameter estimation. The image estimation subproblem is solved using majorization-minimization while the compressed sensing reconstruction becomes an l 1 -minimization subject to a quadratic constraint. The performed experiments on grayscale and synthetically compressed real millimeter wave images, demonstrate the capability of the proposed framework to provide very good quality super resolved images from multiple low resolution compressed acquisitions.

42 ENGINEERING↗