arXiv subjects

Sunwoo Kim

Publications and source records attributed to Sunwoo Kim.

At least 73 records · Page 4Linked to original sources

arXiv2023

How Transitive Are Real-World Group Interactions? -- Measurement and Reproduction

Many real-world interactions (e.g., researcher collaborations and email communication) occur among multiple entities. These group interactions are naturally modeled as hypergraphs. In graphs, transitivity is helpful to understand the connections between node pairs sharing a neighbor, and it has extensive applications in various domains. Hypergraphs, an extension of graphs, are designed to represent group relations. However, to the best of our knowledge, there has been no examination regarding the transitivity of real-world group interactions. In this work, we investigate the transitivity of group interactions in real-world hypergraphs. We first suggest intuitive axioms as necessary characteristics of hypergraph transitivity measures. Then, we propose a principled hypergraph transitivity measure HyperTrans, which satisfies all the proposed axioms, with a fast computation algorithm Fast-HyperTrans. After that, we analyze the transitivity patterns in real-world hypergraphs distinguished from those in random hypergraphs. Lastly, we propose a scalable hypergraph generator THera. It reproduces the observed transitivity patterns by leveraging community structures, which are pervasive in real-world hypergraphs. Our code and datasets are available at https://github.com/kswoo97/hypertrans.

cs.SI↗

arXiv2023

Reciprocity in Directed Hypergraphs: Measures, Findings, and Generators

Group interactions are prevalent in a variety of areas. Many of them, including email exchanges, chemical reactions, and bitcoin transactions, are directional, and thus they are naturally modeled as directed hypergraphs, where each hyperarc consists of the set of source nodes and the set of destination nodes. For directed graphs, which are a special case of directed hypergraphs, reciprocity has played a key role as a fundamental graph statistic in revealing organizing principles of graphs and in solving graph learning tasks. For general directed hypergraphs, however, even no systematic measure of reciprocity has been developed. In this work, we investigate the reciprocity of 11 real-world hypergraphs. To this end, we first introduce eight axioms that any reasonable measure of reciprocity should satisfy. Second, we propose HyperRec, a family of principled measures of hypergraph reciprocity that satisfies all the axioms. Third, we develop Ferret, a fast and exact algorithm for computing the measure, whose search space is up to 10^{147}x smaller than that of naive computation. Fourth, using them, we examine 11 real-world hypergraphs and discover patterns that distinguish them from random hypergraphs. Lastly, we propose ReDi, an intuitive generative model for directed hypergraphs exhibiting the patterns.

cs.SI↗

arXiv2023

User-friendly Image Editing with Minimal Text Input: Leveraging Captioning and Injection Techniques

Recent text-driven image editing in diffusion models has shown remarkable success. However, the existing methods assume that the user's description sufficiently grounds the contexts in the source image, such as objects, background, style, and their relations. This assumption is unsuitable for real-world applications because users have to manually engineer text prompts to find optimal descriptions for different images. From the users' standpoint, prompt engineering is a labor-intensive process, and users prefer to provide a target word for editing instead of a full sentence. To address this problem, we first demonstrate the importance of a detailed text description of the source image, by dividing prompts into three categories based on the level of semantic details. Then, we propose simple yet effective methods by combining prompt generation frameworks, thereby making the prompt engineering process more user-friendly. Extensive qualitative and quantitative experiments demonstrate the importance of prompts in text-driven image editing and our method is comparable to ground-truth prompts.

cs.CV↗

arXiv2023

Classification of Edge-dependent Labels of Nodes in Hypergraphs

A hypergraph is a data structure composed of nodes and hyperedges, where each hyperedge is an any-sized subset of nodes. Due to the flexibility in hyperedge size, hypergraphs represent group interactions (e.g., co-authorship by more than two authors) more naturally and accurately than ordinary graphs. Interestingly, many real-world systems modeled as hypergraphs contain edge-dependent node labels, i.e., node labels that vary depending on hyperedges. For example, on co-authorship datasets, the same author (i.e., a node) can be the primary author in a paper (i.e., a hyperedge) but the corresponding author in another paper (i.e., another hyperedge). In this work, we introduce a classification of edge-dependent node labels as a new problem. This problem can be used as a benchmark task for hypergraph neural networks, which recently have attracted great attention, and also the usefulness of edge-dependent node labels has been verified in various applications. To tackle this problem, we propose WHATsNet, a novel hypergraph neural network that represents the same node differently depending on the hyperedges it participates in by reflecting its varying importance in the hyperedges. To this end, WHATsNet models the relations between nodes within each hyperedge, using their relative centrality as positional encodings. In our experiments, we demonstrate that WHATsNet significantly and consistently outperforms ten competitors on six real-world hypergraphs, and we also show successful applications of WHATsNet to (a) ranking aggregation, (b) node clustering, and (c) product return prediction.

cs.SI↗

arXiv2023

LANIT: Language-Driven Image-to-Image Translation for Unlabeled Data

Existing techniques for image-to-image translation commonly have suffered from two critical problems: heavy reliance on per-sample domain annotation and/or inability of handling multiple attributes per image. Recent truly-unsupervised methods adopt clustering approaches to easily provide per-sample one-hot domain labels. However, they cannot account for the real-world setting: one sample may have multiple attributes. In addition, the semantics of the clusters are not easily coupled to the human understanding. To overcome these, we present a LANguage-driven Image-to-image Translation model, dubbed LANIT. We leverage easy-to-obtain candidate attributes given in texts for a dataset: the similarity between images and attributes indicates per-sample domain labels. This formulation naturally enables multi-hot label so that users can specify the target domain with a set of attributes in language. To account for the case that the initial prompts are inaccurate, we also present prompt learning. We further present domain regularization loss that enforces translated images be mapped to the corresponding domain. Experiments on several standard benchmarks demonstrate that LANIT achieves comparable or superior performance to existing models.

cs.CV↗

arXiv2023

Semantic-Preserving Augmentation for Robust Image-Text Retrieval

Image text retrieval is a task to search for the proper textual descriptions of the visual world and vice versa. One challenge of this task is the vulnerability to input image and text corruptions. Such corruptions are often unobserved during the training, and degrade the retrieval model decision quality substantially. In this paper, we propose a novel image text retrieval technique, referred to as robust visual semantic embedding (RVSE), which consists of novel image-based and text-based augmentation techniques called semantic preserving augmentation for image (SPAugI) and text (SPAugT). Since SPAugI and SPAugT change the original data in a way that its semantic information is preserved, we enforce the feature extractors to generate semantic aware embedding vectors regardless of the corruption, improving the model robustness significantly. From extensive experiments using benchmark datasets, we show that RVSE outperforms conventional retrieval schemes in terms of image-text retrieval performance.

cs.CV↗

arXiv2022

RIS-Enabled and Access-Point-Free Simultaneous Radio Localization and Mapping

In the upcoming sixth generation (6G) of wireless communication systems, reconfigurable intelligent surfaces~(RISs) are regarded as one of the promising technological enablers, which can provide programmable signal propagation. Therefore, simultaneous radio localization and mapping(SLAM) with RISs appears as an emerging research direction within the 6G ecosystem. In this paper, we propose a novel framework of RIS-enabled radio SLAM for wireless operation without the intervention of access points (APs). We first design the RIS phase profiles leveraging prior information for the user equipment~(UE), such that they uniformly illuminate the angular sector where the UE is probabilistically located. Second, we modify the marginal Poisson multi-Bernoulli SLAM filter and estimate the UE state and landmarks, which enables efficient mapping of the radio propagation environment. Third, we derive the theoretical Cramér-Rao lower bounds on the estimators for the channel parameters and the UE state. We finally evaluate the performance of the proposed method under scenarios with a limited number of transmissions, taking into account the channel coherence time. Our results demonstrate that the RIS enables solving the radio SLAM problem with zero APs, and that the consideration of the Doppler shift contributes to improving the UE speed estimates.

eess.SP↗

arXiv2022

Deep Learning-based Beam Tracking for Millimeter-wave Communications under Mobility

In this paper, we propose a deep learning-based beam tracking method for millimeter-wave (mmWave)communications. Beam tracking is employed for transmitting the known symbols using the sounding beams and tracking time-varying channels to maintain a reliable communication link. When the pose of a user equipment (UE) device varies rapidly, the mmWave channels also tend to vary fast, which hinders seamless communication. Thus, models that can capture temporal behavior of mmWave channels caused by the motion of the device are required, to cope with this problem. Accordingly, we employa deep neural network to analyze the temporal structure and patterns underlying in the time-varying channels and the signals acquired by inertial sensors. We propose a model based on long short termmemory (LSTM) that predicts the distribution of the future channel behavior based on a sequence of input signals available at the UE. This channel distribution is used to 1) control the sounding beams adaptively for the future channel state and 2) update the channel estimate through the measurement update step under a sequential Bayesian estimation framework. Our experimental results demonstrate that the proposed method achieves a significant performance gain over the conventional beam tracking methods under various mobility scenarios.

eess.SP↗

arXiv2022

MmWave Mapping and SLAM for 5G and Beyond

Device localization and radar-like mapping are at the heart of integrated sensing and communication, enabling not only new services and applications, but can also improve communication quality with reduced overheads. These forms of sensing are however susceptible to data association problems, due to the unknown relation between measurements and detected objects or targets. In this chapter, we provide an overview of the fundamental tools used to solve mapping, tracking, and simultaneous localization and mapping (SLAM) problems. We distinguish the different types of sensing problems and then focus on mapping and SLAM as running examples. Starting from the applicable models and definitions, we describe the different algorithmic approaches, with a particular focus on how to deal with data association problems. In particular, methods based on random finite set theory and Bayesian graphical models are introduced in detail. A numerical study with synthetic and experimental data is then used to compare these approaches in a variety of scenarios.

eess.SP↗

arXiv2022

Controllable Style Transfer via Test-time Training of Implicit Neural Representation

We propose a controllable style transfer framework based on Implicit Neural Representation that pixel-wisely controls the stylized output via test-time training. Unlike traditional image optimization methods that often suffer from unstable convergence and learning-based methods that require intensive training and have limited generalization ability, we present a model optimization framework that optimizes the neural networks during test-time with explicit loss functions for style transfer. After being test-time trained once, thanks to the flexibility of the INR-based model, our framework can precisely control the stylized images in a pixel-wise manner and freely adjust image resolution without further optimization or training. We demonstrate several applications.

cs.CV↗

arXiv2022

REVECA -- Rich Encoder-decoder framework for Video Event CAptioner

We describe an approach used in the Generic Boundary Event Captioning challenge at the Long-Form Video Understanding Workshop held at CVPR 2022. We designed a Rich Encoder-decoder framework for Video Event CAptioner (REVECA) that utilizes spatial and temporal information from the video to generate a caption for the corresponding the event boundary. REVECA uses frame position embedding to incorporate information before and after the event boundary. Furthermore, it employs features extracted using the temporal segment network and temporal-based pairwise difference method to learn temporal information. A semantic segmentation mask for the attentional pooling process is adopted to learn the subject of an event. Finally, LoRA is applied to fine-tune the image encoder to enhance the learning efficiency. REVECA yielded an average score of 50.97 on the Kinetics-GEBC test data, which is an improvement of 10.17 over the baseline method. Our code is available in https://github.com/TooTouch/REVECA.

cs.CV↗

arXiv2022

PMBM-based SLAM Filters in 5G mmWave Vehicular Networks

Radio-based vehicular simultaneous localization and mapping (SLAM) aims to localize vehicles while mapping the landmarks in the environment. We propose a sequence of three Poisson multi-Bernoulli mixture (PMBM) based SLAM filters, which handle the entire SLAM problem in a theoretically optimal manner. The complexity of the three proposed SLAM filters is progressively reduced while sustaining high accuracy by deriving SLAM density approximation with the marginalization of nuisance parameters (either vehicle state or data association). Firstly, the PMBM SLAM filter serves as the foundation, for which we provide the first complete description based on a Rao-Blackwellized particle filter. Secondly, the Poisson multi-Bernoulli (PMB) SLAM filter is based on the standard reduction from PMBM to PMB, but involves a novel interpretation based on auxiliary variables and a relation to Bethe free energy. Finally, using the same auxiliary variable argument, we derive a marginalized PMB SLAM filter, which avoids particles and is instead implemented with a low-complexity cubature Kalman filter. We evaluate the three proposed SLAM filters in comparison with the probability hypothesis density (PHD) SLAM filter in 5G mmWave vehicular networks and show the computation-performance trade-off between them.

eess.SP↗

arXiv2022

Human Motion Control of Quadrupedal Robots using Deep Reinforcement Learning

A motion-based control interface promises flexible robot operations in dangerous environments by combining user intuitions with the robot's motor capabilities. However, designing a motion interface for non-humanoid robots, such as quadrupeds or hexapods, is not straightforward because different dynamics and control strategies govern their movements. We propose a novel motion control system that allows a human user to operate various motor tasks seamlessly on a quadrupedal robot. We first retarget the captured human motion into the corresponding robot motion with proper semantics using supervised learning and post-processing techniques. Then we apply the motion imitation learning with curriculum learning to develop a control policy that can track the given retargeted reference. We further improve the performance of both motion retargeting and motion imitation by training a set of experts. As we demonstrate, a user can execute various motor tasks using our system, including standing, sitting, tilting, manipulating, walking, and turning, on simulated and real quadrupeds. We also conduct a set of studies to analyze the performance gain induced by each component.

cs.RO↗

arXiv2022

Meta Distribution of SIR in the Internet of Things Modelled as a Euclidean Matching

The Poisson bipolar model considers user-base station pairs distributed at random on a flat domain, similar to matchsticks scattered onto a table. Though this is a simple and tractable setting in which to study dense networks, it doesn't properly characterise the stochastic geometry of user-base station interactions in some dense deployment scenarios, which may involve short and long range links, with some paired very nearby optimally, and others sub-optimally due to local crowding. Since the users will pair one-to-one with base stations, we can consider using the popular bipartite Euclidean matching (BEM) from spatial combinatorics, and study the corresponding (meta) distribution of the signal-to-interference-ratio (SIR). This provides detailed information about the proportion of links in the network meeting a target reliability constraint. We can then observe via comparison the impact of taking into account the variable/correlated short-range distances between the transmitter-receiver pairs on the communication statistics. We illustrate and quantify how the widely-accepted bipolar model fails to capture the network-wide reliability of communication in a typical ultra-dense setting based on a binomial point process. We also show how assuming a Gamma distribution for link distances may be a simple improvement on the bipolar model. Overall, BEMs provide good grounds for understanding more sophisticated pairing features in ultra-dense networks.

cond-mat.dis-nn↗

arXiv2022

BLOOM-Net: Blockwise Optimization for Masking Networks Toward Scalable and Efficient Speech Enhancement

In this paper, we present a blockwise optimization method for masking-based networks (BLOOM-Net) for training scalable speech enhancement networks. Here, we design our network with a residual learning scheme and train the internal separator blocks sequentially to obtain a scalable masking-based deep neural network for speech enhancement. Its scalability lets it dynamically adjust the run-time complexity depending on the test time environment. To this end, we modularize our models in that they can flexibly accommodate varying needs for enhancement performance and constraints on the resources, incurring minimal memory or training overhead due to the added scalability. Our experiments on speech enhancement demonstrate that the proposed blockwise optimization method achieves the desired scalability with only a slight performance degradation compared to corresponding models trained end-to-end.

eess.AS↗

arXiv2022

Deep Translation Prior: Test-time Training for Photorealistic Style Transfer

Recent techniques to solve photorealistic style transfer within deep convolutional neural networks (CNNs) generally require intensive training from large-scale datasets, thus having limited applicability and poor generalization ability to unseen images or styles. To overcome this, we propose a novel framework, dubbed Deep Translation Prior (DTP), to accomplish photorealistic style transfer through test-time training on given input image pair with untrained networks, which learns an image pair-specific translation prior and thus yields better performance and generalization. Tailored for such test-time training for style transfer, we present novel network architectures, with two sub-modules of correspondence and generation modules, and loss functions consisting of contrastive content, style, and cycle consistency losses. Our framework does not require offline training phase for style transfer, which has been one of the main challenges in existing methods, but the networks are to be solely learned during test-time. Experimental results prove that our framework has a better generalization ability to unseen image pairs and even outperforms the state-of-the-art methods.

cs.CV↗

arXiv2021

A Computationally Efficient EK-PMBM Filter for Bistatic mmWave Radio SLAM

Millimeter wave (mmWave) signals are useful for simultaneous localization and mapping (SLAM), due to their inherent geometric connection to the propagation environment and the propagation channel. To solve the SLAM problem, existing approaches rely on sigma-point or particle-based approximations, leading to high computational complexity, precluding real-time execution. We propose a novel low-complexity SLAM filter, based on the Poisson multi-Bernoulli mixture (PMBM) filter. It utilizes the extended Kalman (EK) first-order Taylor series based Gaussian approximation of the filtering distribution, and applies the track-oriented marginal multi-Bernoulli/Poisson (TOMB/P) algorithm to approximate the resulting PMBM as a Poisson multi-Bernoulli (PMB). The filter can account for different landmark types in radio SLAM and multiple data association hypotheses. Hence, it has an adjustable complexity/performance trade-off. Simulation results show that the developed SLAM filter can greatly reduce the computational cost, while it keeps the good performance of mapping and user state estimation.

eess.SP↗

arXiv2021

Blockwise Phase Rotation-Aided Analog Transmit Beamforming for 5G mmWave Systems

In this letter, we propose a blockwise phase rotation-aided analog transmit beamforming (BPR-ATB) scheme to improve the spectral efficiency and the bit-error-rate (BER) performance in millimeter wave (mmWave) communication systems. Due to the phase angle optimization issues of the conventional analog beamforming, we design the BPR-ATB for reducing the rotated beamspace of the equivalent channel and improving the minimum Euclidean distance. To verify the effectiveness of the proposed BPR-ATB scheme, we employ an Alamouti coding technique at the transmitter and evaluate the bit-error-rate performance for mmWave multiple-input and single-output systems. The simulation results show that the proposed BPR-ATB scheme outperforms the conventional discrete Fourier transform-based ATB scheme.

cs.IT↗