Search

The unprecedented amount of scientific data has introduced heavy pressure on the current data storage and transmission systems. Progressive compression has been proposed to mitigate this problem, which offers data access with on-demand precision. However, existing approaches only consider precision control on primary data, leaving uncertainties on the quantities of interest (QoIs) derived from it. In this work, we present a progressive data retrieval framework with guaranteed error control on derivable QoIs. Our contributions are three-fold. (1) We carefully derive the theories to strictly control QoI errors during progressive retrieval. Our theory is generic and can be applied to any QoIs that can be composited by the basis of derivable QoIs proved in the paper. (2) We design and develop a generic progressive retrieval framework based on the proposed theories, and optimize it by exploring feasible progressive representations. (3) We evaluate our framework using five real-world datasets with a diverse set of QoIs. Experiments demonstrate that our framework can faithfully respect any user-specified QoI error bounds in the evaluated applications. This leads to over 2.02x performance gain in data transfer tasks compared to transferring the primary data while guaranteeing a QoI error that is less than 1E-5., Comment: SC'24

High resolution is crucial for precise segmentation in fundus images, yet handling high-resolution inputs incurs considerable GPU memory costs, with diminishing performance gains as overhead increases. To address this issue while tackling the challenge of segmenting tiny objects, recent studies have explored local-global fusion methods. These methods preserve fine details using local regions and capture long-range context information from downscaled global images. However, the necessity of multiple forward passes inevitably incurs significant computational overhead, adversely affecting inference speed. In this paper, we propose HRDecoder, a simple High-Resolution Decoder network for fundus lesion segmentation. It integrates a high-resolution representation learning module to capture fine-grained local features and a high-resolution fusion module to fuse multi-scale predictions. Our method effectively improves the overall segmentation accuracy of fundus lesions while consuming reasonable memory and computational overhead, and maintaining satisfying inference speed. Experimental results on the IDRID and DDR datasets demonstrate the effectiveness of our method. Code is available at https://github.com/CVIU-CSU/HRDecoder., Comment: 11 pages, 3 figures, accepted by MICCAI 2024, the revised version

Large Language Models (LLMs) have achieved impressive results in various tasks but struggle with hallucination problems and lack of relevant knowledge, especially in deep complex reasoning and knowledge-intensive tasks. Knowledge Graphs (KGs), which capture vast amounts of facts in a structured format, offer a reliable source of knowledge for reasoning. However, existing KG-based LLM reasoning methods face challenges like handling multi-hop reasoning, multi-entity questions, and effectively utilizing graph structures. To address these issues, we propose Paths-over-Graph (PoG), a novel method that enhances LLM reasoning by integrating knowledge reasoning paths from KGs, improving the interpretability and faithfulness of LLM outputs. PoG tackles multi-hop and multi-entity questions through a three-phase dynamic multi-hop path exploration, which combines the inherent knowledge of LLMs with factual knowledge from KGs. In order to improve the efficiency, PoG prunes irrelevant information from the graph exploration first and introduces efficient three-step pruning techniques that incorporate graph structures, LLM prompting, and a pre-trained language model (e.g., SBERT) to effectively narrow down the explored candidate paths. This ensures all reasoning paths contain highly relevant information captured from KGs, making the reasoning faithful and interpretable in problem-solving. PoG innovatively utilizes graph structure to prune the irrelevant noise and represents the first method to implement multi-entity deep path detection on KGs for LLM reasoning tasks. Comprehensive experiments on five benchmark KGQA datasets demonstrate PoG outperforms the state-of-the-art method ToG across GPT-3.5-Turbo and GPT-4, achieving an average accuracy improvement of 18.9%. Notably, PoG with GPT-3.5-Turbo surpasses ToG with GPT-4 by up to 23.9%.

Previous research on Lorentz invariance violation in photons from gamma-ray bursts (GRBs) suggested a scenario where multi-GeV photons could be emitted before lower-energy photons at the GRB source frame. This implies the existence of a new preburst phase in addition to the traditionally identified prompt and afterglow stages observed in earlier studies. In this study, we present direct evidence for this novel preburst phase in gamma-ray bursts based on recent observations of GRB 221009A. Our analysis leverages data from the Fermi Gamma-ray Burst Monitor (GBM) and Large Area Telescope (LAT) detectors of the Fermi Gamma-ray Space Telescope (FGST), as well as data from the KM2A detector of the Large High Altitude Air-shower Observatory (LHAASO)., Comment: 4 pages, 1 figure, final version for publication

In this paper, we propose a quality-aware end-to-end audio-visual neural speaker diarization framework, which comprises three key techniques. First, our audio-visual model takes both audio and visual features as inputs, utilizing a series of binary classification output layers to simultaneously identify the activities of all speakers. This end-to-end framework is meticulously designed to effectively handle situations of overlapping speech, providing accurate discrimination between speech and non-speech segments through the utilization of multi-modal information. Next, we employ a quality-aware audio-visual fusion structure to address signal quality issues for both audio degradations, such as noise, reverberation and other distortions, and video degradations, such as occlusions, off-screen speakers, or unreliable detection. Finally, a cross attention mechanism applied to multi-speaker embedding empowers the network to handle scenarios with varying numbers of speakers. Our experimental results, obtained from various data sets, demonstrate the robustness of our proposed techniques in diverse acoustic environments. Even in scenarios with severely degraded video quality, our system attains performance levels comparable to the best available audio-visual systems.

The solar coronal magnetic field is a pivotal element in the study of eruptive phenomena, and understanding its dynamic evolution has long been a focal point in solar physics. Numerical models, driven directly by observation data, serve as indispensable tools in investigating the dynamics of the coronal magnetic field. This paper presents a new approach to electric field inversion, which involves modifying the electric field derived from the DAVE4VM velocity field using ideal Ohm's law. The time series of the modified electric field is used as a boundary condition to drive a MHD model, which is applied to simulate the magnetic field evolution of active region 12673. The simulation results demonstrate that our method enhances the magnetic energy injection through the bottom boundary, as compared with energy injection calculated directly from the DAVE4VM code, and reproduce of the evolution of the photospheric magnetic flux. The coronal magnetic field structure is also in morphological similarity to the coronal loops. This new approach will be applied to the high-accuracy simulation of eruption phenomena and provide more details on the dynamical evolution of the coronal magnetic field.

Group portrait editing is highly desirable since users constantly want to add a person, delete a person, or manipulate existing persons. It is also challenging due to the intricate dynamics of human interactions and the diverse gestures. In this work, we present GroupDiff, a pioneering effort to tackle group photo editing with three dedicated contributions: 1) Data Engine: Since there is no labeled data for group photo editing, we create a data engine to generate paired data for training. The training data engine covers the diverse needs of group portrait editing. 2) Appearance Preservation: To keep the appearance consistent after editing, we inject the images of persons from the group photo into the attention modules and employ skeletons to provide intra-person guidance. 3) Control Flexibility: Bounding boxes indicating the locations of each person are used to reweight the attention matrix so that the features of each person can be injected into the correct places. This inter-person guidance provides flexible manners for manipulation. Extensive experiments demonstrate that GroupDiff exhibits state-of-the-art performance compared to existing methods. GroupDiff offers controllability for editing and maintains the fidelity of the original photos., Comment: ECCV 2024

Extracting information from quantum systems is crucial in quantum physics and information processing. Methods based on randomized measurements, like shadow estimation, show advantages in effectively achieving such tasks. However, randomized measurements require the application of random unitary evolution, which unavoidably necessitates frequent adjustments to the experimental setup or circuit parameters, posing challenges for practical implementations. To address these limitations, positive operator-valued measurements (POVMs) have been integrated to realize real-time single-setting shadow estimation. In this work, we advance the POVM-based shadow estimation by reducing the CNOT gate count for the implementation circuits of informationally complete POVMs (IC-POVMs), in particular, the symmetric IC-POVMs (SIC-POVMs), through the dimension dilation framework. We show that any single-qubit minimal IC-POVM can be implemented using at most 2 CNOT gates, while an SIC-POVM can be implemented with only 1 CNOT gate. In particular, we provide a concise form of the compilation circuit of any SIC-POVM along with an efficient algorithm for the determination of gate parameters. Moreover, we apply the optimized circuit compilation to shadow estimation, showcasing its noise-resilient performance and highlighting the flexibility in compiling various SIC-POVMs. Our work paves the way for the practical applications of qubit IC-POVMs on quantum platforms., Comment: 12+9 pages, 7+3 figures

With advanced synthetic techniques, a wide variety of well-defined graphene nano-ribbons (GNRs) can be produced with atomic precision. Hence, finding the relation between their structures and properties becomes important for the rational design of GNRs. In this work, we explore the complete chemical space of gulf-edged zigzag graphene nanoribbons (ZGNR-Gs), a subclass of zigzag GNRs in which the zigzag edges miss carbon atoms in a regular sequence. We demonstrate that the electronic properties of ZGNR-Gs depend on four structural parameters: ribbon width, gulf edge size, unit length, and gulf offset. Using tight-binding calculations and the Hubbard model, we find that all ZGNR-Gs are semiconductors with varying band gaps; there are no metals in this class of materials. Notably, when spin polarization is considered, most ZGNR-Gs exhibit antiferromagnetic behavior, with the spin moments and spin-induced band gap opening being stabilized by longer zigzag segments at the edges. Furthermore, we provide simple empirical rules that describe the Z2 topological invariant based on the aforementioned structural parameters. By analyzing the full chemical space of ZGNR-Gs, we offer insights into the design of GNRs with desired electronic, magnetic, and topological properties for nanoelectronic applications.

Top-k Nearest Neighbors (kNN) problem on road network has numerous applications on location-based services. As direct search using the Dijkstra's algorithm results in a large search space, a plethora of complex-index-based approaches have been proposed to speedup the query processing. However, even with the current state-of-the-art approach, long query processing delays persist, along with significant space overhead and prohibitively long indexing time. In this paper, we depart from the complex index designs prevalent in existing literature and propose a simple index named KNN-Index. With KNN-Index, we can answer a kNN query optimally and progressively with small and size-bounded index. To improve the index construction performance, we propose a bidirectional construction algorithm which can effectively share the common computation during the construction. Theoretical analysis and experimental results on real road networks demonstrate the superiority of KNN-Index over the state-of-the-art approach in query processing performance, index size, and index construction efficiency., Comment: 15 pages, 15 figures

Efficiently measuring nonlinear properties, like the entanglement spectrum, is a significant yet challenging task from quantum information processing to many-body physics. Current methodologies often suffer from an exponential scaling of the sampling cost or require auxiliary qubits and deep quantum circuits. To address these limitations, we propose an efficient auxiliary-free replica shadow (AFRS) framework, which leverages the power of the joint entangling operation on a few input replicas while integrating the mindset of shadow estimation. We rigorously prove that AFRS can offer exponential improvements in estimation accuracy compared with the conventional shadow method, and facilitate the simultaneous estimation of various nonlinear properties, unlike the destructive swap test. Additionally, we introduce an advanced local-AFRS variant tailored to estimating local observables with even constant-depth local quantum circuits, which significantly simplifies the experimental realization compared with the general swap test. Our work paves the way for the application of AFRS on near-term quantum hardware, opening new avenues for efficient and practical quantum measurements., Comment: main(10 pages, 5 figures), appendix(16 pages, 6 figures), and comments are welcome

Affective brain-computer interfaces (aBCIs) are increasingly recognized for their potential in monitoring and interpreting emotional states through electroencephalography (EEG) signals. Current EEG-based emotion recognition methods perform well with short segments of EEG data. However, these methods encounter significant challenges in real-life scenarios where emotional states evolve over extended periods. To address this issue, we propose a Dual Attentive (DuA) transformer framework for long-term continuous EEG emotion analysis. Unlike segment-based approaches, the DuA transformer processes an entire EEG trial as a whole, identifying emotions at the trial level, referred to as trial-based emotion analysis. This framework is designed to adapt to varying signal lengths, providing a substantial advantage over traditional methods. The DuA transformer incorporates three key modules: the spatial-spectral network module, the temporal network module, and the transfer learning module. The spatial-spectral network module simultaneously captures spatial and spectral information from EEG signals, while the temporal network module detects temporal dependencies within long-term EEG data. The transfer learning module enhances the model's adaptability across different subjects and conditions. We extensively evaluate the DuA transformer using a self-constructed long-term EEG emotion database, along with two benchmark EEG emotion databases. On the basis of the trial-based leave-one-subject-out cross-subject cross-validation protocol, our experimental results demonstrate that the proposed DuA transformer significantly outperforms existing methods in long-term continuous EEG emotion analysis, with an average enhancement of 5.28%., Comment: 11 pages, 3 figures

The Dragonfly Telephoto Array employs a unique design to detect very large and diffuse galaxies, which might be missed with conventional telescopes. The Dragonfly Ultrawide Survey (DFUWS) is a new wide-field survey which will cover 10,000 deg$^2$ of the northern sky, and it provides an ideal dataset to find these large diffuse galaxies. From 3100 deg$^2$ of DFUWS data, we identified eleven large, low surface brightness galaxies as a pilot sample for spectroscopic follow-up. These are the largest galaxies in the examined area that appear smooth and isolated, with effective radii of 12"-27". Eight are below 24 $\mathrm{mag\,arcsec^{-2}}$ in central $g$-band surface brightness. Keck Cosmic Web Imager (KCWI) spectra of the diffuse light show that all eleven galaxies in this sample are quiescent, and seven qualify as ultra-diffuse galaxies (UDGs). Eight galaxies have distances between 15 and 30 Mpc, while the other three are in the Pegasus cluster at 50 Mpc. Their spectra show evidence of a $\sim 1$Gyr old stellar population in addition to an even older stellar population. The intermediate-age component is present in group and satellite galaxies but not in the Pegasus cluster UDGs. All galaxies in this sample are detected in both Dragonfly and Legacy imaging, and the sample partially overlaps with existing UDG catalogs. This pilot sample provides an excellent training set for our analysis of the upcoming full 10,000 deg$^2$ DFUWS data, from which we may expect to discover even larger, previously-unknown galaxies., Comment: Submitted to ApJ

The Dragonfly Spectral Line Mapper is an innovative all-refracting telescope designed to carry out ultra-low surface brightness wide-field mapping of visible wavelength line emission. Equipped with ultranarrowband (0.8 nm bandwidth) filters mounted in Dragonfly Filter-Tilter instrumentation, the Dragonfly Spectral Line Mapper maps H$\alpha$, [NII]$\lambda$6583, and [OIII]$\lambda$5007 line emission produced by structures with sizes ranging from $\sim$1 to 1000 kpc in the local Universe. These spatial scales encompass that of the exceedingly diffuse and faintly radiating circumgalactic medium, which is singularly difficult to detect with conventional mirror-based telescope instrumentation. Extremely careful control of systematics is required to directly image these large scale structures, necessitating high fidelity sky background subtraction, wavelength calibration, and specialized flat-fielding methods. In this paper, we discuss the on-sky performance of the Dragonfly Spectral Line Mapper with these methods in place., Comment: 10 pages, 5 figures, SPIE Astronomical Telescopes and Instrumentation 2024 Proceedings

The Dragonfly Spectral Line Mapper (DSLM) is a semi-autonomous, distributed-aperture based telescope design, featuring a modular setup of 120 Canon telephoto lenses, and equal numbers of ultra-narrowband filters, detectors, and other peripherals. Here we introduce the observatory software stack for this highly-distributed system. Its core is the Dragonfly Communication Protocol (DCP), a pure-Python hardware communication framework for standardized hardware interaction. On top of this are 120 REST-ful FastAPI web servers, hosted on Raspberry Pis attached to each unit, orchestrating command translation to the hardware and providing diagnostic feedback to a central control system running the global instrument control software. We discuss key features of this software suite, including docker containerization for environment management, class composition as a flexible framework for array commands, and a state machine algorithm which controls the telescope during autonomous observations., Comment: 18 pages, presented at the SPIE Astronomical Telescopes and Instrumentation conference in Yokohama, Japan

The Dragonfly Spectral Line Mapper is a mosaic telescope comprising 120 Canon telephoto lenses, based on the design of the Dragonfly Telephoto Array. With a wide field of view, and the addition of the "Dragonfly Filter-Tilter" instrumentation holding ultra narrow bandpass filters in front of each lens, the Dragonfly Spectral Line mapper is optimized for ultra low surface brightness imaging of visible wavelength line emission. The Dragonfly Spectral Line Mapper was constructed and commissioned in four phases from March 2022 to November 2023. During this time, four individual mounts of 30 lenses each were constructed and commissioned. The commissioning of the telescope included the deployment of the "Dragonfly StarChaser" which carries out image stabilization corrections in the telephoto lens, to enable hour-long exposures to be taken. In addition, we introduced new instrumentation such as a film to cover the optics to keep the filters clean. Here we describe the updated design of the complete 120-lens array, and the implementation of the instrumentation described above. Additionally, we present updated characterization of the cameras and filter transmission for the full array. Finally, we reflect on the construction and commissioning process of the complete 120-lens array Dragonfly Spectral Line Mapper, and remark on the feasibility of a larger 1000-lens array., Comment: 12 pages, 9 figures, SPIE conference proceedings

We study a general class of fully nonlinear boundary-degenerate elliptic equations that admit a trivial solution. Although no boundary conditions are posed together with the equations, we show that the operator degeneracy actually generates an implicit boundary condition. Under appropriate assumptions on the degeneracy rate and regularity of the operator, we then prove that there exist no bounded solutions other than the trivial one. Our method is based on the arguments for uniqueness of viscosity solutions to state constraint problems for Hamilton-Jacobi equations. We obtain similar results for fully nonlinear degenerate parabolic equations. Several concrete examples of the equations that satisfy the assumptions are also given., Comment: 22 pages

Web-crawled image-text pairs are inherently noisy. Prior studies demonstrate that semantically aligning and enriching textual descriptions of these pairs can significantly enhance model training across various vision-language tasks, particularly text-to-image generation. However, large-scale investigations in this area remain predominantly closed-source. Our paper aims to bridge this community effort, leveraging the powerful and \textit{open-sourced} LLaMA-3, a GPT-4 level LLM. Our recaptioning pipeline is simple: first, we fine-tune a LLaMA-3-8B powered LLaVA-1.5 and then employ it to recaption 1.3 billion images from the DataComp-1B dataset. Our empirical results confirm that this enhanced dataset, Recap-DataComp-1B, offers substantial benefits in training advanced vision-language models. For discriminative models like CLIP, we observe enhanced zero-shot performance in cross-modal retrieval tasks. For generative models like text-to-image Diffusion Transformers, the generated images exhibit a significant improvement in alignment with users' text instructions, especially in following complex queries. Our project page is https://www.haqtu.me/Recap-Datacomp-1B/, Comment: First five authors contributed equally

Deoccluding the hidden portions of objects in a scene is a formidable task, particularly when addressing real-world scenes. In this paper, we present a new self-supervised PArallel visible-to-COmplete diffusion framework, named PACO, a foundation model for object-level scene deocclusion. Leveraging the rich prior of pre-trained models, we first design the parallel variational autoencoder, which produces a full-view feature map that simultaneously encodes multiple complete objects, and the visible-to-complete latent generator, which learns to implicitly predict the full-view feature map from partial-view feature map and text prompts extracted from the incomplete objects in the input image. To train PACO, we create a large-scale dataset with 500k samples to enable self-supervised learning, avoiding tedious annotations of the amodal masks and occluded regions. At inference, we devise a layer-wise deocclusion strategy to improve efficiency while maintaining the deocclusion quality. Extensive experiments on COCOA and various real-world scenes demonstrate the superior capability of PACO for scene deocclusion, surpassing the state of the arts by a large margin. Our method can also be extended to cross-domain scenes and novel categories that are not covered by the training set. Further, we demonstrate the deocclusion applicability of PACO in single-view 3D scene reconstruction and object recomposition., Comment: SIGGRAPH 2024. A foundation model for category-agnostic object deocclusion

Large language models (LLMs) like ChatGPT show excellent capabilities in various natural language processing tasks, especially for text generation. The effectiveness of LLMs in summarizing radiology report impressions remains unclear. In this study, we explore the capability of eight LLMs on the radiology report impression summarization. Three types of radiology reports, i.e., CT, PET-CT, and Ultrasound reports, are collected from Peking University Cancer Hospital and Institute. We use the report findings to construct the zero-shot, one-shot, and three-shot prompts with complete example reports to generate the impressions. Besides the automatic quantitative evaluation metrics, we define five human evaluation metrics, i.e., completeness, correctness, conciseness, verisimilitude, and replaceability, to evaluate the semantics of the generated impressions. Two thoracic surgeons (ZSY and LB) and one radiologist (LQ) compare the generated impressions with the reference impressions and score each impression under the five human evaluation metrics. Experimental results show that there is a gap between the generated impressions and reference impressions. Although the LLMs achieve comparable performance in completeness and correctness, the conciseness and verisimilitude scores are not very high. Using few-shot prompts can improve the LLMs' performance in conciseness and verisimilitude, but the clinicians still think the LLMs can not replace the radiologists in summarizing the radiology impressions.

In this paper, we propose a variance-preserving interpolation framework to improve diffusion models for single-channel speech enhancement (SE) and automatic speech recognition (ASR). This new variance-preserving interpolation diffusion model (VPIDM) approach requires only 25 iterative steps and obviates the need for a corrector, an essential element in the existing variance-exploding interpolation diffusion model (VEIDM). Two notable distinctions between VPIDM and VEIDM are the scaling function of the mean of state variables and the constraint imposed on the variance relative to the mean's scale. We conduct a systematic exploration of the theoretical mechanism underlying VPIDM and develop insights regarding VPIDM's applications in SE and ASR using VPIDM as a frontend. Our proposed approach, evaluated on two distinct data sets, demonstrates VPIDM's superior performances over conventional discriminative SE algorithms. Furthermore, we assess the performance of the proposed model under varying signal-to-noise ratio (SNR) levels. The investigation reveals VPIDM's improved robustness in target noise elimination when compared to VEIDM. Furthermore, utilizing the mid-outputs of both VPIDM and VEIDM results in enhanced ASR accuracies, thereby highlighting the practical efficacy of our proposed approach.

In this paper, we provide a new PDE proof for the celebrated Borell--Brascamp--Lieb inequality. Our approach reveals a deep connection between the Borell--Brascamp--Lieb inequality and properties of diffusion equations of porous medium type pertaining to the large time asymptotics and preservation of a generalized concavity of the solutions. We also recover the equality condition in the special case of the Pr\'ekopa--Leindler inequality by further exploiting known properties of the heat equation including the eventual log-concavity and backward uniqueness of solutions.

In the Bitcoin system, transaction fees serve as an incentive for blockchain confirmations. In general, a transaction with a higher fee is likely to be included in the next block mined, whereas a transaction with a smaller fee or no fee may be delayed or never processed at all. However, the transaction fee needs to be specified when submitting a transaction and almost cannot be altered thereafter. Hence it is indispensable to help a client set a reasonable fee, as a higher fee incurs over-spending and a lower fee could delay the confirmation. In this work, we focus on estimating the transaction fee for a new transaction to help with its confirmation within a given expected time. We identify two major drawbacks in the existing works. First, the current industry products are built on explicit analytical models, ignoring the complex interactions of different factors which could be better captured by machine learning based methods; Second, all of the existing works utilize limited knowledge for the estimation which hinders the potential of further improving the estimation quality. As a result, we propose a framework FENN, which aims to integrate the knowledge from a wide range of sources, including the transaction itself, unconfirmed transactions in the mempool and the blockchain confirmation environment, into a neural network model in order to estimate a proper transaction fee. Finally, we conduct experiments on real blockchain datasets to demonstrate the effectiveness and efficiency of our proposed framework over the state-of-the-art works evaluated by MAPE and RMSE. Each variation model in our framework can finish training within one block interval, which shows the potential of our framework to process the realtime transaction updates in the Bitcoin blockchain.

Characterization of quantum states is a fundamental requirement in quantum science and technology. As a promising framework, shadow tomography shows significant efficiency in estimating linear functions, however, for the challenging nonlinear ones, it requires measurements at an exponential cost. Here, we implement an advanced shadow protocol, so-called hybrid shadow~(HS) tomography, to reduce the measurement cost in the estimation of nonlinear functions in an optical system. We design and realize a deterministic quantum Fredkin gate with single photon, achieving high process fidelity of $0.935\pm0.001$. Utilizing this novel Fredkin gate, we demonstrate HS in the estimations, like the higher-order moments up to 4, and reveal that the sample complexity of HS is significantly reduced compared with the original shadow protocol. Furthermore, we utilize these higher-degree functions to implement virtual distillation, which effectively extracts a high-purity quantum state from two noisy copies. The virtual distillation is also verified in a proof-of-principle demonstration of quantum metrology, further enhancing the accuracy of parameter estimation. Our results suggest that HS is efficient in state characterization and promising for quantum technologies., Comment: 14 pages, 10 figures

Real topological phases protected by the spacetime inversion (P T) symmetry are a current research focus. The basis is that the P T symmetry endows a real structure in momentum space, which leads to Z2 topological classifications in 1D and 2D. Here, we provide solutions to two outstanding problems in the diagnosis of real topology. First, based on the stable equivalence in K-theory, we clarify that the 2D topological invariant remains well defined in the presence of nontrivial 1D invariant, and we develop a general numerical approach for its evaluation, which was hitherto unavailable. Second, under the unit-cell convention, noncentered P T symmetries assume momentum dependence, which violates the presumption in previous methods for computing the topological invariants. We clarify the classifications for this case and formulate the invariants by introducing a twisted Wilson-loop operator for both 1D and 2D. A simple model on a rectangular lattice is constructed to demonstrate our theory, which can be readily realized using artificial crystals.

Effective editing of personal content holds a pivotal role in enabling individuals to express their creativity, weaving captivating narratives within their visual stories, and elevate the overall quality and impact of their visual content. Therefore, in this work, we introduce SwapAnything, a novel framework that can swap any objects in an image with personalized concepts given by the reference, while keeping the context unchanged. Compared with existing methods for personalized subject swapping, SwapAnything has three unique advantages: (1) precise control of arbitrary objects and parts rather than the main subject, (2) more faithful preservation of context pixels, (3) better adaptation of the personalized concept to the image. First, we propose targeted variable swapping to apply region control over latent feature maps and swap masked variables for faithful context preservation and initial semantic concept swapping. Then, we introduce appearance adaptation, to seamlessly adapt the semantic concept into the original image in terms of target location, shape, style, and content during the image generation process. Extensive results on both human and automatic evaluation demonstrate significant improvements of our approach over baseline methods on personalized swapping. Furthermore, SwapAnything shows its precise and faithful swapping abilities across single object, multiple objects, partial object, and cross-domain swapping tasks. SwapAnything also achieves great performance on text-based swapping and tasks beyond swapping such as object insertion., Comment: ECCV 2024, 23 pages, 14 figures, 3 tables