Search Content

Decentralized information search

Description

Our research focuses on finding answers through decentralized search, for complex, imprecise queries (such as "Which is the best hair salon nearby?") in situations where there is a spatiotemporal constraint (say answer needs to be found within 15 minutes) associated with the query. In general, human networks are good in…

Our research focuses on finding answers through decentralized search, for complex, imprecise queries (such as "Which is the best hair salon nearby?") in situations where there is a spatiotemporal constraint (say answer needs to be found within 15 minutes) associated with the query. In general, human networks are good in answering imprecise queries. We try to use the social network of a person to answer his query. Our research aims at designing a framework that exploits the user's social network in order to maximize the answers for a given query. Exploiting an user's social network has several challenges. The major challenge is that the user's immediate social circle may not possess the answer for the given query, and hence the framework designed needs to carry out the query diffusion process across the network. The next challenge involves in finding the right set of seeds to pass the query to in the user's social circle. One other challenge is to incentivize people in the social network to respond to the query and thereby maximize the quality and quantity of replies. Our proposed framework is a mobile application where an individual can either respond to the query or forward it to his friends. We simulated the query diffusion process in three types of graphs: Small World, Random and Preferential Attachment. Given a type of network and a particular query, we carried out the query diffusion by selecting seeds based on attributes of the seed. The main attributes are Topic relevance, Replying or Forwarding probability and Time to Respond. We found that there is a considerable increase in the number of replies attained, even without saturating the user's network, if we adopt an optimal seed selection process. We found the output of the optimal algorithm to be satisfactory as the number of replies received at the interrogator's end was close to three times the number of neighbors an interrogator has. We addressed the challenge of incentivizing people to respond by associating a particular amount of points for each query asked, and awarding the same to people involved in answering the query. Thus, we aim to design a mobile application based on our proposed framework so that it helps in maximizing the replies for the interrogator's query by diffusing the query across his/her social network.

ContributorsSwaminathan, Neelakantan (Author) / Sundaram, Hari (Thesis advisor) / Davulcu, Hasan (Thesis advisor) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)

Created2013

Exploring video denoising using matrix completion

Description

Video denoising has been an important task in many multimedia and computer vision applications. Recent developments in the matrix completion theory and emergence of new numerical methods which can efficiently solve the matrix completion problem have paved the way for exploration of new techniques for some classical image processing tasks.…

Video denoising has been an important task in many multimedia and computer vision applications. Recent developments in the matrix completion theory and emergence of new numerical methods which can efficiently solve the matrix completion problem have paved the way for exploration of new techniques for some classical image processing tasks. Recent literature shows that many computer vision and image processing problems can be solved by using the matrix completion theory. This thesis explores the application of matrix completion in video denoising. A state-of-the-art video denoising algorithm in which the denoising task is modeled as a matrix completion problem is chosen for detailed study. The contribution of this thesis lies in both providing extensive analysis to bridge the gap in existing literature on matrix completion frame work for video denoising and also in proposing some novel techniques to improve the performance of the chosen denoising algorithm. The chosen algorithm is implemented for thorough analysis. Experiments and discussions are presented to enable better understanding of the problem. Instability shown by the algorithm at some parameter values in a particular case of low levels of pure Gaussian noise is identified. Artifacts introduced in such cases are analyzed. A novel way of grouping structurally-relevant patches is proposed to improve the algorithm. Experiments show that this technique is useful, especially in videos containing high amounts of motion. Based on the observation that matrix completion is not suitable for denoising patches containing relatively low amount of image details, a framework is designed to separate patches corresponding to low structured regions from a noisy image. Experiments are conducted by not subjecting such patches to matrix completion, instead denoising such patches in a different way. The resulting improvement in performance suggests that denoising low structured patches does not require a complex method like matrix completion and in fact it is counter-productive to subject such patches to matrix completion. These results also indicate the inherent limitation of matrix completion to deal with cases in which noise dominates the structural properties of an image. A novel method for introducing priorities to the ranked patches in matrix completion is also presented. Results showed that this method yields improved performance in general. It is observed that the artifacts in presence of low levels of pure Gaussian noise appear differently after introducing priorities to the patches and the artifacts occur at a wider range of parameter values. Results and discussion suggesting future ways to explore this problem are also presented.

ContributorsMaguluri, Hima Bindu (Author) / Li, Baoxin (Thesis advisor) / Turaga, Pavan (Committee member) / Claveau, Claude (Committee member) / Arizona State University (Publisher)

Created2013

Signal processing and robust statistics for fault detection in photovoltaic arrays

Description

Photovoltaics (PV) is an important and rapidly growing area of research. With the advent of power system monitoring and communication technology collectively known as the "smart grid," an opportunity exists to apply signal processing techniques to monitoring and control of PV arrays. In this paper a monitoring system which provides…

Photovoltaics (PV) is an important and rapidly growing area of research. With the advent of power system monitoring and communication technology collectively known as the "smart grid," an opportunity exists to apply signal processing techniques to monitoring and control of PV arrays. In this paper a monitoring system which provides real-time measurements of each PV module's voltage and current is considered. A fault detection algorithm formulated as a clustering problem and addressed using the robust minimum covariance determinant (MCD) estimator is described; its performance on simulated instances of arc and ground faults is evaluated. The algorithm is found to perform well on many types of faults commonly occurring in PV arrays. Among several types of detection algorithms considered, only the MCD shows high performance on both types of faults.

ContributorsBraun, Henry (Author) / Tepedelenlioğlu, Cihan (Thesis advisor) / Spanias, Andreas (Thesis advisor) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)

Created2012

Low complexity differential geometric computations with applications to human activity analysis

Description

In this thesis, we consider the problem of fast and eﬃcient indexing techniques for time sequences which evolve on manifold-valued spaces. Using manifolds is a convenient way to work with complex features that often do not live in Euclidean spaces. However, computing standard notions of geodesic distance, mean etc. can…

In this thesis, we consider the problem of fast and eﬃcient indexing techniques for time sequences which evolve on manifold-valued spaces. Using manifolds is a convenient way to work with complex features that often do not live in Euclidean spaces. However, computing standard notions of geodesic distance, mean etc. can get very involved due to the underlying non-linearity associated with the space. As a result a complex task such as manifold sequence matching would require very large number of computations making it hard to use in practice. We believe that one can device smart approximation algorithms for several classes of such problems which take into account the geometry of the manifold and maintain the favorable properties of the exact approach. This problem has several applications in areas of human activity discovery and recognition, where several features and representations are naturally studied in a non-Euclidean setting. We propose a novel solution to the problem of indexing manifold-valued sequences by proposing an intrinsic approach to map sequences to a symbolic representation. This is shown to enable the deployment of fast and accurate algorithms for activity recognition, motif discovery, and anomaly detection. Toward this end, we present generalizations of key concepts of piece-wise aggregation and symbolic approximation for the case of non-Euclidean manifolds. Experiments show that one can replace expensive geodesic computations with much faster symbolic computations with little loss of accuracy in activity recognition and discovery applications. The proposed methods are ideally suited for real-time systems and resource constrained scenarios.

ContributorsAnirudh, Rushil (Author) / Turaga, Pavan (Thesis advisor) / Spanias, Andreas (Committee member) / Li, Baoxin (Committee member) / Arizona State University (Publisher)

Created2012

Clinically relevant classification and retrieval of diabetic retinopathy images

Description

Diabetic retinopathy (DR) is a common cause of blindness occurring due to prolonged presence of diabetes. The risk of developing DR or having the disease progress is increasing over time. Despite advances in diabetes care over the years, DR remains a vision-threatening complication and one of the leading causes of…

Diabetic retinopathy (DR) is a common cause of blindness occurring due to prolonged presence of diabetes. The risk of developing DR or having the disease progress is increasing over time. Despite advances in diabetes care over the years, DR remains a vision-threatening complication and one of the leading causes of blindness among American adults. Recent studies have shown that diagnosis based on digital retinal imaging has potential benefits over traditional face-to-face evaluation. Yet there is a dearth of computer-based systems that can match the level of performance achieved by ophthalmologists. This thesis takes a fresh perspective in developing a computer-based system aimed at improving diagnosis of DR images. These images are categorized into three classes according to their severity level. The proposed approach explores effective methods to classify new images and retrieve clinically-relevant images from a database with prior diagnosis information associated with them. Retrieval provides a novel way to utilize the vast knowledge in the archives of previously-diagnosed DR images and thereby improve a clinician's performance while classification can safely reduce the burden on DR screening programs and possibly achieve higher detection accuracy than human experts. To solve the three-class retrieval and classification problem, the approach uses a multi-class multiple-instance medical image retrieval framework that makes use of spectrally tuned color correlogram and steerable Gaussian filter response features. The results show better retrieval and classification performances than prior-art methods and are also observed to be of clinical and visual relevance.

ContributorsChandakkar, Parag Shridhar (Author) / Li, Baoxin (Thesis advisor) / Turaga, Pavan (Committee member) / Frakes, David (Committee member) / Arizona State University (Publisher)

Created2012

Feature extraction from compressive cameras with application to activity recognition

Description

Recent advances in camera architectures and associated mathematical representations now enable compressive acquisition of images and videos at low data-rates. While most computer vision applications of today are composed of conventional cameras, which collect a large amount redundant data and power hungry embedded systems, which compress the collected data for…

Recent advances in camera architectures and associated mathematical representations now enable compressive acquisition of images and videos at low data-rates. While most computer vision applications of today are composed of conventional cameras, which collect a large amount redundant data and power hungry embedded systems, which compress the collected data for further processing, compressive cameras offer the advantage of direct acquisition of data in compressed domain and hence readily promise to find applicability in computer vision, particularly in environments hampered by limited communication bandwidths. However, despite the significant progress in theory and methods of compressive sensing, little headway has been made in developing systems for such applications by exploiting the merits of compressive sensing. In such a setting, we consider the problem of activity recognition, which is an important inference problem in many security and surveillance applications. Since all successful activity recognition systems involve detection of human, followed by recognition, a potential fully functioning system motivated by compressive camera would involve the tracking of human, which requires the reconstruction of atleast the initial few frames to detect the human. Once the human is tracked, the recognition part of the system requires only the features to be extracted from the tracked sequences, which can be the reconstructed images or the compressed measurements of such sequences. However, it is desirable in resource constrained environments that these features be extracted from the compressive measurements without reconstruction. Motivated by this, in this thesis, we propose a framework for understanding activities as a non-linear dynamical system, and propose a robust, generalizable feature that can be extracted directly from the compressed measurements without reconstructing the original video frames. The proposed feature is termed recurrence texture and is motivated from recurrence analysis of non-linear dynamical systems. We show that it is possible to obtain discriminative features directly from the compressed stream and show its utility in recognition of activities at very low data rates.

ContributorsKulkarni, Kuldeep Sharad (Author) / Turaga, Pavan (Thesis advisor) / Spanias, Andreas (Committee member) / Frakes, David (Committee member) / Arizona State University (Publisher)

Created2012

The Gender Gap in Medicine and Biotechnology: An Analysis of the Past Two Decades

Description

Women’s roles in society have changed significantly throughout the years. The movement to support the rights of women has been ongoing throughout the evolution of society but has been especially prevalent in the last century. The 1960s are when women began to enter the workforce instead of being limited to…

Women’s roles in society have changed significantly throughout the years. The movement to support the rights of women has been ongoing throughout the evolution of society but has been especially prevalent in the last century. The 1960s are when women began to enter the workforce instead of being limited to presuming roles as homemakers. Since that point in time, women have continued to thrive in the workforce and have pursued a larger variety of positions in various fields. Even though the opportunities for women continue to grow, there still seems to be an underrepresentation of women in science, technology, engineering, and mathematics (STEM) related fields. The underrepresentation of women pursuing physician and entrepreneurship roles in STEM will be analyzed and the challenges this group of people specifically encounter will be examined. Our first proposal to encourage women to enter STEM focuses on middle-school initiatives and incubator programs. The second proposal, based on commonalities females face within the workforce, is finding a better work/home life balance with the development of new maternity/paternity leave policies. Through these initiatives, we believe that the gender gap in STEM can be bridged.

ContributorsTorres, Julianna M (Co-author) / Willbrandt, Maddie (Co-author) / Martin, Thomas (Thesis director) / Fette, Donald (Committee member) / School of Social Transformation (Contributor) / School of Life Sciences (Contributor) / Barrett, The Honors College (Contributor)

Created2021-05

Company X Collaborative Thesis: Real Estate

Description

The COVID-19 pandemic has and will continue to radically shift the workplace. An increasing percentage of the workforce desires flexible working options and, as such, firms are likely to require less office space going forward. Additionally, the economic downturn caused by the pandemic provides an opportunity for companies to secure…

The COVID-19 pandemic has and will continue to radically shift the workplace. An increasing percentage of the workforce desires flexible working options and, as such, firms are likely to require less office space going forward. Additionally, the economic downturn caused by the pandemic provides an opportunity for companies to secure favorable rent rates on new lease agreements. This project aims to evaluate and measure Company X’s potential cost savings from terminating current leases and downsizing office space in five selected cities. Along with city-specific real estate market research and forecasts, we employ a four-stage model of Company X’s real estate negotiation process to analyze whether existing lease agreements in these cities should be renewed or terminated.

ContributorsRies, Sarah Cristine (Co-author) / Saker, Logan (Co-author) / Hegardt, Brandon (Co-author) / Patterson, Jack (Co-author) / Simonson, Mark (Thesis director) / Hertzel, Michael (Committee member) / Department of Finance (Contributor, Contributor) / Barrett, The Honors College (Contributor)

Created2021-05

Parental Expectations and Future Pathways to Success

Description

Expectation for college attendance in the United States continues to rise as more jobs require degrees. This study aims to determine how parental expectations affect high school students in their decision to attend college. By examining parental expectations that were placed on current college students prior to and during the…

Expectation for college attendance in the United States continues to rise as more jobs require degrees. This study aims to determine how parental expectations affect high school students in their decision to attend college. By examining parental expectations that were placed on current college students prior to and during the application period, we can determine the positive and negative outcomes of these expectations as well as the atmosphere they are creating. To test the hypothesis, an online survey was distributed to current ASU and Barrett, Honors College students regarding their experience with college applications and their parents' influence on their collegiate attendance. A qualitative analysis of the data was conducted in tandem with an analysis of several case studies to determine the results. These data show that parental expectations are having a significant impact on the enrollment of high school students in college programs. With parents placing these expectations on their children, collegiate enrollment will continue to increase. Further studies will be necessary to determine the specific influences these expectations are placing on students.

ContributorsJohnson, Benjamin Howard (Co-author) / Scheller, Sara (Co-author) / Kappes, Janelle (Thesis director) / Fairbanks, Elizabeth (Committee member) / Department of Psychology (Contributor) / School of Social Transformation (Contributor) / Barrett, The Honors College (Contributor)

Created2021-05

Desired Purchasing Behavior during the COVID-19 Pandemic

Description

The present study explored the relationship between desired purchasing behavior and individual differences using two nationally-representative, longitudinal samples of the U.S. population early in the COVID-19 pandemic. Past research has shown that individual differences provide information about how one might respond to threat. Therefore, we predicted changes in desired purchasing…

The present study explored the relationship between desired purchasing behavior and individual differences using two nationally-representative, longitudinal samples of the U.S. population early in the COVID-19 pandemic. Past research has shown that individual differences provide information about how one might respond to threat. Therefore, we predicted changes in desired purchasing behavior across different sociodemographic variables that might reflect those differences. Specifically, we investigated hypotheses related to political orientation, age, sexual orientation, socioeconomic status, and whether or not the participant had children. We measured participants’ reported desired purchasing behavior across eleven categories of goods and investigated the connection between specific demographic variables and desired purchasing behavior. We found that conservatives desired to purchase more basic protection goods (guns/ammunition, cash, gas) and that older people desired to purchase more cleaning supplies and toiletries. These findings illustrate possible explanations for purchasing behavior during the COVID-19 pandemic and reveal directions for marketing designed to influence purchasing behavior.

ContributorsZeider, Justyn (Author) / Varnum, Michael (Thesis director) / Neuberg, Steven (Committee member) / Department of Psychology (Contributor) / School of International Letters and Cultures (Contributor) / School of Social Transformation (Contributor) / Sandra Day O'Connor College of Law (Contributor) / Barrett, The Honors College (Contributor)

Created2021-05