Matching Items (65)
Filtering by
- Genre: Doctoral Dissertation
Description
In the rapidly evolving field of computer vision, propelled by advancements in deeplearning, the integration of hardware-software co-design has become crucial to overcome
the limitations of traditional imaging systems. This dissertation explores the integration
of hardware-software co-design in computational imaging, particularly in light transport
acquisition and Non-Line-of-Sight (NLOS) imaging. By leveraging projector-camera
systems and computational techniques, this thesis address critical challenges in imaging
complex environments, such as adverse weather conditions, low-light scenarios, and the
imaging of reflective or transparent objects.
The first contribution in this thesis is the theory, design, and implementation of a slope
disparity gating system, which is a vertically aligned configuration of a synchronized
raster scanning projector and rolling-shutter camera, facilitating selective imaging through
disparity-based triangulation. This system introduces a novel, hardware-oriented approach
to selective imaging, circumventing the limitations of post-capture processing.
The second contribution of this thesis is the realization of two innovative approaches
for spotlight optimization to improve localization and tracking for NLOS imaging. The
first approach utilizes radiosity-based optimization to improve 3D localization and object
identification for small-scale laboratory settings. The second approach introduces a learningbased
illumination network along with a differentiable renderer and NLOS estimation
network to optimize human 2D localization and activity recognition. This approach is
validated on a large, room-scale scene with complex line-of-sight geometries and occluders.
The third contribution of this thesis is an attention-based neural network for passive
NLOS settings where there is no controllable illumination. The thesis demonstrates realtime,
dynamic NLOS human tracking where the camera is moving on a mobile robotic platform. In addition, this thesis contains an appendix featuring temporally consistent
relighting for portrait videos with applications in computer graphics and vision.
ContributorsChandran, Sreenithy (Author) / Jayasuriya, Suren (Thesis advisor) / Turaga, Pavan (Committee member) / Dasarathy, Gautam (Committee member) / Kubo, Hiroyuki (Committee member) / Arizona State University (Publisher)
Created2024
Description
This dissertation presents novel solutions for improving the generalization capabilities of deep learning based computer vision models. Neural networks are known to suffer a large drop in performance when tested on samples from a different distribution than the one on which they were trained. The proposed solutions, based on latent space geometry and meta-learning, address this issue by improving the robustness of these models to distribution shifts. Through the use of geometrical alignment, state-of-the-art domain adaptation and source-free test-time adaptation strategies are developed. Additionally, geometrical alignment can allow classifiers to be progressively adapted to new, unseen test domains without requiring retraining of the feature extractors. The dissertation also presents algorithms for enabling in-the-wild generalization without needing access to any samples from the target domain. Other causes of poor generalization, such as data scarcity in critical applications and training data with high levels of noise and variance, are also explored. To address data scarcity in fine-grained computer vision tasks such as object detection, novel context-aware augmentations are suggested. While the first four chapters focus on general-purpose computer vision models, strategies are also developed to improve robustness in specific applications. The efficiency of training autonomous agents for visual navigation is improved by incorporating semantic knowledge, and the integration of domain experts' knowledge allows for the realization of a low-cost, minimally invasive generalizable automated rehabilitation system. Lastly, new tools for explainability and model introspection using counter-factual explainers trained through interval-based uncertainty calibration objectives are presented.
ContributorsThopalli, Kowshik (Author) / Turaga, Pavan (Thesis advisor) / Thiagarajan, Jayaraman J (Committee member) / Li, Baoxin (Committee member) / Yang, Yezhou (Committee member) / Arizona State University (Publisher)
Created2023
Description
In the era of data explosion, massive data is generated from various sources at an unprecedented speed. The ever-growing amount of data reveals enormous opportunities for developing novel data-driven solutions to unsolved problems. In recent years, benefiting from numerous public datasets and advances in deep learning, data-driven approaches in the computer vision domain have demonstrated superior performance with high adaptability on various data and tasks. Meanwhile, signal processing has long been dominated by techniques derived from rigorous mathematical models built upon prior knowledge of signals. Due to the lack of adaptability to real data and applications, model-based methods often suffer from performance degradation and engineering difficulties. In this dissertation, multiple signal processing problems are studied from vision-inspired data representation and learning perspectives to address the major limitation on adaptability. Corresponding data-driven solutions are proposed to achieve significantly improved performance over conventional solutions. Specifically, in the compressive sensing domain, an open-source image compressive sensing toolbox and benchmark to standardize the implementation and evaluation of reconstruction methods are first proposed. Then a plug-and-play compression ratio adapter is proposed to enable the adaptability of end-to-end data-driven reconstruction methods to variable compression ratios. Lastly, the problem of transfer learning from images to bioelectric signals is experimentally studied to demonstrate the improved performance of data-driven reconstruction. In the image subsampling domain, task-adaptive data-driven image subsampling is studied to reduce data redundancy and retain information of interest simultaneously. In the semiconductor analysis domain, the data-driven automatic error detection problem is studied in the context of integrated circuit segmentation for the first time. In the light detection and ranging(LiDAR) camera calibration domain, the calibration accuracy degradation problem in low-resolution LiDAR scenarios is addressed with data-driven techniques.
ContributorsZhang, Zhikang (Author) / Ren, Fengbo (Thesis advisor) / Li, Baoxin (Committee member) / Turaga, Pavan (Committee member) / Yang, Yezhou (Committee member) / Arizona State University (Publisher)
Created2023
Description
In the age of artificial intelligence, Machine Learning (ML) has become a pervasive force, impacting countless aspects of our lives. As ML’s influence expands, concerns about its reliability and trustworthiness have intensified, with security and robustness emerging as significant challenges. For instance, it has been demonstrated that slight perturbations to a stop sign can cause ML classifiers to misidentify it as a speed limit sign, raising concerns about whether ML algorithms are suitable for real-world deployments. To tackle these issues, Responsible Machine Learning (Responsible ML) has emerged with a clear mission: to develop secure and robust ML algorithms. This dissertation aims to develop Responsible Machine Learning algorithms under real-world constraints. Specifically, recognizing the role of adversarial attacks in exposing security vulnerabilities and robustifying the ML methods, it lays down the foundation of Responsible ML by outlining a novel taxonomy of adversarial attacks within real-world settings, categorizing them into black-box target-specific, and target-agnostic attacks. Subsequently, it proposes potent adversarial attacks in each category, aiming to obtain effectiveness and efficiency. Transcending conventional boundaries, it then introduces the notion of causality into Responsible ML (a.k.a., Causal Responsible ML), presenting the causal adversarial attack. This represents the first principled framework to explain the transferability of adversarial attacks to unknown models by identifying their common source of vulnerabilities, thereby exposing the pinnacle of threat and vulnerability: conducting successful attacks on any model with no prior knowledge.
Finally, acknowledging the surge of Generative AI, this dissertation explores Responsible ML for Generative AI. It introduces a novel adversarial attack that unveils their adversarial vulnerabilities and devises a strong defense mechanism to bolster the models’ robustness against potential attacks.
ContributorsMoraffah, Raha (Author) / Liu, Huan (Thesis advisor) / Yang, Yezhou (Committee member) / Xiao, Chaowei (Committee member) / Turaga, Pavan (Committee member) / Carley, Kathleen (Committee member) / Arizona State University (Publisher)
Created2024
Description
Millimeter-wave (mmWave) and sub-terahertz (sub-THz) systems aim to utilize the large bandwidth available at these frequencies. This has the potential to enable several future applications that require high data rates, such as autonomous vehicles and digital twins. These systems, however, have several challenges that need to be addressed to realize their gains in practice. First, they need to deploy large antenna arrays and use narrow beams to guarantee sufficient receive power. Adjusting the narrow beams of the large antenna arrays incurs massive beam training overhead. Second, the sensitivity to blockages is a key challenge for mmWave and THz networks. Since these networks mainly rely on line-of-sight (LOS) links, sudden link blockages highly threaten the reliability of the networks. Further, when the LOS link is blocked, the network typically needs to hand off the user to another LOS basestation, which may incur critical time latency, especially if a search over a large codebook of narrow beams is needed. A promising way to tackle both these challenges lies in leveraging additional side information such as visual, LiDAR, radar, and position data. These sensors provide rich information about the wireless environment, which can be utilized for fast beam and blockage prediction. This dissertation presents a machine-learning framework for sensing-aided beam and blockage prediction. In particular, for beam prediction, this work proposes to utilize visual and positional data to predict the optimal beam indices. For the first time, this work investigates the sensing-aided beam prediction task in a real-world vehicle-to-infrastructure and drone communication scenario. Similarly, for blockage prediction, this dissertation proposes a multi-modal wireless communication solution that utilizes bimodal machine learning to perform proactive blockage prediction and user hand-off. Evaluations on both real-world and synthetic datasets illustrate the promising performance of the proposed solutions and highlight their potential for next-generation communication and sensing systems.
ContributorsCharan, Gouranga (Author) / Alkhateeb, Ahmed (Thesis advisor) / Chakrabarti, Chaitali (Committee member) / Turaga, Pavan (Committee member) / Michelusi, Nicolò (Committee member) / Arizona State University (Publisher)
Created2024
Description
Owing to the surge in development of endovascular devices such as coils and flow diverter stents, doctors are inclined to approach surgical cases non-invasively more often than before. Treating brain aneurysms as a bulging of a weakened area of a blood vessel is no exception. Therefore, promoting techniques that can help surgeons have a better idea of treatment outcomes are of invaluable importance.
In order to investigate the effects of these devices on intra-aneurysmal hemodynamics, the conventional computational fluid dynamics (CFD) approach uses the explicit geometry of the device within an aneurysm and discretizes the fluid domain to solve the Navier-Stokes equations. However, since the devices are made of small struts, the number of mesh elements in the boundary layer region would be considerable. This cumbersome task led to the implementation of the porous medium assumption. In this approach, the explicit geometry of the device is eliminated, and relevant porous medium assumptions are applied. Unfortunately, as it will be shown in this research, some of the porous medium approaches used in the literature are over-simplified. For example, considering the porous domain to be homogeneous is one major drawback which leads to significant errors in capturing the intra-aneurysmal flow features. Specifically, since the devices must comply with the complex geometry of an aneurysm, the homogeneity assumption is not valid.
In this research, a novel heterogeneous porous medium approach is introduced. This results in a substantial reduction in the total number of mesh elements required to discretize the flow domain while not sacrificing the accuracy of the method by over-simplifying the utilized assumptions.
In order to investigate the effects of these devices on intra-aneurysmal hemodynamics, the conventional computational fluid dynamics (CFD) approach uses the explicit geometry of the device within an aneurysm and discretizes the fluid domain to solve the Navier-Stokes equations. However, since the devices are made of small struts, the number of mesh elements in the boundary layer region would be considerable. This cumbersome task led to the implementation of the porous medium assumption. In this approach, the explicit geometry of the device is eliminated, and relevant porous medium assumptions are applied. Unfortunately, as it will be shown in this research, some of the porous medium approaches used in the literature are over-simplified. For example, considering the porous domain to be homogeneous is one major drawback which leads to significant errors in capturing the intra-aneurysmal flow features. Specifically, since the devices must comply with the complex geometry of an aneurysm, the homogeneity assumption is not valid.
In this research, a novel heterogeneous porous medium approach is introduced. This results in a substantial reduction in the total number of mesh elements required to discretize the flow domain while not sacrificing the accuracy of the method by over-simplifying the utilized assumptions.
ContributorsYadollahi Farsani, Hooman (Author) / Herrmann, Marcus (Thesis advisor) / Frakes, David (Thesis advisor) / Chong, Brian (Committee member) / Peet, Yulia (Committee member) / Oswald, Jay (Committee member) / Arizona State University (Publisher)
Created2018
Description
Human movement is a complex process influenced by physiological and psychological factors. The execution of movement is varied from person to person, and the number of possible strategies for completing a specific movement task is almost infinite. Different choices of strategies can be perceived by humans as having different degrees of quality, and the quality can be defined with regard to aesthetic, athletic, or health-related ratings. It is useful to measure and track the quality of a person's movements, for various applications, especially with the prevalence of low-cost and portable cameras and sensors today. Furthermore, based on such measurements, feedback systems can be designed for people to practice their movements towards certain goals. In this dissertation, I introduce symmetry as a family of measures for movement quality, and utilize recent advances in computer vision and differential geometry to model and analyze different types of symmetry in human movements. Movements are modeled as trajectories on different types of manifolds, according to the representations of movements from sensor data. The benefit of such a universal framework is that it can accommodate different existing and future features that describe human movements. The theory and tools developed in this dissertation will also be useful in other scientific areas to analyze symmetry from high-dimensional signals.
ContributorsWang, Qiao (Author) / Turaga, Pavan (Thesis advisor) / Spanias, Andreas (Committee member) / Srivastava, Anuj (Committee member) / Sha, Xin Wei (Committee member) / Arizona State University (Publisher)
Created2018
Description
Mixture of experts is a machine learning ensemble approach that consists of individual models that are trained to be ``experts'' on subsets of the data, and a gating network that provides weights to output a combination of the expert predictions. Mixture of experts models do not currently see wide use due to difficulty in training diverse experts and high computational requirements. This work presents modifications of the mixture of experts formulation that use domain knowledge to improve training, and incorporate parameter sharing among experts to reduce computational requirements.
First, this work presents an application of mixture of experts models for quality robust visual recognition. First it is shown that human subjects outperform deep neural networks on classification of distorted images, and then propose a model, MixQualNet, that is more robust to distortions. The proposed model consists of ``experts'' that are trained on a particular type of image distortion. The final output of the model is a weighted sum of the expert models, where the weights are determined by a separate gating network. The proposed model also incorporates weight sharing to reduce the number of parameters, as well as increase performance.
Second, an application of mixture of experts to predict visual saliency is presented. A computational saliency model attempts to predict where humans will look in an image. In the proposed model, each expert network is trained to predict saliency for a set of closely related images. The final saliency map is computed as a weighted mixture of the expert networks' outputs, with weights determined by a separate gating network. The proposed model achieves better performance than several other visual saliency models and a baseline non-mixture model.
Finally, this work introduces a saliency model that is a weighted mixture of models trained for different levels of saliency. Levels of saliency include high saliency, which corresponds to regions where almost all subjects look, and low saliency, which corresponds to regions where some, but not all subjects look. The weighted mixture shows improved performance compared with baseline models because of the diversity of the individual model predictions.
First, this work presents an application of mixture of experts models for quality robust visual recognition. First it is shown that human subjects outperform deep neural networks on classification of distorted images, and then propose a model, MixQualNet, that is more robust to distortions. The proposed model consists of ``experts'' that are trained on a particular type of image distortion. The final output of the model is a weighted sum of the expert models, where the weights are determined by a separate gating network. The proposed model also incorporates weight sharing to reduce the number of parameters, as well as increase performance.
Second, an application of mixture of experts to predict visual saliency is presented. A computational saliency model attempts to predict where humans will look in an image. In the proposed model, each expert network is trained to predict saliency for a set of closely related images. The final saliency map is computed as a weighted mixture of the expert networks' outputs, with weights determined by a separate gating network. The proposed model achieves better performance than several other visual saliency models and a baseline non-mixture model.
Finally, this work introduces a saliency model that is a weighted mixture of models trained for different levels of saliency. Levels of saliency include high saliency, which corresponds to regions where almost all subjects look, and low saliency, which corresponds to regions where some, but not all subjects look. The weighted mixture shows improved performance compared with baseline models because of the diversity of the individual model predictions.
ContributorsDodge, Samuel Fuller (Author) / Karam, Lina (Thesis advisor) / Jayasuriya, Suren (Committee member) / Li, Baoxin (Committee member) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)
Created2018
Description
Despite the fact that machine learning supports the development of computer vision applications by shortening the development cycle, finding a general learning algorithm that solves a wide range of applications is still bounded by the ”no free lunch theorem”. The search for the right algorithm to solve a specific problem is driven by the problem itself, the data availability and many other requirements.
Automated visual inspection (AVI) systems represent a major part of these challenging computer vision applications. They are gaining growing interest in the manufacturing industry to detect defective products and keep these from reaching customers. The process of defect detection and classification in semiconductor units is challenging due to different acceptable variations that the manufacturing process introduces. Other variations are also typically introduced when using optical inspection systems due to changes in lighting conditions and misalignment of the imaged units, which makes the defect detection process more challenging.
In this thesis, a BagStack classification framework is proposed, which makes use of stacking and bagging concepts to handle both variance and bias errors. The classifier is designed to handle the data imbalance and overfitting problems by adaptively transforming the
multi-class classification problem into multiple binary classification problems, applying a bagging approach to train a set of base learners for each specific problem, adaptively specifying the number of base learners assigned to each problem, adaptively specifying the number of samples to use from each class, applying a novel data-imbalance aware cross-validation technique to generate the meta-data while taking into account the data imbalance problem at the meta-data level and, finally, using a multi-response random forest regression classifier as a meta-classifier. The BagStack classifier makes use of multiple features to solve the defect classification problem. In order to detect defects, a locally adaptive statistical background modeling is proposed. The proposed BagStack classifier outperforms state-of-the-art image classification techniques on our dataset in terms of overall classification accuracy and average per-class classification accuracy. The proposed detection method achieves high performance on the considered dataset in terms of recall and precision.
Automated visual inspection (AVI) systems represent a major part of these challenging computer vision applications. They are gaining growing interest in the manufacturing industry to detect defective products and keep these from reaching customers. The process of defect detection and classification in semiconductor units is challenging due to different acceptable variations that the manufacturing process introduces. Other variations are also typically introduced when using optical inspection systems due to changes in lighting conditions and misalignment of the imaged units, which makes the defect detection process more challenging.
In this thesis, a BagStack classification framework is proposed, which makes use of stacking and bagging concepts to handle both variance and bias errors. The classifier is designed to handle the data imbalance and overfitting problems by adaptively transforming the
multi-class classification problem into multiple binary classification problems, applying a bagging approach to train a set of base learners for each specific problem, adaptively specifying the number of base learners assigned to each problem, adaptively specifying the number of samples to use from each class, applying a novel data-imbalance aware cross-validation technique to generate the meta-data while taking into account the data imbalance problem at the meta-data level and, finally, using a multi-response random forest regression classifier as a meta-classifier. The BagStack classifier makes use of multiple features to solve the defect classification problem. In order to detect defects, a locally adaptive statistical background modeling is proposed. The proposed BagStack classifier outperforms state-of-the-art image classification techniques on our dataset in terms of overall classification accuracy and average per-class classification accuracy. The proposed detection method achieves high performance on the considered dataset in terms of recall and precision.
ContributorsHaddad, Bashar Muneer (Author) / Karam, Lina (Thesis advisor) / Li, Baoxin (Committee member) / He, Jingrui (Committee member) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)
Created2019
Description
Cancer is a major health problem in the world today and is expected to become an even larger one in the future. Although cancer therapy has improved for many cancers in the last several decades, there is much room for further improvement. Mathematical modeling has the advantage of being able to test many theoretical therapies without having to perform clinical trials and experiments. Mathematical oncology will continue to be an important tool in the future regarding cancer therapies and management.
This dissertation is structured as a growing tumor. Chapters 2 and 3 consider spheroid models. These models are adept at describing 'early-time' tumors, before the tumor needs to co-opt blood vessels to continue sustained growth. I consider two partial differential equation (PDE) models for spheroid growth of glioblastoma. I compare these models to in vitro experimental data for glioblastoma tumor cell lines and other proposed models. Further, I investigate the conditions under which traveling wave solutions exist and confirm numerically.
As a tumor grows, it can no longer be approximated by a spheroid, and it becomes necessary to use in vivo data and more sophisticated modeling to model the growth and diffusion. In Chapter 4, I explore experimental data and computational models for describing growth and diffusion of glioblastoma in murine brains. I discuss not only how the data was obtained, but how the 3D brain geometry is created from Magnetic Resonance (MR) images. A 3D finite-difference code is used to model tumor growth using a basic reaction-diffusion equation. I formulate and test hypotheses as to why there are large differences between the final tumor sizes between the mice.
Once a tumor has reached a detectable size, it is diagnosed, and treatment begins. Chapter 5 considers modeling the treatment of prostate cancer. I consider a joint model with hormonal therapy as well as immunotherapy. I consider a timing study to determine whether changing the vaccine timing has any effect on the outcome of the patient. In addition, I perform basic analysis on the six-dimensional ordinary differential equation (ODE). I also consider the limiting case, and perform a full global analysis.
This dissertation is structured as a growing tumor. Chapters 2 and 3 consider spheroid models. These models are adept at describing 'early-time' tumors, before the tumor needs to co-opt blood vessels to continue sustained growth. I consider two partial differential equation (PDE) models for spheroid growth of glioblastoma. I compare these models to in vitro experimental data for glioblastoma tumor cell lines and other proposed models. Further, I investigate the conditions under which traveling wave solutions exist and confirm numerically.
As a tumor grows, it can no longer be approximated by a spheroid, and it becomes necessary to use in vivo data and more sophisticated modeling to model the growth and diffusion. In Chapter 4, I explore experimental data and computational models for describing growth and diffusion of glioblastoma in murine brains. I discuss not only how the data was obtained, but how the 3D brain geometry is created from Magnetic Resonance (MR) images. A 3D finite-difference code is used to model tumor growth using a basic reaction-diffusion equation. I formulate and test hypotheses as to why there are large differences between the final tumor sizes between the mice.
Once a tumor has reached a detectable size, it is diagnosed, and treatment begins. Chapter 5 considers modeling the treatment of prostate cancer. I consider a joint model with hormonal therapy as well as immunotherapy. I consider a timing study to determine whether changing the vaccine timing has any effect on the outcome of the patient. In addition, I perform basic analysis on the six-dimensional ordinary differential equation (ODE). I also consider the limiting case, and perform a full global analysis.
ContributorsRutter, Erica Marie (Author) / Kuang, Yang (Thesis advisor) / Kostelich, Eric J (Thesis advisor) / Frakes, David (Committee member) / Gardner, Carl (Committee member) / Jackiewicz, Zdzislaw (Committee member) / Arizona State University (Publisher)
Created2016