Abstract

Crack segmentation plays a crucial role in ensuring the structural integrity and seismic safety of civil structures. However, existing crack segmentation algorithms encounter challenges in maintaining accuracy with domain shifts across datasets. To address this issue, we propose a novel deep network that employs incremental training with unsupervised domain adaptation (UDA) using adversarial learning, without a significant drop in accuracy in the source domain. Our approach leverages an encoder-decoder architecture, consisting of both domain-invariant and domain-specific parameters. The encoder learns shared crack features across all domains, ensuring robustness to domain variations. Simultaneously, the decoder's domain-specific parameters capture domain-specific features unique to each domain. By combining these components, our model achieves improved crack segmentation performance. Furthermore, we introduce BuildCrack, a new crack dataset comparable to sub-datasets of the well-established CrackSeg9K dataset in terms of image count and crack percentage. We evaluate our proposed approach against state-of-the-art UDA methods using different sub-datasets of CrackSeg9K and our custom dataset. Our experimental results demonstrate a significant improvement in crack segmentation accuracy and generalization across target domains compared to other UDA methods - specifically, an improvement of 0.65 and 2.7 mIoU on source and target domains respectively. Code, models, and dataset will be made available.

Abstract

Polynomial dynamical systems (i.e. dynamical systems with polynomial right hand side) are ubiquitous in applications, especially as models of reaction networks and interaction networks. The properties of general polynomial dynamical systems can be very difficult to analyze, due to nonlinearity, bifurcations, and the possibility for chaotic dynamics. On the other hand, toric dynamical systems are polynomial dynamical systems that appear naturally as models of reaction networks, and have very robust and stable properties. A disguised toric dynamical system is a polynomial dynamical system generated by a reaction network N and some choice of positive parameters, such that (even though it may not be toric with respect to N) it has a toric realization with respect to some network N′. Disguised toric dynamical systems enjoy all the robust stability properties of toric dynamical systems. In this paper, we study a larger set of dynamical systems where the rate constants are allowed to take both positive and negative values. More precisely, we analyze the R-disguised toric locus of a reaction network N, i.e., the subset in the space rate constants (positive or negative) of N for which the corresponding polynomial dynamical system is disguised toric. We focus especially on finding a lower bound on the dimension of the R-disguised toric locus.

Abstract

Visual servoing for the development of autonomous robotic systems capable of administering UltraSound (US) guided regional anesthesia requires real-time segmentation of nerves, needle tip localization and needle trajectory extrapolation. First, we recruited 227 patients to build a large dataset of 41,000 anesthesiologist annotated images from US videos of brachial plexus nerves and developed models to localize nerves in the US images. Generalizability of the best suited model was tested on the datasets constructed from separate US scanners. Using these nerve segmentation predictions, we define automated anesthesia needle targets by fitting an ellipse to the nerve contours. Next, we developed an image analysis tool to guide the needle toward their targets. For the segmentation of the needle, a natural RGB pre-trained neural network was first fine-tuned on a large US dataset for domain transfer and then adapted for the needle using a small dataset. The segmented needle’s trajectory angle is calculated using Radon transformation and the trajectory is extrapolated from the needle tip. The intersection of the extrapolated trajectory with the needle target guides the needle navigation for drug delivery. The needle trajectory’s average error was within acceptable range of 5 mm as per experienced anesthesiologists. The entire dataset has been released publicly for further study by the research community at https://github.com/Regional-US/

Abstract

Monitoring water flow helps to identify leaks and wastage, leading to better management of water resources and conservation of this precious resource. To address this challenge, there is a need for an efficient and sustainable water management system. This paper presents an Internet of Things (IoT) based solution that involves retrofitting existing analog water meters using readily available off-the-shelf electronic components. Real-time data collection and analysis are performed through edge computation, which locally processes water meter images captured by the camera and extracts water meter readings. These readings are transmitted to the cloud for storage and further analysis. Various strategies have been implemented to optimize supply-current usage, preserving charge-discharge cycles of solar-powered batteries even in adverse environmental conditions. To streamline the firmware update process for multiple connected devices, a broadcasting technique is employed, offering the benefits of reduced manual labor and time savings. To assess the reliability and performance of developed solution, field deployment is conducted over several months, enabling the characterization of water usage patterns across different locations. Integrating energy harvesting capabilities into system reduces maintenance costs and promotes eco-friendly energy practices. Overall, this solution offers an effective and comprehensive approach towards achieving efficient and sustainable water management.

Abstract

Edge server-assisted computation offloading enables vehicles to leverage server compute resources to deliver connected services, overcoming the limitations of onboard resources. Understanding the compute workloads of edge servers is crucial for effective resource management and scheduling, yet this task is challenging due to the complex interplay of factors such as vehicle mobility and computation offloading patterns. To address this, we propose an empirical analysis framework that systematically characterizes the compute workloads of edge servers. We begin by formalizing the relationships among three key aspects: local load (generated by vehicles), composite load (imposed on edge servers), and traffic flow (vehicle mobility patterns). Our framework then uses models of the local load and traffic flow as inputs to generate the composite loads on edge servers. Experiments were conducted by injecting between 600 and 5,000 vehicles per hour in two distinct geographical areas, New York City and Tampa. We provide a quantitative analysis demonstrating how the composite loads on edge servers vary with changes in traffic flows, geographical areas, and offloading patterns.

Abstract

Forensic sketch-to-mugshot matching is a challenging task in face recognition, primarily hindered by the scarcity of annotated forensic sketches and the modality gap between sketches and photographs. To address this, we propose CLIP4Sketch, a novel approach that leverages diffusion models to generate a large and diverse set of sketch images, which helps in enhancing the performance of face recognition systems in sketch-to-mugshot matching. Our method utilizes Denoising Diffusion Probabilistic Models (DDPMs) to generate sketches with explicit control over identity and style. We combine CLIP and Adaface embeddings of a reference mugshot, along with textual descriptions of style, as the conditions to the diffusion model. We demonstrate the efficacy of our approach by generating a comprehensive dataset of sketches corresponding to mugshots and training a face recognition model on our synthetic data. Our results show significant improvements in sketch-to-mugshot matching accuracy over training on an existing, limited amount of real face sketch data, validating the potential of diffusion models in enhancing the performance of face recognition systems across modalities. We also compare our dataset with datasets generated using GAN-based methods to show its superiority.

Abstract

Edge computing allows for reduced latency and operational costs compared to centralized cloud systems. In this context, serverless functions are emerging as a lightweight and effective paradigm for managing computational tasks on edge infrastructures. However, the placement of such functions in constrained edge nodes remains an open challenge. On one hand, it is key to minimize network delays and optimize resource consumption; on the other hand, decisions must be made in a timely manner due to the highly dynamic nature of edge environments. In this paper, we propose POSEIDON, a solution based on Deep Reinforcement Learning for the efficient placement of functions at the edge. POSEIDON leverages Proximal Policy Optimization (PPO) to place functions across a distributed network of nodes under highly dynamic workloads. A comprehensive empirical evaluation demonstrates that POSEIDON significantly reduces execution time, network delay, and resource consumption compared to state-of-the-art methods.

Abstract

In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on n-bits in time poly(n)2^{n/2}. In this work, we investigate whether such general statements can be made for adiabatic quantum optimization, as provable results regarding its performance are mostly unknown. Although a lower bound of Ω(2^{n/2}) has existed in such a setting for over a decade, a purely adiabatic algorithm with this running time has been absent. We show that adiabatic quantum optimization using an unstructured search approach results in a running time that matches this lower bound (up to a polylogarithmic factor) for a broad class of classical local spin Hamiltonians. For this, it is necessary to bound the spectral gap throughout the adiabatic evolution and compute beforehand the position of the avoided crossing with sufficient precision so as to adapt the adiabatic schedule accordingly. However, we show that the position of the avoided crossing is approximately given by a quantity that depends on the degeneracies and inverse gaps of the problem Hamiltonian and is NP-hard to compute even within a low additive precision. Furthermore, computing it exactly (or nearly exactly) is #P-hard. Our work indicates a possible limitation of adiabatic quantum optimization algorithms, leaving open the question of whether provable Grover-like speed-ups can be obtained for any optimization problem using this approach.

Abstract

In the legal domain, research efforts are being made to enhance precedent retrieval by exploiting features based on meta-data, catchphrases, citations, sentences, paragraphs, etc. It is reported in the legal domain that the text surrounding a citation provides information to identify the referenced judgment and supplies additional information about the referenced judgment and its connection to the formulated argument. In this paper, we have exploited the resourcefulness of the text surrounding the citation to improve the document representation of the referenced judgment. Experiments conducted on Indian court judgments show that the proposed Preceding citation Anchor Text (PAT)-based approach captures certain nuances that are not captured by the text present in the referenced judgment, indicating that there is a scope to exploit PAT to improve the performance of precedent retrieval systems.

Abstract

Smart home technology integrates various devices and systems that upgrade the convenience, security, and efficiency of a home. Due to these benefits, this technology is gaining global attention. In this paper, we have explored the perspectives of the residents of Mumbai on smart home technology adoption. A survey of 425 respondents was conducted, over a period of 3 months, covering demographics, awareness, preferences, concerns, and willingness to adopt. The key factors influencing their willingness to adopt such technology have been identified. The findings reveal insights into the perceived benefits, barriers, and demographic influences on smart home technology adoption in Mumbai. Most respondents show a high level of willing-ness to install smart home technology. More than 40% of respondents con-sider security their top priority when thinking about smart home features. Data privacy and security are the top concerns among the respondents, as they are worried about their personal data management and device vulnerabilities. The results are valuable for policymakers, advertisers, and developers working to promote smart home technology in the urban areas of India.